{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BYB5EQKXJNJ3ODT3CTFQNG3YHY","short_pith_number":"pith:BYB5EQKX","canonical_record":{"source":{"id":"1608.02682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-09T03:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"754edd6fdd7696aa1b4386144c009c9af40a051e96d7a8f99edfac3146a905c0","abstract_canon_sha256":"74a475d1150e4f180338fa1c0f92ba39803c1a8b8acbe9ecafd69e7a94dae556"},"schema_version":"1.0"},"canonical_sha256":"0e03d241574b53b70e7b14cb069b783e1cf9d2cc2079a873fb3803bf0f1e15b8","source":{"kind":"arxiv","id":"1608.02682","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02682","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02682v3","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02682","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"BYB5EQKXJNJ3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYB5EQKXJNJ3ODT3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYB5EQKX","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BYB5EQKXJNJ3ODT3CTFQNG3YHY","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02682","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-09T03:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"754edd6fdd7696aa1b4386144c009c9af40a051e96d7a8f99edfac3146a905c0","abstract_canon_sha256":"74a475d1150e4f180338fa1c0f92ba39803c1a8b8acbe9ecafd69e7a94dae556"},"schema_version":"1.0"},"canonical_sha256":"0e03d241574b53b70e7b14cb069b783e1cf9d2cc2079a873fb3803bf0f1e15b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:17.319309Z","signature_b64":"WpKXlLOACt+n8rDvFWxfBsq1KuVknHXeoDBOBm7YsCGuQhdkWXufEMhhs6rrbVOSfXeT4J2NpWBQceDAguX3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e03d241574b53b70e7b14cb069b783e1cf9d2cc2079a873fb3803bf0f1e15b8","last_reissued_at":"2026-05-18T00:48:17.318726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:17.318726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02682","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-18T00:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv+5UmrzolBb2Vu6y+x/bEfMlWuCotwkEilWF3LBx38oqmGo72RahEOLC/BskUS4IjrMZ9GyxNKlrflvOHtVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:11:36.790141Z"},"content_sha256":"50d982cd8cf979a3fe64b77906ba1ddc6bbacd00477f5a23b3776c23bb7bd9de","schema_version":"1.0","event_id":"sha256:50d982cd8cf979a3fe64b77906ba1ddc6bbacd00477f5a23b3776c23bb7bd9de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BYB5EQKXJNJ3ODT3CTFQNG3YHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Structure Learning of Bayesian Networks by Optimal Path Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jaroslaw Zola, Subhadeep Karan","submitted_at":"2016-08-09T03:07:50Z","abstract_excerpt":"Bayesian networks are probabilistic graphical models often used in big data analytics. The problem of exact structure learning is to find a network structure that is optimal under certain scoring criteria. The problem is known to be NP-hard and the existing methods are both computationally and memory intensive. In this paper, we introduce a new approach for exact structure learning. Our strategy is to leverage relationship between a partial network structure and the remaining variables to constraint the number of ways in which the partial network can be optimally extended. Via experimental res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02682","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-18T00:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIzNWAKAQNnutj+cjrsJl8rSiYo2RjTQ1GveR2aysCjKJefnk8ukiQTLV14yjBU958caFVeHCvOI+KKZgweGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:11:36.790937Z"},"content_sha256":"f11fbbbf31ed1d25be66f89ae13abf696a3f27c7f45f888371f9ab3f06d6ffe4","schema_version":"1.0","event_id":"sha256:f11fbbbf31ed1d25be66f89ae13abf696a3f27c7f45f888371f9ab3f06d6ffe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/bundle.json","state_url":"https://pith.science/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/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-09T09:11:36Z","links":{"resolver":"https://pith.science/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY","bundle":"https://pith.science/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/bundle.json","state":"https://pith.science/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYB5EQKXJNJ3ODT3CTFQNG3YHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BYB5EQKXJNJ3ODT3CTFQNG3YHY","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":"74a475d1150e4f180338fa1c0f92ba39803c1a8b8acbe9ecafd69e7a94dae556","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-09T03:07:50Z","title_canon_sha256":"754edd6fdd7696aa1b4386144c009c9af40a051e96d7a8f99edfac3146a905c0"},"schema_version":"1.0","source":{"id":"1608.02682","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02682","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02682v3","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02682","created_at":"2026-05-18T00:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"BYB5EQKXJNJ3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYB5EQKXJNJ3ODT3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYB5EQKX","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:f11fbbbf31ed1d25be66f89ae13abf696a3f27c7f45f888371f9ab3f06d6ffe4","target":"graph","created_at":"2026-05-18T00:48:17Z","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":"Bayesian networks are probabilistic graphical models often used in big data analytics. The problem of exact structure learning is to find a network structure that is optimal under certain scoring criteria. The problem is known to be NP-hard and the existing methods are both computationally and memory intensive. In this paper, we introduce a new approach for exact structure learning. Our strategy is to leverage relationship between a partial network structure and the remaining variables to constraint the number of ways in which the partial network can be optimally extended. Via experimental res","authors_text":"Jaroslaw Zola, Subhadeep Karan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-09T03:07:50Z","title":"Exact Structure Learning of Bayesian Networks by Optimal Path Extension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02682","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:50d982cd8cf979a3fe64b77906ba1ddc6bbacd00477f5a23b3776c23bb7bd9de","target":"record","created_at":"2026-05-18T00:48:17Z","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":"74a475d1150e4f180338fa1c0f92ba39803c1a8b8acbe9ecafd69e7a94dae556","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-09T03:07:50Z","title_canon_sha256":"754edd6fdd7696aa1b4386144c009c9af40a051e96d7a8f99edfac3146a905c0"},"schema_version":"1.0","source":{"id":"1608.02682","kind":"arxiv","version":3}},"canonical_sha256":"0e03d241574b53b70e7b14cb069b783e1cf9d2cc2079a873fb3803bf0f1e15b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e03d241574b53b70e7b14cb069b783e1cf9d2cc2079a873fb3803bf0f1e15b8","first_computed_at":"2026-05-18T00:48:17.318726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:17.318726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WpKXlLOACt+n8rDvFWxfBsq1KuVknHXeoDBOBm7YsCGuQhdkWXufEMhhs6rrbVOSfXeT4J2NpWBQceDAguX3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:17.319309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02682","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50d982cd8cf979a3fe64b77906ba1ddc6bbacd00477f5a23b3776c23bb7bd9de","sha256:f11fbbbf31ed1d25be66f89ae13abf696a3f27c7f45f888371f9ab3f06d6ffe4"],"state_sha256":"1d87fc3833bc7d6a30449602782937c508040e9bd27f7b6b99f62b3bde813971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weJjwc24zGLWzXby3u48NBhwU3OYkXHkYALtOcYaXdR5nj6Ixs6oyflH75MUVWxLGlgWJwT55pS/IiHYqzFwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:11:36.794496Z","bundle_sha256":"d7674070bffa1ac23c3f1df34d6faf83b6f64c066ba0623d10cbf0b4579c504e"}}