{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YMCAYS6X2AIFXGTPMCTTYHF3PD","short_pith_number":"pith:YMCAYS6X","schema_version":"1.0","canonical_sha256":"c3040c4bd7d0105b9a6f60a73c1cbb78f96384c417d1458d6ebc21c41df18560","source":{"kind":"arxiv","id":"1206.5284","version":1},"attestation_state":"computed","paper":{"title":"More-or-Less CP-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fusun Yaman, Marie desJardins","submitted_at":"2012-06-20T15:15:21Z","abstract_excerpt":"Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus (\"all else being equal\") assumptions. Despite their intuitive nature and rich representation, dominance testing with CP-nets is computationally complex, even when the CP-nets are restricted to binary-valued preferences. Tractable algorithms exist for binary CP-nets, but these algorithms are incomplete for multi-valued CPnets. In this paper, we identify a class of multivalued CP-nets, which we call more-or-les"},"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":"1206.5284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:15:21Z","cross_cats_sorted":[],"title_canon_sha256":"896431f386823f4ed0401146ad2ca6f967cbceca40fb876f5b61b3e1132236aa","abstract_canon_sha256":"a72719e62568958d0a2768d4a12dc8c52885722ebc211a66c52fa042e668bce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.565120Z","signature_b64":"USE9fjCcfXzEtyVhdC5YF86WSJbPiK936x81rq1HlSxTVQ77kVPu9xto9bf07kBisrkhJyT3Ro7xxUK6cpLsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3040c4bd7d0105b9a6f60a73c1cbb78f96384c417d1458d6ebc21c41df18560","last_reissued_at":"2026-05-18T03:52:40.564401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.564401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More-or-Less CP-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fusun Yaman, Marie desJardins","submitted_at":"2012-06-20T15:15:21Z","abstract_excerpt":"Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus (\"all else being equal\") assumptions. Despite their intuitive nature and rich representation, dominance testing with CP-nets is computationally complex, even when the CP-nets are restricted to binary-valued preferences. Tractable algorithms exist for binary CP-nets, but these algorithms are incomplete for multi-valued CPnets. In this paper, we identify a class of multivalued CP-nets, which we call more-or-les"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5284","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":"1206.5284","created_at":"2026-05-18T03:52:40.564498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5284v1","created_at":"2026-05-18T03:52:40.564498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5284","created_at":"2026-05-18T03:52:40.564498+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMCAYS6X2AIF","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMCAYS6X2AIFXGTP","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMCAYS6X","created_at":"2026-05-18T12:27:27.928770+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/YMCAYS6X2AIFXGTPMCTTYHF3PD","json":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD.json","graph_json":"https://pith.science/api/pith-number/YMCAYS6X2AIFXGTPMCTTYHF3PD/graph.json","events_json":"https://pith.science/api/pith-number/YMCAYS6X2AIFXGTPMCTTYHF3PD/events.json","paper":"https://pith.science/paper/YMCAYS6X"},"agent_actions":{"view_html":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD","download_json":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD.json","view_paper":"https://pith.science/paper/YMCAYS6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5284&json=true","fetch_graph":"https://pith.science/api/pith-number/YMCAYS6X2AIFXGTPMCTTYHF3PD/graph.json","fetch_events":"https://pith.science/api/pith-number/YMCAYS6X2AIFXGTPMCTTYHF3PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD/action/storage_attestation","attest_author":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD/action/author_attestation","sign_citation":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD/action/citation_signature","submit_replication":"https://pith.science/pith/YMCAYS6X2AIFXGTPMCTTYHF3PD/action/replication_record"}},"created_at":"2026-05-18T03:52:40.564498+00:00","updated_at":"2026-05-18T03:52:40.564498+00:00"}