{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I7PLHKXIA7QVWKYIVTR6VSEZHY","short_pith_number":"pith:I7PLHKXI","canonical_record":{"source":{"id":"1702.02267","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-08T03:52:40Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"a0b039ca4868f72f4209867663284fd96e2730ef1285a20a5906777838baac4f","abstract_canon_sha256":"e58b2b3da94d6d8f32d850353ebbfe269a7d42008b9de46870f169cd53e3892d"},"schema_version":"1.0"},"canonical_sha256":"47deb3aae807e15b2b08ace3eac8993e1a9d2b1f0260f0472f385dc3edf4aac1","source":{"kind":"arxiv","id":"1702.02267","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02267","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02267v4","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02267","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"I7PLHKXIA7QV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7PLHKXIA7QVWKYI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7PLHKXI","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I7PLHKXIA7QVWKYIVTR6VSEZHY","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02267","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-08T03:52:40Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"a0b039ca4868f72f4209867663284fd96e2730ef1285a20a5906777838baac4f","abstract_canon_sha256":"e58b2b3da94d6d8f32d850353ebbfe269a7d42008b9de46870f169cd53e3892d"},"schema_version":"1.0"},"canonical_sha256":"47deb3aae807e15b2b08ace3eac8993e1a9d2b1f0260f0472f385dc3edf4aac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:42.104731Z","signature_b64":"oAMReAC3WPE5lnMwettx0jx0nnr/Hr4Mpt27jAKMVB3CHGGreNjc7xjHcSoWvAQzed3Vql1Jdn5TMDrra/fiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47deb3aae807e15b2b08ace3eac8993e1a9d2b1f0260f0472f385dc3edf4aac1","last_reissued_at":"2026-05-18T00:37:42.104104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:42.104104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02267","source_version":4,"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-18T00:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHbtfhCXQvaxqBsTxWxpMe6XsVI/twgoeWVfccvvIBEugV7Dd0kXdQVquFYa2dexw8/e8rEr59OR/fCG5bUGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:44:11.509544Z"},"content_sha256":"4f647f46d423354d232889bd0c38adaa5082b7cb6cfd726c7f80b3c0d23b1a89","schema_version":"1.0","event_id":"sha256:4f647f46d423354d232889bd0c38adaa5082b7cb6cfd726c7f80b3c0d23b1a89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I7PLHKXIA7QVWKYIVTR6VSEZHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Completion from $O(n)$ Samples in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"David Gamarnik, Hongyi Zhang, Quan Li","submitted_at":"2017-02-08T03:52:40Z","abstract_excerpt":"We consider the problem of reconstructing a rank-$k$ $n \\times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it was shown in \\cite{CandesRecht2009, CandesTao2010, keshavan2010, Recht2011, Jain2012, Hardt2014} that $M$ can be recovered exactly or approximately (depending on some trade-off between accuracy and computational complexity) using $O(n \\, \\text{poly}(\\log n))$ samples in super-linear time $O(n^{a} \\, \\text{poly}(\\log n))$ for some constant $a \\geq 1$.\n  In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02267","kind":"arxiv","version":4},"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-18T00:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e3m/0woZZLCEM9sPj2kuufyYC2CNS4cYPE3StGiNUmohicx0Hcn8CyK6LE4mgar0/+XsqcToYDMj0iU4oKixAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:44:11.509883Z"},"content_sha256":"3f7649b4fcda097640f9f119919f3aa0efdd7cc47a5d2cdbfed27b1024b340f9","schema_version":"1.0","event_id":"sha256:3f7649b4fcda097640f9f119919f3aa0efdd7cc47a5d2cdbfed27b1024b340f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/bundle.json","state_url":"https://pith.science/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/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-06-04T12:44:11Z","links":{"resolver":"https://pith.science/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY","bundle":"https://pith.science/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/bundle.json","state":"https://pith.science/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7PLHKXIA7QVWKYIVTR6VSEZHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I7PLHKXIA7QVWKYIVTR6VSEZHY","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":"e58b2b3da94d6d8f32d850353ebbfe269a7d42008b9de46870f169cd53e3892d","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-08T03:52:40Z","title_canon_sha256":"a0b039ca4868f72f4209867663284fd96e2730ef1285a20a5906777838baac4f"},"schema_version":"1.0","source":{"id":"1702.02267","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02267","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02267v4","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02267","created_at":"2026-05-18T00:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"I7PLHKXIA7QV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7PLHKXIA7QVWKYI","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7PLHKXI","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:3f7649b4fcda097640f9f119919f3aa0efdd7cc47a5d2cdbfed27b1024b340f9","target":"graph","created_at":"2026-05-18T00:37:42Z","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":"We consider the problem of reconstructing a rank-$k$ $n \\times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it was shown in \\cite{CandesRecht2009, CandesTao2010, keshavan2010, Recht2011, Jain2012, Hardt2014} that $M$ can be recovered exactly or approximately (depending on some trade-off between accuracy and computational complexity) using $O(n \\, \\text{poly}(\\log n))$ samples in super-linear time $O(n^{a} \\, \\text{poly}(\\log n))$ for some constant $a \\geq 1$.\n  In thi","authors_text":"David Gamarnik, Hongyi Zhang, Quan Li","cross_cats":["cs.DS","cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-08T03:52:40Z","title":"Matrix Completion from $O(n)$ Samples in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02267","kind":"arxiv","version":4},"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:4f647f46d423354d232889bd0c38adaa5082b7cb6cfd726c7f80b3c0d23b1a89","target":"record","created_at":"2026-05-18T00:37:42Z","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":"e58b2b3da94d6d8f32d850353ebbfe269a7d42008b9de46870f169cd53e3892d","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-08T03:52:40Z","title_canon_sha256":"a0b039ca4868f72f4209867663284fd96e2730ef1285a20a5906777838baac4f"},"schema_version":"1.0","source":{"id":"1702.02267","kind":"arxiv","version":4}},"canonical_sha256":"47deb3aae807e15b2b08ace3eac8993e1a9d2b1f0260f0472f385dc3edf4aac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47deb3aae807e15b2b08ace3eac8993e1a9d2b1f0260f0472f385dc3edf4aac1","first_computed_at":"2026-05-18T00:37:42.104104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:42.104104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oAMReAC3WPE5lnMwettx0jx0nnr/Hr4Mpt27jAKMVB3CHGGreNjc7xjHcSoWvAQzed3Vql1Jdn5TMDrra/fiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:42.104731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02267","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f647f46d423354d232889bd0c38adaa5082b7cb6cfd726c7f80b3c0d23b1a89","sha256:3f7649b4fcda097640f9f119919f3aa0efdd7cc47a5d2cdbfed27b1024b340f9"],"state_sha256":"1f1bc3783786462586905daba22bda08440069950f83e67657cbe7154aba9dad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18kJrbhENH1iQIQaXYPAVcvUU19jGGMz5Yt3VW5QktEn+x7irU6QPUWUHgOO2BphrPqniE1apHBj2KvY8kOgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:44:11.511860Z","bundle_sha256":"acaa5e68587ff9b2a7cd2183bc76770986c19dd04b0b00e90731c22613a9cbb0"}}