{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TCNSXX7J6AH43MYJRNFFKDVH27","short_pith_number":"pith:TCNSXX7J","schema_version":"1.0","canonical_sha256":"989b2bdfe9f00fcdb3098b4a550ea7d7d506fa6e3cc05bc2730531628d80e28a","source":{"kind":"arxiv","id":"2510.01499","version":2},"attestation_state":"computed","paper":{"title":"Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Haifeng Xu, Milind Tambe, Rui Ai, Yuqi Pan","submitted_at":"2025-10-01T22:21:50Z","abstract_excerpt":"With the rapid progress of multi-agent large language model (LLM) reasoning, how to effectively aggregate answers from multiple LLMs has emerged as a fundamental challenge. Standard majority voting treats all answers equally, failing to consider latent heterogeneity and correlation across models. In this work, we design two new aggregation algorithms called Optimal Weight (OW) and Inverse Surprising Popularity (ISP), leveraging both first-order and second-order information. Our theoretical analysis shows these methods provably mitigate inherent limitations of majority voting under mild assumpt"},"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":"2510.01499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-10-01T22:21:50Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"77aff9da86fdc9a96f3d8aafe14c3028bef13dab25ba0f7513c49334ff2daf3f","abstract_canon_sha256":"69065a567a4e6d5feb61e4701a13a7e1a66fc57f56a688d539f8b82c6d0fb6bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:59.052297Z","signature_b64":"hPxfSl7C/LjG5h9YH+2NJcPlI4OG7yk0s41VNiSphEioJOak0byTrACWl0nfKrwYURekE6VYy3fy+sRJ7wy/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"989b2bdfe9f00fcdb3098b4a550ea7d7d506fa6e3cc05bc2730531628d80e28a","last_reissued_at":"2026-05-20T01:04:59.051454Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:59.051454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Majority Voting: LLM Aggregation by Leveraging Higher-Order Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Haifeng Xu, Milind Tambe, Rui Ai, Yuqi Pan","submitted_at":"2025-10-01T22:21:50Z","abstract_excerpt":"With the rapid progress of multi-agent large language model (LLM) reasoning, how to effectively aggregate answers from multiple LLMs has emerged as a fundamental challenge. Standard majority voting treats all answers equally, failing to consider latent heterogeneity and correlation across models. In this work, we design two new aggregation algorithms called Optimal Weight (OW) and Inverse Surprising Popularity (ISP), leveraging both first-order and second-order information. Our theoretical analysis shows these methods provably mitigate inherent limitations of majority voting under mild assumpt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.01499","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/2510.01499/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":"2510.01499","created_at":"2026-05-20T01:04:59.051586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.01499v2","created_at":"2026-05-20T01:04:59.051586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.01499","created_at":"2026-05-20T01:04:59.051586+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCNSXX7J6AH4","created_at":"2026-05-20T01:04:59.051586+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCNSXX7J6AH43MYJ","created_at":"2026-05-20T01:04:59.051586+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCNSXX7J","created_at":"2026-05-20T01:04:59.051586+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.29270","citing_title":"Minority Sentinel: When to Overturn Majority Voting in Multi-Agent LLM Debates","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09588","citing_title":"Efficient Ensemble Selection from Binary and Pairwise Feedback","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24517","citing_title":"Prior-Agnostic Robust Forecast Aggregation","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27","json":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27.json","graph_json":"https://pith.science/api/pith-number/TCNSXX7J6AH43MYJRNFFKDVH27/graph.json","events_json":"https://pith.science/api/pith-number/TCNSXX7J6AH43MYJRNFFKDVH27/events.json","paper":"https://pith.science/paper/TCNSXX7J"},"agent_actions":{"view_html":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27","download_json":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27.json","view_paper":"https://pith.science/paper/TCNSXX7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.01499&json=true","fetch_graph":"https://pith.science/api/pith-number/TCNSXX7J6AH43MYJRNFFKDVH27/graph.json","fetch_events":"https://pith.science/api/pith-number/TCNSXX7J6AH43MYJRNFFKDVH27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27/action/storage_attestation","attest_author":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27/action/author_attestation","sign_citation":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27/action/citation_signature","submit_replication":"https://pith.science/pith/TCNSXX7J6AH43MYJRNFFKDVH27/action/replication_record"}},"created_at":"2026-05-20T01:04:59.051586+00:00","updated_at":"2026-05-20T01:04:59.051586+00:00"}