{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MDY663E5WCLDXGL2JN7DLVOCSJ","short_pith_number":"pith:MDY663E5","schema_version":"1.0","canonical_sha256":"60f1ef6c9db0963b997a4b7e35d5c2924fe081cae1ebb2fbb9d067ec85f7908a","source":{"kind":"arxiv","id":"2108.11204","version":3},"attestation_state":"computed","paper":{"title":"Subgoal Search For Complex Reasoning Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Konrad Czechowski, Krzysztof Olejnik, {\\L}ukasz Kuci\\'nski, Marek Zbysi\\'nski, Micha{\\l} Zawalski, Piotr Mi{\\l}o\\'s, Tomasz Odrzyg\\'o\\'zd\\'z, Yuhuai Wu","submitted_at":"2021-08-25T12:40:04Z","abstract_excerpt":"Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propose Subgoal Search (kSubS) method. Its key component is a learned subgoal generator that produces a diversity of subgoals that are both achievable and closer to the solution. Using subgoals reduces the search space and induces a high-level search graph suitable for efficient planning. In this paper, we implement kSubS using a transformer-based subgoal module coupled with the classical best-first search framework. We show that a simple approach of generatin"},"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":"2108.11204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-08-25T12:40:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"97f1852d1acde2423ea08be922a1df721948350256d46a601d21ba0079b5015e","abstract_canon_sha256":"82d4243d5e78d4e54f9abf40a26f954c9224313262277d9fce014ac42a7c2954"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:37.556752Z","signature_b64":"u3mEm+/cL0qQkvol2iDCRAxN1ZW7RCQ8GW66wtTgE5cx3TXDVEyStMd4Z4wh1yj3DAekhl8wgTZ/3JoRUghQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f1ef6c9db0963b997a4b7e35d5c2924fe081cae1ebb2fbb9d067ec85f7908a","last_reissued_at":"2026-07-05T08:03:37.556131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:37.556131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgoal Search For Complex Reasoning Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Konrad Czechowski, Krzysztof Olejnik, {\\L}ukasz Kuci\\'nski, Marek Zbysi\\'nski, Micha{\\l} Zawalski, Piotr Mi{\\l}o\\'s, Tomasz Odrzyg\\'o\\'zd\\'z, Yuhuai Wu","submitted_at":"2021-08-25T12:40:04Z","abstract_excerpt":"Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propose Subgoal Search (kSubS) method. Its key component is a learned subgoal generator that produces a diversity of subgoals that are both achievable and closer to the solution. Using subgoals reduces the search space and induces a high-level search graph suitable for efficient planning. In this paper, we implement kSubS using a transformer-based subgoal module coupled with the classical best-first search framework. We show that a simple approach of generatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11204","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.11204/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.11204","created_at":"2026-07-05T08:03:37.556210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.11204v3","created_at":"2026-07-05T08:03:37.556210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11204","created_at":"2026-07-05T08:03:37.556210+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDY663E5WCLD","created_at":"2026-07-05T08:03:37.556210+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDY663E5WCLDXGL2","created_at":"2026-07-05T08:03:37.556210+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDY663E5","created_at":"2026-07-05T08:03:37.556210+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/MDY663E5WCLDXGL2JN7DLVOCSJ","json":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ.json","graph_json":"https://pith.science/api/pith-number/MDY663E5WCLDXGL2JN7DLVOCSJ/graph.json","events_json":"https://pith.science/api/pith-number/MDY663E5WCLDXGL2JN7DLVOCSJ/events.json","paper":"https://pith.science/paper/MDY663E5"},"agent_actions":{"view_html":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ","download_json":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ.json","view_paper":"https://pith.science/paper/MDY663E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.11204&json=true","fetch_graph":"https://pith.science/api/pith-number/MDY663E5WCLDXGL2JN7DLVOCSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MDY663E5WCLDXGL2JN7DLVOCSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ/action/storage_attestation","attest_author":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ/action/author_attestation","sign_citation":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ/action/citation_signature","submit_replication":"https://pith.science/pith/MDY663E5WCLDXGL2JN7DLVOCSJ/action/replication_record"}},"created_at":"2026-07-05T08:03:37.556210+00:00","updated_at":"2026-07-05T08:03:37.556210+00:00"}