{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Y5MCWCYDBDFQVPM2XIVLHG3BAG","short_pith_number":"pith:Y5MCWCYD","schema_version":"1.0","canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","source":{"kind":"arxiv","id":"1001.5103","version":2},"attestation_state":"computed","paper":{"title":"On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky (LJK), Arkadii S. Nemirovski (ISyE), Fatma Kilinc Karzan (ISyE)","submitted_at":"2010-01-28T05:28:53Z","abstract_excerpt":"We consider the synthesis problem of Compressed Sensing - given s and an MXn matrix A, extract from it an mXn submatrix A', certified to be s-good, with m as small as possible. Starting from the verifiable sufficient conditions of s-goodness, we express the synthesis problem as the problem of approximating a given matrix by a matrix of specified low rank in the uniform norm. We propose randomized algorithms for efficient construction of rank k approximation of matrices of size mXn achieving accuracy bounds O(1)sqrt({ln(mn)/k) which hold in expectation or with high probability. We also supply d"},"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":"1001.5103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-01-28T05:28:53Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"30a1d7fc2eafec8eff51b99a9fafbf651efba5f33f99b83199d1bc2e4445b27a","abstract_canon_sha256":"f602b9e6ba1ba1f216a17c26e44294feed16fa43e2b600f399e76d5b956a5bae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:31.079017Z","signature_b64":"3yAGDp/rA+vBdPl0LxRJlml1WpsBlIhRqD/ZiuHbiAqO3Th00IMjQ9Kl/+cQfVbbB/Zr9Zn+SUaZAygWYQvWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","last_reissued_at":"2026-05-18T02:54:31.078546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:31.078546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky (LJK), Arkadii S. Nemirovski (ISyE), Fatma Kilinc Karzan (ISyE)","submitted_at":"2010-01-28T05:28:53Z","abstract_excerpt":"We consider the synthesis problem of Compressed Sensing - given s and an MXn matrix A, extract from it an mXn submatrix A', certified to be s-good, with m as small as possible. Starting from the verifiable sufficient conditions of s-goodness, we express the synthesis problem as the problem of approximating a given matrix by a matrix of specified low rank in the uniform norm. We propose randomized algorithms for efficient construction of rank k approximation of matrices of size mXn achieving accuracy bounds O(1)sqrt({ln(mn)/k) which hold in expectation or with high probability. We also supply d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5103","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":"1001.5103","created_at":"2026-05-18T02:54:31.078613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.5103v2","created_at":"2026-05-18T02:54:31.078613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5103","created_at":"2026-05-18T02:54:31.078613+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5MCWCYDBDFQ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5MCWCYDBDFQVPM2","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5MCWCYD","created_at":"2026-05-18T12:26:17.028572+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/Y5MCWCYDBDFQVPM2XIVLHG3BAG","json":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG.json","graph_json":"https://pith.science/api/pith-number/Y5MCWCYDBDFQVPM2XIVLHG3BAG/graph.json","events_json":"https://pith.science/api/pith-number/Y5MCWCYDBDFQVPM2XIVLHG3BAG/events.json","paper":"https://pith.science/paper/Y5MCWCYD"},"agent_actions":{"view_html":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG","download_json":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG.json","view_paper":"https://pith.science/paper/Y5MCWCYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.5103&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5MCWCYDBDFQVPM2XIVLHG3BAG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5MCWCYDBDFQVPM2XIVLHG3BAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/action/storage_attestation","attest_author":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/action/author_attestation","sign_citation":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/action/citation_signature","submit_replication":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/action/replication_record"}},"created_at":"2026-05-18T02:54:31.078613+00:00","updated_at":"2026-05-18T02:54:31.078613+00:00"}