{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5TU6QUXNR4ZJWA5JJNUOPNEKQT","short_pith_number":"pith:5TU6QUXN","canonical_record":{"source":{"id":"1401.4598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"ae42692b72f2e6a8b8d643630d73d86e72381adfb8bd76c6b981851b46deeab1","abstract_canon_sha256":"d672ad595247e22b110f5187e7347bb3b112880e9a295a3c1497ab9eddfb7586"},"schema_version":"1.0"},"canonical_sha256":"ece9e852ed8f329b03a94b68e7b48a84e94e6064d96c681de14809dc48b1349d","source":{"kind":"arxiv","id":"1401.4598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4598","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4598v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4598","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"5TU6QUXNR4ZJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TU6QUXNR4ZJWA5J","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TU6QUXN","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5TU6QUXNR4ZJWA5JJNUOPNEKQT","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"ae42692b72f2e6a8b8d643630d73d86e72381adfb8bd76c6b981851b46deeab1","abstract_canon_sha256":"d672ad595247e22b110f5187e7347bb3b112880e9a295a3c1497ab9eddfb7586"},"schema_version":"1.0"},"canonical_sha256":"ece9e852ed8f329b03a94b68e7b48a84e94e6064d96c681de14809dc48b1349d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.302845Z","signature_b64":"3e2CZE7BrxYgLNErwf5RzBvGaJdlK0RilpbPx+z5S2RVEA4PJDPnVWaW0eMB6VNtsiuENtnmayNr3OPBer16Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece9e852ed8f329b03a94b68e7b48a84e94e6064d96c681de14809dc48b1349d","last_reissued_at":"2026-05-18T03:01:45.302284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.302284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4598","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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kup1/2a9f4b31Dyvw5SQCNUlrCBgOuOt7TXm6IUDcqSMoJC+q5BW6EYbPqYMIC+yO90KEsBhin8y/O2LtDVAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:13:14.038536Z"},"content_sha256":"6eff6c6cca00e046e4f786f2b8bcb5e88e10ffaf7c7d0c0995c64bc919298253","schema_version":"1.0","event_id":"sha256:6eff6c6cca00e046e4f786f2b8bcb5e88e10ffaf7c7d0c0995c64bc919298253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5TU6QUXNR4ZJWA5JJNUOPNEKQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAS+ Planning as Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ruoyun Huang, Weixiong Zhang, Yixin Chen","submitted_at":"2014-01-18T21:05:52Z","abstract_excerpt":"Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for planning. We prove the correctness of the new encoding by establishing an isomorphism between the solution plans of SASE and that of STRIPS based encodings. We further analyze the transition variables newly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4598","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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0XKCDMFSCzbAjQ7Wcrys8fFz+YoG9Sg7faPDNRcOx1UFLuOc4bNcFtNCfEn1yu06F4dDeobfDekIx2X3pOhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:13:14.038881Z"},"content_sha256":"a861cb1d866a4839350d02c1a76d15e1c538f4b4e8d38eb320123a1b1085cb74","schema_version":"1.0","event_id":"sha256:a861cb1d866a4839350d02c1a76d15e1c538f4b4e8d38eb320123a1b1085cb74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/bundle.json","state_url":"https://pith.science/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/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-06-26T08:13:14Z","links":{"resolver":"https://pith.science/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT","bundle":"https://pith.science/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/bundle.json","state":"https://pith.science/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TU6QUXNR4ZJWA5JJNUOPNEKQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5TU6QUXNR4ZJWA5JJNUOPNEKQT","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":"d672ad595247e22b110f5187e7347bb3b112880e9a295a3c1497ab9eddfb7586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:05:52Z","title_canon_sha256":"ae42692b72f2e6a8b8d643630d73d86e72381adfb8bd76c6b981851b46deeab1"},"schema_version":"1.0","source":{"id":"1401.4598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4598","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4598v1","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4598","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"5TU6QUXNR4ZJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5TU6QUXNR4ZJWA5J","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5TU6QUXN","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:a861cb1d866a4839350d02c1a76d15e1c538f4b4e8d38eb320123a1b1085cb74","target":"graph","created_at":"2026-05-18T03:01:45Z","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":"Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for planning. We prove the correctness of the new encoding by establishing an isomorphism between the solution plans of SASE and that of STRIPS based encodings. We further analyze the transition variables newly","authors_text":"Ruoyun Huang, Weixiong Zhang, Yixin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:05:52Z","title":"SAS+ Planning as Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4598","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:6eff6c6cca00e046e4f786f2b8bcb5e88e10ffaf7c7d0c0995c64bc919298253","target":"record","created_at":"2026-05-18T03:01:45Z","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":"d672ad595247e22b110f5187e7347bb3b112880e9a295a3c1497ab9eddfb7586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T21:05:52Z","title_canon_sha256":"ae42692b72f2e6a8b8d643630d73d86e72381adfb8bd76c6b981851b46deeab1"},"schema_version":"1.0","source":{"id":"1401.4598","kind":"arxiv","version":1}},"canonical_sha256":"ece9e852ed8f329b03a94b68e7b48a84e94e6064d96c681de14809dc48b1349d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ece9e852ed8f329b03a94b68e7b48a84e94e6064d96c681de14809dc48b1349d","first_computed_at":"2026-05-18T03:01:45.302284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:45.302284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3e2CZE7BrxYgLNErwf5RzBvGaJdlK0RilpbPx+z5S2RVEA4PJDPnVWaW0eMB6VNtsiuENtnmayNr3OPBer16Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:45.302845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eff6c6cca00e046e4f786f2b8bcb5e88e10ffaf7c7d0c0995c64bc919298253","sha256:a861cb1d866a4839350d02c1a76d15e1c538f4b4e8d38eb320123a1b1085cb74"],"state_sha256":"2ea2891aa5d10c632d7ed24d292046715f711bace74107e6f39c1c92c68fd019"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaVZJHU83xRP0sq4Ud7yxSXgosdQraexUZZh6Kwm/vMw1Btml3RIcHEK0g9NsxYovYvTktKL54etX7Rsnu0OCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:13:14.040802Z","bundle_sha256":"78ed552cc23298c4e458cb2f7f8018efd1e38a7104f5477ac053c2e40b523867"}}