{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:25ZOCJUXRLIG7E7XRJU4QOMHWQ","short_pith_number":"pith:25ZOCJUX","canonical_record":{"source":{"id":"1707.06194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T17:03:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4723818d62ac38349afedd8d79d0b0fb51366f0bce746ab8633f08744aeffa16","abstract_canon_sha256":"dc6ac64a7f2e6a537dd7f5ee4a38b35e1d485d5fef3acae7afd53e80e7755ff4"},"schema_version":"1.0"},"canonical_sha256":"d772e126978ad06f93f78a69c83987b43ce000879a131c297d3fc504f645d20d","source":{"kind":"arxiv","id":"1707.06194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06194","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06194v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06194","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"25ZOCJUXRLIG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"25ZOCJUXRLIG7E7X","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"25ZOCJUX","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:25ZOCJUXRLIG7E7XRJU4QOMHWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T17:03:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4723818d62ac38349afedd8d79d0b0fb51366f0bce746ab8633f08744aeffa16","abstract_canon_sha256":"dc6ac64a7f2e6a537dd7f5ee4a38b35e1d485d5fef3acae7afd53e80e7755ff4"},"schema_version":"1.0"},"canonical_sha256":"d772e126978ad06f93f78a69c83987b43ce000879a131c297d3fc504f645d20d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.318864Z","signature_b64":"aivleBxgijCzYNThTMbwm+9IWqKVF+6ekr3sYyVsVK/a/h9Q/a/usmzriFZQowtgihWx7o2meRUBtrSPLVeoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d772e126978ad06f93f78a69c83987b43ce000879a131c297d3fc504f645d20d","last_reissued_at":"2026-05-18T00:39:57.318431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.318431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06194","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSx81Q19Oy12TV2ZEfNmnjzgREcj0vQynXorhM5MPULpg9Ff+44jlrHU8R2jJ62zsavqo1sR2K7OlnXZbBb7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:28:40.970082Z"},"content_sha256":"0cebc9f266261e9fd2ae33e149b003a37f700c1f303164be95fee8e9fcb2bc71","schema_version":"1.0","event_id":"sha256:0cebc9f266261e9fd2ae33e149b003a37f700c1f303164be95fee8e9fcb2bc71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:25ZOCJUXRLIG7E7XRJU4QOMHWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy-based Pruning for Learning Bayesian Networks using BIC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.AI","authors_text":"Cassio P. de Campos, Giorgio Corani, Marco Zaffalon, Mauro Scanagatta","submitted_at":"2017-07-19T17:03:14Z","abstract_excerpt":"For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize over this collection by choosing one parent set for each variable without creating directed cycles while maximizing the total score. We target the task of constructing the collection of candidate parent sets when the score of choice is the Bayesian Information Criterion (BIC). We provide new non-trivial results that can be used to prune the search space of candidate parent sets of each node. We analyze how these new re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06194","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YphUrrlDmDCU2P/MVxEuqbWWhspzT1SZ6wpNdbNsEThRU6A/L0YdMmx5ci5gWB7TdAkMTihQtqQbt/41BNnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:28:40.970739Z"},"content_sha256":"fc5a62f542131745f553c1d6f4f7d17c4bc79446391cf4696cfe20605ea6fb52","schema_version":"1.0","event_id":"sha256:fc5a62f542131745f553c1d6f4f7d17c4bc79446391cf4696cfe20605ea6fb52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/bundle.json","state_url":"https://pith.science/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/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-05-27T23:28:40Z","links":{"resolver":"https://pith.science/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ","bundle":"https://pith.science/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/bundle.json","state":"https://pith.science/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25ZOCJUXRLIG7E7XRJU4QOMHWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:25ZOCJUXRLIG7E7XRJU4QOMHWQ","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":"dc6ac64a7f2e6a537dd7f5ee4a38b35e1d485d5fef3acae7afd53e80e7755ff4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T17:03:14Z","title_canon_sha256":"4723818d62ac38349afedd8d79d0b0fb51366f0bce746ab8633f08744aeffa16"},"schema_version":"1.0","source":{"id":"1707.06194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06194","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06194v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06194","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"25ZOCJUXRLIG","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"25ZOCJUXRLIG7E7X","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"25ZOCJUX","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:fc5a62f542131745f553c1d6f4f7d17c4bc79446391cf4696cfe20605ea6fb52","target":"graph","created_at":"2026-05-18T00:39:57Z","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":"For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize over this collection by choosing one parent set for each variable without creating directed cycles while maximizing the total score. We target the task of constructing the collection of candidate parent sets when the score of choice is the Bayesian Information Criterion (BIC). We provide new non-trivial results that can be used to prune the search space of candidate parent sets of each node. We analyze how these new re","authors_text":"Cassio P. de Campos, Giorgio Corani, Marco Zaffalon, Mauro Scanagatta","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T17:03:14Z","title":"Entropy-based Pruning for Learning Bayesian Networks using BIC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06194","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:0cebc9f266261e9fd2ae33e149b003a37f700c1f303164be95fee8e9fcb2bc71","target":"record","created_at":"2026-05-18T00:39:57Z","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":"dc6ac64a7f2e6a537dd7f5ee4a38b35e1d485d5fef3acae7afd53e80e7755ff4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-19T17:03:14Z","title_canon_sha256":"4723818d62ac38349afedd8d79d0b0fb51366f0bce746ab8633f08744aeffa16"},"schema_version":"1.0","source":{"id":"1707.06194","kind":"arxiv","version":1}},"canonical_sha256":"d772e126978ad06f93f78a69c83987b43ce000879a131c297d3fc504f645d20d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d772e126978ad06f93f78a69c83987b43ce000879a131c297d3fc504f645d20d","first_computed_at":"2026-05-18T00:39:57.318431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:57.318431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aivleBxgijCzYNThTMbwm+9IWqKVF+6ekr3sYyVsVK/a/h9Q/a/usmzriFZQowtgihWx7o2meRUBtrSPLVeoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:57.318864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cebc9f266261e9fd2ae33e149b003a37f700c1f303164be95fee8e9fcb2bc71","sha256:fc5a62f542131745f553c1d6f4f7d17c4bc79446391cf4696cfe20605ea6fb52"],"state_sha256":"560a02190234a56c62cfd1ec1d7fce9e51c0c9825d379d3c41d7a7711d0389a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plZO0Gfhi+AuYLlZ21HOE2CA/JpB+knwWcTHcG7QynFtm7EYkn1s/+1kBZYZqusKuHkKbsXhGypFTfAhgcixAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:28:40.974273Z","bundle_sha256":"46aded74fb6552702420f79d08afa1c5e3032c5dfa4bfa0dd3e9f95b574c6d20"}}