{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UND7QOZMYXSK7MJKRQPEXUDL27","short_pith_number":"pith:UND7QOZM","schema_version":"1.0","canonical_sha256":"a347f83b2cc5e4afb12a8c1e4bd06bd7df7ad8c0d563f1427f1e36af54e7fe72","source":{"kind":"arxiv","id":"2505.13630","version":1},"attestation_state":"computed","paper":{"title":"Metric Distortion for Tournament Voting and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kangning Wang, Moses Charikar, Prasanna Ramakrishnan, Zihan Tan","submitted_at":"2025-05-19T18:06:52Z","abstract_excerpt":"In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters. However, the voting rule has limited information about the distances in the metric, such as each voter's ordinal rankings of the candidates in order of distances. The central question is whether we can design rules that, for any election and underlying metric space, select a candidate whose total cost deviates from the optimal by only a small factor, referr"},"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":"2505.13630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-05-19T18:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"8a9cde2fa369a8202fe19acbaaa645c45aeb11ee33329a2dc214154711b87cb9","abstract_canon_sha256":"6a4267d35f69e7c4841987d46d3359ab8cb54cbe415f855cf7073e457599cff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:48.713981Z","signature_b64":"wF3dVaLgYB6Si5xKLnUnOx56iz+Lu2ANhUmk08H9xc5kPme1ALTVV+V/o5SvZEYIPmB6m7q/9oIEKvXjHJbrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a347f83b2cc5e4afb12a8c1e4bd06bd7df7ad8c0d563f1427f1e36af54e7fe72","last_reissued_at":"2026-07-05T11:05:48.713540Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:48.713540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Distortion for Tournament Voting and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kangning Wang, Moses Charikar, Prasanna Ramakrishnan, Zihan Tan","submitted_at":"2025-05-19T18:06:52Z","abstract_excerpt":"In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters. However, the voting rule has limited information about the distances in the metric, such as each voter's ordinal rankings of the candidates in order of distances. The central question is whether we can design rules that, for any election and underlying metric space, select a candidate whose total cost deviates from the optimal by only a small factor, referr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13630","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/2505.13630/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":"2505.13630","created_at":"2026-07-05T11:05:48.713592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13630v1","created_at":"2026-07-05T11:05:48.713592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13630","created_at":"2026-07-05T11:05:48.713592+00:00"},{"alias_kind":"pith_short_12","alias_value":"UND7QOZMYXSK","created_at":"2026-07-05T11:05:48.713592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UND7QOZMYXSK7MJK","created_at":"2026-07-05T11:05:48.713592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UND7QOZM","created_at":"2026-07-05T11:05:48.713592+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/UND7QOZMYXSK7MJKRQPEXUDL27","json":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27.json","graph_json":"https://pith.science/api/pith-number/UND7QOZMYXSK7MJKRQPEXUDL27/graph.json","events_json":"https://pith.science/api/pith-number/UND7QOZMYXSK7MJKRQPEXUDL27/events.json","paper":"https://pith.science/paper/UND7QOZM"},"agent_actions":{"view_html":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27","download_json":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27.json","view_paper":"https://pith.science/paper/UND7QOZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13630&json=true","fetch_graph":"https://pith.science/api/pith-number/UND7QOZMYXSK7MJKRQPEXUDL27/graph.json","fetch_events":"https://pith.science/api/pith-number/UND7QOZMYXSK7MJKRQPEXUDL27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27/action/storage_attestation","attest_author":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27/action/author_attestation","sign_citation":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27/action/citation_signature","submit_replication":"https://pith.science/pith/UND7QOZMYXSK7MJKRQPEXUDL27/action/replication_record"}},"created_at":"2026-07-05T11:05:48.713592+00:00","updated_at":"2026-07-05T11:05:48.713592+00:00"}