{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FIHGM3MWIXYCJF6NMRTJ3BKNYI","short_pith_number":"pith:FIHGM3MW","canonical_record":{"source":{"id":"1111.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"1c4f006c25037272542eae91f0d95aa867a6104a53ecf66dd0f2a15603a4c014","abstract_canon_sha256":"b243b5f4c53f38ed2bc866e0a86f6981694f757bae1124064e29b7b8c31390a6"},"schema_version":"1.0"},"canonical_sha256":"2a0e666d9645f02497cd64669d854dc21d51d644d4c068c31873c1f188c5019c","source":{"kind":"arxiv","id":"1111.0056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0056","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0056v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0056","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"FIHGM3MWIXYC","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FIHGM3MWIXYCJF6N","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FIHGM3MW","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FIHGM3MWIXYCJF6NMRTJ3BKNYI","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"1c4f006c25037272542eae91f0d95aa867a6104a53ecf66dd0f2a15603a4c014","abstract_canon_sha256":"b243b5f4c53f38ed2bc866e0a86f6981694f757bae1124064e29b7b8c31390a6"},"schema_version":"1.0"},"canonical_sha256":"2a0e666d9645f02497cd64669d854dc21d51d644d4c068c31873c1f188c5019c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.533992Z","signature_b64":"leIvJSxCyAyOwHmF1rNmjf8J1WIMn4kMuJtd95x3epzFNyiDRNKGVczWmic84u3TVuHM4PMdco+VuXTiXxNgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a0e666d9645f02497cd64669d854dc21d51d644d4c068c31873c1f188c5019c","last_reissued_at":"2026-05-18T04:09:46.533519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.533519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0056","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:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cdT2x2OwRb+Cwxam7LTjIY7vykeTHLJz/f53qyvja9L7fbN8fUcezyQFPBHX7E0KBYf4uqlWW1Kjba9jGjOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:07:58.399227Z"},"content_sha256":"7423aa362e920269267cd30535044d2f8d8de8d6fa3743661f61f4659165e716","schema_version":"1.0","event_id":"sha256:7423aa362e920269267cd30535044d2f8d8de8d6fa3743661f61f4659165e716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FIHGM3MWIXYCJF6NMRTJ3BKNYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Planning Problems With Simple Causal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anders Jonsson, Omer Gim\\'enez","submitted_at":"2011-10-31T22:12:22Z","abstract_excerpt":"We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state variables and acyclic causal graphs. This implies that plan generation may be tractable even when a planning problem has an exponentially long minimal solution. We also prove that the problem of plan existence for planning problems with multi-valued variables and chain causal graphs is NP-hard. Finally, we show that plan existence for planning problems with bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0056","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:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IP3JuXx9BEZhEtdp6LtoQMxp5zR2WRKukYVC42Dn7997D4MkgdAQLOOUhxtCTgPmftVVfNpDV3S9Ni13IsyhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:07:58.399586Z"},"content_sha256":"e213b61f6d4eb189ed8452728105f2455bfb4893f7dd3dbdeb93a70c3e019383","schema_version":"1.0","event_id":"sha256:e213b61f6d4eb189ed8452728105f2455bfb4893f7dd3dbdeb93a70c3e019383"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/bundle.json","state_url":"https://pith.science/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/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-02T00:07:58Z","links":{"resolver":"https://pith.science/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI","bundle":"https://pith.science/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/bundle.json","state":"https://pith.science/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIHGM3MWIXYCJF6NMRTJ3BKNYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FIHGM3MWIXYCJF6NMRTJ3BKNYI","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":"b243b5f4c53f38ed2bc866e0a86f6981694f757bae1124064e29b7b8c31390a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:12:22Z","title_canon_sha256":"1c4f006c25037272542eae91f0d95aa867a6104a53ecf66dd0f2a15603a4c014"},"schema_version":"1.0","source":{"id":"1111.0056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0056","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0056v1","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0056","created_at":"2026-05-18T04:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"FIHGM3MWIXYC","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FIHGM3MWIXYCJF6N","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FIHGM3MW","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:e213b61f6d4eb189ed8452728105f2455bfb4893f7dd3dbdeb93a70c3e019383","target":"graph","created_at":"2026-05-18T04:09:46Z","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":"We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state variables and acyclic causal graphs. This implies that plan generation may be tractable even when a planning problem has an exponentially long minimal solution. We also prove that the problem of plan existence for planning problems with multi-valued variables and chain causal graphs is NP-hard. Finally, we show that plan existence for planning problems with bi","authors_text":"Anders Jonsson, Omer Gim\\'enez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:12:22Z","title":"The Complexity of Planning Problems With Simple Causal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0056","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:7423aa362e920269267cd30535044d2f8d8de8d6fa3743661f61f4659165e716","target":"record","created_at":"2026-05-18T04:09:46Z","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":"b243b5f4c53f38ed2bc866e0a86f6981694f757bae1124064e29b7b8c31390a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:12:22Z","title_canon_sha256":"1c4f006c25037272542eae91f0d95aa867a6104a53ecf66dd0f2a15603a4c014"},"schema_version":"1.0","source":{"id":"1111.0056","kind":"arxiv","version":1}},"canonical_sha256":"2a0e666d9645f02497cd64669d854dc21d51d644d4c068c31873c1f188c5019c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a0e666d9645f02497cd64669d854dc21d51d644d4c068c31873c1f188c5019c","first_computed_at":"2026-05-18T04:09:46.533519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:46.533519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"leIvJSxCyAyOwHmF1rNmjf8J1WIMn4kMuJtd95x3epzFNyiDRNKGVczWmic84u3TVuHM4PMdco+VuXTiXxNgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:46.533992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7423aa362e920269267cd30535044d2f8d8de8d6fa3743661f61f4659165e716","sha256:e213b61f6d4eb189ed8452728105f2455bfb4893f7dd3dbdeb93a70c3e019383"],"state_sha256":"566d147966441a95a84a7c081feae20399cb5ca4f33c0b5423cf0687b4eff9cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iT2kfFtNY4n6v5vj9t6m9zBvFOEPRQN2PWdJZa3AYDfv07RYxuJc29/ikolleyNwBDNotclQYdJS8OSNgF4kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:07:58.401770Z","bundle_sha256":"32dcac63daf802f6bbace8de5b4241ac16267dfb5ff8b082d492c4acd507a751"}}