{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PFVZMYP53S4CZEM5SKTSNXRDVX","short_pith_number":"pith:PFVZMYP5","schema_version":"1.0","canonical_sha256":"796b9661fddcb82c919d92a726de23add9a9f3b2de65b0f751bf4ce8c5bd4a1f","source":{"kind":"arxiv","id":"2607.03564","version":1},"attestation_state":"computed","paper":{"title":"New bounds on randomized metric distortion of top-$k$ voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alec Sun, Daniel Zhu","submitted_at":"2026-07-03T19:05:48Z","abstract_excerpt":"We prove new upper and lower bounds on metric distortion for randomized social choice mechanisms. Under first-choice voting where each voter reports only their most preferred candidate, we show that selecting a candidate with probability proportional to the $\\frac{n}{n-1}$-th power of their vote share achieves the optimal worst-case distortion of $3 - \\frac{2}{n}$. This is a simpler single-rule alternative to prior work. We also study instance-specific metric distortion of first-choice mechanisms in terms of the vote vector $\\nu$. We show that there is a uniquely optimal rule achieving distort"},"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":"2607.03564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-03T19:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"5a6184cd825d512f2719cf60cc3d086259ede3cee0b441b58cfedefd4df48463","abstract_canon_sha256":"392662d0e4404a2d59e607411407b12b7a7b9a7ef4fbdc1f993c2a240331cf58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:54.743703Z","signature_b64":"lL/TxQ8wmnSgpUv0YhiUCht/p7sqArdQUMBQipMJ3byvM2V01CVIWiDDvsb3F5zpsi7um6IRU9dE1eXDObEHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"796b9661fddcb82c919d92a726de23add9a9f3b2de65b0f751bf4ce8c5bd4a1f","last_reissued_at":"2026-07-07T02:17:54.743135Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:54.743135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds on randomized metric distortion of top-$k$ voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alec Sun, Daniel Zhu","submitted_at":"2026-07-03T19:05:48Z","abstract_excerpt":"We prove new upper and lower bounds on metric distortion for randomized social choice mechanisms. Under first-choice voting where each voter reports only their most preferred candidate, we show that selecting a candidate with probability proportional to the $\\frac{n}{n-1}$-th power of their vote share achieves the optimal worst-case distortion of $3 - \\frac{2}{n}$. This is a simpler single-rule alternative to prior work. We also study instance-specific metric distortion of first-choice mechanisms in terms of the vote vector $\\nu$. We show that there is a uniquely optimal rule achieving distort"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03564","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/2607.03564/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":"2607.03564","created_at":"2026-07-07T02:17:54.743225+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03564v1","created_at":"2026-07-07T02:17:54.743225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03564","created_at":"2026-07-07T02:17:54.743225+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFVZMYP53S4C","created_at":"2026-07-07T02:17:54.743225+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFVZMYP53S4CZEM5","created_at":"2026-07-07T02:17:54.743225+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFVZMYP5","created_at":"2026-07-07T02:17:54.743225+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/PFVZMYP53S4CZEM5SKTSNXRDVX","json":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX.json","graph_json":"https://pith.science/api/pith-number/PFVZMYP53S4CZEM5SKTSNXRDVX/graph.json","events_json":"https://pith.science/api/pith-number/PFVZMYP53S4CZEM5SKTSNXRDVX/events.json","paper":"https://pith.science/paper/PFVZMYP5"},"agent_actions":{"view_html":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX","download_json":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX.json","view_paper":"https://pith.science/paper/PFVZMYP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03564&json=true","fetch_graph":"https://pith.science/api/pith-number/PFVZMYP53S4CZEM5SKTSNXRDVX/graph.json","fetch_events":"https://pith.science/api/pith-number/PFVZMYP53S4CZEM5SKTSNXRDVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX/action/storage_attestation","attest_author":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX/action/author_attestation","sign_citation":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX/action/citation_signature","submit_replication":"https://pith.science/pith/PFVZMYP53S4CZEM5SKTSNXRDVX/action/replication_record"}},"created_at":"2026-07-07T02:17:54.743225+00:00","updated_at":"2026-07-07T02:17:54.743225+00:00"}