{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5FY7E55JPEKG6WX3PQ6VIO2PZO","short_pith_number":"pith:5FY7E55J","schema_version":"1.0","canonical_sha256":"e971f277a979146f5afb7c3d543b4fcbb757315abc25cf567d8efaec494f578b","source":{"kind":"arxiv","id":"2508.16177","version":2},"attestation_state":"computed","paper":{"title":"Proportional Representation in Rank Aggregation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Patrick Lederer","submitted_at":"2025-08-22T07:55:05Z","abstract_excerpt":"In rank aggregation, the task is to aggregate multiple weighted input rankings into a single output ranking. While numerous methods, so-called social welfare functions (SWFs), have been suggested for this problem, all of the classical SWFs tend to be majoritarian and are thus not acceptable when a proportional ranking is required. Motivated by this observation, we design SWFs that guarantee that every input ranking is proportionally represented by the output ranking. Specifically, our central fairness condition requires that the number of pairwise comparisons between candidates on which an inp"},"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":"2508.16177","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-22T07:55:05Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"cfd6a3fa6dfd1b3b1abd34e76749c8ba64dc3ec344fdb6de8dbe57a425c962a8","abstract_canon_sha256":"e8fed8d3df1c2ed694c9a4aec730abea56547a416468bab579a31c9b5075a2fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:04.100048Z","signature_b64":"jlu8uD49ED+2Zs1Oed4zsvHFWHEh5DJycOa/dGLYKQQ84FHxp2cG1DD/gXidIy/SNwb/eM+mAhLloHZDUE7hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e971f277a979146f5afb7c3d543b4fcbb757315abc25cf567d8efaec494f578b","last_reissued_at":"2026-06-19T16:12:04.099558Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:04.099558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proportional Representation in Rank Aggregation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Patrick Lederer","submitted_at":"2025-08-22T07:55:05Z","abstract_excerpt":"In rank aggregation, the task is to aggregate multiple weighted input rankings into a single output ranking. While numerous methods, so-called social welfare functions (SWFs), have been suggested for this problem, all of the classical SWFs tend to be majoritarian and are thus not acceptable when a proportional ranking is required. Motivated by this observation, we design SWFs that guarantee that every input ranking is proportionally represented by the output ranking. Specifically, our central fairness condition requires that the number of pairwise comparisons between candidates on which an inp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16177","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/2508.16177/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":"2508.16177","created_at":"2026-06-19T16:12:04.099614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16177v2","created_at":"2026-06-19T16:12:04.099614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16177","created_at":"2026-06-19T16:12:04.099614+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FY7E55JPEKG","created_at":"2026-06-19T16:12:04.099614+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FY7E55JPEKG6WX3","created_at":"2026-06-19T16:12:04.099614+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FY7E55J","created_at":"2026-06-19T16:12:04.099614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.12717","citing_title":"The End Justifies the Mean: A Linear Ranking Rule for Proportional Sequential Decisions","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04612","citing_title":"An Axiomatic Analysis of Proportionality Notions in Approval-Based Multiwinner Voting","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01525","citing_title":"Computational Challenges in Scaling Democratic Deliberation","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO","json":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO.json","graph_json":"https://pith.science/api/pith-number/5FY7E55JPEKG6WX3PQ6VIO2PZO/graph.json","events_json":"https://pith.science/api/pith-number/5FY7E55JPEKG6WX3PQ6VIO2PZO/events.json","paper":"https://pith.science/paper/5FY7E55J"},"agent_actions":{"view_html":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO","download_json":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO.json","view_paper":"https://pith.science/paper/5FY7E55J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16177&json=true","fetch_graph":"https://pith.science/api/pith-number/5FY7E55JPEKG6WX3PQ6VIO2PZO/graph.json","fetch_events":"https://pith.science/api/pith-number/5FY7E55JPEKG6WX3PQ6VIO2PZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO/action/storage_attestation","attest_author":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO/action/author_attestation","sign_citation":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO/action/citation_signature","submit_replication":"https://pith.science/pith/5FY7E55JPEKG6WX3PQ6VIO2PZO/action/replication_record"}},"created_at":"2026-06-19T16:12:04.099614+00:00","updated_at":"2026-06-19T16:12:04.099614+00:00"}