{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KY4O5W4DAZXX6ENRCEWOUVY22H","short_pith_number":"pith:KY4O5W4D","canonical_record":{"source":{"id":"1412.7646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-24T11:55:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b7f98064950511230a64f62f2bcc2d91a29f0ff57c98f9080132256ce91eff1","abstract_canon_sha256":"f8c8cc5d2b031b924504f3dfd07e8a5189189a93807ae69017acdbaf7e991302"},"schema_version":"1.0"},"canonical_sha256":"5638eedb83066f7f11b1112cea571ad1e08eb5857b3877cb9ff177b918000bce","source":{"kind":"arxiv","id":"1412.7646","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7646","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7646v2","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7646","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"KY4O5W4DAZXX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KY4O5W4DAZXX6ENR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KY4O5W4D","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KY4O5W4DAZXX6ENRCEWOUVY22H","target":"record","payload":{"canonical_record":{"source":{"id":"1412.7646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-24T11:55:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b7f98064950511230a64f62f2bcc2d91a29f0ff57c98f9080132256ce91eff1","abstract_canon_sha256":"f8c8cc5d2b031b924504f3dfd07e8a5189189a93807ae69017acdbaf7e991302"},"schema_version":"1.0"},"canonical_sha256":"5638eedb83066f7f11b1112cea571ad1e08eb5857b3877cb9ff177b918000bce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:40.641264Z","signature_b64":"ddmPG9zUNZS6esWun359HeTbxqfgYq0rur3GNAwweFi4ZOCw/fTYvMA9gE79YAn8YkLr2JxnW40PdwrlEvMWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5638eedb83066f7f11b1112cea571ad1e08eb5857b3877cb9ff177b918000bce","last_reissued_at":"2026-05-18T00:22:40.640711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:40.640711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.7646","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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"maySyz0QvZkQnCXaiiTPjk+ZI4eJZbF/jhyvqTLHpKgaJtAMGQ2L6ARM8qQtRGhM0KlLB0JW2swCsaZPYiJ6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:01:45.796278Z"},"content_sha256":"203e189aa7289e77b81f419a9ebc111114fcc1eaf4f47a571c578784791c5248","schema_version":"1.0","event_id":"sha256:203e189aa7289e77b81f419a9ebc111114fcc1eaf4f47a571c578784791c5248"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KY4O5W4DAZXX6ENRCEWOUVY22H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Yin, Kannan Ramchandran, Ramtin Pedarsani, Sameer Pawar, Xiao Li","submitted_at":"2014-12-24T11:55:14Z","abstract_excerpt":"We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\\mathbf{x}\\in\\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key contribution is a new compressed sensing framework through a new family of carefully designed sparse measurement matrices associated with minimal measurement costs and a low-complexity recovery algorithm. The measurement matrix in our framework is designed based on the well-crafted sparsification through capacity-approaching sparse-graph codes, where the spars"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7646","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:22:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0CAbh05TqEJYAXVCsKK8gJu19NXGFFyKqWEJD6aEPx5pDh9gwZmhm+dXQd1KRqeL9TtyeJvW0ZquYESTpYSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T10:01:45.796952Z"},"content_sha256":"c2e0ddf63a9eb16ea7bba8e6d0a38c3c90d8bc8e4aab1cb05194a455d4246b5a","schema_version":"1.0","event_id":"sha256:c2e0ddf63a9eb16ea7bba8e6d0a38c3c90d8bc8e4aab1cb05194a455d4246b5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/bundle.json","state_url":"https://pith.science/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/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-22T10:01:45Z","links":{"resolver":"https://pith.science/pith/KY4O5W4DAZXX6ENRCEWOUVY22H","bundle":"https://pith.science/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/bundle.json","state":"https://pith.science/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KY4O5W4DAZXX6ENRCEWOUVY22H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KY4O5W4DAZXX6ENRCEWOUVY22H","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":"f8c8cc5d2b031b924504f3dfd07e8a5189189a93807ae69017acdbaf7e991302","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-24T11:55:14Z","title_canon_sha256":"6b7f98064950511230a64f62f2bcc2d91a29f0ff57c98f9080132256ce91eff1"},"schema_version":"1.0","source":{"id":"1412.7646","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7646","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7646v2","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7646","created_at":"2026-05-18T00:22:40Z"},{"alias_kind":"pith_short_12","alias_value":"KY4O5W4DAZXX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KY4O5W4DAZXX6ENR","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KY4O5W4D","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c2e0ddf63a9eb16ea7bba8e6d0a38c3c90d8bc8e4aab1cb05194a455d4246b5a","target":"graph","created_at":"2026-05-18T00:22:40Z","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 study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\\mathbf{x}\\in\\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key contribution is a new compressed sensing framework through a new family of carefully designed sparse measurement matrices associated with minimal measurement costs and a low-complexity recovery algorithm. The measurement matrix in our framework is designed based on the well-crafted sparsification through capacity-approaching sparse-graph codes, where the spars","authors_text":"Dong Yin, Kannan Ramchandran, Ramtin Pedarsani, Sameer Pawar, Xiao Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-24T11:55:14Z","title":"Sub-linear Time Support Recovery for Compressed Sensing using Sparse-Graph Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7646","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:203e189aa7289e77b81f419a9ebc111114fcc1eaf4f47a571c578784791c5248","target":"record","created_at":"2026-05-18T00:22:40Z","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":"f8c8cc5d2b031b924504f3dfd07e8a5189189a93807ae69017acdbaf7e991302","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-24T11:55:14Z","title_canon_sha256":"6b7f98064950511230a64f62f2bcc2d91a29f0ff57c98f9080132256ce91eff1"},"schema_version":"1.0","source":{"id":"1412.7646","kind":"arxiv","version":2}},"canonical_sha256":"5638eedb83066f7f11b1112cea571ad1e08eb5857b3877cb9ff177b918000bce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5638eedb83066f7f11b1112cea571ad1e08eb5857b3877cb9ff177b918000bce","first_computed_at":"2026-05-18T00:22:40.640711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:40.640711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddmPG9zUNZS6esWun359HeTbxqfgYq0rur3GNAwweFi4ZOCw/fTYvMA9gE79YAn8YkLr2JxnW40PdwrlEvMWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:40.641264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7646","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:203e189aa7289e77b81f419a9ebc111114fcc1eaf4f47a571c578784791c5248","sha256:c2e0ddf63a9eb16ea7bba8e6d0a38c3c90d8bc8e4aab1cb05194a455d4246b5a"],"state_sha256":"8499890574c997d30c2c677b95eac73b93bb1e80f43429359c6c9dfd46cc5638"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wTemMJ8KwJK6oJNWjdtRSwB8Rzr2gUZfeqbm1bMKi929DjuNuclKXKuVUt0EXHRSnmlfWw8cS46bn+CzgfSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T10:01:45.800387Z","bundle_sha256":"379191c5f37aa45cf55d434419d983fe6aee83f591a26ba9ac2321cefd80128d"}}