{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZXVNZXKIAE5ZNGHVO3UUAGMP6J","short_pith_number":"pith:ZXVNZXKI","schema_version":"1.0","canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","source":{"kind":"arxiv","id":"1502.04631","version":2},"attestation_state":"computed","paper":{"title":"Clustering and Inference From Pairwise Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bruce Hajek, Jiaming Xu, Laurent Massouli\\'e, Marc Lelarge, R. Srikant, Rui Wu","submitted_at":"2015-02-16T17:08:48Z","abstract_excerpt":"Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, arising in the context of making personalized recommendations. In particular, we assume that there are $n$ users of $r$ types; users of the same type provide similar pairwise comparisons for $m$ items according to the Bradley-Terry model. We propose an efficient algorithm that accurately estimates the individual preferences for almost all users, if there are $r \\max \\{m, n\\}\\log m"},"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":"1502.04631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-16T17:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"252fa93a2e8f50c6b4dccaa58e495c67bd32a85d8dfbd2ba1d82f76d917ce87c","abstract_canon_sha256":"62b04c0cbddb7b011950888937d38dcdd07c4514da5e78323e69f93ee1d8351c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.943965Z","signature_b64":"9TkXOLg/RuPkuz/49YCDSpyXc0xTy/vaRCebaR19bRzUcPzNV9F4UcYVj7GcoPbL850W+jrOA8mSgGq8wTGvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","last_reissued_at":"2026-05-18T01:24:10.943177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.943177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering and Inference From Pairwise Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bruce Hajek, Jiaming Xu, Laurent Massouli\\'e, Marc Lelarge, R. Srikant, Rui Wu","submitted_at":"2015-02-16T17:08:48Z","abstract_excerpt":"Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, arising in the context of making personalized recommendations. In particular, we assume that there are $n$ users of $r$ types; users of the same type provide similar pairwise comparisons for $m$ items according to the Bradley-Terry model. We propose an efficient algorithm that accurately estimates the individual preferences for almost all users, if there are $r \\max \\{m, n\\}\\log m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04631","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":""},"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":"1502.04631","created_at":"2026-05-18T01:24:10.943309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04631v2","created_at":"2026-05-18T01:24:10.943309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04631","created_at":"2026-05-18T01:24:10.943309+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXVNZXKIAE5Z","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXVNZXKIAE5ZNGHV","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXVNZXKI","created_at":"2026-05-18T12:29:52.810259+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/ZXVNZXKIAE5ZNGHVO3UUAGMP6J","json":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J.json","graph_json":"https://pith.science/api/pith-number/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/graph.json","events_json":"https://pith.science/api/pith-number/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/events.json","paper":"https://pith.science/paper/ZXVNZXKI"},"agent_actions":{"view_html":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J","download_json":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J.json","view_paper":"https://pith.science/paper/ZXVNZXKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04631&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/action/storage_attestation","attest_author":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/action/author_attestation","sign_citation":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/action/citation_signature","submit_replication":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/action/replication_record"}},"created_at":"2026-05-18T01:24:10.943309+00:00","updated_at":"2026-05-18T01:24:10.943309+00:00"}