{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XLBFWMOVOWV44TBHFHUUIAQYSI","short_pith_number":"pith:XLBFWMOV","canonical_record":{"source":{"id":"0910.1879","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-12T19:56:24Z","cross_cats_sorted":["cs.NA","math.IT","math.NA","quant-ph"],"title_canon_sha256":"8d58fce5d622267ba83caaa89adcaa836d898d60489ff218fdc760a2b6cbc5d8","abstract_canon_sha256":"24c02013cf1d3451326ef42f50cf88cde04f7c82206e57b9d01e1a0e726ffa8f"},"schema_version":"1.0"},"canonical_sha256":"bac25b31d575abce4c2729e9440218921905cf688aaaaf6d1edcba933a557746","source":{"kind":"arxiv","id":"0910.1879","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.1879","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"0910.1879v5","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1879","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"XLBFWMOVOWV4","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XLBFWMOVOWV44TBH","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XLBFWMOV","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XLBFWMOVOWV44TBHFHUUIAQYSI","target":"record","payload":{"canonical_record":{"source":{"id":"0910.1879","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-12T19:56:24Z","cross_cats_sorted":["cs.NA","math.IT","math.NA","quant-ph"],"title_canon_sha256":"8d58fce5d622267ba83caaa89adcaa836d898d60489ff218fdc760a2b6cbc5d8","abstract_canon_sha256":"24c02013cf1d3451326ef42f50cf88cde04f7c82206e57b9d01e1a0e726ffa8f"},"schema_version":"1.0"},"canonical_sha256":"bac25b31d575abce4c2729e9440218921905cf688aaaaf6d1edcba933a557746","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:31.947721Z","signature_b64":"gXa4WEBMNQlG0OLuRIz2IzMoWoAnn4GbFvk2k9mX59VELootje+g2d2YSBcRqSZQM7XxIwqZ8AnzIH9rCZdwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bac25b31d575abce4c2729e9440218921905cf688aaaaf6d1edcba933a557746","last_reissued_at":"2026-05-18T04:26:31.947126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:31.947126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.1879","source_version":5,"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-18T04:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07NAoO//OOUCzVbTBKQmuap/Rvcuy0MwWJIU2WVDXfmNcA+HBn1hnsT70AGcE9Dyh5aY8LyC+KLpbFrquImPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:36:10.621222Z"},"content_sha256":"e28f00c176cc1d85c8012cb0f633f9264486965cc8a70ee18dca7eedd532385f","schema_version":"1.0","event_id":"sha256:e28f00c176cc1d85c8012cb0f633f9264486965cc8a70ee18dca7eedd532385f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XLBFWMOVOWV44TBHFHUUIAQYSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering low-rank matrices from few coefficients in any basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT","math.NA","quant-ph"],"primary_cat":"cs.IT","authors_text":"David Gross","submitted_at":"2009-10-12T19:56:24Z","abstract_excerpt":"We present novel techniques for analyzing the problem of low-rank matrix recovery. The methods are both considerably simpler and more general than previous approaches. It is shown that an unknown (n x n) matrix of rank r can be efficiently reconstructed from only O(n r nu log^2 n) randomly sampled expansion coefficients with respect to any given matrix basis. The number nu quantifies the \"degree of incoherence\" between the unknown matrix and the basis. Existing work concentrated mostly on the problem of \"matrix completion\" where one aims to recover a low-rank matrix from randomly selected matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1879","kind":"arxiv","version":5},"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-18T04:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+mFw7NazgufgpARwjJ975OYY6KqYBp3H4XAaLShcjj7oc7in514N/Sq++Px+pSZVXzMAT6/lSVus0TpncyRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:36:10.621770Z"},"content_sha256":"20ee5420798b69f41b6b3a512800191d3c24cb4bfdda88e0fc1aa3966352c37d","schema_version":"1.0","event_id":"sha256:20ee5420798b69f41b6b3a512800191d3c24cb4bfdda88e0fc1aa3966352c37d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/bundle.json","state_url":"https://pith.science/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/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-08-20T07:36:10Z","links":{"resolver":"https://pith.science/pith/XLBFWMOVOWV44TBHFHUUIAQYSI","bundle":"https://pith.science/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/bundle.json","state":"https://pith.science/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLBFWMOVOWV44TBHFHUUIAQYSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XLBFWMOVOWV44TBHFHUUIAQYSI","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":"24c02013cf1d3451326ef42f50cf88cde04f7c82206e57b9d01e1a0e726ffa8f","cross_cats_sorted":["cs.NA","math.IT","math.NA","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-12T19:56:24Z","title_canon_sha256":"8d58fce5d622267ba83caaa89adcaa836d898d60489ff218fdc760a2b6cbc5d8"},"schema_version":"1.0","source":{"id":"0910.1879","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.1879","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"0910.1879v5","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1879","created_at":"2026-05-18T04:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"XLBFWMOVOWV4","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XLBFWMOVOWV44TBH","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XLBFWMOV","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:20ee5420798b69f41b6b3a512800191d3c24cb4bfdda88e0fc1aa3966352c37d","target":"graph","created_at":"2026-05-18T04:26:31Z","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 present novel techniques for analyzing the problem of low-rank matrix recovery. The methods are both considerably simpler and more general than previous approaches. It is shown that an unknown (n x n) matrix of rank r can be efficiently reconstructed from only O(n r nu log^2 n) randomly sampled expansion coefficients with respect to any given matrix basis. The number nu quantifies the \"degree of incoherence\" between the unknown matrix and the basis. Existing work concentrated mostly on the problem of \"matrix completion\" where one aims to recover a low-rank matrix from randomly selected matr","authors_text":"David Gross","cross_cats":["cs.NA","math.IT","math.NA","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-12T19:56:24Z","title":"Recovering low-rank matrices from few coefficients in any basis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1879","kind":"arxiv","version":5},"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:e28f00c176cc1d85c8012cb0f633f9264486965cc8a70ee18dca7eedd532385f","target":"record","created_at":"2026-05-18T04:26:31Z","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":"24c02013cf1d3451326ef42f50cf88cde04f7c82206e57b9d01e1a0e726ffa8f","cross_cats_sorted":["cs.NA","math.IT","math.NA","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-12T19:56:24Z","title_canon_sha256":"8d58fce5d622267ba83caaa89adcaa836d898d60489ff218fdc760a2b6cbc5d8"},"schema_version":"1.0","source":{"id":"0910.1879","kind":"arxiv","version":5}},"canonical_sha256":"bac25b31d575abce4c2729e9440218921905cf688aaaaf6d1edcba933a557746","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bac25b31d575abce4c2729e9440218921905cf688aaaaf6d1edcba933a557746","first_computed_at":"2026-05-18T04:26:31.947126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:31.947126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXa4WEBMNQlG0OLuRIz2IzMoWoAnn4GbFvk2k9mX59VELootje+g2d2YSBcRqSZQM7XxIwqZ8AnzIH9rCZdwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:31.947721Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.1879","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e28f00c176cc1d85c8012cb0f633f9264486965cc8a70ee18dca7eedd532385f","sha256:20ee5420798b69f41b6b3a512800191d3c24cb4bfdda88e0fc1aa3966352c37d"],"state_sha256":"23e66c313924abcc346edc933d64c272117d90a34cdd20025f5b71e814606bde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VT/cWbmnOxb1rYCxrVmtbbdarZSRepDGnnNkqmjJk3gdlSv3VMOHVP9Nsk51x3rkNsvrKkR3ByBZFBjuF97TAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:36:10.625724Z","bundle_sha256":"7b44d7875f137b77d99b32cfa6fbc040d5ad16f8a96ac5b1b9d9b6443c232a7f"}}