{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GNXNXBRVB43UJHSXJ7RYMICCQ7","short_pith_number":"pith:GNXNXBRV","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"},"canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","source":{"kind":"arxiv","id":"1602.04259","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04259","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04259v3","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04259","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"GNXNXBRVB43U","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GNXNXBRVB43UJHSX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GNXNXBRV","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GNXNXBRVB43UJHSXJ7RYMICCQ7","target":"record","payload":{"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"},"canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","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"},"source_kind":"arxiv","source_id":"1602.04259","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQHk/Pnb0iT262FihXehNDU8xyVEG33lQL5QERbottkXXq4mL7yGFI2zI88RxXHEM0tUxpa+Png9yC6EP7vVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:06:14.980632Z"},"content_sha256":"b1b2325d673b436fcf976dd423ecb3a21dac9e900deb58589cedbdd658b2c435","schema_version":"1.0","event_id":"sha256:b1b2325d673b436fcf976dd423ecb3a21dac9e900deb58589cedbdd658b2c435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GNXNXBRVB43UJHSXJ7RYMICCQ7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zt848eGEoDvWkk12JA5V3NvXoS6UH3Gp4W2YP/NAJfgblw/2Rw+OeDcHdr5OKba+xHtqEYkTwW4iDIUquQlGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:06:14.980976Z"},"content_sha256":"7c9f2684dd77de9f7d7b88d62db973b3ac7806a0fd206c0efa826e93ff8e3231","schema_version":"1.0","event_id":"sha256:7c9f2684dd77de9f7d7b88d62db973b3ac7806a0fd206c0efa826e93ff8e3231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/bundle.json","state_url":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T19:06:14Z","links":{"resolver":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7","bundle":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/bundle.json","state":"https://pith.science/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNXNXBRVB43UJHSXJ7RYMICCQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GNXNXBRVB43UJHSXJ7RYMICCQ7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c36606d640fc88efd9ca86069c3ab66981836ebc9a0121186df3713ccad1a6a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-12T23:11:05Z","title_canon_sha256":"bb5d9501b21ec6c90efbc40a385aca0e9db025c8e3a23dcfa10cd2abb9126be6"},"schema_version":"1.0","source":{"id":"1602.04259","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04259","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04259v3","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04259","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"GNXNXBRVB43U","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GNXNXBRVB43UJHSX","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GNXNXBRV","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:7c9f2684dd77de9f7d7b88d62db973b3ac7806a0fd206c0efa826e93ff8e3231","target":"graph","created_at":"2026-05-18T01:16:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Moshe Looks, Viktoriya Krakovna","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-12T23:11:05Z","title":"A Minimalistic Approach to Sum-Product Network Learning for Real Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04259","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b1b2325d673b436fcf976dd423ecb3a21dac9e900deb58589cedbdd658b2c435","target":"record","created_at":"2026-05-18T01:16:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1c36606d640fc88efd9ca86069c3ab66981836ebc9a0121186df3713ccad1a6a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-12T23:11:05Z","title_canon_sha256":"bb5d9501b21ec6c90efbc40a385aca0e9db025c8e3a23dcfa10cd2abb9126be6"},"schema_version":"1.0","source":{"id":"1602.04259","kind":"arxiv","version":3}},"canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"336edb86350f37449e574fe386204287e7c1682e8b17c4a19e1465061019e7c9","first_computed_at":"2026-05-18T01:16:24.282699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:24.282699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9xQAvFJsx6nw7tcjaFjC36aBdT+metyMxRs/gTOU15FOnx1NZ+GsnG8JmC4zANegkoo73xNQJYLxdS4K2OGCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:24.283275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04259","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1b2325d673b436fcf976dd423ecb3a21dac9e900deb58589cedbdd658b2c435","sha256:7c9f2684dd77de9f7d7b88d62db973b3ac7806a0fd206c0efa826e93ff8e3231"],"state_sha256":"1ee851817547aba916dd63ea6c9b67c9738e6b6331f06412fb65030689e4e70d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KC9uE3KUrY6VxgdZ/i9aNG4+GkUP94+sfEhQOHy85uWW5YqF18QGTZBdSSeD1L11hPWq5RiXwzp3DEre9kb0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:06:14.982868Z","bundle_sha256":"a404accffaa132e14f863ab62aab0a6e44c1346904fae31b58997471ea21cd60"}}