{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P4BSVUUJBH4HECCZYOP4EWTS52","short_pith_number":"pith:P4BSVUUJ","schema_version":"1.0","canonical_sha256":"7f032ad28909f8720859c39fc25a72ee8ad366168fda34e51782efd0be72f9d6","source":{"kind":"arxiv","id":"1110.5888","version":2},"attestation_state":"computed","paper":{"title":"A quantitative Gibbard-Satterthwaite theorem without neutrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.PR"],"primary_cat":"math.CO","authors_text":"Elchanan Mossel, Miklos Z. Racz","submitted_at":"2011-10-26T19:29:12Z","abstract_excerpt":"Recently, quantitative versions of the Gibbard-Satterthwaite theorem were proven for $k=3$ alternatives by Friedgut, Kalai, Keller and Nisan and for neutral functions on $k \\geq 4$ alternatives by Isaksson, Kindler and Mossel.\n  We prove a quantitative version of the Gibbard-Satterthwaite theorem for general social choice functions for any number $k \\geq 3$ of alternatives. In particular we show that for a social choice function $f$ on $k \\geq 3$ alternatives and $n$ voters, which is $\\epsilon$-far from the family of nonmanipulable functions, a uniformly chosen voter profile is manipulable wit"},"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":"1110.5888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T19:29:12Z","cross_cats_sorted":["cs.GT","math.PR"],"title_canon_sha256":"13b3a4d164ba916f1e53083ea6fa0c6b4cc7a190df476bf68338f26570fa50f5","abstract_canon_sha256":"7aa2e2360495e2f51d4c3b4ea60623db87489b9ee5670375ba39ec6071f81796"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:03.044255Z","signature_b64":"D8sOMQkz+3upFcLpTyjj6Ejz0cThzNgfPuE+zVQ9p0gkk7H1w3jlB7st72mbSZLkqYCfa7OT3DSwcVNdU2NeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f032ad28909f8720859c39fc25a72ee8ad366168fda34e51782efd0be72f9d6","last_reissued_at":"2026-05-18T03:59:03.043295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:03.043295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantitative Gibbard-Satterthwaite theorem without neutrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.PR"],"primary_cat":"math.CO","authors_text":"Elchanan Mossel, Miklos Z. Racz","submitted_at":"2011-10-26T19:29:12Z","abstract_excerpt":"Recently, quantitative versions of the Gibbard-Satterthwaite theorem were proven for $k=3$ alternatives by Friedgut, Kalai, Keller and Nisan and for neutral functions on $k \\geq 4$ alternatives by Isaksson, Kindler and Mossel.\n  We prove a quantitative version of the Gibbard-Satterthwaite theorem for general social choice functions for any number $k \\geq 3$ of alternatives. In particular we show that for a social choice function $f$ on $k \\geq 3$ alternatives and $n$ voters, which is $\\epsilon$-far from the family of nonmanipulable functions, a uniformly chosen voter profile is manipulable wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5888","kind":"arxiv","version":2},"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":"1110.5888","created_at":"2026-05-18T03:59:03.043507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5888v2","created_at":"2026-05-18T03:59:03.043507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5888","created_at":"2026-05-18T03:59:03.043507+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4BSVUUJBH4H","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4BSVUUJBH4HECCZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4BSVUUJ","created_at":"2026-05-18T12:26:39.201973+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/P4BSVUUJBH4HECCZYOP4EWTS52","json":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52.json","graph_json":"https://pith.science/api/pith-number/P4BSVUUJBH4HECCZYOP4EWTS52/graph.json","events_json":"https://pith.science/api/pith-number/P4BSVUUJBH4HECCZYOP4EWTS52/events.json","paper":"https://pith.science/paper/P4BSVUUJ"},"agent_actions":{"view_html":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52","download_json":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52.json","view_paper":"https://pith.science/paper/P4BSVUUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5888&json=true","fetch_graph":"https://pith.science/api/pith-number/P4BSVUUJBH4HECCZYOP4EWTS52/graph.json","fetch_events":"https://pith.science/api/pith-number/P4BSVUUJBH4HECCZYOP4EWTS52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52/action/storage_attestation","attest_author":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52/action/author_attestation","sign_citation":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52/action/citation_signature","submit_replication":"https://pith.science/pith/P4BSVUUJBH4HECCZYOP4EWTS52/action/replication_record"}},"created_at":"2026-05-18T03:59:03.043507+00:00","updated_at":"2026-05-18T03:59:03.043507+00:00"}