{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4RUSIIK7WLNN4ALDXB5LA4IJYC","short_pith_number":"pith:4RUSIIK7","schema_version":"1.0","canonical_sha256":"e46924215fb2dade0163b87ab07109c085e6fd4c69b45a616165161582ecbe3d","source":{"kind":"arxiv","id":"1109.5713","version":1},"attestation_state":"computed","paper":{"title":"Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"J. Hoffmann","submitted_at":"2011-09-26T20:22:39Z","abstract_excerpt":"Between 1998 and 2004, the planning community has seen vast progress in terms of the sizes of benchmark examples that domain-independent planners can tackle successfully. The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The unprecedented success of such methods, in many commonly used benchmark examples, calls for an understanding of what classes of domains these methods are well suited for.   In the investigation at hand, we derive a formal background to such "},"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":"1109.5713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-26T20:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"0ec95ade053e2b8d027241176b055384100ee7ce1abe9cd40a762f690de57e21","abstract_canon_sha256":"efd0b0e3e158e018d68644490d214f3e4258d02cc88bebd71077956323a5bc53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:11.390172Z","signature_b64":"wTg6nNsw1xAbKgJ/2xXL2uPDytZoMNWN8A3XnIXwtjZ672WUFV+ppWns6LhO5yH/mpljyaU/OJkwcJod1f2qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46924215fb2dade0163b87ab07109c085e6fd4c69b45a616165161582ecbe3d","last_reissued_at":"2026-05-18T04:12:11.389720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:11.389720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"J. Hoffmann","submitted_at":"2011-09-26T20:22:39Z","abstract_excerpt":"Between 1998 and 2004, the planning community has seen vast progress in terms of the sizes of benchmark examples that domain-independent planners can tackle successfully. The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The unprecedented success of such methods, in many commonly used benchmark examples, calls for an understanding of what classes of domains these methods are well suited for.   In the investigation at hand, we derive a formal background to such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5713","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":"1109.5713","created_at":"2026-05-18T04:12:11.389791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5713v1","created_at":"2026-05-18T04:12:11.389791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5713","created_at":"2026-05-18T04:12:11.389791+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RUSIIK7WLNN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RUSIIK7WLNN4ALD","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RUSIIK7","created_at":"2026-05-18T12:26:20.644004+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/4RUSIIK7WLNN4ALDXB5LA4IJYC","json":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC.json","graph_json":"https://pith.science/api/pith-number/4RUSIIK7WLNN4ALDXB5LA4IJYC/graph.json","events_json":"https://pith.science/api/pith-number/4RUSIIK7WLNN4ALDXB5LA4IJYC/events.json","paper":"https://pith.science/paper/4RUSIIK7"},"agent_actions":{"view_html":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC","download_json":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC.json","view_paper":"https://pith.science/paper/4RUSIIK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5713&json=true","fetch_graph":"https://pith.science/api/pith-number/4RUSIIK7WLNN4ALDXB5LA4IJYC/graph.json","fetch_events":"https://pith.science/api/pith-number/4RUSIIK7WLNN4ALDXB5LA4IJYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC/action/storage_attestation","attest_author":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC/action/author_attestation","sign_citation":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC/action/citation_signature","submit_replication":"https://pith.science/pith/4RUSIIK7WLNN4ALDXB5LA4IJYC/action/replication_record"}},"created_at":"2026-05-18T04:12:11.389791+00:00","updated_at":"2026-05-18T04:12:11.389791+00:00"}