{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GGW3VA6DNORYSUBBIQXTKHF64Q","short_pith_number":"pith:GGW3VA6D","schema_version":"1.0","canonical_sha256":"31adba83c36ba3895021442f351cbee4166593a392304a37af112b39156914ad","source":{"kind":"arxiv","id":"1601.01492","version":2},"attestation_state":"computed","paper":{"title":"Complexity of Shift Bribery in Committee Elections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Nimrod Talmon, Piotr Faliszewski, Robert Bredereck, Rolf Niedermeier","submitted_at":"2016-01-07T11:35:43Z","abstract_excerpt":"Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. Of course, shifting comes at a price (depending on the voter and on the extent of the shift) and one must not exceed the given budget. We study the (parameterized) computational complexity of S HIFT BRIBERY for multiwinner voting rules where winning the election means to be part of some winning committee. We focus on the well-established SNTV, Bloc, k-Borda, and Chamberlin-Courant rules, as well as on approximate vari"},"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":"1601.01492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-07T11:35:43Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"3b1cd3b3cbcf2b83479b8ca069ab3ec1a9f4d6498b0d5a096ef370272c42938c","abstract_canon_sha256":"5c79a498d3364d9698f76f99d98e763b9ddd421b5ca0e262510077873c2c7118"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.860780Z","signature_b64":"IKIgXbDH+L67msYixa9objmlQ07Ay7HcEUIcDmngzboCIxEBaLdfPLyFrpev3K+GN9eaLiz6gGwk/0AW+UU3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31adba83c36ba3895021442f351cbee4166593a392304a37af112b39156914ad","last_reissued_at":"2026-05-18T00:05:00.860359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.860359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Shift Bribery in Committee Elections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Nimrod Talmon, Piotr Faliszewski, Robert Bredereck, Rolf Niedermeier","submitted_at":"2016-01-07T11:35:43Z","abstract_excerpt":"Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. Of course, shifting comes at a price (depending on the voter and on the extent of the shift) and one must not exceed the given budget. We study the (parameterized) computational complexity of S HIFT BRIBERY for multiwinner voting rules where winning the election means to be part of some winning committee. We focus on the well-established SNTV, Bloc, k-Borda, and Chamberlin-Courant rules, as well as on approximate vari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01492","kind":"arxiv","version":2},"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":"1601.01492","created_at":"2026-05-18T00:05:00.860424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01492v2","created_at":"2026-05-18T00:05:00.860424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01492","created_at":"2026-05-18T00:05:00.860424+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGW3VA6DNORY","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGW3VA6DNORYSUBB","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGW3VA6D","created_at":"2026-05-18T12:30:19.053100+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/GGW3VA6DNORYSUBBIQXTKHF64Q","json":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q.json","graph_json":"https://pith.science/api/pith-number/GGW3VA6DNORYSUBBIQXTKHF64Q/graph.json","events_json":"https://pith.science/api/pith-number/GGW3VA6DNORYSUBBIQXTKHF64Q/events.json","paper":"https://pith.science/paper/GGW3VA6D"},"agent_actions":{"view_html":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q","download_json":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q.json","view_paper":"https://pith.science/paper/GGW3VA6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01492&json=true","fetch_graph":"https://pith.science/api/pith-number/GGW3VA6DNORYSUBBIQXTKHF64Q/graph.json","fetch_events":"https://pith.science/api/pith-number/GGW3VA6DNORYSUBBIQXTKHF64Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q/action/storage_attestation","attest_author":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q/action/author_attestation","sign_citation":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q/action/citation_signature","submit_replication":"https://pith.science/pith/GGW3VA6DNORYSUBBIQXTKHF64Q/action/replication_record"}},"created_at":"2026-05-18T00:05:00.860424+00:00","updated_at":"2026-05-18T00:05:00.860424+00:00"}