{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35C3ND7Y75MNOOEQNOY7COYLIC","short_pith_number":"pith:35C3ND7Y","schema_version":"1.0","canonical_sha256":"df45b68ff8ff58d738906bb1f13b0b409ce0c47640c487225323a31680b048c3","source":{"kind":"arxiv","id":"1604.07243","version":3},"attestation_state":"computed","paper":{"title":"Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christoph Schn\\\"orr, Mattia Desana","submitted_at":"2016-04-25T13:22:55Z","abstract_excerpt":"Sum-Product Networks with complex probability distribution at the leaves have been shown to be powerful tractable-inference probabilistic models. However, while learning the internal parameters has been amply studied, learning complex leaf distribution is an open problem with only few results available in special cases. In this paper we derive an efficient method to learn a very large class of leaf distributions with Expectation-Maximization. The EM updates have the form of simple weighted maximum likelihood problems, allowing to use any distribution that can be learned with maximum likelihood"},"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":"1604.07243","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-25T13:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"a15609df9b87e093a42f1d4aa88ef6148eac425d2aa6cfc291ced0e0d163c5a2","abstract_canon_sha256":"1ae00bf6238c2b28f656ab18320a4f65befb4f3bbc6062a88a736e892e636fdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.941654Z","signature_b64":"0srjSnrOEUPLnWhBx6gUMiVV8dW+ieTluFvPZ+b05Yv3CQF4Uj27TDR0T3vY6EaOohDRlBCjPG8j7AQCuhFiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df45b68ff8ff58d738906bb1f13b0b409ce0c47640c487225323a31680b048c3","last_reissued_at":"2026-05-18T00:42:23.941010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.941010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Christoph Schn\\\"orr, Mattia Desana","submitted_at":"2016-04-25T13:22:55Z","abstract_excerpt":"Sum-Product Networks with complex probability distribution at the leaves have been shown to be powerful tractable-inference probabilistic models. However, while learning the internal parameters has been amply studied, learning complex leaf distribution is an open problem with only few results available in special cases. In this paper we derive an efficient method to learn a very large class of leaf distributions with Expectation-Maximization. The EM updates have the form of simple weighted maximum likelihood problems, allowing to use any distribution that can be learned with maximum likelihood"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07243","kind":"arxiv","version":3},"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":"1604.07243","created_at":"2026-05-18T00:42:23.941098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07243v3","created_at":"2026-05-18T00:42:23.941098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07243","created_at":"2026-05-18T00:42:23.941098+00:00"},{"alias_kind":"pith_short_12","alias_value":"35C3ND7Y75MN","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35C3ND7Y75MNOOEQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35C3ND7Y","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.12869","citing_title":"A Compositional Theory of Curvature in Probabilistic Circuits","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC","json":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC.json","graph_json":"https://pith.science/api/pith-number/35C3ND7Y75MNOOEQNOY7COYLIC/graph.json","events_json":"https://pith.science/api/pith-number/35C3ND7Y75MNOOEQNOY7COYLIC/events.json","paper":"https://pith.science/paper/35C3ND7Y"},"agent_actions":{"view_html":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC","download_json":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC.json","view_paper":"https://pith.science/paper/35C3ND7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07243&json=true","fetch_graph":"https://pith.science/api/pith-number/35C3ND7Y75MNOOEQNOY7COYLIC/graph.json","fetch_events":"https://pith.science/api/pith-number/35C3ND7Y75MNOOEQNOY7COYLIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC/action/storage_attestation","attest_author":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC/action/author_attestation","sign_citation":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC/action/citation_signature","submit_replication":"https://pith.science/pith/35C3ND7Y75MNOOEQNOY7COYLIC/action/replication_record"}},"created_at":"2026-05-18T00:42:23.941098+00:00","updated_at":"2026-05-18T00:42:23.941098+00:00"}