{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:55ETZVCY3DJ223VESRVVVHIR6S","short_pith_number":"pith:55ETZVCY","schema_version":"1.0","canonical_sha256":"ef493cd458d8d3ad6ea4946b5a9d11f4af87d98e1d0854d691a253358ded5917","source":{"kind":"arxiv","id":"1604.05692","version":4},"attestation_state":"computed","paper":{"title":"Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.GT","authors_text":"Christian Geist, Felix Brandt, Florian Brandl, Manuel Eberl","submitted_at":"2016-04-19T19:01:55Z","abstract_excerpt":"Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable. In this paper, we provide a computer-aided proof of a sweeping impossibility using these two conditions for randomized aggregation mechanisms. More precisely, we show that every efficient aggregation mechanism can be manipulated for all expected utility representations of the agents' preferences. This settles an open problem and strengthens a number of existing theorems, including statements that were shown"},"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":"1604.05692","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-19T19:01:55Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"18b2e82b5a400f6eb4bbce720f22ffad5747e7a25d753cf0acaac538e5d565fd","abstract_canon_sha256":"66075ee37b65bce24a3e06ee80c33b36e6825eb72a4d5cd26e14de385fc70b62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:55.711311Z","signature_b64":"Gsz2joyIZ1DIdWZbcxZ18Q6tOLyyctYaX1ipuWRfxFD+Dh+u/88/5JpOGZodH038FTUQQKJhQpP9cvjI2uA0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef493cd458d8d3ad6ea4946b5a9d11f4af87d98e1d0854d691a253358ded5917","last_reissued_at":"2026-05-18T00:35:55.710970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:55.710970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.GT","authors_text":"Christian Geist, Felix Brandt, Florian Brandl, Manuel Eberl","submitted_at":"2016-04-19T19:01:55Z","abstract_excerpt":"Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable. In this paper, we provide a computer-aided proof of a sweeping impossibility using these two conditions for randomized aggregation mechanisms. More precisely, we show that every efficient aggregation mechanism can be manipulated for all expected utility representations of the agents' preferences. This settles an open problem and strengthens a number of existing theorems, including statements that were shown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05692","kind":"arxiv","version":4},"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":"1604.05692","created_at":"2026-05-18T00:35:55.711023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05692v4","created_at":"2026-05-18T00:35:55.711023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05692","created_at":"2026-05-18T00:35:55.711023+00:00"},{"alias_kind":"pith_short_12","alias_value":"55ETZVCY3DJ2","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"55ETZVCY3DJ223VE","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"55ETZVCY","created_at":"2026-05-18T12:29:58.707656+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/55ETZVCY3DJ223VESRVVVHIR6S","json":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S.json","graph_json":"https://pith.science/api/pith-number/55ETZVCY3DJ223VESRVVVHIR6S/graph.json","events_json":"https://pith.science/api/pith-number/55ETZVCY3DJ223VESRVVVHIR6S/events.json","paper":"https://pith.science/paper/55ETZVCY"},"agent_actions":{"view_html":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S","download_json":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S.json","view_paper":"https://pith.science/paper/55ETZVCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05692&json=true","fetch_graph":"https://pith.science/api/pith-number/55ETZVCY3DJ223VESRVVVHIR6S/graph.json","fetch_events":"https://pith.science/api/pith-number/55ETZVCY3DJ223VESRVVVHIR6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S/action/storage_attestation","attest_author":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S/action/author_attestation","sign_citation":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S/action/citation_signature","submit_replication":"https://pith.science/pith/55ETZVCY3DJ223VESRVVVHIR6S/action/replication_record"}},"created_at":"2026-05-18T00:35:55.711023+00:00","updated_at":"2026-05-18T00:35:55.711023+00:00"}