{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JX72LK5LWK7WX5L3H2PXGYMSPY","short_pith_number":"pith:JX72LK5L","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"},"canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","source":{"kind":"arxiv","id":"1105.5457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5457","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5457v1","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5457","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"JX72LK5LWK7W","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JX72LK5LWK7WX5L3","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JX72LK5L","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JX72LK5LWK7WX5L3H2PXGYMSPY","target":"record","payload":{"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"},"canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","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"},"source_kind":"arxiv","source_id":"1105.5457","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgOwHVRRMf5wqX7dpK8iJAiz+gQtjuK2+m2o31+gLDBtdpTTuVvbT/uJrGzaG7DC37I8/t1kQHaJS00Lp3DpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:00:39.110806Z"},"content_sha256":"cbbbedd6b59e915351a3f3129d3499daf7e4afa71c7803f45f64189193a7b0bd","schema_version":"1.0","event_id":"sha256:cbbbedd6b59e915351a3f3129d3499daf7e4afa71c7803f45f64189193a7b0bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JX72LK5LWK7WX5L3H2PXGYMSPY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFagQHNSdL8W+bf95pLtja+xrxwFVYLj7j+7GNDXD5BTm1lAJC85+ONIKwAD7BS86AD23SeQ6JjaZ9d9WM1+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:00:39.111460Z"},"content_sha256":"e267982d3ce2b357bbb909d4ea7eff6f655681b2e10200b965c2dde1b172746e","schema_version":"1.0","event_id":"sha256:e267982d3ce2b357bbb909d4ea7eff6f655681b2e10200b965c2dde1b172746e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/bundle.json","state_url":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T02:00:39Z","links":{"resolver":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY","bundle":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/bundle.json","state":"https://pith.science/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JX72LK5LWK7WX5L3H2PXGYMSPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JX72LK5LWK7WX5L3H2PXGYMSPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"265313289c3d86504f8a8828df283ceaccdf14181597623684ce861162c62759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T01:52:09Z","title_canon_sha256":"033d7e88f205c44e19daf6c107ee3f1fee0c4feac687504b2e7f8b10bc62ebdc"},"schema_version":"1.0","source":{"id":"1105.5457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5457","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5457v1","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5457","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"JX72LK5LWK7W","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JX72LK5LWK7WX5L3","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JX72LK5L","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:e267982d3ce2b357bbb909d4ea7eff6f655681b2e10200b965c2dde1b172746e","target":"graph","created_at":"2026-05-18T04:21:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"D. Long, M. Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T01:52:09Z","title":"Efficient Implementation of the Plan Graph in STAN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5457","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cbbbedd6b59e915351a3f3129d3499daf7e4afa71c7803f45f64189193a7b0bd","target":"record","created_at":"2026-05-18T04:21:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"265313289c3d86504f8a8828df283ceaccdf14181597623684ce861162c62759","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-05-27T01:52:09Z","title_canon_sha256":"033d7e88f205c44e19daf6c107ee3f1fee0c4feac687504b2e7f8b10bc62ebdc"},"schema_version":"1.0","source":{"id":"1105.5457","kind":"arxiv","version":1}},"canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dffa5ababb2bf6bf57b3e9f7361927e1e3ec1753024a4db312ab96a116ae191","first_computed_at":"2026-05-18T04:21:11.695716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:11.695716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lw4pglnvIw1BPNT9X9VYvL2JyZXhk4e7Ltlpm5oGm/qpdSc7/d5ur8nXXPzEJECknY6QbYeuCB0JLKYM6nKKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:11.696390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbbbedd6b59e915351a3f3129d3499daf7e4afa71c7803f45f64189193a7b0bd","sha256:e267982d3ce2b357bbb909d4ea7eff6f655681b2e10200b965c2dde1b172746e"],"state_sha256":"d52695c6eeb0dbf8fad282d43634a982f568a0b0e65f96b2d2e303da28fea8fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ydnlgz2W+zB+y7gRO3MFuGbLniDVQeWlpGzqZyd6iovCyRmKqCh9FDTFRwGf0F1Z8z02h7g3X/UTidDOcREiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:00:39.114923Z","bundle_sha256":"458ed301210684169a5aa86951dc207369b05d6daebf7357cb4670c0058eeddb"}}