{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YRWYTK3GHO4UDTC5GB6PRG32WB","short_pith_number":"pith:YRWYTK3G","schema_version":"1.0","canonical_sha256":"c46d89ab663bb941cc5d307cf89b7ab055c48218ea0696c19a6046d346fae162","source":{"kind":"arxiv","id":"1411.7717","version":3},"attestation_state":"computed","paper":{"title":"On the Expressive Efficiency of Sum Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"James Martens, Venkatesh Medabalimi","submitted_at":"2014-11-27T23:02:41Z","abstract_excerpt":"Sum Product Networks (SPNs) are a recently developed class of deep generative models which compute their associated unnormalized density functions using a special type of arithmetic circuit. When certain sufficient conditions, called the decomposability and completeness conditions (or \"D&C\" conditions), are imposed on the structure of these circuits, marginal densities and other useful quantities, which are typically intractable for other deep generative models, can be computed by what amounts to a single evaluation of the network (which is a property known as \"validity\"). However, the effect "},"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":"1411.7717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-27T23:02:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"96faa6e75d25e81d07a3527927eb02f03c5822dc8928941ad26f77ed09701297","abstract_canon_sha256":"e0224079944cfa8e979d8d6e41541552588638a4e4ba9ff2a6499cba2fbd73f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:53.718921Z","signature_b64":"JxQiUjj2PewfbK8w4ejWRufPklybdJvbRi7s7QdjCH5iKry51G/b5GaemoTABk5ojZpAtL5Bl/6KJDRJkUUfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46d89ab663bb941cc5d307cf89b7ab055c48218ea0696c19a6046d346fae162","last_reissued_at":"2026-05-18T02:28:53.718568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:53.718568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Expressive Efficiency of Sum Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"James Martens, Venkatesh Medabalimi","submitted_at":"2014-11-27T23:02:41Z","abstract_excerpt":"Sum Product Networks (SPNs) are a recently developed class of deep generative models which compute their associated unnormalized density functions using a special type of arithmetic circuit. When certain sufficient conditions, called the decomposability and completeness conditions (or \"D&C\" conditions), are imposed on the structure of these circuits, marginal densities and other useful quantities, which are typically intractable for other deep generative models, can be computed by what amounts to a single evaluation of the network (which is a property known as \"validity\"). However, the effect "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7717","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":"1411.7717","created_at":"2026-05-18T02:28:53.718625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7717v3","created_at":"2026-05-18T02:28:53.718625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7717","created_at":"2026-05-18T02:28:53.718625+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRWYTK3GHO4U","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRWYTK3GHO4UDTC5","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRWYTK3G","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12940","citing_title":"The Expressivity Boundary of Probabilistic Circuits: A Comparison with Large Language Models","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB","json":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB.json","graph_json":"https://pith.science/api/pith-number/YRWYTK3GHO4UDTC5GB6PRG32WB/graph.json","events_json":"https://pith.science/api/pith-number/YRWYTK3GHO4UDTC5GB6PRG32WB/events.json","paper":"https://pith.science/paper/YRWYTK3G"},"agent_actions":{"view_html":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB","download_json":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB.json","view_paper":"https://pith.science/paper/YRWYTK3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7717&json=true","fetch_graph":"https://pith.science/api/pith-number/YRWYTK3GHO4UDTC5GB6PRG32WB/graph.json","fetch_events":"https://pith.science/api/pith-number/YRWYTK3GHO4UDTC5GB6PRG32WB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB/action/storage_attestation","attest_author":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB/action/author_attestation","sign_citation":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB/action/citation_signature","submit_replication":"https://pith.science/pith/YRWYTK3GHO4UDTC5GB6PRG32WB/action/replication_record"}},"created_at":"2026-05-18T02:28:53.718625+00:00","updated_at":"2026-05-18T02:28:53.718625+00:00"}