{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4WTLXPRGXVDH62NEF7GN5PSSCR","short_pith_number":"pith:4WTLXPRG","schema_version":"1.0","canonical_sha256":"e5a6bbbe26bd467f69a42fccdebe521456e8e055bcaa2fa09549e3605bbecb06","source":{"kind":"arxiv","id":"1210.6963","version":5},"attestation_state":"computed","paper":{"title":"Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Curtis Menton, Lane A. Hemaspaandra, Rahman Lavaee","submitted_at":"2012-10-25T19:37:24Z","abstract_excerpt":"Schulze and ranked-pairs elections have received much attention recently, and the former has quickly become a quite widely used election system. For many cases these systems have been proven resistant to bribery, control, or manipulation, with ranked pairs being particularly praised for being NP-hard for all three of those. Nonetheless, the present paper shows that with respect to the number of candidates, Schulze and ranked-pairs elections are fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform, polynomial-time algorithms whose degree does not depend on the number o"},"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":"1210.6963","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-10-25T19:37:24Z","cross_cats_sorted":["cs.DS","cs.MA"],"title_canon_sha256":"dccd268f02640e2fa076e2211ac50cdf9b0fb7f81b18d2b0b53950b25595bb63","abstract_canon_sha256":"c61e9e6d7ce69ab451b862cb320bd6af2240bb5e689b1966abf05d998bac2c5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:18.544959Z","signature_b64":"fIQNpromKia17zhTLmp3LoqClXv20g92ShR/YeygXdiWxC9PLd7X8dUzpVbqt2maeZJz0We7sA7N78NZxxo5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a6bbbe26bd467f69a42fccdebe521456e8e055bcaa2fa09549e3605bbecb06","last_reissued_at":"2026-05-18T02:49:18.544261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:18.544261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Curtis Menton, Lane A. Hemaspaandra, Rahman Lavaee","submitted_at":"2012-10-25T19:37:24Z","abstract_excerpt":"Schulze and ranked-pairs elections have received much attention recently, and the former has quickly become a quite widely used election system. For many cases these systems have been proven resistant to bribery, control, or manipulation, with ranked pairs being particularly praised for being NP-hard for all three of those. Nonetheless, the present paper shows that with respect to the number of candidates, Schulze and ranked-pairs elections are fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform, polynomial-time algorithms whose degree does not depend on the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6963","kind":"arxiv","version":5},"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":"1210.6963","created_at":"2026-05-18T02:49:18.544381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6963v5","created_at":"2026-05-18T02:49:18.544381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6963","created_at":"2026-05-18T02:49:18.544381+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WTLXPRGXVDH","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WTLXPRGXVDH62NE","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WTLXPRG","created_at":"2026-05-18T12:26:53.410803+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/4WTLXPRGXVDH62NEF7GN5PSSCR","json":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR.json","graph_json":"https://pith.science/api/pith-number/4WTLXPRGXVDH62NEF7GN5PSSCR/graph.json","events_json":"https://pith.science/api/pith-number/4WTLXPRGXVDH62NEF7GN5PSSCR/events.json","paper":"https://pith.science/paper/4WTLXPRG"},"agent_actions":{"view_html":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR","download_json":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR.json","view_paper":"https://pith.science/paper/4WTLXPRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6963&json=true","fetch_graph":"https://pith.science/api/pith-number/4WTLXPRGXVDH62NEF7GN5PSSCR/graph.json","fetch_events":"https://pith.science/api/pith-number/4WTLXPRGXVDH62NEF7GN5PSSCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR/action/storage_attestation","attest_author":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR/action/author_attestation","sign_citation":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR/action/citation_signature","submit_replication":"https://pith.science/pith/4WTLXPRGXVDH62NEF7GN5PSSCR/action/replication_record"}},"created_at":"2026-05-18T02:49:18.544381+00:00","updated_at":"2026-05-18T02:49:18.544381+00:00"}