{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UDYB6K6LK46W3K4ZBRASEJRGAI","short_pith_number":"pith:UDYB6K6L","schema_version":"1.0","canonical_sha256":"a0f01f2bcb573d6dab990c41222626020874a30d90c70d73a8be6c8c4bd0409a","source":{"kind":"arxiv","id":"1209.1064","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.1064","created_at":"2026-05-18T03:15:06.492514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1064v4","created_at":"2026-05-18T03:15:06.492514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1064","created_at":"2026-05-18T03:15:06.492514+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDYB6K6LK46W","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDYB6K6LK46W3K4Z","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDYB6K6L","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI","json":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI.json","graph_json":"https://pith.science/api/pith-number/UDYB6K6LK46W3K4ZBRASEJRGAI/graph.json","events_json":"https://pith.science/api/pith-number/UDYB6K6LK46W3K4ZBRASEJRGAI/events.json","paper":"https://pith.science/paper/UDYB6K6L"},"agent_actions":{"view_html":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI","download_json":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI.json","view_paper":"https://pith.science/paper/UDYB6K6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1064&json=true","fetch_graph":"https://pith.science/api/pith-number/UDYB6K6LK46W3K4ZBRASEJRGAI/graph.json","fetch_events":"https://pith.science/api/pith-number/UDYB6K6LK46W3K4ZBRASEJRGAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/action/storage_attestation","attest_author":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/action/author_attestation","sign_citation":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/action/citation_signature","submit_replication":"https://pith.science/pith/UDYB6K6LK46W3K4ZBRASEJRGAI/action/replication_record"}},"created_at":"2026-05-18T03:15:06.492514+00:00","updated_at":"2026-05-18T03:15:06.492514+00:00"}