{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CAMKZ5TGEVEN2YQWEUPKE3433F","short_pith_number":"pith:CAMKZ5TG","canonical_record":{"source":{"id":"1401.5848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"48e9d9803e5cd5d212877cd5b6d9edb410384a43002de97ee4d26b824cffd678","abstract_canon_sha256":"728157cbb4f03817e483dfb50f79f7ed02b621bf7370355ad15e8e90cf0d83cc"},"schema_version":"1.0"},"canonical_sha256":"1018acf6662548dd6216251ea26f9bd972a5cff7b545f13660551567e6b36964","source":{"kind":"arxiv","id":"1401.5848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5848","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5848v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5848","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"CAMKZ5TGEVEN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CAMKZ5TGEVEN2YQW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CAMKZ5TG","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CAMKZ5TGEVEN2YQWEUPKE3433F","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:41:51Z","cross_cats_sorted":[],"title_canon_sha256":"48e9d9803e5cd5d212877cd5b6d9edb410384a43002de97ee4d26b824cffd678","abstract_canon_sha256":"728157cbb4f03817e483dfb50f79f7ed02b621bf7370355ad15e8e90cf0d83cc"},"schema_version":"1.0"},"canonical_sha256":"1018acf6662548dd6216251ea26f9bd972a5cff7b545f13660551567e6b36964","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.722270Z","signature_b64":"gZrXjSuzSvFD57Lz8r02Pck0QK0duK3zsnvTTEahSiKW3ApjQV9e+iEUYlB2TG/CBJDRdwL4oAULGirEcsikAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1018acf6662548dd6216251ea26f9bd972a5cff7b545f13660551567e6b36964","last_reissued_at":"2026-05-18T03:01:23.721624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.721624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5848","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6cku0GbcghvcKRj65nroI8sJKdAugjpala/aTZFFlE9dq44CiQWJKFbceHS+usdZUb9POM3Zefm0/gWvZItDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:34.528582Z"},"content_sha256":"9e31b7f1b7785d199ced3c531c12dcc4cde67a735578e193d85953ddb7257c99","schema_version":"1.0","event_id":"sha256:9e31b7f1b7785d199ced3c531c12dcc4cde67a735578e193d85953ddb7257c99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CAMKZ5TGEVEN2YQWEUPKE3433F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Limits for Compact Plan Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christer B\\\"ackstr\\\"om, Peter Jonsson","submitted_at":"2014-01-23T02:41:51Z","abstract_excerpt":"Compact representations of objects is a common concept in  computer science.  Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a plan) in this graph.  While the graphs themselves are represented compactly as planning instances, the paths are usually represented explicitly as sequences of actions.  Some cases are known where the plans always have compact representations, for example, using macros.  We show that these results do not extend to the general case, by proving a number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5848","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"verHQYoRkRmYr6ASUv4WuscFc/rx+CgmE4Gb4oCDxOWK4dTCDaZFIk6Wm0efdvq4EonqJgUAmyKkPUCQYXzWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:34.528927Z"},"content_sha256":"bdd8c6b1be1ebff5cfcaddb8c26e533ed19f100326bf363bda55dfdae18783a2","schema_version":"1.0","event_id":"sha256:bdd8c6b1be1ebff5cfcaddb8c26e533ed19f100326bf363bda55dfdae18783a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/bundle.json","state_url":"https://pith.science/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/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-30T08:47:34Z","links":{"resolver":"https://pith.science/pith/CAMKZ5TGEVEN2YQWEUPKE3433F","bundle":"https://pith.science/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/bundle.json","state":"https://pith.science/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAMKZ5TGEVEN2YQWEUPKE3433F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CAMKZ5TGEVEN2YQWEUPKE3433F","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":"728157cbb4f03817e483dfb50f79f7ed02b621bf7370355ad15e8e90cf0d83cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:41:51Z","title_canon_sha256":"48e9d9803e5cd5d212877cd5b6d9edb410384a43002de97ee4d26b824cffd678"},"schema_version":"1.0","source":{"id":"1401.5848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5848","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5848v1","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5848","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"CAMKZ5TGEVEN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CAMKZ5TGEVEN2YQW","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CAMKZ5TG","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:bdd8c6b1be1ebff5cfcaddb8c26e533ed19f100326bf363bda55dfdae18783a2","target":"graph","created_at":"2026-05-18T03:01:23Z","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":"Compact representations of objects is a common concept in  computer science.  Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a plan) in this graph.  While the graphs themselves are represented compactly as planning instances, the paths are usually represented explicitly as sequences of actions.  Some cases are known where the plans always have compact representations, for example, using macros.  We show that these results do not extend to the general case, by proving a number of ","authors_text":"Christer B\\\"ackstr\\\"om, Peter Jonsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:41:51Z","title":"Algorithms and Limits for Compact Plan Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5848","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:9e31b7f1b7785d199ced3c531c12dcc4cde67a735578e193d85953ddb7257c99","target":"record","created_at":"2026-05-18T03:01:23Z","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":"728157cbb4f03817e483dfb50f79f7ed02b621bf7370355ad15e8e90cf0d83cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-23T02:41:51Z","title_canon_sha256":"48e9d9803e5cd5d212877cd5b6d9edb410384a43002de97ee4d26b824cffd678"},"schema_version":"1.0","source":{"id":"1401.5848","kind":"arxiv","version":1}},"canonical_sha256":"1018acf6662548dd6216251ea26f9bd972a5cff7b545f13660551567e6b36964","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1018acf6662548dd6216251ea26f9bd972a5cff7b545f13660551567e6b36964","first_computed_at":"2026-05-18T03:01:23.721624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.721624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gZrXjSuzSvFD57Lz8r02Pck0QK0duK3zsnvTTEahSiKW3ApjQV9e+iEUYlB2TG/CBJDRdwL4oAULGirEcsikAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.722270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e31b7f1b7785d199ced3c531c12dcc4cde67a735578e193d85953ddb7257c99","sha256:bdd8c6b1be1ebff5cfcaddb8c26e533ed19f100326bf363bda55dfdae18783a2"],"state_sha256":"98d240e37aea5939c54d8c2366f8691e1088513870d37d37a26d692f5a14cb72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YS5eIVXBcN1EyxKVOTA2Uw/huIPlj6dpaEzVHBHj9GV+WhIoJCNPJYV1ki9nr9hi84D5fpG5vbfpKthV1GruCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:47:34.530897Z","bundle_sha256":"77c4dbca48bdcc44544248503403dc785772bfee78c2e97155de380c92311884"}}