{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FBUL7K242AUPNJMKJV3I4SB4Z4","short_pith_number":"pith:FBUL7K24","canonical_record":{"source":{"id":"1805.11243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T04:46:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d2ebf0520a5de79ac52a2a7003aa8a450d68cfb92d3dc5e41396185237746a0e","abstract_canon_sha256":"b6dc3c65507e304e14029549d100e34d34269c7f2c5996868d948e0dc2e2f5b9"},"schema_version":"1.0"},"canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","source":{"kind":"arxiv","id":"1805.11243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11243","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11243v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11243","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"FBUL7K242AUP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBUL7K242AUPNJMK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBUL7K24","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FBUL7K242AUPNJMKJV3I4SB4Z4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T04:46:16Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d2ebf0520a5de79ac52a2a7003aa8a450d68cfb92d3dc5e41396185237746a0e","abstract_canon_sha256":"b6dc3c65507e304e14029549d100e34d34269c7f2c5996868d948e0dc2e2f5b9"},"schema_version":"1.0"},"canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.190083Z","signature_b64":"5X6sSAqno+qhwnlJdaYMOQKmNZeDEDlOXP+LulFCii+QsKsH/xW6Sg5UobZiarlIqy68YmurRZ/XIZrr5Ra0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","last_reissued_at":"2026-05-18T00:14:43.189335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.189335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11243","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:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jv9ey+JIieMGcY5GGi7W6fcDyjO89htArsKA/IyUGUNP8N4jg8I5MRsgTx97EItcSyc5y7UAiE+k3980TXGoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:05:19.312439Z"},"content_sha256":"fe19e5277003965e1859d890b84950aca847ae98bd4d2e235c903b1ad2542ee3","schema_version":"1.0","event_id":"sha256:fe19e5277003965e1859d890b84950aca847ae98bd4d2e235c903b1ad2542ee3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FBUL7K242AUPNJMKJV3I4SB4Z4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Robust Trimming of Bayesian Network Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guy Van den Broeck, YooJung Choi","submitted_at":"2018-05-29T04:46:16Z","abstract_excerpt":"This paper considers the problem of removing costly features from a Bayesian network classifier. We want the classifier to be robust to these changes, and maintain its classification behavior. To this end, we propose a closeness metric between Bayesian classifiers, called the expected classification agreement (ECA). Our corresponding trimming algorithm finds an optimal subset of features and a new classification threshold that maximize the expected agreement, subject to a budgetary constraint. It utilizes new theoretical insights to perform branch-and-bound search in the space of feature sets,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11243","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:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uukk3WYxFng7vNU45Ec+fW8IvfzuwIELoIxdCE051AdPJm+cdbyoCbxIdisk5V6I9Jm7AGZ8j7JTxPIQEHxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:05:19.313148Z"},"content_sha256":"9a7692b02194a924f2eb2979af353bd288f1d62732696e3f067660293d501006","schema_version":"1.0","event_id":"sha256:9a7692b02194a924f2eb2979af353bd288f1d62732696e3f067660293d501006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/bundle.json","state_url":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/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-10T07:05:19Z","links":{"resolver":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4","bundle":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/bundle.json","state":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FBUL7K242AUPNJMKJV3I4SB4Z4","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":"b6dc3c65507e304e14029549d100e34d34269c7f2c5996868d948e0dc2e2f5b9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T04:46:16Z","title_canon_sha256":"d2ebf0520a5de79ac52a2a7003aa8a450d68cfb92d3dc5e41396185237746a0e"},"schema_version":"1.0","source":{"id":"1805.11243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11243","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11243v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11243","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"FBUL7K242AUP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBUL7K242AUPNJMK","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBUL7K24","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:9a7692b02194a924f2eb2979af353bd288f1d62732696e3f067660293d501006","target":"graph","created_at":"2026-05-18T00:14:43Z","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":"This paper considers the problem of removing costly features from a Bayesian network classifier. We want the classifier to be robust to these changes, and maintain its classification behavior. To this end, we propose a closeness metric between Bayesian classifiers, called the expected classification agreement (ECA). Our corresponding trimming algorithm finds an optimal subset of features and a new classification threshold that maximize the expected agreement, subject to a budgetary constraint. It utilizes new theoretical insights to perform branch-and-bound search in the space of feature sets,","authors_text":"Guy Van den Broeck, YooJung Choi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T04:46:16Z","title":"On Robust Trimming of Bayesian Network Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11243","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:fe19e5277003965e1859d890b84950aca847ae98bd4d2e235c903b1ad2542ee3","target":"record","created_at":"2026-05-18T00:14:43Z","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":"b6dc3c65507e304e14029549d100e34d34269c7f2c5996868d948e0dc2e2f5b9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T04:46:16Z","title_canon_sha256":"d2ebf0520a5de79ac52a2a7003aa8a450d68cfb92d3dc5e41396185237746a0e"},"schema_version":"1.0","source":{"id":"1805.11243","kind":"arxiv","version":1}},"canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","first_computed_at":"2026-05-18T00:14:43.189335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.189335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5X6sSAqno+qhwnlJdaYMOQKmNZeDEDlOXP+LulFCii+QsKsH/xW6Sg5UobZiarlIqy68YmurRZ/XIZrr5Ra0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.190083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe19e5277003965e1859d890b84950aca847ae98bd4d2e235c903b1ad2542ee3","sha256:9a7692b02194a924f2eb2979af353bd288f1d62732696e3f067660293d501006"],"state_sha256":"e7502da31bb5bc4300a92f579f15886ab64867ff19063b69faf956785cc52542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ael0ngXpuopDO3iPsmeKI8/PDLtvOpo0t5Cd/Y00K+8ibJ9cioEj4ko8prYUDB5qh5fVWtR+MYeY+V9G16AIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:05:19.317385Z","bundle_sha256":"ec9182b4b72a85c2d2b0c8b618b686d54af6376e1350b98ce6bf78b9c39b2cc8"}}