{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PBORQ6FMPKCKFSXIJT3VSDISTK","short_pith_number":"pith:PBORQ6FM","schema_version":"1.0","canonical_sha256":"785d1878ac7a84a2cae84cf7590d129ab65e6eda79b1d79d1c295ea68e4247d0","source":{"kind":"arxiv","id":"1408.1717","version":3},"attestation_state":"computed","paper":{"title":"Matrix Completion on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael Bronstein, Pierre Vandergheynst, Vassilis Kalofolias, Xavier Bresson","submitted_at":"2014-08-07T21:33:51Z","abstract_excerpt":"The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Cand\\`es and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large. In this work, we introduce a novel matrix completion model that makes use of proximity information about rows and columns by assuming they form communities. This assumption makes sense in several real-world problems like in recommender systems, where th"},"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":"1408.1717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-07T21:33:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73ab47415e251668ab5d44b757fa39cb3ecb342b8574d82a79385b6428c86748","abstract_canon_sha256":"61ea34cd3bb8a2cf634f50309a542ca4c42cc8d58d5eb9e4b1d5e57fcc4c6e14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.528704Z","signature_b64":"QMb0dBZOaweF9MFg5UZfLpMpj+q5eoH5V3t4Q7WoCHKgwA1urVA1FqG8p6Xc7fopP+eu9+srV9RTM3caZnEmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785d1878ac7a84a2cae84cf7590d129ab65e6eda79b1d79d1c295ea68e4247d0","last_reissued_at":"2026-05-18T02:32:38.528271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.528271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Completion on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael Bronstein, Pierre Vandergheynst, Vassilis Kalofolias, Xavier Bresson","submitted_at":"2014-08-07T21:33:51Z","abstract_excerpt":"The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Cand\\`es and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large. In this work, we introduce a novel matrix completion model that makes use of proximity information about rows and columns by assuming they form communities. This assumption makes sense in several real-world problems like in recommender systems, where th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1717","kind":"arxiv","version":3},"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":"1408.1717","created_at":"2026-05-18T02:32:38.528331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.1717v3","created_at":"2026-05-18T02:32:38.528331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1717","created_at":"2026-05-18T02:32:38.528331+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBORQ6FMPKCK","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBORQ6FMPKCKFSXI","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBORQ6FM","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09708","citing_title":"Node Attribute Generation on Graphs","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK","json":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK.json","graph_json":"https://pith.science/api/pith-number/PBORQ6FMPKCKFSXIJT3VSDISTK/graph.json","events_json":"https://pith.science/api/pith-number/PBORQ6FMPKCKFSXIJT3VSDISTK/events.json","paper":"https://pith.science/paper/PBORQ6FM"},"agent_actions":{"view_html":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK","download_json":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK.json","view_paper":"https://pith.science/paper/PBORQ6FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.1717&json=true","fetch_graph":"https://pith.science/api/pith-number/PBORQ6FMPKCKFSXIJT3VSDISTK/graph.json","fetch_events":"https://pith.science/api/pith-number/PBORQ6FMPKCKFSXIJT3VSDISTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK/action/storage_attestation","attest_author":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK/action/author_attestation","sign_citation":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK/action/citation_signature","submit_replication":"https://pith.science/pith/PBORQ6FMPKCKFSXIJT3VSDISTK/action/replication_record"}},"created_at":"2026-05-18T02:32:38.528331+00:00","updated_at":"2026-05-18T02:32:38.528331+00:00"}