{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TDF2PTWJB5XZVTFV67APIRU2FN","short_pith_number":"pith:TDF2PTWJ","schema_version":"1.0","canonical_sha256":"98cba7cec90f6f9accb5f7c0f4469a2b774b8916df5e1abab0d2c72ed3df2100","source":{"kind":"arxiv","id":"1302.6768","version":2},"attestation_state":"computed","paper":{"title":"Missing Entries Matrix Approximation and Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Gil Shabat, Yaniv Shmueli","submitted_at":"2013-02-27T13:47:45Z","abstract_excerpt":"We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, similar algorithms appears recently in the literature under different names. In this work, we introduce new theorems for matrix approximation and show that these algorithms can be extended to handle different constraints such as nuclear norm, spectral norm, orthogonality constraints and more that are different than low rank approximations. As the algor"},"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":"1302.6768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-02-27T13:47:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"88d877ee646d55b606f4cbad2ee90f9a8ada504e9ca67c900fab9e71fd8ce134","abstract_canon_sha256":"9b822b4347f1495ac7f1999b0a9356c01d63c785317cddf760a91ed6c19da9da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:47.091539Z","signature_b64":"k643lBwRE7edRAl1XZJn77kvYFa5d8Zs6J9dwxyVb89GMJnY0rJ2wrzcWysopCC8xIoV9MA6WHHWuozGQX0rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98cba7cec90f6f9accb5f7c0f4469a2b774b8916df5e1abab0d2c72ed3df2100","last_reissued_at":"2026-05-18T02:48:47.090959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:47.090959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Missing Entries Matrix Approximation and Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Gil Shabat, Yaniv Shmueli","submitted_at":"2013-02-27T13:47:45Z","abstract_excerpt":"We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, similar algorithms appears recently in the literature under different names. In this work, we introduce new theorems for matrix approximation and show that these algorithms can be extended to handle different constraints such as nuclear norm, spectral norm, orthogonality constraints and more that are different than low rank approximations. As the algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6768","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":"1302.6768","created_at":"2026-05-18T02:48:47.091063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6768v2","created_at":"2026-05-18T02:48:47.091063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6768","created_at":"2026-05-18T02:48:47.091063+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDF2PTWJB5XZ","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDF2PTWJB5XZVTFV","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDF2PTWJ","created_at":"2026-05-18T12:28:02.375192+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/TDF2PTWJB5XZVTFV67APIRU2FN","json":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN.json","graph_json":"https://pith.science/api/pith-number/TDF2PTWJB5XZVTFV67APIRU2FN/graph.json","events_json":"https://pith.science/api/pith-number/TDF2PTWJB5XZVTFV67APIRU2FN/events.json","paper":"https://pith.science/paper/TDF2PTWJ"},"agent_actions":{"view_html":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN","download_json":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN.json","view_paper":"https://pith.science/paper/TDF2PTWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6768&json=true","fetch_graph":"https://pith.science/api/pith-number/TDF2PTWJB5XZVTFV67APIRU2FN/graph.json","fetch_events":"https://pith.science/api/pith-number/TDF2PTWJB5XZVTFV67APIRU2FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN/action/storage_attestation","attest_author":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN/action/author_attestation","sign_citation":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN/action/citation_signature","submit_replication":"https://pith.science/pith/TDF2PTWJB5XZVTFV67APIRU2FN/action/replication_record"}},"created_at":"2026-05-18T02:48:47.091063+00:00","updated_at":"2026-05-18T02:48:47.091063+00:00"}