{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IFLKQHEIJKCDSCJWPUJTA7LD6S","short_pith_number":"pith:IFLKQHEI","schema_version":"1.0","canonical_sha256":"4156a81c884a843909367d13307d63f4933eb14571930025a9ab2d88a292b188","source":{"kind":"arxiv","id":"1811.06889","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Exploration in Goal-Driven Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Xing, Lisa Lee, Maruan Al-Shedivat, Ruslan Salakhutdinov","submitted_at":"2018-11-16T16:17:27Z","abstract_excerpt":"Building agents that can explore their environments intelligently is a challenging open problem. In this paper, we make a step towards understanding how a hierarchical design of the agent's policy can affect its exploration capabilities. First, we design EscapeRoom environments, where the agent must figure out how to navigate to the exit by accomplishing a number of intermediate tasks (\\emph{subgoals}), such as finding keys or opening doors. Our environments are procedurally generated and vary in complexity, which can be controlled by the number of subgoals and relationships between them. Next"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.06889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-16T16:17:27Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3b66b35528fc3972297b3ba1fdca3a50348578642573151f960cea4746a2e275","abstract_canon_sha256":"036469eccdf8c2b1584e47dd31fc1372b07b3700f216584758ed1a13afdb2e88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:33.560026Z","signature_b64":"Z77bWrLiZfp22Wxk4IB3vgUK0IrZsgVrXUhOdcTCNT3CDxGzZSu6ZmGsbicU20mWsplhm7NjKFokTtuUwPR5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4156a81c884a843909367d13307d63f4933eb14571930025a9ab2d88a292b188","last_reissued_at":"2026-05-18T00:00:33.559494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:33.559494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Exploration in Goal-Driven Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Xing, Lisa Lee, Maruan Al-Shedivat, Ruslan Salakhutdinov","submitted_at":"2018-11-16T16:17:27Z","abstract_excerpt":"Building agents that can explore their environments intelligently is a challenging open problem. In this paper, we make a step towards understanding how a hierarchical design of the agent's policy can affect its exploration capabilities. First, we design EscapeRoom environments, where the agent must figure out how to navigate to the exit by accomplishing a number of intermediate tasks (\\emph{subgoals}), such as finding keys or opening doors. Our environments are procedurally generated and vary in complexity, which can be controlled by the number of subgoals and relationships between them. Next"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06889","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06889","created_at":"2026-05-18T00:00:33.559560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06889v1","created_at":"2026-05-18T00:00:33.559560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06889","created_at":"2026-05-18T00:00:33.559560+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFLKQHEIJKCD","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFLKQHEIJKCDSCJW","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFLKQHEI","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S","json":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S.json","graph_json":"https://pith.science/api/pith-number/IFLKQHEIJKCDSCJWPUJTA7LD6S/graph.json","events_json":"https://pith.science/api/pith-number/IFLKQHEIJKCDSCJWPUJTA7LD6S/events.json","paper":"https://pith.science/paper/IFLKQHEI"},"agent_actions":{"view_html":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S","download_json":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S.json","view_paper":"https://pith.science/paper/IFLKQHEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06889&json=true","fetch_graph":"https://pith.science/api/pith-number/IFLKQHEIJKCDSCJWPUJTA7LD6S/graph.json","fetch_events":"https://pith.science/api/pith-number/IFLKQHEIJKCDSCJWPUJTA7LD6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S/action/storage_attestation","attest_author":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S/action/author_attestation","sign_citation":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S/action/citation_signature","submit_replication":"https://pith.science/pith/IFLKQHEIJKCDSCJWPUJTA7LD6S/action/replication_record"}},"created_at":"2026-05-18T00:00:33.559560+00:00","updated_at":"2026-05-18T00:00:33.559560+00:00"}