{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KZIMIZB735RPPJRONFE57OUTCM","short_pith_number":"pith:KZIMIZB7","schema_version":"1.0","canonical_sha256":"5650c4643fdf62f7a62e6949dfba93130afbaad72c1c4a73a2e0d16fa71c66b3","source":{"kind":"arxiv","id":"2408.13630","version":2},"attestation_state":"computed","paper":{"title":"DeepVoting: Learning and Fine-Tuning Voting Rules with Canonical Embeddings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.LG","econ.GN","q-fin.EC"],"primary_cat":"cs.MA","authors_text":"Avinash Balakrishnan, Ben Abramowitz, Ben Armstrong, Leonardo Matone, Nicholas Mattei","submitted_at":"2024-08-24T17:15:20Z","abstract_excerpt":"Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice Theory has shown, the problem of designing aggregation rules with specific sets of properties (axioms) can be difficult, or provably impossible in some cases. Instead of designing algorithms by hand, one can learn aggregation rules, particularly voting rules, from data. However, prior work in this area has required extremely large models or been limited by "},"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":"2408.13630","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MA","submitted_at":"2024-08-24T17:15:20Z","cross_cats_sorted":["cs.AI","cs.GT","cs.LG","econ.GN","q-fin.EC"],"title_canon_sha256":"0572a7dfeba8e2622cd47e4538c6bf88b0ff9639277a4e8044eb51406cfe3059","abstract_canon_sha256":"7bc0102107d648f7af194013c1ed764d6e287063e9d9bc242d605ea4b5c934e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:10.437421Z","signature_b64":"w89bNhVmhTmKce8mgslWqCZ6Y7Ov7ZRtlyOr2r7rzdu4gvfcGn2bPzK+7yw57Jc1IQ0DvDRrrv1QtQyaH8IIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5650c4643fdf62f7a62e6949dfba93130afbaad72c1c4a73a2e0d16fa71c66b3","last_reissued_at":"2026-07-05T12:09:10.436633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:10.436633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepVoting: Learning and Fine-Tuning Voting Rules with Canonical Embeddings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.GT","cs.LG","econ.GN","q-fin.EC"],"primary_cat":"cs.MA","authors_text":"Avinash Balakrishnan, Ben Abramowitz, Ben Armstrong, Leonardo Matone, Nicholas Mattei","submitted_at":"2024-08-24T17:15:20Z","abstract_excerpt":"Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice Theory has shown, the problem of designing aggregation rules with specific sets of properties (axioms) can be difficult, or provably impossible in some cases. Instead of designing algorithms by hand, one can learn aggregation rules, particularly voting rules, from data. However, prior work in this area has required extremely large models or been limited by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.13630","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.13630/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.13630","created_at":"2026-07-05T12:09:10.436695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.13630v2","created_at":"2026-07-05T12:09:10.436695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.13630","created_at":"2026-07-05T12:09:10.436695+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZIMIZB735RP","created_at":"2026-07-05T12:09:10.436695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZIMIZB735RPPJRO","created_at":"2026-07-05T12:09:10.436695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZIMIZB7","created_at":"2026-07-05T12:09:10.436695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06454","citing_title":"What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM","json":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM.json","graph_json":"https://pith.science/api/pith-number/KZIMIZB735RPPJRONFE57OUTCM/graph.json","events_json":"https://pith.science/api/pith-number/KZIMIZB735RPPJRONFE57OUTCM/events.json","paper":"https://pith.science/paper/KZIMIZB7"},"agent_actions":{"view_html":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM","download_json":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM.json","view_paper":"https://pith.science/paper/KZIMIZB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.13630&json=true","fetch_graph":"https://pith.science/api/pith-number/KZIMIZB735RPPJRONFE57OUTCM/graph.json","fetch_events":"https://pith.science/api/pith-number/KZIMIZB735RPPJRONFE57OUTCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM/action/storage_attestation","attest_author":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM/action/author_attestation","sign_citation":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM/action/citation_signature","submit_replication":"https://pith.science/pith/KZIMIZB735RPPJRONFE57OUTCM/action/replication_record"}},"created_at":"2026-07-05T12:09:10.436695+00:00","updated_at":"2026-07-05T12:09:10.436695+00:00"}