{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7RLHIOCHAEQA35D6YIVZBCJXKW","short_pith_number":"pith:7RLHIOCH","schema_version":"1.0","canonical_sha256":"fc5674384701200df47ec22b90893755af6037acb96af9cc14e97287c080c4c6","source":{"kind":"arxiv","id":"1410.5186","version":3},"attestation_state":"computed","paper":{"title":"On the Hardness of Bribery Variants in Voting with CP-Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Britta Dorn, Dominikus Kr\\\"uger","submitted_at":"2014-10-20T08:23:00Z","abstract_excerpt":"We continue previous work by Mattei et al. (Mattei, N., Pini, M., Rossi, F., Venable, K.: Bribery in voting with CP-nets. Ann. of Math. and Artif. Intell. pp. 1--26 (2013)) in which they study the computational complexity of bribery schemes when voters have conditional preferences that are modeled by CP-nets. For most of the cases they considered, they could show that the bribery problem is solvable in polynomial time. Some cases remained open---we solve two of them and extend the previous results to the case that voters are weighted. Moreover, we consider negative (weighted) bribery in CP-net"},"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":"1410.5186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-20T08:23:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e51a2f67eb57f1407b71fb0d9593bfac07ee40eacb01f73119d152cd8c948d96","abstract_canon_sha256":"f2819238e55bf58831af39e62d9f5bdad7ecf3a2a9de1efbe4f674282d9da614"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:36.231619Z","signature_b64":"/Bjh8S/tRtqs6zz6Ub9C4Niaw+N4MOz/X/1zQXuYqzIyXxBHzDctFrEJBg/BsX7ydm9u1k6AcxxYW8uOXmO0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5674384701200df47ec22b90893755af6037acb96af9cc14e97287c080c4c6","last_reissued_at":"2026-05-18T01:14:36.231009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:36.231009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardness of Bribery Variants in Voting with CP-Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Britta Dorn, Dominikus Kr\\\"uger","submitted_at":"2014-10-20T08:23:00Z","abstract_excerpt":"We continue previous work by Mattei et al. (Mattei, N., Pini, M., Rossi, F., Venable, K.: Bribery in voting with CP-nets. Ann. of Math. and Artif. Intell. pp. 1--26 (2013)) in which they study the computational complexity of bribery schemes when voters have conditional preferences that are modeled by CP-nets. For most of the cases they considered, they could show that the bribery problem is solvable in polynomial time. Some cases remained open---we solve two of them and extend the previous results to the case that voters are weighted. Moreover, we consider negative (weighted) bribery in CP-net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5186","kind":"arxiv","version":3},"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":"1410.5186","created_at":"2026-05-18T01:14:36.231112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5186v3","created_at":"2026-05-18T01:14:36.231112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5186","created_at":"2026-05-18T01:14:36.231112+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RLHIOCHAEQA","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RLHIOCHAEQA35D6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RLHIOCH","created_at":"2026-05-18T12:28:19.803747+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/7RLHIOCHAEQA35D6YIVZBCJXKW","json":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW.json","graph_json":"https://pith.science/api/pith-number/7RLHIOCHAEQA35D6YIVZBCJXKW/graph.json","events_json":"https://pith.science/api/pith-number/7RLHIOCHAEQA35D6YIVZBCJXKW/events.json","paper":"https://pith.science/paper/7RLHIOCH"},"agent_actions":{"view_html":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW","download_json":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW.json","view_paper":"https://pith.science/paper/7RLHIOCH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5186&json=true","fetch_graph":"https://pith.science/api/pith-number/7RLHIOCHAEQA35D6YIVZBCJXKW/graph.json","fetch_events":"https://pith.science/api/pith-number/7RLHIOCHAEQA35D6YIVZBCJXKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW/action/storage_attestation","attest_author":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW/action/author_attestation","sign_citation":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW/action/citation_signature","submit_replication":"https://pith.science/pith/7RLHIOCHAEQA35D6YIVZBCJXKW/action/replication_record"}},"created_at":"2026-05-18T01:14:36.231112+00:00","updated_at":"2026-05-18T01:14:36.231112+00:00"}