{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MPCVR5ONYYJKEWC54TVBLYQYYH","short_pith_number":"pith:MPCVR5ON","schema_version":"1.0","canonical_sha256":"63c558f5cdc612a2585de4ea15e218c1f6388d76eb9ee7d9c750467f280cbac8","source":{"kind":"arxiv","id":"1605.09733","version":1},"attestation_state":"computed","paper":{"title":"Condorcet-Consistent and Approximately Strategyproof Tournament Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel Schvartzman, Jon Schneider, S. Matthew Weinberg","submitted_at":"2016-05-31T17:25:30Z","abstract_excerpt":"We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\\binom{n}{2}$ pairwise matches (called a tournament, $T$) to a distribution over winners. Rule $r$ is Condorcet-consistent if whenever $i$ wins all $n-1$ of her matches, $r$ selects $i$ with probability $1$.\n  We consider strategic manipulation of tournaments where player $j$ might throw their match to player $i$ in order to increase the likelihood that one of them wins the tournament. Regar"},"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":"1605.09733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-31T17:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"1cbda878490d4167208b06fcffead875159119711957f642632bb927f75b156d","abstract_canon_sha256":"f9610ede801f2c0251d034b52666bd032187bc5694c9b2aaeb17bacf065cc5fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.260455Z","signature_b64":"KbbVh9Vyb1GYLkHxJ/drBJOzACHRwzJhfAV9QKLfZp2V7eCN6ZwAvatmYJZrpVdnsjAfRDsEe7ApZAfRbY8mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c558f5cdc612a2585de4ea15e218c1f6388d76eb9ee7d9c750467f280cbac8","last_reissued_at":"2026-05-18T01:13:10.259901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.259901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Condorcet-Consistent and Approximately Strategyproof Tournament Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel Schvartzman, Jon Schneider, S. Matthew Weinberg","submitted_at":"2016-05-31T17:25:30Z","abstract_excerpt":"We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\\binom{n}{2}$ pairwise matches (called a tournament, $T$) to a distribution over winners. Rule $r$ is Condorcet-consistent if whenever $i$ wins all $n-1$ of her matches, $r$ selects $i$ with probability $1$.\n  We consider strategic manipulation of tournaments where player $j$ might throw their match to player $i$ in order to increase the likelihood that one of them wins the tournament. Regar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09733","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":"1605.09733","created_at":"2026-05-18T01:13:10.259977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09733v1","created_at":"2026-05-18T01:13:10.259977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09733","created_at":"2026-05-18T01:13:10.259977+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPCVR5ONYYJK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPCVR5ONYYJKEWC5","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPCVR5ON","created_at":"2026-05-18T12:30:32.724797+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/MPCVR5ONYYJKEWC54TVBLYQYYH","json":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH.json","graph_json":"https://pith.science/api/pith-number/MPCVR5ONYYJKEWC54TVBLYQYYH/graph.json","events_json":"https://pith.science/api/pith-number/MPCVR5ONYYJKEWC54TVBLYQYYH/events.json","paper":"https://pith.science/paper/MPCVR5ON"},"agent_actions":{"view_html":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH","download_json":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH.json","view_paper":"https://pith.science/paper/MPCVR5ON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09733&json=true","fetch_graph":"https://pith.science/api/pith-number/MPCVR5ONYYJKEWC54TVBLYQYYH/graph.json","fetch_events":"https://pith.science/api/pith-number/MPCVR5ONYYJKEWC54TVBLYQYYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH/action/storage_attestation","attest_author":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH/action/author_attestation","sign_citation":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH/action/citation_signature","submit_replication":"https://pith.science/pith/MPCVR5ONYYJKEWC54TVBLYQYYH/action/replication_record"}},"created_at":"2026-05-18T01:13:10.259977+00:00","updated_at":"2026-05-18T01:13:10.259977+00:00"}