{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KDK34O4AF6S33F73UAEJOOXYXH","short_pith_number":"pith:KDK34O4A","schema_version":"1.0","canonical_sha256":"50d5be3b802fa5bd97fba008973af8b9c2f2161b37aadec69d419f396141cfe2","source":{"kind":"arxiv","id":"1806.10018","version":1},"attestation_state":"computed","paper":{"title":"Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Enrico Malizia, Thomas Lukasiewicz","submitted_at":"2018-06-26T14:33:15Z","abstract_excerpt":"Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two ways to aggregate preferences over CP-nets. In the former, preferences are aggregated feature-by-feature. Hence, when preferences have specific feature dependencies, sequential voting may exhibit voting paradoxes, i.e., it might select sub-optimal outcomes. To avoid paradoxes in sequential voting, one has often assumed the $\\mathcal{O}$-legality restriction, "},"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":"1806.10018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-26T14:33:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ee9110c69843279735c761410c1aee5c450230dc48251296c675349d7838d68f","abstract_canon_sha256":"e52eef8403d15fb804e841d3e7276e5593046c577ae6490a7b276fe890c47815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:07.195912Z","signature_b64":"AaB4xITcQ2gYefblsHnONniUe/bY01MFXOXS6L/hh+BsQmTUwIA4gF4jC/O9tfS88Uo5XYf6Jk43W1MZglWzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d5be3b802fa5bd97fba008973af8b9c2f2161b37aadec69d419f396141cfe2","last_reissued_at":"2026-05-17T23:50:07.195373Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:07.195373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Enrico Malizia, Thomas Lukasiewicz","submitted_at":"2018-06-26T14:33:15Z","abstract_excerpt":"Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two ways to aggregate preferences over CP-nets. In the former, preferences are aggregated feature-by-feature. Hence, when preferences have specific feature dependencies, sequential voting may exhibit voting paradoxes, i.e., it might select sub-optimal outcomes. To avoid paradoxes in sequential voting, one has often assumed the $\\mathcal{O}$-legality restriction, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10018","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":"1806.10018","created_at":"2026-05-17T23:50:07.195452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10018v1","created_at":"2026-05-17T23:50:07.195452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10018","created_at":"2026-05-17T23:50:07.195452+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDK34O4AF6S3","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDK34O4AF6S33F73","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDK34O4A","created_at":"2026-05-18T12:32:33.847187+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/KDK34O4AF6S33F73UAEJOOXYXH","json":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH.json","graph_json":"https://pith.science/api/pith-number/KDK34O4AF6S33F73UAEJOOXYXH/graph.json","events_json":"https://pith.science/api/pith-number/KDK34O4AF6S33F73UAEJOOXYXH/events.json","paper":"https://pith.science/paper/KDK34O4A"},"agent_actions":{"view_html":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH","download_json":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH.json","view_paper":"https://pith.science/paper/KDK34O4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10018&json=true","fetch_graph":"https://pith.science/api/pith-number/KDK34O4AF6S33F73UAEJOOXYXH/graph.json","fetch_events":"https://pith.science/api/pith-number/KDK34O4AF6S33F73UAEJOOXYXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH/action/storage_attestation","attest_author":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH/action/author_attestation","sign_citation":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH/action/citation_signature","submit_replication":"https://pith.science/pith/KDK34O4AF6S33F73UAEJOOXYXH/action/replication_record"}},"created_at":"2026-05-17T23:50:07.195452+00:00","updated_at":"2026-05-17T23:50:07.195452+00:00"}