{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZXVNZXKIAE5ZNGHVO3UUAGMP6J","short_pith_number":"pith:ZXVNZXKI","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"},"canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","source":{"kind":"arxiv","id":"1502.04631","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04631","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04631v2","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04631","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZXVNZXKIAE5Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZXVNZXKIAE5ZNGHV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZXVNZXKI","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZXVNZXKIAE5ZNGHVO3UUAGMP6J","target":"record","payload":{"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"},"canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","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"},"source_kind":"arxiv","source_id":"1502.04631","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRrjSU2i88do7RkcVG24RBv1BSXN0tOlby8iFthEmgtxuXj5AMyp9q+8uyZ4DAd6xKQZuGguwFLaMguAfKZ3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:31:43.575371Z"},"content_sha256":"c5ee7399f3009a503e4315630ad424546c37e26fc30762420d66067ff0eb1860","schema_version":"1.0","event_id":"sha256:c5ee7399f3009a503e4315630ad424546c37e26fc30762420d66067ff0eb1860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZXVNZXKIAE5ZNGHVO3UUAGMP6J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuZPSdbU2xJaLUeCx6JdITwWafUtnNeCP/PlOdHbn2+ykpWqsWAKyqlsse8TaNXPFYo6/kDq4zyPJdJkHCZbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:31:43.576000Z"},"content_sha256":"afaecffe326e6b6b01d0f22c0322100dd12d8270d1b950ab6abd147c970d3598","schema_version":"1.0","event_id":"sha256:afaecffe326e6b6b01d0f22c0322100dd12d8270d1b950ab6abd147c970d3598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/bundle.json","state_url":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T15:31:43Z","links":{"resolver":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J","bundle":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/bundle.json","state":"https://pith.science/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXVNZXKIAE5ZNGHVO3UUAGMP6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZXVNZXKIAE5ZNGHVO3UUAGMP6J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"62b04c0cbddb7b011950888937d38dcdd07c4514da5e78323e69f93ee1d8351c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-16T17:08:48Z","title_canon_sha256":"252fa93a2e8f50c6b4dccaa58e495c67bd32a85d8dfbd2ba1d82f76d917ce87c"},"schema_version":"1.0","source":{"id":"1502.04631","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04631","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04631v2","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04631","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZXVNZXKIAE5Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZXVNZXKIAE5ZNGHV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZXVNZXKI","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:afaecffe326e6b6b01d0f22c0322100dd12d8270d1b950ab6abd147c970d3598","target":"graph","created_at":"2026-05-18T01:24:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bruce Hajek, Jiaming Xu, Laurent Massouli\\'e, Marc Lelarge, R. Srikant, Rui Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-16T17:08:48Z","title":"Clustering and Inference From Pairwise Comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04631","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c5ee7399f3009a503e4315630ad424546c37e26fc30762420d66067ff0eb1860","target":"record","created_at":"2026-05-18T01:24:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"62b04c0cbddb7b011950888937d38dcdd07c4514da5e78323e69f93ee1d8351c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-16T17:08:48Z","title_canon_sha256":"252fa93a2e8f50c6b4dccaa58e495c67bd32a85d8dfbd2ba1d82f76d917ce87c"},"schema_version":"1.0","source":{"id":"1502.04631","kind":"arxiv","version":2}},"canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdeadcdd48013b9698f576e940198ff26174cfceb017ed7da3fab6dbb427d079","first_computed_at":"2026-05-18T01:24:10.943177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:10.943177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9TkXOLg/RuPkuz/49YCDSpyXc0xTy/vaRCebaR19bRzUcPzNV9F4UcYVj7GcoPbL850W+jrOA8mSgGq8wTGvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:10.943965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04631","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5ee7399f3009a503e4315630ad424546c37e26fc30762420d66067ff0eb1860","sha256:afaecffe326e6b6b01d0f22c0322100dd12d8270d1b950ab6abd147c970d3598"],"state_sha256":"b45497bd47bada8ac062ef2743aa151e191e73a03f7e49d24f5b286aae82a3e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sdql2J6Qd/BqC2uGRz7JZw0TLXeqJU4lo2184aVUtnLY+vN6mnZ7jdHtfku4J8L8F2nOeuUfpNyk4JBA+igMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:31:43.579416Z","bundle_sha256":"4ce71aae6be5ec14fb722bd39291e486d4d51cb92569de6573c71ec49d8a25ac"}}