{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CU4B3W4CVP5MJFHQKR3E67BZJH","short_pith_number":"pith:CU4B3W4C","schema_version":"1.0","canonical_sha256":"15381ddb82abfac494f054764f7c3949ce4be22eef9e0b2975fc9292cb445cdb","source":{"kind":"arxiv","id":"2405.17950","version":1},"attestation_state":"computed","paper":{"title":"Self-Guiding Exploration for Combinatorial Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Farkhad Akimov, Martin Takac, Yali Du, Zangir Iklassov","submitted_at":"2024-05-28T08:26:54Z","abstract_excerpt":"Large Language Models (LLMs) have become pivotal in addressing reasoning tasks across diverse domains, including arithmetic, commonsense, and symbolic reasoning. They utilize prompting techniques such as Exploration-of-Thought, Decomposition, and Refinement to effectively navigate and solve intricate tasks. Despite these advancements, the application of LLMs to Combinatorial Problems (CPs), known for their NP-hardness and critical roles in logistics and resource management remains underexplored. To address this gap, we introduce a novel prompting strategy: Self-Guiding Exploration (SGE), desig"},"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":"2405.17950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-05-28T08:26:54Z","cross_cats_sorted":[],"title_canon_sha256":"47984a5e4c918678e1f0e75a835eaa4129253a8c0d63228778a2524c34c5b55f","abstract_canon_sha256":"5177bc0d94e2d5c708c4568f1f83e9487ed8191e966e3c8e3ce8a273e35a8c00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:13.612342Z","signature_b64":"lAhaVqH8m1BiMoLN/JXLYQ7AAqSRu5C8c6owsVZ5B1mCnavXU1pn/TdNNnQj0H8d6N/759lXW8s2o7z9bRAvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15381ddb82abfac494f054764f7c3949ce4be22eef9e0b2975fc9292cb445cdb","last_reissued_at":"2026-07-05T08:24:13.611851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:13.611851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Guiding Exploration for Combinatorial Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Farkhad Akimov, Martin Takac, Yali Du, Zangir Iklassov","submitted_at":"2024-05-28T08:26:54Z","abstract_excerpt":"Large Language Models (LLMs) have become pivotal in addressing reasoning tasks across diverse domains, including arithmetic, commonsense, and symbolic reasoning. They utilize prompting techniques such as Exploration-of-Thought, Decomposition, and Refinement to effectively navigate and solve intricate tasks. Despite these advancements, the application of LLMs to Combinatorial Problems (CPs), known for their NP-hardness and critical roles in logistics and resource management remains underexplored. To address this gap, we introduce a novel prompting strategy: Self-Guiding Exploration (SGE), desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17950","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.17950/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":"2405.17950","created_at":"2026-07-05T08:24:13.611915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17950v1","created_at":"2026-07-05T08:24:13.611915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17950","created_at":"2026-07-05T08:24:13.611915+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU4B3W4CVP5M","created_at":"2026-07-05T08:24:13.611915+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU4B3W4CVP5MJFHQ","created_at":"2026-07-05T08:24:13.611915+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU4B3W4C","created_at":"2026-07-05T08:24:13.611915+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15196","citing_title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH","json":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH.json","graph_json":"https://pith.science/api/pith-number/CU4B3W4CVP5MJFHQKR3E67BZJH/graph.json","events_json":"https://pith.science/api/pith-number/CU4B3W4CVP5MJFHQKR3E67BZJH/events.json","paper":"https://pith.science/paper/CU4B3W4C"},"agent_actions":{"view_html":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH","download_json":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH.json","view_paper":"https://pith.science/paper/CU4B3W4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17950&json=true","fetch_graph":"https://pith.science/api/pith-number/CU4B3W4CVP5MJFHQKR3E67BZJH/graph.json","fetch_events":"https://pith.science/api/pith-number/CU4B3W4CVP5MJFHQKR3E67BZJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH/action/storage_attestation","attest_author":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH/action/author_attestation","sign_citation":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH/action/citation_signature","submit_replication":"https://pith.science/pith/CU4B3W4CVP5MJFHQKR3E67BZJH/action/replication_record"}},"created_at":"2026-07-05T08:24:13.611915+00:00","updated_at":"2026-07-05T08:24:13.611915+00:00"}