{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PTONMFUN6DVDAT4LPYZOAW3KSU","short_pith_number":"pith:PTONMFUN","schema_version":"1.0","canonical_sha256":"7cdcd6168df0ea304f8b7e32e05b6a95201cf64faeb259aedebb90d240edb41b","source":{"kind":"arxiv","id":"2605.23743","version":1},"attestation_state":"computed","paper":{"title":"The Communication Complexity of Instant-Runoff Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"CNRS), \\'Elie de Panafieu, Fran\\c{c}ois Durand, J\\'er\\^ome Lang (LAMSADE","submitted_at":"2026-05-22T15:18:25Z","abstract_excerpt":"The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in an election with m candidates. We study the communication complexity of Instant-Runoff Voting (IRV). Conitzer and Sandholm [2005] established an upper bound of O(n (log m)${}^2$), but did not provide a matching lower bound beyond $\\Omega$(n log m). We resolve this open problem by raising the lower bound to $\\Omega$(n (log m)${}^2$) using the fooling set technique, thereby showing that the communication complexity of I"},"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":"2605.23743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-22T15:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"0b82117f03adc182c6fe00b357e855d996733e91f61f54d457dbdb3959077d12","abstract_canon_sha256":"7f6d1787563d09f0b228edb612f47b275accb75d5a1817d279821dd305b60064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:29.666006Z","signature_b64":"QXLqowj0kNEI5+krUkbicKbQsAI3rzGfqv9EeFBhXKlpdt/lGMtnlxY6ix2W7K95vSWVnVVH2AP4WwSWelERAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cdcd6168df0ea304f8b7e32e05b6a95201cf64faeb259aedebb90d240edb41b","last_reissued_at":"2026-05-25T02:02:29.665246Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:29.665246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Communication Complexity of Instant-Runoff Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"CNRS), \\'Elie de Panafieu, Fran\\c{c}ois Durand, J\\'er\\^ome Lang (LAMSADE","submitted_at":"2026-05-22T15:18:25Z","abstract_excerpt":"The communication complexity of a voting rule is the worst-case number of bits that n voters must transmit to a central authority under the most efficient elicitation protocol in an election with m candidates. We study the communication complexity of Instant-Runoff Voting (IRV). Conitzer and Sandholm [2005] established an upper bound of O(n (log m)${}^2$), but did not provide a matching lower bound beyond $\\Omega$(n log m). We resolve this open problem by raising the lower bound to $\\Omega$(n (log m)${}^2$) using the fooling set technique, thereby showing that the communication complexity of I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23743","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23743/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.23743","created_at":"2026-05-25T02:02:29.665381+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23743v1","created_at":"2026-05-25T02:02:29.665381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23743","created_at":"2026-05-25T02:02:29.665381+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTONMFUN6DVD","created_at":"2026-05-25T02:02:29.665381+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTONMFUN6DVDAT4L","created_at":"2026-05-25T02:02:29.665381+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTONMFUN","created_at":"2026-05-25T02:02:29.665381+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/PTONMFUN6DVDAT4LPYZOAW3KSU","json":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU.json","graph_json":"https://pith.science/api/pith-number/PTONMFUN6DVDAT4LPYZOAW3KSU/graph.json","events_json":"https://pith.science/api/pith-number/PTONMFUN6DVDAT4LPYZOAW3KSU/events.json","paper":"https://pith.science/paper/PTONMFUN"},"agent_actions":{"view_html":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU","download_json":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU.json","view_paper":"https://pith.science/paper/PTONMFUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23743&json=true","fetch_graph":"https://pith.science/api/pith-number/PTONMFUN6DVDAT4LPYZOAW3KSU/graph.json","fetch_events":"https://pith.science/api/pith-number/PTONMFUN6DVDAT4LPYZOAW3KSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU/action/storage_attestation","attest_author":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU/action/author_attestation","sign_citation":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU/action/citation_signature","submit_replication":"https://pith.science/pith/PTONMFUN6DVDAT4LPYZOAW3KSU/action/replication_record"}},"created_at":"2026-05-25T02:02:29.665381+00:00","updated_at":"2026-05-25T02:02:29.665381+00:00"}