{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:YDGUMKTIROYLOB2DFNXBBJH74U","short_pith_number":"pith:YDGUMKTI","canonical_record":{"source":{"id":"0804.0041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"9034fed062f67c5901d83f15ea116cbbdd0bfb94287ddbbaddb127bc2b615e2c","abstract_canon_sha256":"92cb723b19674f372b8c144603b99b4442f44a17c8ca648da786dc9955b07e90"},"schema_version":"1.0"},"canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","source":{"kind":"arxiv","id":"0804.0041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.0041","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"0804.0041v1","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0041","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"YDGUMKTIROYL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"YDGUMKTIROYLOB2D","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"YDGUMKTI","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:YDGUMKTIROYLOB2DFNXBBJH74U","target":"record","payload":{"canonical_record":{"source":{"id":"0804.0041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","cross_cats_sorted":["cs.NA","math.IT"],"title_canon_sha256":"9034fed062f67c5901d83f15ea116cbbdd0bfb94287ddbbaddb127bc2b615e2c","abstract_canon_sha256":"92cb723b19674f372b8c144603b99b4442f44a17c8ca648da786dc9955b07e90"},"schema_version":"1.0"},"canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:16.504695Z","signature_b64":"WJJ65TDloQ1fUnlCFhFBBfL3OGe0EI8zjYOcbJn7NuOju5TBr11udeoncWZVOMDHdn5IGsA2xp4lOjjoYLhtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","last_reissued_at":"2026-05-18T04:27:16.504035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:16.504035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.0041","source_version":1,"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:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95K2o566KBb/NuG9aT3BRbwAYFz1gnL/Xs1dZUglMBVlC7KzTzy/JP6J67cd8DauCIcHBpeeRq1ExkmB6TeRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:18:06.723093Z"},"content_sha256":"fb193090fc76edc3828290791632a3513654905f6b4ff9f7918ce633f9900911","schema_version":"1.0","event_id":"sha256:fb193090fc76edc3828290791632a3513654905f6b4ff9f7918ce633f9900911"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:YDGUMKTIROYLOB2DFNXBBJH74U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the reconstruction of block-sparse signals with an optimal number of measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Farzad Parvaresh, Mihailo Stojnic","submitted_at":"2008-03-31T23:00:33Z","abstract_excerpt":"Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the sparsity of x is smaller than half the dimension of y then with overwhelming probability over A the sparsest solution is unique and can be found by an exhaustive search over x with an exponential time complexity for any y. The recent work of Cand\\'es, Donoho, and Tao shows that minimization of the L_1 norm of x subject to A x = y results in the sparsest solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0041","kind":"arxiv","version":1},"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:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EE2hbo/3YGcD8kvf4ZvntRIcT2cmEvpOW9Za1rzteaQklchCF/AG89R4kFiP/EuaX2KEOTd1cCzjE8Ebw/EnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:18:06.723770Z"},"content_sha256":"6c6b2b209cfe824282897569280ce5d2ab357193237a757d004008b0416ead3d","schema_version":"1.0","event_id":"sha256:6c6b2b209cfe824282897569280ce5d2ab357193237a757d004008b0416ead3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/bundle.json","state_url":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDGUMKTIROYLOB2DFNXBBJH74U/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-24T11:18:06Z","links":{"resolver":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U","bundle":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/bundle.json","state":"https://pith.science/pith/YDGUMKTIROYLOB2DFNXBBJH74U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDGUMKTIROYLOB2DFNXBBJH74U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:YDGUMKTIROYLOB2DFNXBBJH74U","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":"92cb723b19674f372b8c144603b99b4442f44a17c8ca648da786dc9955b07e90","cross_cats_sorted":["cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","title_canon_sha256":"9034fed062f67c5901d83f15ea116cbbdd0bfb94287ddbbaddb127bc2b615e2c"},"schema_version":"1.0","source":{"id":"0804.0041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.0041","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"0804.0041v1","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0041","created_at":"2026-05-18T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"YDGUMKTIROYL","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"YDGUMKTIROYLOB2D","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"YDGUMKTI","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6c6b2b209cfe824282897569280ce5d2ab357193237a757d004008b0416ead3d","target":"graph","created_at":"2026-05-18T04:27:16Z","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":"Let A be an M by N matrix (M < N) which is an instance of a real random Gaussian ensemble. In compressed sensing we are interested in finding the sparsest solution to the system of equations A x = y for a given y. In general, whenever the sparsity of x is smaller than half the dimension of y then with overwhelming probability over A the sparsest solution is unique and can be found by an exhaustive search over x with an exponential time complexity for any y. The recent work of Cand\\'es, Donoho, and Tao shows that minimization of the L_1 norm of x subject to A x = y results in the sparsest solut","authors_text":"Babak Hassibi, Farzad Parvaresh, Mihailo Stojnic","cross_cats":["cs.NA","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","title":"On the reconstruction of block-sparse signals with an optimal number of measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0041","kind":"arxiv","version":1},"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:fb193090fc76edc3828290791632a3513654905f6b4ff9f7918ce633f9900911","target":"record","created_at":"2026-05-18T04:27:16Z","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":"92cb723b19674f372b8c144603b99b4442f44a17c8ca648da786dc9955b07e90","cross_cats_sorted":["cs.NA","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-03-31T23:00:33Z","title_canon_sha256":"9034fed062f67c5901d83f15ea116cbbdd0bfb94287ddbbaddb127bc2b615e2c"},"schema_version":"1.0","source":{"id":"0804.0041","kind":"arxiv","version":1}},"canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0cd462a688bb0b707432b6e10a4ffe51110a70026faa1bc645efc6b246240ed","first_computed_at":"2026-05-18T04:27:16.504035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:16.504035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WJJ65TDloQ1fUnlCFhFBBfL3OGe0EI8zjYOcbJn7NuOju5TBr11udeoncWZVOMDHdn5IGsA2xp4lOjjoYLhtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:16.504695Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.0041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb193090fc76edc3828290791632a3513654905f6b4ff9f7918ce633f9900911","sha256:6c6b2b209cfe824282897569280ce5d2ab357193237a757d004008b0416ead3d"],"state_sha256":"db49d2a184cb8d358c838b0243b2da86fdf812abd2320563f43f53f36ba434ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxW/NuygY1nwk1vvpd6qHCVQb4lv3ZGhGQRGNVty8WaSNW0O+Cn/8nnc8rGQad2rxh7Ix6LXoOmBakDR03Q8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:18:06.727306Z","bundle_sha256":"3ea77d3b57721b7fa3f65eca78d3f641b738644d972567fd4a6c7421778e4cd3"}}