{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6QXOSLU6U5AY2PH24C4TPYEPQ3","short_pith_number":"pith:6QXOSLU6","schema_version":"1.0","canonical_sha256":"f42ee92e9ea7418d3cfae0b937e08f86d157704131cf21bf7974ac1b7d6a0d47","source":{"kind":"arxiv","id":"1602.04396","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.04396","created_at":"2026-05-18T00:26:57.938904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04396v2","created_at":"2026-05-18T00:26:57.938904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04396","created_at":"2026-05-18T00:26:57.938904+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QXOSLU6U5AY","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QXOSLU6U5AY2PH2","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QXOSLU6","created_at":"2026-05-18T12:30:01.593930+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/6QXOSLU6U5AY2PH24C4TPYEPQ3","json":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3.json","graph_json":"https://pith.science/api/pith-number/6QXOSLU6U5AY2PH24C4TPYEPQ3/graph.json","events_json":"https://pith.science/api/pith-number/6QXOSLU6U5AY2PH24C4TPYEPQ3/events.json","paper":"https://pith.science/paper/6QXOSLU6"},"agent_actions":{"view_html":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3","download_json":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3.json","view_paper":"https://pith.science/paper/6QXOSLU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04396&json=true","fetch_graph":"https://pith.science/api/pith-number/6QXOSLU6U5AY2PH24C4TPYEPQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/6QXOSLU6U5AY2PH24C4TPYEPQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/action/storage_attestation","attest_author":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/action/author_attestation","sign_citation":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/action/citation_signature","submit_replication":"https://pith.science/pith/6QXOSLU6U5AY2PH24C4TPYEPQ3/action/replication_record"}},"created_at":"2026-05-18T00:26:57.938904+00:00","updated_at":"2026-05-18T00:26:57.938904+00:00"}