{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TJEJDKTK76SG2TBFJNPLBAQY2A","short_pith_number":"pith:TJEJDKTK","schema_version":"1.0","canonical_sha256":"9a4891aa6affa46d4c254b5eb08218d036b937c02e66dab786eb57111a3f1f3b","source":{"kind":"arxiv","id":"1707.05619","version":1},"attestation_state":"computed","paper":{"title":"Gibbard-Satterthwaite Games for k-Approval Voting Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arkadii Slinko, Daniel Hughes, Francesca Rossi, Umberto Grandi","submitted_at":"2017-07-18T14:02:16Z","abstract_excerpt":"The Gibbard-Satterthwaite theorem implies the existence of voters, called manipulators, who can change the election outcome in their favour by voting strategically. When a given preference profile admits several such manipulators, voting becomes a game played by these voters, who have to reason strategically about each others' actions. To complicate the game even further, counter-manipulators may then try to counteract the actions of manipulators. Our voters are boundedly rational and do not think beyond manipulating or countermanipulating. We call these games Gibbard--Satterthwaite Games. In "},"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":"1707.05619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-18T14:02:16Z","cross_cats_sorted":[],"title_canon_sha256":"0ae6beb38f47dc4a9a5ee4f04d33de7781989f147dcfa339685c6a7f314548fc","abstract_canon_sha256":"73a72a746aa9a8909ae0f0bfcb8dac42c0638dbf2b362143fff78ca11e457e5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:01.899000Z","signature_b64":"Wl6hO2LTzpHwXaQ5GwigOCOLfUSjx3ihl8bSkggGoGZE387MRRPfNgxwO22Fqra//F5NnQ7KByCNvVPHXMxPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a4891aa6affa46d4c254b5eb08218d036b937c02e66dab786eb57111a3f1f3b","last_reissued_at":"2026-05-18T00:40:01.898457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:01.898457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gibbard-Satterthwaite Games for k-Approval Voting Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arkadii Slinko, Daniel Hughes, Francesca Rossi, Umberto Grandi","submitted_at":"2017-07-18T14:02:16Z","abstract_excerpt":"The Gibbard-Satterthwaite theorem implies the existence of voters, called manipulators, who can change the election outcome in their favour by voting strategically. When a given preference profile admits several such manipulators, voting becomes a game played by these voters, who have to reason strategically about each others' actions. To complicate the game even further, counter-manipulators may then try to counteract the actions of manipulators. Our voters are boundedly rational and do not think beyond manipulating or countermanipulating. We call these games Gibbard--Satterthwaite Games. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05619","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":"1707.05619","created_at":"2026-05-18T00:40:01.898525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05619v1","created_at":"2026-05-18T00:40:01.898525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05619","created_at":"2026-05-18T00:40:01.898525+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJEJDKTK76SG","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJEJDKTK76SG2TBF","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJEJDKTK","created_at":"2026-05-18T12:31:46.661854+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/TJEJDKTK76SG2TBFJNPLBAQY2A","json":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A.json","graph_json":"https://pith.science/api/pith-number/TJEJDKTK76SG2TBFJNPLBAQY2A/graph.json","events_json":"https://pith.science/api/pith-number/TJEJDKTK76SG2TBFJNPLBAQY2A/events.json","paper":"https://pith.science/paper/TJEJDKTK"},"agent_actions":{"view_html":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A","download_json":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A.json","view_paper":"https://pith.science/paper/TJEJDKTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05619&json=true","fetch_graph":"https://pith.science/api/pith-number/TJEJDKTK76SG2TBFJNPLBAQY2A/graph.json","fetch_events":"https://pith.science/api/pith-number/TJEJDKTK76SG2TBFJNPLBAQY2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A/action/storage_attestation","attest_author":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A/action/author_attestation","sign_citation":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A/action/citation_signature","submit_replication":"https://pith.science/pith/TJEJDKTK76SG2TBFJNPLBAQY2A/action/replication_record"}},"created_at":"2026-05-18T00:40:01.898525+00:00","updated_at":"2026-05-18T00:40:01.898525+00:00"}