{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OE3R4Q67IVWMIABTFILP3OH2NA","short_pith_number":"pith:OE3R4Q67","schema_version":"1.0","canonical_sha256":"71371e43df456cc400332a16fdb8fa681a56834ae7ed20c56409d5708d3ae526","source":{"kind":"arxiv","id":"1705.08621","version":2},"attestation_state":"computed","paper":{"title":"Nonparametric Preference Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Clayton Scott, Julian Katz-Samuels","submitted_at":"2017-05-24T06:04:58Z","abstract_excerpt":"We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the \\emph{personalized ranking} of each user over all of the items. Our approach is nonparametric: we assume that each item $i$ and each user $u$ have unobserved features $x_i$ and $y_u$, and that the associated rating is given by $g_u(f(x_i,y_u))$ where $f$ is Lipschitz and $g_u$ is a monotonic transformation that depends on the user. We propose a $k$-nearest neighbors-like algorithm and prove that it is consistent. To the"},"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":"1705.08621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-24T06:04:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"149d0dfc802522590252855037b71c98b06d2460fc3bdf5916c87e3d8092f75a","abstract_canon_sha256":"63d6635a1e6ed6adca91ab1f08481b4939f09af9e86ea714ea73b9f09b020e66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:53.762336Z","signature_b64":"sSCA8jwzIvLGPmwTirdHGcFUr0+zL6yI5gi3IR9gJJ1KN6lOMZPSLGe3Gzncc1ilSNG+Y/1Y3ubhq5D/VTL2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71371e43df456cc400332a16fdb8fa681a56834ae7ed20c56409d5708d3ae526","last_reissued_at":"2026-05-18T00:18:53.761908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:53.761908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonparametric Preference Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Clayton Scott, Julian Katz-Samuels","submitted_at":"2017-05-24T06:04:58Z","abstract_excerpt":"We consider the task of collaborative preference completion: given a pool of items, a pool of users and a partially observed item-user rating matrix, the goal is to recover the \\emph{personalized ranking} of each user over all of the items. Our approach is nonparametric: we assume that each item $i$ and each user $u$ have unobserved features $x_i$ and $y_u$, and that the associated rating is given by $g_u(f(x_i,y_u))$ where $f$ is Lipschitz and $g_u$ is a monotonic transformation that depends on the user. We propose a $k$-nearest neighbors-like algorithm and prove that it is consistent. To the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08621","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":"1705.08621","created_at":"2026-05-18T00:18:53.761966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08621v2","created_at":"2026-05-18T00:18:53.761966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08621","created_at":"2026-05-18T00:18:53.761966+00:00"},{"alias_kind":"pith_short_12","alias_value":"OE3R4Q67IVWM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OE3R4Q67IVWMIABT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OE3R4Q67","created_at":"2026-05-18T12:31:34.259226+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/OE3R4Q67IVWMIABTFILP3OH2NA","json":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA.json","graph_json":"https://pith.science/api/pith-number/OE3R4Q67IVWMIABTFILP3OH2NA/graph.json","events_json":"https://pith.science/api/pith-number/OE3R4Q67IVWMIABTFILP3OH2NA/events.json","paper":"https://pith.science/paper/OE3R4Q67"},"agent_actions":{"view_html":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA","download_json":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA.json","view_paper":"https://pith.science/paper/OE3R4Q67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08621&json=true","fetch_graph":"https://pith.science/api/pith-number/OE3R4Q67IVWMIABTFILP3OH2NA/graph.json","fetch_events":"https://pith.science/api/pith-number/OE3R4Q67IVWMIABTFILP3OH2NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA/action/storage_attestation","attest_author":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA/action/author_attestation","sign_citation":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA/action/citation_signature","submit_replication":"https://pith.science/pith/OE3R4Q67IVWMIABTFILP3OH2NA/action/replication_record"}},"created_at":"2026-05-18T00:18:53.761966+00:00","updated_at":"2026-05-18T00:18:53.761966+00:00"}