{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:J34QQFOGURCFME5MQJNPKRK5UL","short_pith_number":"pith:J34QQFOG","canonical_record":{"source":{"id":"1206.3953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-18T14:41:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b245d7251f0efcfca48ab1b6d8fc1c71ac0ce115eadb8fad2d97d15b9d85b9e8","abstract_canon_sha256":"60f1f094fa9a89187925cef11ac83d900de02496918c2e601e65a777235eb5c8"},"schema_version":"1.0"},"canonical_sha256":"4ef90815c6a4445613ac825af5455da2d27fa3acb912702a1c09f3b356989f23","source":{"kind":"arxiv","id":"1206.3953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3953","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3953v1","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3953","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"J34QQFOGURCF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J34QQFOGURCFME5M","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J34QQFOG","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:J34QQFOGURCFME5MQJNPKRK5UL","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-18T14:41:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b245d7251f0efcfca48ab1b6d8fc1c71ac0ce115eadb8fad2d97d15b9d85b9e8","abstract_canon_sha256":"60f1f094fa9a89187925cef11ac83d900de02496918c2e601e65a777235eb5c8"},"schema_version":"1.0"},"canonical_sha256":"4ef90815c6a4445613ac825af5455da2d27fa3acb912702a1c09f3b356989f23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:35.275398Z","signature_b64":"NgGfgf7MbsQbf6bR2SU/imgGE0Pdib4xOrdlFlgQqh2m03OiS+1LXdLEb1jFvbLVw5B4t/AME27X7mhVk9BYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef90815c6a4445613ac825af5455da2d27fa3acb912702a1c09f3b356989f23","last_reissued_at":"2026-05-18T03:48:35.274871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:35.274871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3953","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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAcpLYPaacKsjHWDRz3v+CsRQmWM6mNWKOxY+6suJBViEZ0v28zPZflLiSdOJqG55GywcP+kVGs6ijuHgtQaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:04:39.013434Z"},"content_sha256":"06cd93a77c300d0c69784f1ca2cb8e4e1f5095318dfcc525ba75694100c94ced","schema_version":"1.0","event_id":"sha256:06cd93a77c300d0c69784f1ca2cb8e4e1f5095318dfcc525ba75694100c94ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:J34QQFOGURCFME5MQJNPKRK5UL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cond-mat.stat-mech","authors_text":"Florent Krzakala, Fran\\c{c}ois Sausset, Lenka Zdeborov\\'a, Marc M\\'ezard, Yifan Sun","submitted_at":"2012-06-18T14:41:52Z","abstract_excerpt":"Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement protocols in a wide range of applications. Using an interdisciplinary approach, we have recently proposed in [arXiv:1109.4424] a strategy that allows compressed sensing to be performed at acquisition rates approaching to the theoretical optimal limits. In this paper, we give a more thorough presentation of our approach, and introduce many new results. We pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3953","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-18T03:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIQLV8zOQtk1X/IvNrLRfguEuHeqBGWPettB2NA16zJBqrA4Tz6W+hNMx/Xii734qwZzvC8TOs9cVOSYu6nyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:04:39.014134Z"},"content_sha256":"2b73912727553c64dcdb463fba78b7d271620e25a13fcdaab96c3599fb6669a6","schema_version":"1.0","event_id":"sha256:2b73912727553c64dcdb463fba78b7d271620e25a13fcdaab96c3599fb6669a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J34QQFOGURCFME5MQJNPKRK5UL/bundle.json","state_url":"https://pith.science/pith/J34QQFOGURCFME5MQJNPKRK5UL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J34QQFOGURCFME5MQJNPKRK5UL/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-06-08T17:04:39Z","links":{"resolver":"https://pith.science/pith/J34QQFOGURCFME5MQJNPKRK5UL","bundle":"https://pith.science/pith/J34QQFOGURCFME5MQJNPKRK5UL/bundle.json","state":"https://pith.science/pith/J34QQFOGURCFME5MQJNPKRK5UL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J34QQFOGURCFME5MQJNPKRK5UL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J34QQFOGURCFME5MQJNPKRK5UL","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":"60f1f094fa9a89187925cef11ac83d900de02496918c2e601e65a777235eb5c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-18T14:41:52Z","title_canon_sha256":"b245d7251f0efcfca48ab1b6d8fc1c71ac0ce115eadb8fad2d97d15b9d85b9e8"},"schema_version":"1.0","source":{"id":"1206.3953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3953","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3953v1","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3953","created_at":"2026-05-18T03:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"J34QQFOGURCF","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J34QQFOGURCFME5M","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J34QQFOG","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:2b73912727553c64dcdb463fba78b7d271620e25a13fcdaab96c3599fb6669a6","target":"graph","created_at":"2026-05-18T03:48:35Z","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":"Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement protocols in a wide range of applications. Using an interdisciplinary approach, we have recently proposed in [arXiv:1109.4424] a strategy that allows compressed sensing to be performed at acquisition rates approaching to the theoretical optimal limits. In this paper, we give a more thorough presentation of our approach, and introduce many new results. We pre","authors_text":"Florent Krzakala, Fran\\c{c}ois Sausset, Lenka Zdeborov\\'a, Marc M\\'ezard, Yifan Sun","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-18T14:41:52Z","title":"Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3953","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:06cd93a77c300d0c69784f1ca2cb8e4e1f5095318dfcc525ba75694100c94ced","target":"record","created_at":"2026-05-18T03:48:35Z","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":"60f1f094fa9a89187925cef11ac83d900de02496918c2e601e65a777235eb5c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-18T14:41:52Z","title_canon_sha256":"b245d7251f0efcfca48ab1b6d8fc1c71ac0ce115eadb8fad2d97d15b9d85b9e8"},"schema_version":"1.0","source":{"id":"1206.3953","kind":"arxiv","version":1}},"canonical_sha256":"4ef90815c6a4445613ac825af5455da2d27fa3acb912702a1c09f3b356989f23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef90815c6a4445613ac825af5455da2d27fa3acb912702a1c09f3b356989f23","first_computed_at":"2026-05-18T03:48:35.274871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:35.274871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NgGfgf7MbsQbf6bR2SU/imgGE0Pdib4xOrdlFlgQqh2m03OiS+1LXdLEb1jFvbLVw5B4t/AME27X7mhVk9BYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:35.275398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06cd93a77c300d0c69784f1ca2cb8e4e1f5095318dfcc525ba75694100c94ced","sha256:2b73912727553c64dcdb463fba78b7d271620e25a13fcdaab96c3599fb6669a6"],"state_sha256":"25793981cbc0a9839d6911473fda2a225e8e78db3d2f018946ded54133ae5e29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z5+tiU+yQC8heAEuFxwsawa8Jxd83FG2FlsPEPRYuiAXUiAsvUb1PznNacLNENLYAb92jk8UVu8HOhevMvoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:04:39.017685Z","bundle_sha256":"7fb6d18c5ea384181d56b8a7c39ece4facd4ca783958aab2a6e3c35d3b3364e4"}}