{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Y5MCWCYDBDFQVPM2XIVLHG3BAG","short_pith_number":"pith:Y5MCWCYD","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"},"canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","source":{"kind":"arxiv","id":"1001.5103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5103","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5103v2","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5103","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y5MCWCYDBDFQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y5MCWCYDBDFQVPM2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y5MCWCYD","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Y5MCWCYDBDFQVPM2XIVLHG3BAG","target":"record","payload":{"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"},"canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","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"},"source_kind":"arxiv","source_id":"1001.5103","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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q3qMXngfGcdw6xRoQ0unBL6K3iIsuE7LVKRtlssb53zIaMoa6SWlqdEixEGKR40vsYFACkjkQ7Fxt1eKXaACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:32.383036Z"},"content_sha256":"a4105adf033aeb25c77881a67ad2aa8034429749ab0c3062139280c89d07ade6","schema_version":"1.0","event_id":"sha256:a4105adf033aeb25c77881a67ad2aa8034429749ab0c3062139280c89d07ade6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Y5MCWCYDBDFQVPM2XIVLHG3BAG","target":"graph","payload":{"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"},"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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLkLjXmHtXwlnLxlHfId0zYYryyRhAlQpozCu1uObJA1g9Xn6wl4CZoyAGcYzZ6bse9cLD+quc4R04hcdmcxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:32.383671Z"},"content_sha256":"92602b7bc28d1320d1075259f9cb251861d3ee315e468299559d7597996c8f1e","schema_version":"1.0","event_id":"sha256:92602b7bc28d1320d1075259f9cb251861d3ee315e468299559d7597996c8f1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/bundle.json","state_url":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/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-05-26T23:41:32Z","links":{"resolver":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG","bundle":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/bundle.json","state":"https://pith.science/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5MCWCYDBDFQVPM2XIVLHG3BAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Y5MCWCYDBDFQVPM2XIVLHG3BAG","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":"f602b9e6ba1ba1f216a17c26e44294feed16fa43e2b600f399e76d5b956a5bae","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-01-28T05:28:53Z","title_canon_sha256":"30a1d7fc2eafec8eff51b99a9fafbf651efba5f33f99b83199d1bc2e4445b27a"},"schema_version":"1.0","source":{"id":"1001.5103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5103","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5103v2","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5103","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y5MCWCYDBDFQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Y5MCWCYDBDFQVPM2","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Y5MCWCYD","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:92602b7bc28d1320d1075259f9cb251861d3ee315e468299559d7597996c8f1e","target":"graph","created_at":"2026-05-18T02:54: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 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","authors_text":"Anatoli Juditsky (LJK), Arkadii S. Nemirovski (ISyE), Fatma Kilinc Karzan (ISyE)","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-01-28T05:28:53Z","title":"On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5103","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:a4105adf033aeb25c77881a67ad2aa8034429749ab0c3062139280c89d07ade6","target":"record","created_at":"2026-05-18T02:54: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":"f602b9e6ba1ba1f216a17c26e44294feed16fa43e2b600f399e76d5b956a5bae","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-01-28T05:28:53Z","title_canon_sha256":"30a1d7fc2eafec8eff51b99a9fafbf651efba5f33f99b83199d1bc2e4445b27a"},"schema_version":"1.0","source":{"id":"1001.5103","kind":"arxiv","version":2}},"canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7582b0b0308cb0abd9aba2ab39b6101b61dfddb1753a3701ad7f3855dd0f717","first_computed_at":"2026-05-18T02:54:31.078546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:31.078546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3yAGDp/rA+vBdPl0LxRJlml1WpsBlIhRqD/ZiuHbiAqO3Th00IMjQ9Kl/+cQfVbbB/Zr9Zn+SUaZAygWYQvWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:31.079017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.5103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4105adf033aeb25c77881a67ad2aa8034429749ab0c3062139280c89d07ade6","sha256:92602b7bc28d1320d1075259f9cb251861d3ee315e468299559d7597996c8f1e"],"state_sha256":"d94fc3160bd704e7ec1d0faeeae01aa3c38956f20c2ed4f60e3b8763b3dd4a58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOvsTwHxZJqBRNxLLHWowy1qi/B/kA9YYTIQUF3OGfu3ShA1EsKeMH+YGN4vgZFs0H5zKkmu/ScUiQgNQvZ6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:41:32.387058Z","bundle_sha256":"0021fa592a38bdf5ac97a7c04d5d3c06cd6a2e33ba963b280d078ecc2969d32d"}}