{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DAXH3JTQKYKOFMLUZUS2Q22Z7D","short_pith_number":"pith:DAXH3JTQ","canonical_record":{"source":{"id":"1408.3930","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a65fd69ad369567665a4728e81971eec7312dad0d8448fcd0b6b4287d643f210","abstract_canon_sha256":"eca58959befa726bdd4cfba403f2a8b24f0992cc17d4a6306793795f3eb9d3cf"},"schema_version":"1.0"},"canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","source":{"kind":"arxiv","id":"1408.3930","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3930","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3930v3","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3930","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"DAXH3JTQKYKO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAXH3JTQKYKOFMLU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAXH3JTQ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DAXH3JTQKYKOFMLUZUS2Q22Z7D","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3930","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a65fd69ad369567665a4728e81971eec7312dad0d8448fcd0b6b4287d643f210","abstract_canon_sha256":"eca58959befa726bdd4cfba403f2a8b24f0992cc17d4a6306793795f3eb9d3cf"},"schema_version":"1.0"},"canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:58.693587Z","signature_b64":"5310BWNYcvF3XNwOu1H/Y5+lUDjiVB7K/53DD2iigEV0fMWBDTVo3UE67QUI8lr0VAVE7rAPaDZQz93qlAfpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","last_reissued_at":"2026-05-18T01:33:58.693152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:58.693152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3930","source_version":3,"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-18T01:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LEybyzMdUaQb98PBJSnVQU04dsU+0f6XpBXvibFar9mMGBWYXYXi6A5Y70lzun/EdHoBm9qLDCaZI4ozG5vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:11:06.355805Z"},"content_sha256":"9af16f449f488a18fc8a26ccb7c93c55b19a8aa24f09e808fbcf98c00aa9152f","schema_version":"1.0","event_id":"sha256:9af16f449f488a18fc8a26ccb7c93c55b19a8aa24f09e808fbcf98c00aa9152f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DAXH3JTQKYKOFMLUZUS2Q22Z7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bernoulli-Gaussian Approximate Message-Passing Algorithm for Compressed Sensing with 1D-Finite-Difference Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Heung-No Lee, Hyoyoung Jung, Jaewook Kang, Kiseon Kim","submitted_at":"2014-08-18T08:38:46Z","abstract_excerpt":"This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is low-computational with its fast convergence and cheap per-iteration cost, providing phase transition nearly approaching to the state-of-the-art. The proposed algorithm is originated from a sum-product message-passing rule, applying a Bernoulli-Gaussian (BG) prior, seeking an MMSE solution. The algorithm construction includes not only the conventional AMP technique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3930","kind":"arxiv","version":3},"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-18T01:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPWMhEjQSPxzRE4DNw4sTQI25HzXiHkApnNgOTBNpLWHTNpvPSIFo/Bw+DbjgN3l8ZUaw8mJNf8ftdXryd+zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:11:06.356143Z"},"content_sha256":"ec31c1324e93390c3ee4956c29f86b6292cc3cf31f5c8a4c90254d8e50ead409","schema_version":"1.0","event_id":"sha256:ec31c1324e93390c3ee4956c29f86b6292cc3cf31f5c8a4c90254d8e50ead409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/bundle.json","state_url":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/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-05T12:11:06Z","links":{"resolver":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D","bundle":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/bundle.json","state":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DAXH3JTQKYKOFMLUZUS2Q22Z7D","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":"eca58959befa726bdd4cfba403f2a8b24f0992cc17d4a6306793795f3eb9d3cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","title_canon_sha256":"a65fd69ad369567665a4728e81971eec7312dad0d8448fcd0b6b4287d643f210"},"schema_version":"1.0","source":{"id":"1408.3930","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3930","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3930v3","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3930","created_at":"2026-05-18T01:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"DAXH3JTQKYKO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAXH3JTQKYKOFMLU","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAXH3JTQ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:ec31c1324e93390c3ee4956c29f86b6292cc3cf31f5c8a4c90254d8e50ead409","target":"graph","created_at":"2026-05-18T01:33:58Z","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":"This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is low-computational with its fast convergence and cheap per-iteration cost, providing phase transition nearly approaching to the state-of-the-art. The proposed algorithm is originated from a sum-product message-passing rule, applying a Bernoulli-Gaussian (BG) prior, seeking an MMSE solution. The algorithm construction includes not only the conventional AMP technique ","authors_text":"Heung-No Lee, Hyoyoung Jung, Jaewook Kang, Kiseon Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","title":"Bernoulli-Gaussian Approximate Message-Passing Algorithm for Compressed Sensing with 1D-Finite-Difference Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3930","kind":"arxiv","version":3},"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:9af16f449f488a18fc8a26ccb7c93c55b19a8aa24f09e808fbcf98c00aa9152f","target":"record","created_at":"2026-05-18T01:33:58Z","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":"eca58959befa726bdd4cfba403f2a8b24f0992cc17d4a6306793795f3eb9d3cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","title_canon_sha256":"a65fd69ad369567665a4728e81971eec7312dad0d8448fcd0b6b4287d643f210"},"schema_version":"1.0","source":{"id":"1408.3930","kind":"arxiv","version":3}},"canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","first_computed_at":"2026-05-18T01:33:58.693152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:58.693152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5310BWNYcvF3XNwOu1H/Y5+lUDjiVB7K/53DD2iigEV0fMWBDTVo3UE67QUI8lr0VAVE7rAPaDZQz93qlAfpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:58.693587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3930","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9af16f449f488a18fc8a26ccb7c93c55b19a8aa24f09e808fbcf98c00aa9152f","sha256:ec31c1324e93390c3ee4956c29f86b6292cc3cf31f5c8a4c90254d8e50ead409"],"state_sha256":"6ed5ff882719c15592c31cf06cd8d59ebcc3786450e4036d96f16336147e30da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTQ282h3qfLIRTjaA9hfrYxUJgvBCECzpOYEzlB8YRrSrhiX/cDdnGMc+zK+3CuXSb5ujE/XWgDDiMvdJG2ZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:11:06.358107Z","bundle_sha256":"1b4bfc93f46191acc9da972fb044da40da463fe03354c09e62fefdee03609243"}}