{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UDYB6K6LK46W3K4ZBRASEJRGAI","short_pith_number":"pith:UDYB6K6L","canonical_record":{"source":{"id":"1209.1064","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-05T18:06:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"58769880e741edb19c539592617c86473e8f9554c1be1d21e811b0969cb0e256","abstract_canon_sha256":"290ff0b08acad2b3667f1cec5534e6c2649550a9639cf0b4c3261f6fadc36d0d"},"schema_version":"1.0"},"canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","source":{"kind":"arxiv","id":"1209.1064","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1064","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1064v4","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1064","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"UDYB6K6LK46W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UDYB6K6LK46W3K4Z","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UDYB6K6L","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UDYB6K6LK46W3K4ZBRASEJRGAI","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1064","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-05T18:06:29Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"58769880e741edb19c539592617c86473e8f9554c1be1d21e811b0969cb0e256","abstract_canon_sha256":"290ff0b08acad2b3667f1cec5534e6c2649550a9639cf0b4c3261f6fadc36d0d"},"schema_version":"1.0"},"canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.492995Z","signature_b64":"PsYNg2SQBVNPhE6FuYe/GOn+EF3hYMUA/IEBx31/vjv1WrAAPyrTya125bPY2Q1kzY4rV/5q1wyK3VJOBuH9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","last_reissued_at":"2026-05-18T03:15:06.492435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.492435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1064","source_version":4,"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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfzJppOHsQJInxfw11juwbGfCQW00EYHgfw5TyRhS4XB8u/Po06GhOPmXQbrUsOdlaa542KAj4UH30NbcOorAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:06:43.431885Z"},"content_sha256":"d5d3706e84e21d30012fd42130c0d5a205a7b98a08728840a095379e1985d904","schema_version":"1.0","event_id":"sha256:d5d3706e84e21d30012fd42130c0d5a205a7b98a08728840a095379e1985d904"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UDYB6K6LK46W3K4ZBRASEJRGAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Max-Product EM Algorithm for Reconstructing Markov-tree Sparse Signals from Compressive Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Aleksandar Dogandzic, Zhao Song","submitted_at":"2012-09-05T18:06:29Z","abstract_excerpt":"We propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation. The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum of an unknown approximately sparse signal and a zero-mean white Gaussian noise with an unknown variance. The signal is composed of large- and small-magnitude components identified by binary state variables whose probabilistic dependence structure is described by a Markov tree. Gaussian priors are assigned to the signal coefficients given their state variables"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1064","kind":"arxiv","version":4},"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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMe6RVJqjuPoafn/azuWSzPBMovEVmooHcil+VYbv+w5yjkuMEaBtPHeH9e0JNkmTnBd8HcLQNJ/HfemlYZHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:06:43.432226Z"},"content_sha256":"29559c19352bbff38280e201314e9f04a4c12db750e2c31f6b05d3d18685acc6","schema_version":"1.0","event_id":"sha256:29559c19352bbff38280e201314e9f04a4c12db750e2c31f6b05d3d18685acc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/bundle.json","state_url":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/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-02T05:06:43Z","links":{"resolver":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI","bundle":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/bundle.json","state":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UDYB6K6LK46W3K4ZBRASEJRGAI","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":"290ff0b08acad2b3667f1cec5534e6c2649550a9639cf0b4c3261f6fadc36d0d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-05T18:06:29Z","title_canon_sha256":"58769880e741edb19c539592617c86473e8f9554c1be1d21e811b0969cb0e256"},"schema_version":"1.0","source":{"id":"1209.1064","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1064","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1064v4","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1064","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"UDYB6K6LK46W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UDYB6K6LK46W3K4Z","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UDYB6K6L","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:29559c19352bbff38280e201314e9f04a4c12db750e2c31f6b05d3d18685acc6","target":"graph","created_at":"2026-05-18T03:15:06Z","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 propose a Bayesian expectation-maximization (EM) algorithm for reconstructing Markov-tree sparse signals via belief propagation. The measurements follow an underdetermined linear model where the regression-coefficient vector is the sum of an unknown approximately sparse signal and a zero-mean white Gaussian noise with an unknown variance. The signal is composed of large- and small-magnitude components identified by binary state variables whose probabilistic dependence structure is described by a Markov tree. Gaussian priors are assigned to the signal coefficients given their state variables","authors_text":"Aleksandar Dogandzic, Zhao Song","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-05T18:06:29Z","title":"A Max-Product EM Algorithm for Reconstructing Markov-tree Sparse Signals from Compressive Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1064","kind":"arxiv","version":4},"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:d5d3706e84e21d30012fd42130c0d5a205a7b98a08728840a095379e1985d904","target":"record","created_at":"2026-05-18T03:15:06Z","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":"290ff0b08acad2b3667f1cec5534e6c2649550a9639cf0b4c3261f6fadc36d0d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-05T18:06:29Z","title_canon_sha256":"58769880e741edb19c539592617c86473e8f9554c1be1d21e811b0969cb0e256"},"schema_version":"1.0","source":{"id":"1209.1064","kind":"arxiv","version":4}},"canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","first_computed_at":"2026-05-18T03:15:06.492435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:06.492435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PsYNg2SQBVNPhE6FuYe/GOn+EF3hYMUA/IEBx31/vjv1WrAAPyrTya125bPY2Q1kzY4rV/5q1wyK3VJOBuH9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:06.492995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1064","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5d3706e84e21d30012fd42130c0d5a205a7b98a08728840a095379e1985d904","sha256:29559c19352bbff38280e201314e9f04a4c12db750e2c31f6b05d3d18685acc6"],"state_sha256":"e299ccd460e04efad4e694c72076750b9e7204e781ecab3b988663608c22da91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2DE35kq3vScGKRL9JC1zWlLMLW3+XjrB9ViAAXZDpiwmlqvDiLnaHBuOM3K7fJH00B6stzaVt1JjQs5V6qWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:06:43.434109Z","bundle_sha256":"f36cf73fd572d4a73c2d232a9016e51c14d52fb71b3a20fafd2af6df16e5f1f4"}}