{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QSPJJRMSGA5RIGMATGRK5SL4IB","short_pith_number":"pith:QSPJJRMS","canonical_record":{"source":{"id":"1504.03156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-04-13T12:52:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e6d10c95db712eda7c72d3b08fc35133499610b17d0d87310684370a1975487d","abstract_canon_sha256":"a9e0d241e16e4ffa36bb1593a6238a51f1ee94896513371e3e38f326a18b9e28"},"schema_version":"1.0"},"canonical_sha256":"849e94c592303b14198099a2aec97c404aa81ae0bddcc56946c1c57821f8f104","source":{"kind":"arxiv","id":"1504.03156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03156","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03156v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03156","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"QSPJJRMSGA5R","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QSPJJRMSGA5RIGMA","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QSPJJRMS","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QSPJJRMSGA5RIGMATGRK5SL4IB","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-04-13T12:52:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e6d10c95db712eda7c72d3b08fc35133499610b17d0d87310684370a1975487d","abstract_canon_sha256":"a9e0d241e16e4ffa36bb1593a6238a51f1ee94896513371e3e38f326a18b9e28"},"schema_version":"1.0"},"canonical_sha256":"849e94c592303b14198099a2aec97c404aa81ae0bddcc56946c1c57821f8f104","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:59.025629Z","signature_b64":"I5Ow6+jY1KRtnSdFt95dpMcTXjBNTMxOYOZHuhLdlJbBigBUfunbH0C+upa214FiPOYh3Wpx3rstMyeL/7yQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"849e94c592303b14198099a2aec97c404aa81ae0bddcc56946c1c57821f8f104","last_reissued_at":"2026-05-18T02:18:59.025100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:59.025100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03156","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biRrMRLx8GZ9vLZomQjDxAR8Ji5aiyMrDAQ+sAK9Hrz7AVj1VKTXhHttGqHizFUo25vYt38XjuYaCtnrG6J+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:11:01.706178Z"},"content_sha256":"2d25eded47823924f321d187fc4de288a709527f12537b32c1af2026c77d600c","schema_version":"1.0","event_id":"sha256:2d25eded47823924f321d187fc4de288a709527f12537b32c1af2026c77d600c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QSPJJRMSGA5RIGMATGRK5SL4IB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming, Memory Limited Matrix Completion with Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.SP","authors_text":"Alexandre Proutiere, Marc Lelarge, Se-Young Yun","submitted_at":"2015-04-13T12:52:31Z","abstract_excerpt":"In this paper, we consider the streaming memory-limited matrix completion problem when the observed entries are noisy versions of a small random fraction of the original entries. We are interested in scenarios where the matrix size is very large so the matrix is very hard to store and manipulate. Here, columns of the observed matrix are presented sequentially and the goal is to complete the missing entries after one pass on the data with limited memory space and limited computational complexity. We propose a streaming algorithm which produces an estimate of the original matrix with a vanishing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03156","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJdVKSZ1s2S6VLB8PGSa3cB2Q7GbhZggm854BBp8JNiXUozRP1BRaZTPCdPJNyt4CXxycZZDiy2uJw75638KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:11:01.706809Z"},"content_sha256":"b73663dbeb14749d230185e9fff2ccfa8edb17379f51c2b16845558cc1648f2b","schema_version":"1.0","event_id":"sha256:b73663dbeb14749d230185e9fff2ccfa8edb17379f51c2b16845558cc1648f2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/bundle.json","state_url":"https://pith.science/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T12:11:01Z","links":{"resolver":"https://pith.science/pith/QSPJJRMSGA5RIGMATGRK5SL4IB","bundle":"https://pith.science/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/bundle.json","state":"https://pith.science/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSPJJRMSGA5RIGMATGRK5SL4IB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QSPJJRMSGA5RIGMATGRK5SL4IB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9e0d241e16e4ffa36bb1593a6238a51f1ee94896513371e3e38f326a18b9e28","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-04-13T12:52:31Z","title_canon_sha256":"e6d10c95db712eda7c72d3b08fc35133499610b17d0d87310684370a1975487d"},"schema_version":"1.0","source":{"id":"1504.03156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03156","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03156v1","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03156","created_at":"2026-05-18T02:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"QSPJJRMSGA5R","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QSPJJRMSGA5RIGMA","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QSPJJRMS","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:b73663dbeb14749d230185e9fff2ccfa8edb17379f51c2b16845558cc1648f2b","target":"graph","created_at":"2026-05-18T02:18:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we consider the streaming memory-limited matrix completion problem when the observed entries are noisy versions of a small random fraction of the original entries. We are interested in scenarios where the matrix size is very large so the matrix is very hard to store and manipulate. Here, columns of the observed matrix are presented sequentially and the goal is to complete the missing entries after one pass on the data with limited memory space and limited computational complexity. We propose a streaming algorithm which produces an estimate of the original matrix with a vanishing","authors_text":"Alexandre Proutiere, Marc Lelarge, Se-Young Yun","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-04-13T12:52:31Z","title":"Streaming, Memory Limited Matrix Completion with Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03156","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2d25eded47823924f321d187fc4de288a709527f12537b32c1af2026c77d600c","target":"record","created_at":"2026-05-18T02:18:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9e0d241e16e4ffa36bb1593a6238a51f1ee94896513371e3e38f326a18b9e28","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-04-13T12:52:31Z","title_canon_sha256":"e6d10c95db712eda7c72d3b08fc35133499610b17d0d87310684370a1975487d"},"schema_version":"1.0","source":{"id":"1504.03156","kind":"arxiv","version":1}},"canonical_sha256":"849e94c592303b14198099a2aec97c404aa81ae0bddcc56946c1c57821f8f104","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"849e94c592303b14198099a2aec97c404aa81ae0bddcc56946c1c57821f8f104","first_computed_at":"2026-05-18T02:18:59.025100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:59.025100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5Ow6+jY1KRtnSdFt95dpMcTXjBNTMxOYOZHuhLdlJbBigBUfunbH0C+upa214FiPOYh3Wpx3rstMyeL/7yQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:59.025629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d25eded47823924f321d187fc4de288a709527f12537b32c1af2026c77d600c","sha256:b73663dbeb14749d230185e9fff2ccfa8edb17379f51c2b16845558cc1648f2b"],"state_sha256":"4966a8eb7fb22e06076a5e9b72bb44576fdad0e767784f7c3e189b6477f2d491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pDY+q81ODR8ddzrvFUZqZhq+RvSRTff3G2cHN5TO/Sc/namgiPMjEGcHywG4GmtCE9HM9o6zJFxlS2bK2O5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:11:01.710211Z","bundle_sha256":"b5c34d445949c739431a9eedb57f14e20d46fabe0c39cb76195ad4147d64e490"}}