{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SMBT77A3WPGETRVJ32RPG3WDNA","short_pith_number":"pith:SMBT77A3","schema_version":"1.0","canonical_sha256":"93033ffc1bb3cc49c6a9dea2f36ec3682926332df29fd4c60d499312302de979","source":{"kind":"arxiv","id":"2406.03361","version":3},"attestation_state":"computed","paper":{"title":"What Matters in Hierarchical Search for Combinatorial Reasoning Problems?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Emilia Wi\\'snios, Franciszek Budrowski, Gracjan G\\'oral, {\\L}ukasz Kuci\\'nski, Marek Cygan, Micha{\\l} Tyrolski, Micha{\\l} Zawalski, Piotr Mi{\\l}o\\'s","submitted_at":"2024-06-05T15:14:58Z","abstract_excerpt":"Efficiently tackling combinatorial reasoning problems, particularly the notorious NP-hard tasks, remains a significant challenge for AI research. Recent efforts have sought to enhance planning by incorporating hierarchical high-level search strategies, known as subgoal methods. While promising, their performance against traditional low-level planners is inconsistent, raising questions about their application contexts. In this study, we conduct an in-depth exploration of subgoal-planning methods for combinatorial reasoning. We identify the attributes pivotal for leveraging the advantages of hig"},"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":"2406.03361","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-05T15:14:58Z","cross_cats_sorted":[],"title_canon_sha256":"698bff1d9a5239c9b398e0e31820692240db2239f616d545e128a9a842c5798e","abstract_canon_sha256":"9e167f27f3d67fe13b74a7b337e8ccc0556a80dcb1d852bdaa5b2aeaf244ae27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:01.045470Z","signature_b64":"E0WbrLuG/gDb+oBEvtYlToFK/58gmPjw9pMucKCOrkPIDFB/fQw8OdmggGhB+be8nS7RsCui25ALPDA0bOOBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93033ffc1bb3cc49c6a9dea2f36ec3682926332df29fd4c60d499312302de979","last_reissued_at":"2026-07-05T10:13:01.044936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:01.044936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Matters in Hierarchical Search for Combinatorial Reasoning Problems?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Emilia Wi\\'snios, Franciszek Budrowski, Gracjan G\\'oral, {\\L}ukasz Kuci\\'nski, Marek Cygan, Micha{\\l} Tyrolski, Micha{\\l} Zawalski, Piotr Mi{\\l}o\\'s","submitted_at":"2024-06-05T15:14:58Z","abstract_excerpt":"Efficiently tackling combinatorial reasoning problems, particularly the notorious NP-hard tasks, remains a significant challenge for AI research. Recent efforts have sought to enhance planning by incorporating hierarchical high-level search strategies, known as subgoal methods. While promising, their performance against traditional low-level planners is inconsistent, raising questions about their application contexts. In this study, we conduct an in-depth exploration of subgoal-planning methods for combinatorial reasoning. We identify the attributes pivotal for leveraging the advantages of hig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03361","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/2406.03361/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":"2406.03361","created_at":"2026-07-05T10:13:01.044997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03361v3","created_at":"2026-07-05T10:13:01.044997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03361","created_at":"2026-07-05T10:13:01.044997+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMBT77A3WPGE","created_at":"2026-07-05T10:13:01.044997+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMBT77A3WPGETRVJ","created_at":"2026-07-05T10:13:01.044997+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMBT77A3","created_at":"2026-07-05T10:13:01.044997+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/SMBT77A3WPGETRVJ32RPG3WDNA","json":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA.json","graph_json":"https://pith.science/api/pith-number/SMBT77A3WPGETRVJ32RPG3WDNA/graph.json","events_json":"https://pith.science/api/pith-number/SMBT77A3WPGETRVJ32RPG3WDNA/events.json","paper":"https://pith.science/paper/SMBT77A3"},"agent_actions":{"view_html":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA","download_json":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA.json","view_paper":"https://pith.science/paper/SMBT77A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03361&json=true","fetch_graph":"https://pith.science/api/pith-number/SMBT77A3WPGETRVJ32RPG3WDNA/graph.json","fetch_events":"https://pith.science/api/pith-number/SMBT77A3WPGETRVJ32RPG3WDNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA/action/storage_attestation","attest_author":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA/action/author_attestation","sign_citation":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA/action/citation_signature","submit_replication":"https://pith.science/pith/SMBT77A3WPGETRVJ32RPG3WDNA/action/replication_record"}},"created_at":"2026-07-05T10:13:01.044997+00:00","updated_at":"2026-07-05T10:13:01.044997+00:00"}