{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5WWT72QC6DS3OE7T4HE7WNU3GE","short_pith_number":"pith:5WWT72QC","canonical_record":{"source":{"id":"1701.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T00:42:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68f7a8ef5cba3d737d21419948b7302c679161b6be0c697595f9c2a2c29291df","abstract_canon_sha256":"08b19422d061854a526f6bb9f2b96d9f012267a2355bc8b748492b2edbe336d5"},"schema_version":"1.0"},"canonical_sha256":"edad3fea02f0e5b713f3e1c9fb369b311221b6bea6142580c8aefbfd695b471d","source":{"kind":"arxiv","id":"1701.05265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05265","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05265v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05265","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"5WWT72QC6DS3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5WWT72QC6DS3OE7T","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5WWT72QC","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5WWT72QC6DS3OE7T4HE7WNU3GE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T00:42:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68f7a8ef5cba3d737d21419948b7302c679161b6be0c697595f9c2a2c29291df","abstract_canon_sha256":"08b19422d061854a526f6bb9f2b96d9f012267a2355bc8b748492b2edbe336d5"},"schema_version":"1.0"},"canonical_sha256":"edad3fea02f0e5b713f3e1c9fb369b311221b6bea6142580c8aefbfd695b471d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.398645Z","signature_b64":"CUiVFR/dhfYQ1rZRqumEUuTj+lBs/wDO4J808R6FcAGzDGukbPwft2Xd2f46z6iDJMc89cUrgl4C45lUfosGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edad3fea02f0e5b713f3e1c9fb369b311221b6bea6142580c8aefbfd695b471d","last_reissued_at":"2026-05-18T00:52:30.398044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.398044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05265","source_version":1,"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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/H+MCdB7akLkZYgYS/hzNSLa7qKd8QIKtl7MA8l/cVX02vK1NWNBQmgfADtDijUX8G9QusQXqDqBJB0Zu2VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:30:37.699606Z"},"content_sha256":"72d23c7fafd952401367243712553c8aeca70a51c609ec10863007c19d5c4772","schema_version":"1.0","event_id":"sha256:72d23c7fafd952401367243712553c8aeca70a51c609ec10863007c19d5c4772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5WWT72QC6DS3OE7T4HE7WNU3GE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Structure Learning for Sum-Product Networks with Gaussian Leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Agastya Kalra, Pascal Poupart, Wilson Hsu","submitted_at":"2017-01-19T00:42:01Z","abstract_excerpt":"Sum-product networks have recently emerged as an attractive representation due to their dual view as a special type of deep neural network with clear semantics and a special type of probabilistic graphical model for which inference is always tractable. Those properties follow from some conditions (i.e., completeness and decomposability) that must be respected by the structure of the network. As a result, it is not easy to specify a valid sum-product network by hand and therefore structure learning techniques are typically used in practice. This paper describes the first online structure learni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05265","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"},"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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmHQf+rvaHsr5dTGz9SW05LrUokAn5z3/dh63CLkj4PIGN05krq3FtU17wDuzosMrfG+9kSLfjekgE5Cm9eYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:30:37.699971Z"},"content_sha256":"3d29fed97a946c30405f76c5ef15498f3e69e9cd22344080d611b318d580d258","schema_version":"1.0","event_id":"sha256:3d29fed97a946c30405f76c5ef15498f3e69e9cd22344080d611b318d580d258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/bundle.json","state_url":"https://pith.science/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/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-05T19:30:37Z","links":{"resolver":"https://pith.science/pith/5WWT72QC6DS3OE7T4HE7WNU3GE","bundle":"https://pith.science/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/bundle.json","state":"https://pith.science/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WWT72QC6DS3OE7T4HE7WNU3GE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5WWT72QC6DS3OE7T4HE7WNU3GE","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":"08b19422d061854a526f6bb9f2b96d9f012267a2355bc8b748492b2edbe336d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T00:42:01Z","title_canon_sha256":"68f7a8ef5cba3d737d21419948b7302c679161b6be0c697595f9c2a2c29291df"},"schema_version":"1.0","source":{"id":"1701.05265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05265","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05265v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05265","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"5WWT72QC6DS3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5WWT72QC6DS3OE7T","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5WWT72QC","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:3d29fed97a946c30405f76c5ef15498f3e69e9cd22344080d611b318d580d258","target":"graph","created_at":"2026-05-18T00:52:30Z","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 have recently emerged as an attractive representation due to their dual view as a special type of deep neural network with clear semantics and a special type of probabilistic graphical model for which inference is always tractable. Those properties follow from some conditions (i.e., completeness and decomposability) that must be respected by the structure of the network. As a result, it is not easy to specify a valid sum-product network by hand and therefore structure learning techniques are typically used in practice. This paper describes the first online structure learni","authors_text":"Agastya Kalra, Pascal Poupart, Wilson Hsu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T00:42:01Z","title":"Online Structure Learning for Sum-Product Networks with Gaussian Leaves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05265","kind":"arxiv","version":1},"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:72d23c7fafd952401367243712553c8aeca70a51c609ec10863007c19d5c4772","target":"record","created_at":"2026-05-18T00:52:30Z","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":"08b19422d061854a526f6bb9f2b96d9f012267a2355bc8b748492b2edbe336d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T00:42:01Z","title_canon_sha256":"68f7a8ef5cba3d737d21419948b7302c679161b6be0c697595f9c2a2c29291df"},"schema_version":"1.0","source":{"id":"1701.05265","kind":"arxiv","version":1}},"canonical_sha256":"edad3fea02f0e5b713f3e1c9fb369b311221b6bea6142580c8aefbfd695b471d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edad3fea02f0e5b713f3e1c9fb369b311221b6bea6142580c8aefbfd695b471d","first_computed_at":"2026-05-18T00:52:30.398044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.398044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CUiVFR/dhfYQ1rZRqumEUuTj+lBs/wDO4J808R6FcAGzDGukbPwft2Xd2f46z6iDJMc89cUrgl4C45lUfosGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.398645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72d23c7fafd952401367243712553c8aeca70a51c609ec10863007c19d5c4772","sha256:3d29fed97a946c30405f76c5ef15498f3e69e9cd22344080d611b318d580d258"],"state_sha256":"62402dd1ca9d9d2611ccc391e1647049f5ca7205b010cdf44293b44c64e505c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D70Roz1LFmF8zPNlPlSnx1O5/FC49X7pCtYx4GyStmRLP6rTAzEja7WuDyp43fIpXk8+yOazBt9mb2h/g9qlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:30:37.702350Z","bundle_sha256":"83ddb08e4e9f61db7f87c530ddc7b66efdea15b39ad550b32632895070ad5709"}}