{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2POJ3OXSC3VGZX6NPK3LLESOCX","short_pith_number":"pith:2POJ3OXS","schema_version":"1.0","canonical_sha256":"d3dc9dbaf216ea6cdfcd7ab6b5924e15d20262784442311d552656f4302d08c7","source":{"kind":"arxiv","id":"1011.1338","version":1},"attestation_state":"computed","paper":{"title":"Multivariate Analyis of Swap Bribery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Britta Dorn, Ildik\\'o Schlotter","submitted_at":"2010-11-05T08:25:57Z","abstract_excerpt":"We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his preference ranking. The question is whether it is possible, without exceeding a given budget, to bribe the voters in a way that the preferred candidate wins in the election. We initiate a parameterized and multivariate complexity analysis of Swap Bribery, focusing on the case of k-approval. We investigate how different cost functions affect the computational co"},"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":"1011.1338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-05T08:25:57Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"234962189c983d13d950b5f055b2deb999b7667a1a70e142ee974ee08609ef86","abstract_canon_sha256":"609db50ba4647c5cd1f4d002fab4316e7dfb4106b75d3de023255c1d83f37e98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:52.579048Z","signature_b64":"yniHL8rPvqcL65aAwyJEJG0dL0h3n/3RvJg2NRj4taF/Dfn/PtlNlvnxb33QMB5oTvfQDtIe865x/pFEoJ7cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3dc9dbaf216ea6cdfcd7ab6b5924e15d20262784442311d552656f4302d08c7","last_reissued_at":"2026-05-18T02:04:52.578411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:52.578411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multivariate Analyis of Swap Bribery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Britta Dorn, Ildik\\'o Schlotter","submitted_at":"2010-11-05T08:25:57Z","abstract_excerpt":"We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swapping the positions of two consecutive candidates in his preference ranking. The question is whether it is possible, without exceeding a given budget, to bribe the voters in a way that the preferred candidate wins in the election. We initiate a parameterized and multivariate complexity analysis of Swap Bribery, focusing on the case of k-approval. We investigate how different cost functions affect the computational co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1338","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":"1011.1338","created_at":"2026-05-18T02:04:52.578515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1338v1","created_at":"2026-05-18T02:04:52.578515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1338","created_at":"2026-05-18T02:04:52.578515+00:00"},{"alias_kind":"pith_short_12","alias_value":"2POJ3OXSC3VG","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2POJ3OXSC3VGZX6N","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2POJ3OXS","created_at":"2026-05-18T12:26:03.138858+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/2POJ3OXSC3VGZX6NPK3LLESOCX","json":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX.json","graph_json":"https://pith.science/api/pith-number/2POJ3OXSC3VGZX6NPK3LLESOCX/graph.json","events_json":"https://pith.science/api/pith-number/2POJ3OXSC3VGZX6NPK3LLESOCX/events.json","paper":"https://pith.science/paper/2POJ3OXS"},"agent_actions":{"view_html":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX","download_json":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX.json","view_paper":"https://pith.science/paper/2POJ3OXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1338&json=true","fetch_graph":"https://pith.science/api/pith-number/2POJ3OXSC3VGZX6NPK3LLESOCX/graph.json","fetch_events":"https://pith.science/api/pith-number/2POJ3OXSC3VGZX6NPK3LLESOCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX/action/storage_attestation","attest_author":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX/action/author_attestation","sign_citation":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX/action/citation_signature","submit_replication":"https://pith.science/pith/2POJ3OXSC3VGZX6NPK3LLESOCX/action/replication_record"}},"created_at":"2026-05-18T02:04:52.578515+00:00","updated_at":"2026-05-18T02:04:52.578515+00:00"}