{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IYU2EWPS2OFLRFG7QJSJB632QM","short_pith_number":"pith:IYU2EWPS","schema_version":"1.0","canonical_sha256":"4629a259f2d38ab894df826490fb7a8338adf535289f382e157caacf7fc57da2","source":{"kind":"arxiv","id":"2607.28588","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Kemeny Aggregation with Three Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.GT","authors_text":"P\\'eter Madarasi","submitted_at":"2026-07-30T17:43:05Z","abstract_excerpt":"The Kemeny rule aggregates rankings by minimizing their total Kendall-tau distance from an aggregate order. We prove that Kemeny Score is NP-complete for exactly three unweighted rankings, even when every candidate pair is split $2$-to-$1$. On the same profiles, the winner, unique-winner, and possible- and necessary-precedence problems are $\\Theta_2^p$-complete, while recognizing a Kemeny-optimal or uniquely Kemeny-optimal aggregate is coNP-complete. The hard instances induce tournaments of majority dimension exactly $3$. The reduction also determines the exact maximum-cut value from the optim"},"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.28588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-30T17:43:05Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"7902942b2bebc66fc6648ffad931f598de8d26cca703540375416af6a9cc2e71","abstract_canon_sha256":"640d274db76e4c4749f372b84285a6fc06b62fcdc606644f5e936b5f20156b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4629a259f2d38ab894df826490fb7a8338adf535289f382e157caacf7fc57da2","last_reissued_at":"2026-07-31T01:38:47.430651Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:38:47.430651Z"},"graph_snapshot":{"paper":{"title":"The Complexity of Kemeny Aggregation with Three Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.GT","authors_text":"P\\'eter Madarasi","submitted_at":"2026-07-30T17:43:05Z","abstract_excerpt":"The Kemeny rule aggregates rankings by minimizing their total Kendall-tau distance from an aggregate order. We prove that Kemeny Score is NP-complete for exactly three unweighted rankings, even when every candidate pair is split $2$-to-$1$. On the same profiles, the winner, unique-winner, and possible- and necessary-precedence problems are $\\Theta_2^p$-complete, while recognizing a Kemeny-optimal or uniquely Kemeny-optimal aggregate is coNP-complete. The hard instances induce tournaments of majority dimension exactly $3$. The reduction also determines the exact maximum-cut value from the optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28588","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.28588/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.28588","created_at":"2026-07-31T01:38:47.433966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28588v1","created_at":"2026-07-31T01:38:47.433966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28588","created_at":"2026-07-31T01:38:47.433966+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYU2EWPS2OFL","created_at":"2026-07-31T01:38:47.433966+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYU2EWPS2OFLRFG7","created_at":"2026-07-31T01:38:47.433966+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYU2EWPS","created_at":"2026-07-31T01:38:47.433966+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/IYU2EWPS2OFLRFG7QJSJB632QM","json":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM.json","graph_json":"https://pith.science/api/pith-number/IYU2EWPS2OFLRFG7QJSJB632QM/graph.json","events_json":"https://pith.science/api/pith-number/IYU2EWPS2OFLRFG7QJSJB632QM/events.json","paper":"https://pith.science/paper/IYU2EWPS"},"agent_actions":{"view_html":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM","download_json":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM.json","view_paper":"https://pith.science/paper/IYU2EWPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28588&json=true","fetch_graph":"https://pith.science/api/pith-number/IYU2EWPS2OFLRFG7QJSJB632QM/graph.json","fetch_events":"https://pith.science/api/pith-number/IYU2EWPS2OFLRFG7QJSJB632QM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM/action/storage_attestation","attest_author":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM/action/author_attestation","sign_citation":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM/action/citation_signature","submit_replication":"https://pith.science/pith/IYU2EWPS2OFLRFG7QJSJB632QM/action/replication_record"}},"created_at":"2026-07-31T01:38:47.433966+00:00","updated_at":"2026-07-31T01:38:47.433966+00:00"}