{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LE2FJ2RHVS6TDQ3YFDUVKIN4DJ","short_pith_number":"pith:LE2FJ2RH","schema_version":"1.0","canonical_sha256":"593454ea27acbd31c37828e95521bc1a7d0dcd67669161b13d4a83f1c856c20c","source":{"kind":"arxiv","id":"2404.08474","version":1},"attestation_state":"computed","paper":{"title":"The Squared Kemeny Rule for Averaging Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Dominik Peters, Patrick Lederer, Tomasz W\\k{a}s","submitted_at":"2024-04-12T13:48:35Z","abstract_excerpt":"For the problem of aggregating several rankings into one ranking, Kemeny (1959) proposed two methods: the median rule which selects the ranking with the smallest total swap distance to the input rankings, and the mean rule which minimizes the squared swap distances to the input rankings. The median rule has been extensively studied since and is now known simply as Kemeny's rule. It exhibits majoritarian properties, so for example if more than half of the input rankings are the same, then the output of the rule is the same ranking.\n  We observe that this behavior is undesirable in many rank agg"},"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":"2404.08474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-04-12T13:48:35Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"f671880e0cbc3538cf179339b981a0fdee3a4217546b3752626979e55dc7ba74","abstract_canon_sha256":"50f8b26f4aa82f4353cdd8886bbbda441664ffc466529a2d2c1a3997a7a2c234"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:22.438069Z","signature_b64":"mNnZx5Q+wcHByMD7TdS182qmpcdRNkJLr9yDy7/ONlwYrhnceOsJ1reKwoMx1q9OdcJ/OPNq3YqkN2jJ9r+EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"593454ea27acbd31c37828e95521bc1a7d0dcd67669161b13d4a83f1c856c20c","last_reissued_at":"2026-07-05T08:07:22.437693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:22.437693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Squared Kemeny Rule for Averaging Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Dominik Peters, Patrick Lederer, Tomasz W\\k{a}s","submitted_at":"2024-04-12T13:48:35Z","abstract_excerpt":"For the problem of aggregating several rankings into one ranking, Kemeny (1959) proposed two methods: the median rule which selects the ranking with the smallest total swap distance to the input rankings, and the mean rule which minimizes the squared swap distances to the input rankings. The median rule has been extensively studied since and is now known simply as Kemeny's rule. It exhibits majoritarian properties, so for example if more than half of the input rankings are the same, then the output of the rule is the same ranking.\n  We observe that this behavior is undesirable in many rank agg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08474","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.08474/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":"2404.08474","created_at":"2026-07-05T08:07:22.437750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08474v1","created_at":"2026-07-05T08:07:22.437750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08474","created_at":"2026-07-05T08:07:22.437750+00:00"},{"alias_kind":"pith_short_12","alias_value":"LE2FJ2RHVS6T","created_at":"2026-07-05T08:07:22.437750+00:00"},{"alias_kind":"pith_short_16","alias_value":"LE2FJ2RHVS6TDQ3Y","created_at":"2026-07-05T08:07:22.437750+00:00"},{"alias_kind":"pith_short_8","alias_value":"LE2FJ2RH","created_at":"2026-07-05T08:07:22.437750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12717","citing_title":"The End Justifies the Mean: A Linear Ranking Rule for Proportional Sequential Decisions","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02379","citing_title":"Fair Agents: Balancing Multistakeholder Alignment in Multi-Agent Personalization Systems","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ","json":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ.json","graph_json":"https://pith.science/api/pith-number/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/graph.json","events_json":"https://pith.science/api/pith-number/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/events.json","paper":"https://pith.science/paper/LE2FJ2RH"},"agent_actions":{"view_html":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ","download_json":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ.json","view_paper":"https://pith.science/paper/LE2FJ2RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08474&json=true","fetch_graph":"https://pith.science/api/pith-number/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/action/storage_attestation","attest_author":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/action/author_attestation","sign_citation":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/action/citation_signature","submit_replication":"https://pith.science/pith/LE2FJ2RHVS6TDQ3YFDUVKIN4DJ/action/replication_record"}},"created_at":"2026-07-05T08:07:22.437750+00:00","updated_at":"2026-07-05T08:07:22.437750+00:00"}