{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6A2G6M7GRHFYVTAHJDFP75UWX7","short_pith_number":"pith:6A2G6M7G","schema_version":"1.0","canonical_sha256":"f0346f33e689cb8acc0748cafff696bfe7073d9c25a570a2e26be059dd55d6f4","source":{"kind":"arxiv","id":"1207.4149","version":1},"attestation_state":"computed","paper":{"title":"From Fields to Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.CO","authors_text":"Firas Hamze, Nando de Freitas","submitted_at":"2012-07-11T14:56:43Z","abstract_excerpt":"We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demonstration purposes, we focus on Markov Random Fields (MRFs). By partitioning the MRFs into non-overlapping trees, it is possible to compute the posterior distribution of a particular tree exactly by conditioning on the remaining tree. These exact solutions allow us to construct efficient blocked and Rao-Blackwellised MCMC algorithms. We show empirically that tree sampling is considerably more efficient than other parti"},"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":"1207.4149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-07-11T14:56:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e5c0c921829522177579a37041ff75552d621bbf66cbab8c802359920ed9c794","abstract_canon_sha256":"85d24e276ac6c360ddca9f1d0605ccf6045ed3cd7c9e6f0203be48c18afca128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.646987Z","signature_b64":"/yxnocQyf6jRAsbqvS4Sq9+ZfoP78oiYtG6xVZ5JbL/OQx4bbq1Rdwsqn6L56oTAYsNXxbW5cSd3moZR4IWNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0346f33e689cb8acc0748cafff696bfe7073d9c25a570a2e26be059dd55d6f4","last_reissued_at":"2026-05-18T03:50:47.646379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.646379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Fields to Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.CO","authors_text":"Firas Hamze, Nando de Freitas","submitted_at":"2012-07-11T14:56:43Z","abstract_excerpt":"We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demonstration purposes, we focus on Markov Random Fields (MRFs). By partitioning the MRFs into non-overlapping trees, it is possible to compute the posterior distribution of a particular tree exactly by conditioning on the remaining tree. These exact solutions allow us to construct efficient blocked and Rao-Blackwellised MCMC algorithms. We show empirically that tree sampling is considerably more efficient than other parti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4149","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4149","created_at":"2026-05-18T03:50:47.646475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4149v1","created_at":"2026-05-18T03:50:47.646475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4149","created_at":"2026-05-18T03:50:47.646475+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A2G6M7GRHFY","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A2G6M7GRHFYVTAH","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A2G6M7G","created_at":"2026-05-18T12:26:56.085431+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/6A2G6M7GRHFYVTAHJDFP75UWX7","json":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7.json","graph_json":"https://pith.science/api/pith-number/6A2G6M7GRHFYVTAHJDFP75UWX7/graph.json","events_json":"https://pith.science/api/pith-number/6A2G6M7GRHFYVTAHJDFP75UWX7/events.json","paper":"https://pith.science/paper/6A2G6M7G"},"agent_actions":{"view_html":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7","download_json":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7.json","view_paper":"https://pith.science/paper/6A2G6M7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4149&json=true","fetch_graph":"https://pith.science/api/pith-number/6A2G6M7GRHFYVTAHJDFP75UWX7/graph.json","fetch_events":"https://pith.science/api/pith-number/6A2G6M7GRHFYVTAHJDFP75UWX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7/action/storage_attestation","attest_author":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7/action/author_attestation","sign_citation":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7/action/citation_signature","submit_replication":"https://pith.science/pith/6A2G6M7GRHFYVTAHJDFP75UWX7/action/replication_record"}},"created_at":"2026-05-18T03:50:47.646475+00:00","updated_at":"2026-05-18T03:50:47.646475+00:00"}