{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5B3N7PSJEVKBMMX45YK32UFQRJ","short_pith_number":"pith:5B3N7PSJ","canonical_record":{"source":{"id":"1401.3467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:25:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"98d27b6cb05215a646bd56d968b8a3c2851269639443f6804d331d193c5a3143","abstract_canon_sha256":"7da49d0889ff52198c7467da4dc2c529d165657eb467b6e169720137e1445c75"},"schema_version":"1.0"},"canonical_sha256":"e876dfbe4925541632fcee15bd50b08a5a49aa69bc783d1c94156c52007ff221","source":{"kind":"arxiv","id":"1401.3467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3467","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3467v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3467","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"5B3N7PSJEVKB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5B3N7PSJEVKBMMX4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5B3N7PSJ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5B3N7PSJEVKBMMX45YK32UFQRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:25:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"98d27b6cb05215a646bd56d968b8a3c2851269639443f6804d331d193c5a3143","abstract_canon_sha256":"7da49d0889ff52198c7467da4dc2c529d165657eb467b6e169720137e1445c75"},"schema_version":"1.0"},"canonical_sha256":"e876dfbe4925541632fcee15bd50b08a5a49aa69bc783d1c94156c52007ff221","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.896858Z","signature_b64":"WiQAWtsHjWlvVM/z+BcHJjOicKabbATYr0A/n2rIJ+1a+/ItR6UhZ3Yh3wQIi+Z03wQ8a7p67IhTzEkcFoT5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e876dfbe4925541632fcee15bd50b08a5a49aa69bc783d1c94156c52007ff221","last_reissued_at":"2026-05-18T03:02:08.896024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.896024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3467","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2Ilzw2kg7rC48euOBdTCaFtkvpn/OebAMpHEkfOfcWfZhNUNyWux9OVnbDSYSpdQ+mpArjlCmd1v4yWnBy8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:40:56.708440Z"},"content_sha256":"6c0121e7703136622da9bd318d00be84755fa2255283b74d7df831670e86eac2","schema_version":"1.0","event_id":"sha256:6c0121e7703136622da9bd318d00be84755fa2255283b74d7df831670e86eac2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5B3N7PSJEVKBMMX45YK32UFQRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"Anders Jonsson, Omer Gim\\'enez","submitted_at":"2014-01-15T05:25:29Z","abstract_excerpt":"Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. In this paper, we study the complexity of planning in the class C_n of planning problems, characterized by unary operators and directed path causal graphs. Although this is one of the simplest forms of causal graphs a planning problem can have, we show that planning is intractable for C_n (unless P = NP), even if the domains of state variables have bounded size. In particular, we show that plan existence for C_n^k is NP-hard for k>=5 by reduction from CNFS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3467","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmuRtSNm2x6Fjneq6xjk0VUCQYTR2DhFmG0bYnl/E4tlkn6YPmov/kX5aAtlJm9MMEIIBSpepOlBO1+0QSCACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:40:56.708880Z"},"content_sha256":"35d630955245856fc29677bbf466d68ba4e06918dbbeea2985646f5a18a76353","schema_version":"1.0","event_id":"sha256:35d630955245856fc29677bbf466d68ba4e06918dbbeea2985646f5a18a76353"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/bundle.json","state_url":"https://pith.science/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/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-31T15:40:56Z","links":{"resolver":"https://pith.science/pith/5B3N7PSJEVKBMMX45YK32UFQRJ","bundle":"https://pith.science/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/bundle.json","state":"https://pith.science/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5B3N7PSJEVKBMMX45YK32UFQRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5B3N7PSJEVKBMMX45YK32UFQRJ","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":"7da49d0889ff52198c7467da4dc2c529d165657eb467b6e169720137e1445c75","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:25:29Z","title_canon_sha256":"98d27b6cb05215a646bd56d968b8a3c2851269639443f6804d331d193c5a3143"},"schema_version":"1.0","source":{"id":"1401.3467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3467","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3467v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3467","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"5B3N7PSJEVKB","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5B3N7PSJEVKBMMX4","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5B3N7PSJ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:35d630955245856fc29677bbf466d68ba4e06918dbbeea2985646f5a18a76353","target":"graph","created_at":"2026-05-18T03:02:08Z","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":"Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. In this paper, we study the complexity of planning in the class C_n of planning problems, characterized by unary operators and directed path causal graphs. Although this is one of the simplest forms of causal graphs a planning problem can have, we show that planning is intractable for C_n (unless P = NP), even if the domains of state variables have bounded size. In particular, we show that plan existence for C_n^k is NP-hard for k>=5 by reduction from CNFS","authors_text":"Anders Jonsson, Omer Gim\\'enez","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:25:29Z","title":"Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3467","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:6c0121e7703136622da9bd318d00be84755fa2255283b74d7df831670e86eac2","target":"record","created_at":"2026-05-18T03:02:08Z","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":"7da49d0889ff52198c7467da4dc2c529d165657eb467b6e169720137e1445c75","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:25:29Z","title_canon_sha256":"98d27b6cb05215a646bd56d968b8a3c2851269639443f6804d331d193c5a3143"},"schema_version":"1.0","source":{"id":"1401.3467","kind":"arxiv","version":1}},"canonical_sha256":"e876dfbe4925541632fcee15bd50b08a5a49aa69bc783d1c94156c52007ff221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e876dfbe4925541632fcee15bd50b08a5a49aa69bc783d1c94156c52007ff221","first_computed_at":"2026-05-18T03:02:08.896024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.896024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiQAWtsHjWlvVM/z+BcHJjOicKabbATYr0A/n2rIJ+1a+/ItR6UhZ3Yh3wQIi+Z03wQ8a7p67IhTzEkcFoT5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.896858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c0121e7703136622da9bd318d00be84755fa2255283b74d7df831670e86eac2","sha256:35d630955245856fc29677bbf466d68ba4e06918dbbeea2985646f5a18a76353"],"state_sha256":"a07ee035d296c26f3ef37127ae0a5c4102ce56b65dafa5579a6b39078c8bb2e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vvVOcvG6b2MnLI0bxFbIif5FISyux+zl2tJ+ogmPfgBspeGCJhCgWWSaSwerRtmA7XDtErHPFjnYvWmA/RR9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:40:56.713024Z","bundle_sha256":"1c04aa969a781a4022f6b996f21e24314853a1047ad6447e15a5341bef9b0e74"}}