{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O2QLVQRLWVUBWI4OWZZSZCK35Q","short_pith_number":"pith:O2QLVQRL","schema_version":"1.0","canonical_sha256":"76a0bac22bb5681b238eb6732c895bec046de45408aedc6d039e9367a576d24e","source":{"kind":"arxiv","id":"2607.25540","version":1},"attestation_state":"computed","paper":{"title":"Kemeny Rank Aggregation is NP-Hard for Three Voters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Dominik Peters","submitted_at":"2026-07-28T10:20:56Z","abstract_excerpt":"Rank aggregation is the task of combining $n$ input rankings (linear orders) of alternatives into a single output ranking. The Kemeny rank aggregation rule selects the output ranking that minimizes the total Kendall-tau distance to the input rankings, i.e., the total number of adjacent swaps that need to be performed across input rankings so that they are all equal to the output ranking. Dwork et al. (2001) proved that the problem of computing such a ranking is NP-complete for every even $n \\ge 4$ and asked whether hardness holds even for $n = 3$. We give a hardness reduction from MAX CUT that"},"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":"2607.25540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-28T10:20:56Z","cross_cats_sorted":[],"title_canon_sha256":"475bcb8e2db6a32a3e1312b0aa756b08ce0c31c0b9cdbb1f5e062e37080d65cb","abstract_canon_sha256":"08207894bbb514253fdf15d175770d514ef6c53341c7c46ca638015c66a2a262"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:45.722839Z","signature_b64":"E0TAUVbxQAs+M6VbEhegOPzsa2toMotediwytAXjXB97RPDG2lp5Rosnrphmy4W1UbI1zEVeZUPVWFQAnttNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76a0bac22bb5681b238eb6732c895bec046de45408aedc6d039e9367a576d24e","last_reissued_at":"2026-07-29T01:25:45.722011Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:45.722011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kemeny Rank Aggregation is NP-Hard for Three Voters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Dominik Peters","submitted_at":"2026-07-28T10:20:56Z","abstract_excerpt":"Rank aggregation is the task of combining $n$ input rankings (linear orders) of alternatives into a single output ranking. The Kemeny rank aggregation rule selects the output ranking that minimizes the total Kendall-tau distance to the input rankings, i.e., the total number of adjacent swaps that need to be performed across input rankings so that they are all equal to the output ranking. Dwork et al. (2001) proved that the problem of computing such a ranking is NP-complete for every even $n \\ge 4$ and asked whether hardness holds even for $n = 3$. We give a hardness reduction from MAX CUT that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25540","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/2607.25540/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":"2607.25540","created_at":"2026-07-29T01:25:45.722442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25540v1","created_at":"2026-07-29T01:25:45.722442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25540","created_at":"2026-07-29T01:25:45.722442+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2QLVQRLWVUB","created_at":"2026-07-29T01:25:45.722442+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2QLVQRLWVUBWI4O","created_at":"2026-07-29T01:25:45.722442+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2QLVQRL","created_at":"2026-07-29T01:25:45.722442+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/O2QLVQRLWVUBWI4OWZZSZCK35Q","json":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q.json","graph_json":"https://pith.science/api/pith-number/O2QLVQRLWVUBWI4OWZZSZCK35Q/graph.json","events_json":"https://pith.science/api/pith-number/O2QLVQRLWVUBWI4OWZZSZCK35Q/events.json","paper":"https://pith.science/paper/O2QLVQRL"},"agent_actions":{"view_html":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q","download_json":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q.json","view_paper":"https://pith.science/paper/O2QLVQRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25540&json=true","fetch_graph":"https://pith.science/api/pith-number/O2QLVQRLWVUBWI4OWZZSZCK35Q/graph.json","fetch_events":"https://pith.science/api/pith-number/O2QLVQRLWVUBWI4OWZZSZCK35Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q/action/storage_attestation","attest_author":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q/action/author_attestation","sign_citation":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q/action/citation_signature","submit_replication":"https://pith.science/pith/O2QLVQRLWVUBWI4OWZZSZCK35Q/action/replication_record"}},"created_at":"2026-07-29T01:25:45.722442+00:00","updated_at":"2026-07-29T01:25:45.722442+00:00"}