{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O47QNX7ISMRBCZSGVSKDOQCAPP","short_pith_number":"pith:O47QNX7I","schema_version":"1.0","canonical_sha256":"773f06dfe89322116646ac943740407bd7c147e239daedf2c7670018ee9b337d","source":{"kind":"arxiv","id":"1401.3453","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3453","created_at":"2026-05-18T03:02:09.026569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3453v1","created_at":"2026-05-18T03:02:09.026569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3453","created_at":"2026-05-18T03:02:09.026569+00:00"},{"alias_kind":"pith_short_12","alias_value":"O47QNX7ISMRB","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O47QNX7ISMRBCZSG","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O47QNX7I","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP","json":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP.json","graph_json":"https://pith.science/api/pith-number/O47QNX7ISMRBCZSGVSKDOQCAPP/graph.json","events_json":"https://pith.science/api/pith-number/O47QNX7ISMRBCZSGVSKDOQCAPP/events.json","paper":"https://pith.science/paper/O47QNX7I"},"agent_actions":{"view_html":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP","download_json":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP.json","view_paper":"https://pith.science/paper/O47QNX7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3453&json=true","fetch_graph":"https://pith.science/api/pith-number/O47QNX7ISMRBCZSGVSKDOQCAPP/graph.json","fetch_events":"https://pith.science/api/pith-number/O47QNX7ISMRBCZSGVSKDOQCAPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/action/storage_attestation","attest_author":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/action/author_attestation","sign_citation":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/action/citation_signature","submit_replication":"https://pith.science/pith/O47QNX7ISMRBCZSGVSKDOQCAPP/action/replication_record"}},"created_at":"2026-05-18T03:02:09.026569+00:00","updated_at":"2026-05-18T03:02:09.026569+00:00"}