{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UVDAJ2ODZC4AQTRFVJ7NRHGAYZ","short_pith_number":"pith:UVDAJ2OD","schema_version":"1.0","canonical_sha256":"a54604e9c3c8b8084e25aa7ed89cc0c669bcbf1459f4f8b7f32b2a7854254057","source":{"kind":"arxiv","id":"2509.01847","version":1},"attestation_state":"computed","paper":{"title":"Uncertainty Quantification for Ranking with Heterogeneous Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Hyukjun Kwon, Jianqing Fan, Xiaonan Zhu","submitted_at":"2025-09-02T00:10:17Z","abstract_excerpt":"This paper studies human preference learning based on partially revealed choice behavior and formulates the problem as a generalized Bradley-Terry-Luce (BTL) ranking model that accounts for heterogeneous preferences. Specifically, we assume that each user is associated with a nonparametric preference function, and each item is characterized by a low-dimensional latent feature vector - their interaction defines the underlying low-rank score matrix. In this formulation, we propose an indirect regularization method for collaboratively learning the score matrix, which ensures entrywise $\\ell_\\inft"},"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":"2509.01847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-09-02T00:10:17Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"7d3de6bfb2717f936bf568cf03a3b8a3ca47679b885a2334e85e47ebedad52c8","abstract_canon_sha256":"76c5406d86bd8b0386a4fe0b966d9413dec03484b60c4ccb0471f5a81a905ced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:09.881443Z","signature_b64":"u1PVBkEZIbbt4iVmwaGjzbBj5m1ddZ5NZQWp6h82zoWJuyn3wSAS7xXfe68ov9wL5GK8rnq05MC6iLoEPxbNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54604e9c3c8b8084e25aa7ed89cc0c669bcbf1459f4f8b7f32b2a7854254057","last_reissued_at":"2026-07-05T12:03:09.880698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:09.880698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Quantification for Ranking with Heterogeneous Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Hyukjun Kwon, Jianqing Fan, Xiaonan Zhu","submitted_at":"2025-09-02T00:10:17Z","abstract_excerpt":"This paper studies human preference learning based on partially revealed choice behavior and formulates the problem as a generalized Bradley-Terry-Luce (BTL) ranking model that accounts for heterogeneous preferences. Specifically, we assume that each user is associated with a nonparametric preference function, and each item is characterized by a low-dimensional latent feature vector - their interaction defines the underlying low-rank score matrix. In this formulation, we propose an indirect regularization method for collaboratively learning the score matrix, which ensures entrywise $\\ell_\\inft"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01847","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/2509.01847/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":"2509.01847","created_at":"2026-07-05T12:03:09.880799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.01847v1","created_at":"2026-07-05T12:03:09.880799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01847","created_at":"2026-07-05T12:03:09.880799+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVDAJ2ODZC4A","created_at":"2026-07-05T12:03:09.880799+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVDAJ2ODZC4AQTRF","created_at":"2026-07-05T12:03:09.880799+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVDAJ2OD","created_at":"2026-07-05T12:03:09.880799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29395","citing_title":"Low Rank for Rank: Uncertainty-Aware Task-Specific LLM Ranking under Sparse Pairwise Comparisons","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13284","citing_title":"Learning Perturbations to Extrapolate Your LLM","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05073","citing_title":"Heterogeneous Judge-Aware Ranking with Sensitivity, Disagreement, and Confidence","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04344","citing_title":"Perturbation is All You Need for Extrapolating Language Models","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05460","citing_title":"LLM Evaluation as Tensor Completion: Low Rank Structure and Semiparametric Efficiency","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ","json":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ.json","graph_json":"https://pith.science/api/pith-number/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/graph.json","events_json":"https://pith.science/api/pith-number/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/events.json","paper":"https://pith.science/paper/UVDAJ2OD"},"agent_actions":{"view_html":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ","download_json":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ.json","view_paper":"https://pith.science/paper/UVDAJ2OD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.01847&json=true","fetch_graph":"https://pith.science/api/pith-number/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/action/storage_attestation","attest_author":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/action/author_attestation","sign_citation":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/action/citation_signature","submit_replication":"https://pith.science/pith/UVDAJ2ODZC4AQTRFVJ7NRHGAYZ/action/replication_record"}},"created_at":"2026-07-05T12:03:09.880799+00:00","updated_at":"2026-07-05T12:03:09.880799+00:00"}