{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KO7DX7NDWVA2YOL6QZPGWEDXA5","short_pith_number":"pith:KO7DX7ND","schema_version":"1.0","canonical_sha256":"53be3bfda3b541ac397e865e6b1077077cdfc937f36b35e546d5c5c3b737d0c4","source":{"kind":"arxiv","id":"1303.1499","version":1},"attestation_state":"computed","paper":{"title":"Using Tree-Decomposable Structures to Approximate Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sumit Sarkar","submitted_at":"2013-03-06T14:22:41Z","abstract_excerpt":"Tree structures have been shown to provide an efficient framework for propagating beliefs [Pearl,1986].  This paper studies the problem of finding an optimal approximating tree.  The star decomposition scheme for sets of three binary variables [Lazarsfeld,1966; Pearl,1986] is shown to enhance the class of probability distributions that can support tree structures; such structures are called tree-decomposable structures.  The logarithm scoring rule is found to be an appropriate optimality criterion to evaluate different tree-decomposable structures.  Characteristics of such structures closest t"},"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":"1303.1499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"c869c15c78e075766fde0b24734e35173222e169070e8582ab2dd34c18d86106","abstract_canon_sha256":"7d9dfcb9b29a1947fb1597055ee31899eeb4a101936895b41ded3187cbe24242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.532506Z","signature_b64":"JJwm1AFJ7EXfTyHxbKYJ9Y2GFVMk3uQ6JkEYB1K4TW3z5lXjN3K98icU0bNGpIzaZpwMLRtj7PToJ07fnmzMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53be3bfda3b541ac397e865e6b1077077cdfc937f36b35e546d5c5c3b737d0c4","last_reissued_at":"2026-05-18T03:31:42.532017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.532017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Tree-Decomposable Structures to Approximate Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sumit Sarkar","submitted_at":"2013-03-06T14:22:41Z","abstract_excerpt":"Tree structures have been shown to provide an efficient framework for propagating beliefs [Pearl,1986].  This paper studies the problem of finding an optimal approximating tree.  The star decomposition scheme for sets of three binary variables [Lazarsfeld,1966; Pearl,1986] is shown to enhance the class of probability distributions that can support tree structures; such structures are called tree-decomposable structures.  The logarithm scoring rule is found to be an appropriate optimality criterion to evaluate different tree-decomposable structures.  Characteristics of such structures closest t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1499","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":"1303.1499","created_at":"2026-05-18T03:31:42.532081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1499v1","created_at":"2026-05-18T03:31:42.532081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1499","created_at":"2026-05-18T03:31:42.532081+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO7DX7NDWVA2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO7DX7NDWVA2YOL6","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO7DX7ND","created_at":"2026-05-18T12:27:51.066281+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/KO7DX7NDWVA2YOL6QZPGWEDXA5","json":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5.json","graph_json":"https://pith.science/api/pith-number/KO7DX7NDWVA2YOL6QZPGWEDXA5/graph.json","events_json":"https://pith.science/api/pith-number/KO7DX7NDWVA2YOL6QZPGWEDXA5/events.json","paper":"https://pith.science/paper/KO7DX7ND"},"agent_actions":{"view_html":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5","download_json":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5.json","view_paper":"https://pith.science/paper/KO7DX7ND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1499&json=true","fetch_graph":"https://pith.science/api/pith-number/KO7DX7NDWVA2YOL6QZPGWEDXA5/graph.json","fetch_events":"https://pith.science/api/pith-number/KO7DX7NDWVA2YOL6QZPGWEDXA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5/action/storage_attestation","attest_author":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5/action/author_attestation","sign_citation":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5/action/citation_signature","submit_replication":"https://pith.science/pith/KO7DX7NDWVA2YOL6QZPGWEDXA5/action/replication_record"}},"created_at":"2026-05-18T03:31:42.532081+00:00","updated_at":"2026-05-18T03:31:42.532081+00:00"}