{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JX72LK5LWK7WX5L3H2PXGYMSPY","short_pith_number":"pith:JX72LK5L","schema_version":"1.0","canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","source":{"kind":"arxiv","id":"1105.5457","version":1},"attestation_state":"computed","paper":{"title":"Efficient Implementation of the Plan Graph in STAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. Long, M. Fox","submitted_at":"2011-05-27T01:52:09Z","abstract_excerpt":"STAN is a Graphplan-based planner, so-called because it uses    a variety of STate ANalysis techniques to enhance its performance.    STAN competed in the AIPS-98 planning competition where it compared    well with the other competitors in terms of speed, finding solutions    fastest to many of the problems posed. Although the domain analysis    techniques STAN exploits are an important factor in its overall    performance, we believe that the speed at which STAN solved the    competition problems is largely due to the implementation of its plan    graph. The implementation is based on two ins"},"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":"1105.5457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T01:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"033d7e88f205c44e19daf6c107ee3f1fee0c4feac687504b2e7f8b10bc62ebdc","abstract_canon_sha256":"265313289c3d86504f8a8828df283ceaccdf14181597623684ce861162c62759"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:11.696390Z","signature_b64":"Lw4pglnvIw1BPNT9X9VYvL2JyZXhk4e7Ltlpm5oGm/qpdSc7/d5ur8nXXPzEJECknY6QbYeuCB0JLKYM6nKKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","last_reissued_at":"2026-05-18T04:21:11.695716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:11.695716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Implementation of the Plan Graph in STAN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"D. Long, M. Fox","submitted_at":"2011-05-27T01:52:09Z","abstract_excerpt":"STAN is a Graphplan-based planner, so-called because it uses    a variety of STate ANalysis techniques to enhance its performance.    STAN competed in the AIPS-98 planning competition where it compared    well with the other competitors in terms of speed, finding solutions    fastest to many of the problems posed. Although the domain analysis    techniques STAN exploits are an important factor in its overall    performance, we believe that the speed at which STAN solved the    competition problems is largely due to the implementation of its plan    graph. The implementation is based on two ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5457","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":"1105.5457","created_at":"2026-05-18T04:21:11.695803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5457v1","created_at":"2026-05-18T04:21:11.695803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5457","created_at":"2026-05-18T04:21:11.695803+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX72LK5LWK7W","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX72LK5LWK7WX5L3","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX72LK5L","created_at":"2026-05-18T12:26:32.869790+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/JX72LK5LWK7WX5L3H2PXGYMSPY","json":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY.json","graph_json":"https://pith.science/api/pith-number/JX72LK5LWK7WX5L3H2PXGYMSPY/graph.json","events_json":"https://pith.science/api/pith-number/JX72LK5LWK7WX5L3H2PXGYMSPY/events.json","paper":"https://pith.science/paper/JX72LK5L"},"agent_actions":{"view_html":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY","download_json":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY.json","view_paper":"https://pith.science/paper/JX72LK5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5457&json=true","fetch_graph":"https://pith.science/api/pith-number/JX72LK5LWK7WX5L3H2PXGYMSPY/graph.json","fetch_events":"https://pith.science/api/pith-number/JX72LK5LWK7WX5L3H2PXGYMSPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/action/storage_attestation","attest_author":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/action/author_attestation","sign_citation":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/action/citation_signature","submit_replication":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/action/replication_record"}},"created_at":"2026-05-18T04:21:11.695803+00:00","updated_at":"2026-05-18T04:21:11.695803+00:00"}