{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GNXNXBRVB43UJHSXJ7RYMICCQ7","short_pith_number":"pith:GNXNXBRV","schema_version":"1.0","canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","source":{"kind":"arxiv","id":"1602.04259","version":3},"attestation_state":"computed","paper":{"title":"A Minimalistic Approach to Sum-Product Network Learning for Real Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Moshe Looks, Viktoriya Krakovna","submitted_at":"2016-02-12T23:11:05Z","abstract_excerpt":"Sum-Product Networks (SPNs) are a class of expressive yet tractable hierarchical graphical models. LearnSPN is a structure learning algorithm for SPNs that uses hierarchical co-clustering to simultaneously identifying similar entities and similar features. The original LearnSPN algorithm assumes that all the variables are discrete and there is no missing data. We introduce a practical, simplified version of LearnSPN, MiniSPN, that runs faster and can handle missing data and heterogeneous features common in real applications. We demonstrate the performance of MiniSPN on standard benchmark datas"},"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":"1602.04259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-12T23:11:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"bb5d9501b21ec6c90efbc40a385aca0e9db025c8e3a23dcfa10cd2abb9126be6","abstract_canon_sha256":"1c36606d640fc88efd9ca86069c3ab66981836ebc9a0121186df3713ccad1a6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:24.283275Z","signature_b64":"9xQAvFJsx6nw7tcjaFjC36aBdT+metyMxRs/gTOU15FOnx1NZ+GsnG8JmC4zANegkoo73xNQJYLxdS4K2OGCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","last_reissued_at":"2026-05-18T01:16:24.282699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:24.282699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Minimalistic Approach to Sum-Product Network Learning for Real Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Moshe Looks, Viktoriya Krakovna","submitted_at":"2016-02-12T23:11:05Z","abstract_excerpt":"Sum-Product Networks (SPNs) are a class of expressive yet tractable hierarchical graphical models. LearnSPN is a structure learning algorithm for SPNs that uses hierarchical co-clustering to simultaneously identifying similar entities and similar features. The original LearnSPN algorithm assumes that all the variables are discrete and there is no missing data. We introduce a practical, simplified version of LearnSPN, MiniSPN, that runs faster and can handle missing data and heterogeneous features common in real applications. We demonstrate the performance of MiniSPN on standard benchmark datas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04259","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":"1602.04259","created_at":"2026-05-18T01:16:24.282771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04259v3","created_at":"2026-05-18T01:16:24.282771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04259","created_at":"2026-05-18T01:16:24.282771+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNXNXBRVB43U","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNXNXBRVB43UJHSX","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNXNXBRV","created_at":"2026-05-18T12:30:19.053100+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/GNXNXBRVB43UJHSXJ7RYMICCQ7","json":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7.json","graph_json":"https://pith.science/api/pith-number/GNXNXBRVB43UJHSXJ7RYMICCQ7/graph.json","events_json":"https://pith.science/api/pith-number/GNXNXBRVB43UJHSXJ7RYMICCQ7/events.json","paper":"https://pith.science/paper/GNXNXBRV"},"agent_actions":{"view_html":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7","download_json":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7.json","view_paper":"https://pith.science/paper/GNXNXBRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04259&json=true","fetch_graph":"https://pith.science/api/pith-number/GNXNXBRVB43UJHSXJ7RYMICCQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/GNXNXBRVB43UJHSXJ7RYMICCQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/action/storage_attestation","attest_author":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/action/author_attestation","sign_citation":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/action/citation_signature","submit_replication":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/action/replication_record"}},"created_at":"2026-05-18T01:16:24.282771+00:00","updated_at":"2026-05-18T01:16:24.282771+00:00"}