{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:44MSEFTJ3CCLPTJRCCFMBTPT2M","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":"aaba6eef30226d2b59810a7fe7cb65b0bf920ae4775c2d24129240ee9aa64617","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-09T00:17:39Z","title_canon_sha256":"a5d834e4d711b5e6c2e7554733d6bd970d0e840b14e440334a7a2972e1ac104d"},"schema_version":"1.0","source":{"id":"1702.02661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02661","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02661v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02661","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"44MSEFTJ3CCL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"44MSEFTJ3CCLPTJR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"44MSEFTJ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:699145b5f9f83fee748717cb55b94b5782b8b44892802dd3cbb14b2aa2d7e2be","target":"graph","created_at":"2026-05-18T00:51:03Z","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":"We study the problem of ranking a set of items from nonactively chosen pairwise preferences where each item has feature information with it. We propose and characterize a very broad class of preference matrices giving rise to the Feature Low Rank (FLR) model, which subsumes several models ranging from the classic Bradley-Terry-Luce (BTL) (Bradley and Terry 1952) and Thurstone (Thurstone 1927) models to the recently proposed blade-chest (Chen and Joachims 2016) and generic low-rank preference (Rajkumar and Agarwal 2016) models. We use the technique of matrix completion in the presence of side i","authors_text":"Arun Rajkumar, U.N. Niranjan","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-09T00:17:39Z","title":"Inductive Pairwise Ranking: Going Beyond the n log(n) Barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02661","kind":"arxiv","version":1},"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:1edc2c5ea8964b7764c281295f02a64e04697763e28cf1fc73391a61585ccb2c","target":"record","created_at":"2026-05-18T00:51:03Z","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":"aaba6eef30226d2b59810a7fe7cb65b0bf920ae4775c2d24129240ee9aa64617","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-09T00:17:39Z","title_canon_sha256":"a5d834e4d711b5e6c2e7554733d6bd970d0e840b14e440334a7a2972e1ac104d"},"schema_version":"1.0","source":{"id":"1702.02661","kind":"arxiv","version":1}},"canonical_sha256":"e719221669d884b7cd31108ac0cdf3d323f05212b68b512a2070fde4280d5736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e719221669d884b7cd31108ac0cdf3d323f05212b68b512a2070fde4280d5736","first_computed_at":"2026-05-18T00:51:03.754706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.754706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVs3YLdaY4pAAfWHirvGHk/SSAQ+7FXzDpdHPgIxdsHIuIZBgzo/5RQmEH/7yqwm3JuVYMTRoe38JuIJwnZKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.755099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1edc2c5ea8964b7764c281295f02a64e04697763e28cf1fc73391a61585ccb2c","sha256:699145b5f9f83fee748717cb55b94b5782b8b44892802dd3cbb14b2aa2d7e2be"],"state_sha256":"828f2bcc8dc0d5c78affdfbcf906f26a17304100b8a5b743108f89459536ea55"}