{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5GZFQ6AB7MCPFMLC3DO3ZHLGQF","short_pith_number":"pith:5GZFQ6AB","schema_version":"1.0","canonical_sha256":"e9b2587801fb04f2b162d8ddbc9d668155265da9480c249d4ccf0d0b621c9ea9","source":{"kind":"arxiv","id":"1602.05127","version":1},"attestation_state":"computed","paper":{"title":"A Harmonic Extension Approach for Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Bertozzi, Da Kuang, Stanley Osher, Zuoqiang Shi","submitted_at":"2016-02-16T18:35:25Z","abstract_excerpt":"We present a new perspective on graph-based methods for collaborative ranking for recommender systems. Unlike user-based or item-based methods that compute a weighted average of ratings given by the nearest neighbors, or low-rank approximation methods using convex optimization and the nuclear norm, we formulate matrix completion as a series of semi-supervised learning problems, and propagate the known ratings to the missing ones on the user-user or item-item graph globally. The semi-supervised learning problems are expressed as Laplace-Beltrami equations on a manifold, or namely, harmonic exte"},"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":"1602.05127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-16T18:35:25Z","cross_cats_sorted":[],"title_canon_sha256":"1119b71cef989d1c57d4d459f183ee22fc5e0e35a68f0202fed121db6581621a","abstract_canon_sha256":"2cf9a2553c40084f2263d535bd137d059010e012880e03f432c2746f6260191f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:37.507625Z","signature_b64":"kC+j8zrD/pO0LBZbxcekjiDGo60jsTlji1AxB7YGSdDt+8osiv5IWEJ2DRbVoySZ30iLwrFSSvn5XR+2Pb0WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9b2587801fb04f2b162d8ddbc9d668155265da9480c249d4ccf0d0b621c9ea9","last_reissued_at":"2026-05-18T01:20:37.507236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:37.507236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Harmonic Extension Approach for Collaborative Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrea Bertozzi, Da Kuang, Stanley Osher, Zuoqiang Shi","submitted_at":"2016-02-16T18:35:25Z","abstract_excerpt":"We present a new perspective on graph-based methods for collaborative ranking for recommender systems. Unlike user-based or item-based methods that compute a weighted average of ratings given by the nearest neighbors, or low-rank approximation methods using convex optimization and the nuclear norm, we formulate matrix completion as a series of semi-supervised learning problems, and propagate the known ratings to the missing ones on the user-user or item-item graph globally. The semi-supervised learning problems are expressed as Laplace-Beltrami equations on a manifold, or namely, harmonic exte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05127","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":"1602.05127","created_at":"2026-05-18T01:20:37.507292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05127v1","created_at":"2026-05-18T01:20:37.507292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05127","created_at":"2026-05-18T01:20:37.507292+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GZFQ6AB7MCP","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GZFQ6AB7MCPFMLC","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GZFQ6AB","created_at":"2026-05-18T12:30:01.593930+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/5GZFQ6AB7MCPFMLC3DO3ZHLGQF","json":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF.json","graph_json":"https://pith.science/api/pith-number/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/graph.json","events_json":"https://pith.science/api/pith-number/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/events.json","paper":"https://pith.science/paper/5GZFQ6AB"},"agent_actions":{"view_html":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF","download_json":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF.json","view_paper":"https://pith.science/paper/5GZFQ6AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05127&json=true","fetch_graph":"https://pith.science/api/pith-number/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/graph.json","fetch_events":"https://pith.science/api/pith-number/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/action/storage_attestation","attest_author":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/action/author_attestation","sign_citation":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/action/citation_signature","submit_replication":"https://pith.science/pith/5GZFQ6AB7MCPFMLC3DO3ZHLGQF/action/replication_record"}},"created_at":"2026-05-18T01:20:37.507292+00:00","updated_at":"2026-05-18T01:20:37.507292+00:00"}