{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O47QNX7ISMRBCZSGVSKDOQCAPP","short_pith_number":"pith:O47QNX7I","canonical_record":{"source":{"id":"1401.3453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"a76aaa36c1830be238a84ff3c321ccad3757d0714ffbd34744508db2577a75a0","abstract_canon_sha256":"803394c62da00fe25efda1bf857a50e4fdc34db85d36a92e1e0e7598835a7d4b"},"schema_version":"1.0"},"canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","source":{"kind":"arxiv","id":"1401.3453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3453","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3453v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3453","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"O47QNX7ISMRB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O47QNX7ISMRBCZSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O47QNX7I","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O47QNX7ISMRBCZSGVSKDOQCAPP","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"a76aaa36c1830be238a84ff3c321ccad3757d0714ffbd34744508db2577a75a0","abstract_canon_sha256":"803394c62da00fe25efda1bf857a50e4fdc34db85d36a92e1e0e7598835a7d4b"},"schema_version":"1.0"},"canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.027249Z","signature_b64":"Emt3mNoMP+1LLZVtdh+4B3vZa+RKIGZ7tKSgFUwsN8LYl/gQHWEGr5HVLwMGIQQH+LAl2jOnX7iXZOXqrnRlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","last_reissued_at":"2026-05-18T03:02:09.026406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.026406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3453","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNGdPsm1QR3Me9fjeAZg9qaQ6/BosM5I4UlypkBmIMrO8SgkEqmfKj3IxilycF5Ga0Pn2zcB7uu3ujRZ0Q20BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:17.106965Z"},"content_sha256":"1d029a68859559ecea8bf99dd1a332cfb988133ff54bab1ec163c381d617ed0d","schema_version":"1.0","event_id":"sha256:1d029a68859559ecea8bf99dd1a332cfb988133ff54bab1ec163c381d617ed0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O47QNX7ISMRBCZSGVSKDOQCAPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Computational Complexity of Dominance and Consistency in CP-Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jerome Lang, Judy Goldsmith, Miroslaw Truszczyski, Nic Wilson","submitted_at":"2014-01-15T05:13:25Z","abstract_excerpt":"We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3453","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCwR+xLCWMT4eNED8XaWqFLKJguxKUP6vqwZCvi+Bm7N7/O8sHV9TI+Rpa6XT/gYLA0u8FudNrPgKs6ZsJiQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:17.107641Z"},"content_sha256":"98cdbdfcd4041d7616d7c016764a98428f04c9b7d0f47516abda0ace6ba2f342","schema_version":"1.0","event_id":"sha256:98cdbdfcd4041d7616d7c016764a98428f04c9b7d0f47516abda0ace6ba2f342"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/bundle.json","state_url":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/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-31T14:28:17Z","links":{"resolver":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP","bundle":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/bundle.json","state":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O47QNX7ISMRBCZSGVSKDOQCAPP","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":"803394c62da00fe25efda1bf857a50e4fdc34db85d36a92e1e0e7598835a7d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:13:25Z","title_canon_sha256":"a76aaa36c1830be238a84ff3c321ccad3757d0714ffbd34744508db2577a75a0"},"schema_version":"1.0","source":{"id":"1401.3453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3453","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3453v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3453","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"O47QNX7ISMRB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O47QNX7ISMRBCZSG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O47QNX7I","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:98cdbdfcd4041d7616d7c016764a98428f04c9b7d0f47516abda0ace6ba2f342","target":"graph","created_at":"2026-05-18T03:02:09Z","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 investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality","authors_text":"Jerome Lang, Judy Goldsmith, Miroslaw Truszczyski, Nic Wilson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:13:25Z","title":"The Computational Complexity of Dominance and Consistency in CP-Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3453","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:1d029a68859559ecea8bf99dd1a332cfb988133ff54bab1ec163c381d617ed0d","target":"record","created_at":"2026-05-18T03:02:09Z","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":"803394c62da00fe25efda1bf857a50e4fdc34db85d36a92e1e0e7598835a7d4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:13:25Z","title_canon_sha256":"a76aaa36c1830be238a84ff3c321ccad3757d0714ffbd34744508db2577a75a0"},"schema_version":"1.0","source":{"id":"1401.3453","kind":"arxiv","version":1}},"canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","first_computed_at":"2026-05-18T03:02:09.026406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.026406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Emt3mNoMP+1LLZVtdh+4B3vZa+RKIGZ7tKSgFUwsN8LYl/gQHWEGr5HVLwMGIQQH+LAl2jOnX7iXZOXqrnRlAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.027249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d029a68859559ecea8bf99dd1a332cfb988133ff54bab1ec163c381d617ed0d","sha256:98cdbdfcd4041d7616d7c016764a98428f04c9b7d0f47516abda0ace6ba2f342"],"state_sha256":"fb3fcf8d002ed54ec5fca1fc28b046928bbebe00577009a26f711ab3e44ab23d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YRd5ma7gTKcPvks5Cjs/dfZqJzd1lbl/okzCAVr9lZBq7pcUvBCPr/3cZifsrADCtNHgXw4HHCr9qlH93MUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:28:17.111196Z","bundle_sha256":"ccd94ecd74de58c084d10c70a8e25268fa0a7aa22ca874bdd3d82b395cbb1f30"}}