{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KOSLHNRP3CGXJE7TXRWWYSAFO3","short_pith_number":"pith:KOSLHNRP","canonical_record":{"source":{"id":"1207.2853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"09be205904d51021b92ab740141a18295286289dd351aa6203b8d7b532e4b4d5","abstract_canon_sha256":"d0b579c320b8dcc3b16cabb9e8ed31672b08107e11414d70aba25c833ea27e6e"},"schema_version":"1.0"},"canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","source":{"kind":"arxiv","id":"1207.2853","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2853","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2853v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2853","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOSLHNRP3CGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KOSLHNRP3CGXJE7T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KOSLHNRP","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KOSLHNRP3CGXJE7TXRWWYSAFO3","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"09be205904d51021b92ab740141a18295286289dd351aa6203b8d7b532e4b4d5","abstract_canon_sha256":"d0b579c320b8dcc3b16cabb9e8ed31672b08107e11414d70aba25c833ea27e6e"},"schema_version":"1.0"},"canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.462353Z","signature_b64":"kItSc5UqAbzMJFU8yQiNfH2emOwUcIy0Shdly72pWyyWaaRrvwf9zFSBhqNSr2h8KgM0RJjaFGGgBXgvhGE8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","last_reissued_at":"2026-05-18T03:28:17.461521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.461521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2853","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-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tk3A1z7/tRABI6NyHjQxiJCDkYOtj0hdJBjXLo/E29Rvew/VBqhBiG/46vuBtmALiZPBaMsXhmgbXqTgj25aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:59.488201Z"},"content_sha256":"1130ff39befa85f34991c505f5f03b656700df52ca8b9c5219aa05d9e1b10149","schema_version":"1.0","event_id":"sha256:1130ff39befa85f34991c505f5f03b656700df52ca8b9c5219aa05d9e1b10149"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KOSLHNRP3CGXJE7TXRWWYSAFO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed sensing with sparse, structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Federico Ricci-Tersenghi, Maria Chiara Angelini, Yoshiyuki Kabashima","submitted_at":"2012-07-12T06:16:33Z","abstract_excerpt":"In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the original signal, compressed at a rate {\\alpha}, by using a message passing algorithm (Expectation Maximization Belief Propagation) that runs in a time linear in N. In the large N limit, the scheme proposed here closely approaches the theoretical bound {\\rho}0 = {\\alpha}, and so it is both optimal and efficient (linear time complexity). More generally, we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2853","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-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sUqobPnSTEMiW0Quco76xJnRu0VoILnJSAxCc/HnOnRURTdmyMDRbbXaMFpPBvb6ZYgA/KXQMSG8FC1i2NEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:54:59.488852Z"},"content_sha256":"99e279c5c92bf4959da7782dd2af470919161bfa0dad215ea3a184d3878b2d0a","schema_version":"1.0","event_id":"sha256:99e279c5c92bf4959da7782dd2af470919161bfa0dad215ea3a184d3878b2d0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/bundle.json","state_url":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/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-26T21:54:59Z","links":{"resolver":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3","bundle":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/bundle.json","state":"https://pith.science/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOSLHNRP3CGXJE7TXRWWYSAFO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KOSLHNRP3CGXJE7TXRWWYSAFO3","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":"d0b579c320b8dcc3b16cabb9e8ed31672b08107e11414d70aba25c833ea27e6e","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","title_canon_sha256":"09be205904d51021b92ab740141a18295286289dd351aa6203b8d7b532e4b4d5"},"schema_version":"1.0","source":{"id":"1207.2853","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2853","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2853v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2853","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOSLHNRP3CGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KOSLHNRP3CGXJE7T","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KOSLHNRP","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:99e279c5c92bf4959da7782dd2af470919161bfa0dad215ea3a184d3878b2d0a","target":"graph","created_at":"2026-05-18T03:28:17Z","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":"In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the original signal, compressed at a rate {\\alpha}, by using a message passing algorithm (Expectation Maximization Belief Propagation) that runs in a time linear in N. In the large N limit, the scheme proposed here closely approaches the theoretical bound {\\rho}0 = {\\alpha}, and so it is both optimal and efficient (linear time complexity). More generally, we show ","authors_text":"Federico Ricci-Tersenghi, Maria Chiara Angelini, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","title":"Compressed sensing with sparse, structured matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2853","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:1130ff39befa85f34991c505f5f03b656700df52ca8b9c5219aa05d9e1b10149","target":"record","created_at":"2026-05-18T03:28:17Z","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":"d0b579c320b8dcc3b16cabb9e8ed31672b08107e11414d70aba25c833ea27e6e","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-12T06:16:33Z","title_canon_sha256":"09be205904d51021b92ab740141a18295286289dd351aa6203b8d7b532e4b4d5"},"schema_version":"1.0","source":{"id":"1207.2853","kind":"arxiv","version":2}},"canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53a4b3b62fd88d7493f3bc6d6c480576eca06c98d789261f05a4ea6ea878f7a7","first_computed_at":"2026-05-18T03:28:17.461521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:17.461521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kItSc5UqAbzMJFU8yQiNfH2emOwUcIy0Shdly72pWyyWaaRrvwf9zFSBhqNSr2h8KgM0RJjaFGGgBXgvhGE8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:17.462353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2853","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1130ff39befa85f34991c505f5f03b656700df52ca8b9c5219aa05d9e1b10149","sha256:99e279c5c92bf4959da7782dd2af470919161bfa0dad215ea3a184d3878b2d0a"],"state_sha256":"669dcf655a3bd1654434c4fef185447843537424e680386c2672b7316b82cfdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3fP2U30QPR68gdSXb0npEZdWquMyx4jDELxqZ8PFISL0GwV0/+EVJJXHGkFeUzJdWzBR0fJLGVEkvtKGv90JCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:54:59.492300Z","bundle_sha256":"c9015c25dab54aaadf048904f40cd930ab365f3be43b39b09ebe5b66718ca06c"}}