{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6QXOSLU6U5AY2PH24C4TPYEPQ3","short_pith_number":"pith:6QXOSLU6","canonical_record":{"source":{"id":"1602.04396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T22:51:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11cb2ca84c42dda4ae997092cfe49c5805b0d5dabfd784f8da8fbb86584476b4","abstract_canon_sha256":"ccfeca19d003efddd66ffccc873eb647541830347d58e3a62a4062345dbabe5e"},"schema_version":"1.0"},"canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","source":{"kind":"arxiv","id":"1602.04396","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04396","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04396v2","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04396","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"6QXOSLU6U5AY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6QXOSLU6U5AY2PH2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6QXOSLU6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6QXOSLU6U5AY2PH24C4TPYEPQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T22:51:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11cb2ca84c42dda4ae997092cfe49c5805b0d5dabfd784f8da8fbb86584476b4","abstract_canon_sha256":"ccfeca19d003efddd66ffccc873eb647541830347d58e3a62a4062345dbabe5e"},"schema_version":"1.0"},"canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:57.939455Z","signature_b64":"L/EOB5/xEAosuxcY39MF7CJDuZVZZaRhODYz+HUkb5fd2F1dsXtaS4w2umQKOLRXvXaK17JybsI2uGRBpJP/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","last_reissued_at":"2026-05-18T00:26:57.938799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:57.938799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04396","source_version":2,"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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwFK+nw908yKGoLCzjvlGpuuf556q0bh/6/79pgiU1shctkSvkQtSt3AXCXme+r6D/LdP0gsLSEINusyfdjJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:58:00.075329Z"},"content_sha256":"701c53a3e84ddf223850573b8b93bf03875a8da83a102e5fd479376bba4e098d","schema_version":"1.0","event_id":"sha256:701c53a3e84ddf223850573b8b93bf03875a8da83a102e5fd479376bba4e098d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6QXOSLU6U5AY2PH24C4TPYEPQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Sample Complexity for Stable Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","submitted_at":"2016-02-13T22:51:42Z","abstract_excerpt":"Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery without constants or log factors. We treat sparsity, low-rankness, and potentially other parsimonious structures within the same framework: constraint sets that have small covering numbers or Minkowski dimensions. We consider three types of random measurement matrices (unstructured, rank-1, and symmetric rank-1 matrices), following probability distributions tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04396","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"},"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:26:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEnzOS5FmK3MMh/lg26YW/Cdo/VGcbkc+9jS4t799DMbr8ocVJXN7oy0/ssdtWTFxs12uzk0cPQbWRTUSK8mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:58:00.076018Z"},"content_sha256":"84bc33eaef8fde37b7600f052c6dc8c397734fb55b969e3ada13d16200e0472c","schema_version":"1.0","event_id":"sha256:84bc33eaef8fde37b7600f052c6dc8c397734fb55b969e3ada13d16200e0472c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/bundle.json","state_url":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/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-07T21:58:00Z","links":{"resolver":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3","bundle":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/bundle.json","state":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6QXOSLU6U5AY2PH24C4TPYEPQ3","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":"ccfeca19d003efddd66ffccc873eb647541830347d58e3a62a4062345dbabe5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T22:51:42Z","title_canon_sha256":"11cb2ca84c42dda4ae997092cfe49c5805b0d5dabfd784f8da8fbb86584476b4"},"schema_version":"1.0","source":{"id":"1602.04396","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04396","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04396v2","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04396","created_at":"2026-05-18T00:26:57Z"},{"alias_kind":"pith_short_12","alias_value":"6QXOSLU6U5AY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6QXOSLU6U5AY2PH2","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6QXOSLU6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:84bc33eaef8fde37b7600f052c6dc8c397734fb55b969e3ada13d16200e0472c","target":"graph","created_at":"2026-05-18T00:26:57Z","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":"Tremendous efforts have been made to study the theoretical and algorithmic aspects of sparse recovery and low-rank matrix recovery. This paper fills a theoretical gap in matrix recovery: the optimal sample complexity for stable recovery without constants or log factors. We treat sparsity, low-rankness, and potentially other parsimonious structures within the same framework: constraint sets that have small covering numbers or Minkowski dimensions. We consider three types of random measurement matrices (unstructured, rank-1, and symmetric rank-1 matrices), following probability distributions tha","authors_text":"Kiryung Lee, Yanjun Li, Yoram Bresler","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T22:51:42Z","title":"Optimal Sample Complexity for Stable Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04396","kind":"arxiv","version":2},"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:701c53a3e84ddf223850573b8b93bf03875a8da83a102e5fd479376bba4e098d","target":"record","created_at":"2026-05-18T00:26:57Z","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":"ccfeca19d003efddd66ffccc873eb647541830347d58e3a62a4062345dbabe5e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T22:51:42Z","title_canon_sha256":"11cb2ca84c42dda4ae997092cfe49c5805b0d5dabfd784f8da8fbb86584476b4"},"schema_version":"1.0","source":{"id":"1602.04396","kind":"arxiv","version":2}},"canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","first_computed_at":"2026-05-18T00:26:57.938799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:57.938799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L/EOB5/xEAosuxcY39MF7CJDuZVZZaRhODYz+HUkb5fd2F1dsXtaS4w2umQKOLRXvXaK17JybsI2uGRBpJP/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:57.939455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04396","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:701c53a3e84ddf223850573b8b93bf03875a8da83a102e5fd479376bba4e098d","sha256:84bc33eaef8fde37b7600f052c6dc8c397734fb55b969e3ada13d16200e0472c"],"state_sha256":"6373d5437e1b9ea5c9658a9e12f01a148a4f72413f4ec7fc710edb1e47515b17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccz50HibSBEvftGkxZy85OKigqOUu/SrzL1wwMWR3GbBSsCirGMPhzPeVQ+1a/ELKHpJgbK1U/fsn0X/eudQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:58:00.080104Z","bundle_sha256":"08730fc2d0519413af4803b8687c08be61893ab56b1d0f48e79dd4d33b6f9c9d"}}