{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PQX4GKVCMINBLTXO2Y42HFYULL","short_pith_number":"pith:PQX4GKVC","schema_version":"1.0","canonical_sha256":"7c2fc32aa2621a15ceeed639a397145ac9bfd76fa9ed9ed03c1747c1760984cf","source":{"kind":"arxiv","id":"1207.1368","version":1},"attestation_state":"computed","paper":{"title":"Common Voting Rules as Maximum Likelihood Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Tuomas Sandholm, Vincent Conitzer","submitted_at":"2012-07-04T16:05:23Z","abstract_excerpt":"Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a 'correct' outcome (winner/ranking), and each voter's vote corresponds to a noisy perception of this correct outcome. If we are given the noise model, then for any vector of votes, we can"},"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":"1207.1368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:05:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8959c6e251443202d8d94dc5f8bae1d5888069260f1317ce826ac5c6ac2b4091","abstract_canon_sha256":"61f6721812fdab849eabdea4e23ae81e32f3085df5c2a9afabf7640a3e1b2499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.612290Z","signature_b64":"+FJQyjMgWIuKsTHGHvcln0yhNIOX/vDp9QLsmmRxZV5XrKhUYGO4nxHGVMWfcFmw4hmuwoLLHT8lspif0LkcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c2fc32aa2621a15ceeed639a397145ac9bfd76fa9ed9ed03c1747c1760984cf","last_reissued_at":"2026-05-18T03:51:37.611809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.611809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Common Voting Rules as Maximum Likelihood Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Tuomas Sandholm, Vincent Conitzer","submitted_at":"2012-07-04T16:05:23Z","abstract_excerpt":"Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the alternatives. One potential view of voting is the following. There exists a 'correct' outcome (winner/ranking), and each voter's vote corresponds to a noisy perception of this correct outcome. If we are given the noise model, then for any vector of votes, we can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1368","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":"1207.1368","created_at":"2026-05-18T03:51:37.611868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1368v1","created_at":"2026-05-18T03:51:37.611868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1368","created_at":"2026-05-18T03:51:37.611868+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQX4GKVCMINB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQX4GKVCMINBLTXO","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQX4GKVC","created_at":"2026-05-18T12:27:18.751474+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/PQX4GKVCMINBLTXO2Y42HFYULL","json":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL.json","graph_json":"https://pith.science/api/pith-number/PQX4GKVCMINBLTXO2Y42HFYULL/graph.json","events_json":"https://pith.science/api/pith-number/PQX4GKVCMINBLTXO2Y42HFYULL/events.json","paper":"https://pith.science/paper/PQX4GKVC"},"agent_actions":{"view_html":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL","download_json":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL.json","view_paper":"https://pith.science/paper/PQX4GKVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1368&json=true","fetch_graph":"https://pith.science/api/pith-number/PQX4GKVCMINBLTXO2Y42HFYULL/graph.json","fetch_events":"https://pith.science/api/pith-number/PQX4GKVCMINBLTXO2Y42HFYULL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL/action/storage_attestation","attest_author":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL/action/author_attestation","sign_citation":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL/action/citation_signature","submit_replication":"https://pith.science/pith/PQX4GKVCMINBLTXO2Y42HFYULL/action/replication_record"}},"created_at":"2026-05-18T03:51:37.611868+00:00","updated_at":"2026-05-18T03:51:37.611868+00:00"}