{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SH3PA7KVA356TP72HHBSD3BI6Z","short_pith_number":"pith:SH3PA7KV","schema_version":"1.0","canonical_sha256":"91f6f07d5506fbe9bffa39c321ec28f659ed13ba8942eebf84ea644fef619112","source":{"kind":"arxiv","id":"2201.13132","version":2},"attestation_state":"computed","paper":{"title":"On the identifiability of mixtures of ranking models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Po-Ling Loh, Xiaomin Zhang, Xucheng Zhang, Yingyu Liang","submitted_at":"2022-01-31T11:23:31Z","abstract_excerpt":"Mixtures of ranking models are standard tools for ranking problems. However, even the fundamental question of parameter identifiability is not fully understood: the identifiability of a mixture model with two Bradley-Terry-Luce (BTL) components has remained open. In this work, we show that popular mixtures of ranking models with two components (BTL, multinomial logistic models with slates of size 3, or Plackett-Luce) are generically identifiable, i.e., the ground-truth parameters can be identified except when they are from a pathological subset of measure zero. We provide a framework for verif"},"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":"2201.13132","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T11:23:31Z","cross_cats_sorted":["math.AG","stat.ML"],"title_canon_sha256":"e8ac69caeb8edb92e801eca05d7247388462dcd562e95d1ede8b0bc96cefd831","abstract_canon_sha256":"ba0d54e26ac4b66c19c76315b1aaa4974db1540ecfef701da138ddee4c604430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:54.212496Z","signature_b64":"A8Wb+3y6zJvqymk0NjCpTSE4lUaz4RMPz8bWGZewA72sBvwBEYAWKM88XGQWyWmUZn8M+QPZvji9zt7U9DK/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f6f07d5506fbe9bffa39c321ec28f659ed13ba8942eebf84ea644fef619112","last_reissued_at":"2026-07-05T04:25:54.212049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:54.212049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the identifiability of mixtures of ranking models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Po-Ling Loh, Xiaomin Zhang, Xucheng Zhang, Yingyu Liang","submitted_at":"2022-01-31T11:23:31Z","abstract_excerpt":"Mixtures of ranking models are standard tools for ranking problems. However, even the fundamental question of parameter identifiability is not fully understood: the identifiability of a mixture model with two Bradley-Terry-Luce (BTL) components has remained open. In this work, we show that popular mixtures of ranking models with two components (BTL, multinomial logistic models with slates of size 3, or Plackett-Luce) are generically identifiable, i.e., the ground-truth parameters can be identified except when they are from a pathological subset of measure zero. We provide a framework for verif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13132","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/2201.13132/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":"2201.13132","created_at":"2026-07-05T04:25:54.212106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.13132v2","created_at":"2026-07-05T04:25:54.212106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13132","created_at":"2026-07-05T04:25:54.212106+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH3PA7KVA356","created_at":"2026-07-05T04:25:54.212106+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH3PA7KVA356TP72","created_at":"2026-07-05T04:25:54.212106+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH3PA7KV","created_at":"2026-07-05T04:25:54.212106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23749","citing_title":"Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z","json":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z.json","graph_json":"https://pith.science/api/pith-number/SH3PA7KVA356TP72HHBSD3BI6Z/graph.json","events_json":"https://pith.science/api/pith-number/SH3PA7KVA356TP72HHBSD3BI6Z/events.json","paper":"https://pith.science/paper/SH3PA7KV"},"agent_actions":{"view_html":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z","download_json":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z.json","view_paper":"https://pith.science/paper/SH3PA7KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.13132&json=true","fetch_graph":"https://pith.science/api/pith-number/SH3PA7KVA356TP72HHBSD3BI6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SH3PA7KVA356TP72HHBSD3BI6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z/action/storage_attestation","attest_author":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z/action/author_attestation","sign_citation":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z/action/citation_signature","submit_replication":"https://pith.science/pith/SH3PA7KVA356TP72HHBSD3BI6Z/action/replication_record"}},"created_at":"2026-07-05T04:25:54.212106+00:00","updated_at":"2026-07-05T04:25:54.212106+00:00"}