{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PT2MNIRTWGKJXZ7J6SUJUX7VNK","short_pith_number":"pith:PT2MNIRT","canonical_record":{"source":{"id":"1407.7934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"f3b896b1532d74a63b7cfc63d02b922bcb15543461e730deef5f27948d9e064b","abstract_canon_sha256":"c189af790cfb9ad1bba53114bf9dd8ec42817e4d59bc89df136a10139b9af9f5"},"schema_version":"1.0"},"canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","source":{"kind":"arxiv","id":"1407.7934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7934","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7934v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7934","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"PT2MNIRTWGKJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PT2MNIRTWGKJXZ7J","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PT2MNIRT","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PT2MNIRTWGKJXZ7J6SUJUX7VNK","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"f3b896b1532d74a63b7cfc63d02b922bcb15543461e730deef5f27948d9e064b","abstract_canon_sha256":"c189af790cfb9ad1bba53114bf9dd8ec42817e4d59bc89df136a10139b9af9f5"},"schema_version":"1.0"},"canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:14.088067Z","signature_b64":"IOCB/fom1ssVVpL/yEgBOkHg7WqOxn2GiqnhX2sNkB3TYsirrQGsMnac3Z7SK3mZAd7fwB/+FOepwmtAPfO5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","last_reissued_at":"2026-05-18T02:46:14.087394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:14.087394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7934","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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PgyC7835lsgKOEPtmiupOpCb08uaIw7X/bFuOwTJsh5By8zFtTaoljVWBO7czptN8/PYjzzaXnmMaJOY0HGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:01:53.864694Z"},"content_sha256":"6da58fc3bd95b4194c49064587ac6c1d5c3c78b67c05a2d09428302a4768346e","schema_version":"1.0","event_id":"sha256:6da58fc3bd95b4194c49064587ac6c1d5c3c78b67c05a2d09428302a4768346e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PT2MNIRTWGKJXZ7J6SUJUX7VNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Backwards State-space Reduction for Planning in Dynamic Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michele Stawowy (IMT Institute for Advanced Studies), Valerio Senni","submitted_at":"2014-07-30T03:28:15Z","abstract_excerpt":"In this paper we address the problem of planning in rich domains, where knowledge representation is a key aspect for managing the complexity and size of the planning domain. We follow the approach of Description Logic (DL) based Dynamic Knowledge Bases, where a state of the world is represented concisely by a (possibly changing) ABox and a (fixed) TBox containing the axioms, and actions that allow to change the content of the ABox. The plan goal is given in terms of satisfaction of a DL query. In this paper we start from a traditional forward planning algorithm and we propose a much more effic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7934","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-18T02:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZPkqFL5aZeNv4MUNJT8TUf5FdYdFv/CuzH660JdngMGWBbvllmaZ3AGHzkHqFTQbWVJ+3j9aBwd6IqYLYemAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:01:53.865034Z"},"content_sha256":"bc8c2d8746495f5426dfb34a149a584b101c01a5d87ebb2cdb04fae3346aed65","schema_version":"1.0","event_id":"sha256:bc8c2d8746495f5426dfb34a149a584b101c01a5d87ebb2cdb04fae3346aed65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/bundle.json","state_url":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/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-22T01:01:53Z","links":{"resolver":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK","bundle":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/bundle.json","state":"https://pith.science/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT2MNIRTWGKJXZ7J6SUJUX7VNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PT2MNIRTWGKJXZ7J6SUJUX7VNK","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":"c189af790cfb9ad1bba53114bf9dd8ec42817e4d59bc89df136a10139b9af9f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","title_canon_sha256":"f3b896b1532d74a63b7cfc63d02b922bcb15543461e730deef5f27948d9e064b"},"schema_version":"1.0","source":{"id":"1407.7934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7934","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7934v1","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7934","created_at":"2026-05-18T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"PT2MNIRTWGKJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PT2MNIRTWGKJXZ7J","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PT2MNIRT","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:bc8c2d8746495f5426dfb34a149a584b101c01a5d87ebb2cdb04fae3346aed65","target":"graph","created_at":"2026-05-18T02:46:14Z","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":"In this paper we address the problem of planning in rich domains, where knowledge representation is a key aspect for managing the complexity and size of the planning domain. We follow the approach of Description Logic (DL) based Dynamic Knowledge Bases, where a state of the world is represented concisely by a (possibly changing) ABox and a (fixed) TBox containing the axioms, and actions that allow to change the content of the ABox. The plan goal is given in terms of satisfaction of a DL query. In this paper we start from a traditional forward planning algorithm and we propose a much more effic","authors_text":"Michele Stawowy (IMT Institute for Advanced Studies), Valerio Senni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","title":"Backwards State-space Reduction for Planning in Dynamic Knowledge Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7934","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:6da58fc3bd95b4194c49064587ac6c1d5c3c78b67c05a2d09428302a4768346e","target":"record","created_at":"2026-05-18T02:46:14Z","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":"c189af790cfb9ad1bba53114bf9dd8ec42817e4d59bc89df136a10139b9af9f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-30T03:28:15Z","title_canon_sha256":"f3b896b1532d74a63b7cfc63d02b922bcb15543461e730deef5f27948d9e064b"},"schema_version":"1.0","source":{"id":"1407.7934","kind":"arxiv","version":1}},"canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cf4c6a233b1949be7e9f4a89a5ff56a92888584e498f634695cf0d92a50ac08","first_computed_at":"2026-05-18T02:46:14.087394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:14.087394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IOCB/fom1ssVVpL/yEgBOkHg7WqOxn2GiqnhX2sNkB3TYsirrQGsMnac3Z7SK3mZAd7fwB/+FOepwmtAPfO5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:14.088067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da58fc3bd95b4194c49064587ac6c1d5c3c78b67c05a2d09428302a4768346e","sha256:bc8c2d8746495f5426dfb34a149a584b101c01a5d87ebb2cdb04fae3346aed65"],"state_sha256":"06df5cd19efce3fa214161d95567227acd0c0449e7dd6a1b718ab49c37e909b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ql+zk8kO3Cux+JbuwM5kVUhQ/FWwvW9HBr49lfzfAhlalrxT5sYRYIxJOHr50j+aAZin2a4eoOlHlFBy8oonDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T01:01:53.866911Z","bundle_sha256":"3127d5926618571ca92f89e745b66a877ec5924c60e182e41259ea3106e99014"}}