{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7REUTWLFFRAVBQUFOHPJNVSRR4","short_pith_number":"pith:7REUTWLF","canonical_record":{"source":{"id":"1507.02764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:48:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20a0470632215ce13b1a4aa2517e55985f25cc8891ef786003e84842fe7233cc","abstract_canon_sha256":"d021a10128c6a7a049226d380df8472049718b0a34fbdd297f031b18b6c2a199"},"schema_version":"1.0"},"canonical_sha256":"fc4949d9652c4150c28571de96d6518f09f2099d63a8fb4abb88950ae7ce706a","source":{"kind":"arxiv","id":"1507.02764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02764","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02764v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02764","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"7REUTWLFFRAV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7REUTWLFFRAVBQUF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7REUTWLF","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7REUTWLFFRAVBQUFOHPJNVSRR4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:48:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"20a0470632215ce13b1a4aa2517e55985f25cc8891ef786003e84842fe7233cc","abstract_canon_sha256":"d021a10128c6a7a049226d380df8472049718b0a34fbdd297f031b18b6c2a199"},"schema_version":"1.0"},"canonical_sha256":"fc4949d9652c4150c28571de96d6518f09f2099d63a8fb4abb88950ae7ce706a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.248119Z","signature_b64":"uOTzLCXqHL2oyCNsjNXZBbzbX/DwYSziZ5MIgDze4KaV8z8KtWH9Ho0KVJge4NMk7phXUlxh0+t69Fb5367zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4949d9652c4150c28571de96d6518f09f2099d63a8fb4abb88950ae7ce706a","last_reissued_at":"2026-05-18T01:37:03.247686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.247686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02764","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEhwi8xRboFmHHsFFMKPG+eXEVfriuzJg/iwSrew8rYZM9gVzNFgn1ntYHIlcBKE0TBmYz7UIOcLU0AG6GFWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:40:03.915788Z"},"content_sha256":"05600373d257e5edd0ab16744db7414d356a1a778e59c200a1499b3e4cc7cf24","schema_version":"1.0","event_id":"sha256:05600373d257e5edd0ab16744db7414d356a1a778e59c200a1499b3e4cc7cf24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7REUTWLFFRAVBQUFOHPJNVSRR4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Signal Separation of 2D Sparse Mixture via Approximate Message-Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hyoyoung Jung, Jaewook Kang, Kiseon Kim","submitted_at":"2015-07-10T01:48:54Z","abstract_excerpt":"Approximate message-passing (AMP) method is a simple and efficient framework for the linear inverse problems. In this letter, we propose a faster AMP to solve the \\emph{$L_1$-Split-Analysis} for the 2D sparsity separation, which is referred to as \\emph{MixAMP}. We develop the MixAMP based on the factor graphical modeling and the min-sum message-passing. Then, we examine MixAMP for two types of the sparsity separation: separation of the direct-and-group sparsity, and that of the direct-and-finite-difference sparsity. This case study shows that the MixAMP method offers computational advantages o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02764","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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbjyLHihHGMwIQ8IP5Rk2soITKpqLzQ45Em+W+TwfXa4ilcHmuefqNkhBRQidRRK+gFWkSK2ZiKhWxaOa7TJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:40:03.916361Z"},"content_sha256":"320e4ee0c8eeb85aab04a649247774a304a86945561f9e12d10256cdb7616d2a","schema_version":"1.0","event_id":"sha256:320e4ee0c8eeb85aab04a649247774a304a86945561f9e12d10256cdb7616d2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/bundle.json","state_url":"https://pith.science/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/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-05T19:40:03Z","links":{"resolver":"https://pith.science/pith/7REUTWLFFRAVBQUFOHPJNVSRR4","bundle":"https://pith.science/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/bundle.json","state":"https://pith.science/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7REUTWLFFRAVBQUFOHPJNVSRR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7REUTWLFFRAVBQUFOHPJNVSRR4","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":"d021a10128c6a7a049226d380df8472049718b0a34fbdd297f031b18b6c2a199","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:48:54Z","title_canon_sha256":"20a0470632215ce13b1a4aa2517e55985f25cc8891ef786003e84842fe7233cc"},"schema_version":"1.0","source":{"id":"1507.02764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02764","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02764v1","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02764","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"7REUTWLFFRAV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7REUTWLFFRAVBQUF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7REUTWLF","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:320e4ee0c8eeb85aab04a649247774a304a86945561f9e12d10256cdb7616d2a","target":"graph","created_at":"2026-05-18T01:37:03Z","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":"Approximate message-passing (AMP) method is a simple and efficient framework for the linear inverse problems. In this letter, we propose a faster AMP to solve the \\emph{$L_1$-Split-Analysis} for the 2D sparsity separation, which is referred to as \\emph{MixAMP}. We develop the MixAMP based on the factor graphical modeling and the min-sum message-passing. Then, we examine MixAMP for two types of the sparsity separation: separation of the direct-and-group sparsity, and that of the direct-and-finite-difference sparsity. This case study shows that the MixAMP method offers computational advantages o","authors_text":"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":"2015-07-10T01:48:54Z","title":"Fast Signal Separation of 2D Sparse Mixture via Approximate Message-Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02764","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:05600373d257e5edd0ab16744db7414d356a1a778e59c200a1499b3e4cc7cf24","target":"record","created_at":"2026-05-18T01:37:03Z","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":"d021a10128c6a7a049226d380df8472049718b0a34fbdd297f031b18b6c2a199","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-10T01:48:54Z","title_canon_sha256":"20a0470632215ce13b1a4aa2517e55985f25cc8891ef786003e84842fe7233cc"},"schema_version":"1.0","source":{"id":"1507.02764","kind":"arxiv","version":1}},"canonical_sha256":"fc4949d9652c4150c28571de96d6518f09f2099d63a8fb4abb88950ae7ce706a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4949d9652c4150c28571de96d6518f09f2099d63a8fb4abb88950ae7ce706a","first_computed_at":"2026-05-18T01:37:03.247686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.247686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uOTzLCXqHL2oyCNsjNXZBbzbX/DwYSziZ5MIgDze4KaV8z8KtWH9Ho0KVJge4NMk7phXUlxh0+t69Fb5367zBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.248119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05600373d257e5edd0ab16744db7414d356a1a778e59c200a1499b3e4cc7cf24","sha256:320e4ee0c8eeb85aab04a649247774a304a86945561f9e12d10256cdb7616d2a"],"state_sha256":"ca06ea7a488a30adacf92a09c7e123f2247f8c28421d70c894bda0954a8c8010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uf/ZjWZizatPlUu1ObEHCEBz3ALL7b/9qtjTVQ52PUwdm+DAFWjyTTbg2AnV4BLojbcmY/jc6VPlNxmut6bOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:40:03.922838Z","bundle_sha256":"e0846331a8e5eeef0e66f3f6de8ea94254f946654defd87bc74515012d85202d"}}