{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YMCSLWOYG36R6Z2CSM5SPOUSSP","short_pith_number":"pith:YMCSLWOY","schema_version":"1.0","canonical_sha256":"c30525d9d836fd1f6742933b27ba9293ddeaa283413016b0a6f7bc09590c7351","source":{"kind":"arxiv","id":"1611.04218","version":1},"attestation_state":"computed","paper":{"title":"Preference Completion from Partial Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo, Suriya Gunasekar","submitted_at":"2016-11-14T01:17:14Z","abstract_excerpt":"We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of observed affinity values. Our approach exploits the observation that while preferences are often recorded as numerical scores, the predictive quantity of interest is the underlying rankings. Thus, attempts to closely match the recorded scores may lead to overfitting and impair generalization performance. Instead, we propose an estimator that directly fits the under"},"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":"1611.04218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-14T01:17:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c0a05da378b1f3d3a0211b7d14bc1e229fbc7679b5b07bc1a8b9bfcd30202206","abstract_canon_sha256":"9d49fd17807395ad5c3bbacd0017e9663beddeccdc37664fd14c651c98942709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.972109Z","signature_b64":"VQIB9s/+e0vUGXETuZAoPuixGyw9+N34Tr7mYQh/ZuWU28nv/rANW9GGdWIq9dipV37Lo5iIX/7SOzGBTTBmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30525d9d836fd1f6742933b27ba9293ddeaa283413016b0a6f7bc09590c7351","last_reissued_at":"2026-05-18T00:58:48.971575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.971575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preference Completion from Partial Rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Joydeep Ghosh, Oluwasanmi Koyejo, Suriya Gunasekar","submitted_at":"2016-11-14T01:17:14Z","abstract_excerpt":"We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of observed affinity values. Our approach exploits the observation that while preferences are often recorded as numerical scores, the predictive quantity of interest is the underlying rankings. Thus, attempts to closely match the recorded scores may lead to overfitting and impair generalization performance. Instead, we propose an estimator that directly fits the under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04218","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":""},"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":"1611.04218","created_at":"2026-05-18T00:58:48.971660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04218v1","created_at":"2026-05-18T00:58:48.971660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04218","created_at":"2026-05-18T00:58:48.971660+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMCSLWOYG36R","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMCSLWOYG36R6Z2C","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMCSLWOY","created_at":"2026-05-18T12:30:53.716459+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/YMCSLWOYG36R6Z2CSM5SPOUSSP","json":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP.json","graph_json":"https://pith.science/api/pith-number/YMCSLWOYG36R6Z2CSM5SPOUSSP/graph.json","events_json":"https://pith.science/api/pith-number/YMCSLWOYG36R6Z2CSM5SPOUSSP/events.json","paper":"https://pith.science/paper/YMCSLWOY"},"agent_actions":{"view_html":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP","download_json":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP.json","view_paper":"https://pith.science/paper/YMCSLWOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04218&json=true","fetch_graph":"https://pith.science/api/pith-number/YMCSLWOYG36R6Z2CSM5SPOUSSP/graph.json","fetch_events":"https://pith.science/api/pith-number/YMCSLWOYG36R6Z2CSM5SPOUSSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP/action/storage_attestation","attest_author":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP/action/author_attestation","sign_citation":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP/action/citation_signature","submit_replication":"https://pith.science/pith/YMCSLWOYG36R6Z2CSM5SPOUSSP/action/replication_record"}},"created_at":"2026-05-18T00:58:48.971660+00:00","updated_at":"2026-05-18T00:58:48.971660+00:00"}