{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P4ECB65I36OFWSKAFWPJ22TO3J","short_pith_number":"pith:P4ECB65I","schema_version":"1.0","canonical_sha256":"7f0820fba8df9c5b49402d9e9d6a6eda71b70616b8da94b87157f681cf7d35d6","source":{"kind":"arxiv","id":"1705.02047","version":3},"attestation_state":"computed","paper":{"title":"Matrix Completion via Factorizing Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nikhil Rao, Vatsal Shah, Weicong Ding","submitted_at":"2017-05-04T23:47:12Z","abstract_excerpt":"Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees have been developed for algorithms where the matrix is factored into low-rank components, and embeddings are learned for the row and column entities. While there has been recent research on incorporating explicit side information in the low-rank matrix factorization setting, often implicit information can be gleaned from the data, via higher-order interactio"},"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.02047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T23:47:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"016bd5cfd1437cb9e138d698be4a14c3fd1a8e7be18ef8180ba229de78aae301","abstract_canon_sha256":"5ad000fab04f2bf508b7067bf2666561cb43e726b442260b4f42d75837ddb631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:23.289510Z","signature_b64":"n2hKGVI6DIJoGxep4c2jsPnLsT9vaynDSBRCG3/+7tFUzF5qSMjKJYbK/3XifUiXsYPb43SvHQLXELNLX6CMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f0820fba8df9c5b49402d9e9d6a6eda71b70616b8da94b87157f681cf7d35d6","last_reissued_at":"2026-05-18T00:23:23.288854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:23.288854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Completion via Factorizing Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Nikhil Rao, Vatsal Shah, Weicong Ding","submitted_at":"2017-05-04T23:47:12Z","abstract_excerpt":"Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees have been developed for algorithms where the matrix is factored into low-rank components, and embeddings are learned for the row and column entities. While there has been recent research on incorporating explicit side information in the low-rank matrix factorization setting, often implicit information can be gleaned from the data, via higher-order interactio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02047","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":"1705.02047","created_at":"2026-05-18T00:23:23.289007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02047v3","created_at":"2026-05-18T00:23:23.289007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02047","created_at":"2026-05-18T00:23:23.289007+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4ECB65I36OF","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4ECB65I36OFWSKA","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4ECB65I","created_at":"2026-05-18T12:31:37.085036+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/P4ECB65I36OFWSKAFWPJ22TO3J","json":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J.json","graph_json":"https://pith.science/api/pith-number/P4ECB65I36OFWSKAFWPJ22TO3J/graph.json","events_json":"https://pith.science/api/pith-number/P4ECB65I36OFWSKAFWPJ22TO3J/events.json","paper":"https://pith.science/paper/P4ECB65I"},"agent_actions":{"view_html":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J","download_json":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J.json","view_paper":"https://pith.science/paper/P4ECB65I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02047&json=true","fetch_graph":"https://pith.science/api/pith-number/P4ECB65I36OFWSKAFWPJ22TO3J/graph.json","fetch_events":"https://pith.science/api/pith-number/P4ECB65I36OFWSKAFWPJ22TO3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J/action/storage_attestation","attest_author":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J/action/author_attestation","sign_citation":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J/action/citation_signature","submit_replication":"https://pith.science/pith/P4ECB65I36OFWSKAFWPJ22TO3J/action/replication_record"}},"created_at":"2026-05-18T00:23:23.289007+00:00","updated_at":"2026-05-18T00:23:23.289007+00:00"}