{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"boolq","formal_name":"BoolQ","introduction":"BoolQ pairs naturally occurring yes/no questions from search queries with a passage that decides them. The format is simple, but the inference it needs is consistently heavier than it looks.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/google-research-datasets/boolean-questions","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"2821b06e-83c4-56c9-a001-7193d93249dd","task_key":"default--validation--2821b06e-83c4-56c9-a001-7193d93249dd","task_revision_id":"1","upstream_id":"","short_description":"can a node in a tree have two parents","config":"default","split":"validation","body":"{\"passage\":\"This data structure defines a directed graph, and for it to be a tree one must add a condition on its global structure (its topology), namely that at most one reference can point to any given node (a node has at most a single parent), and no node in the tree point to the root. In fact, every node (other than the root) must have exactly one parent, and the root must have no parents.\",\"question\":\"can a node in a tree have two parents\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/google-research-datasets/boolean-questions","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}