{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FBUL7K242AUPNJMKJV3I4SB4Z4","short_pith_number":"pith:FBUL7K24","schema_version":"1.0","canonical_sha256":"2868bfab5cd028f6a58a4d768e483ccf14afa4a05e4e2a5e936a377e79bf1ccd","source":{"kind":"arxiv","id":"1805.11243","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.11243","created_at":"2026-05-18T00:14:43.189454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11243v1","created_at":"2026-05-18T00:14:43.189454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11243","created_at":"2026-05-18T00:14:43.189454+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBUL7K242AUP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBUL7K242AUPNJMK","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBUL7K24","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4","json":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4.json","graph_json":"https://pith.science/api/pith-number/FBUL7K242AUPNJMKJV3I4SB4Z4/graph.json","events_json":"https://pith.science/api/pith-number/FBUL7K242AUPNJMKJV3I4SB4Z4/events.json","paper":"https://pith.science/paper/FBUL7K24"},"agent_actions":{"view_html":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4","download_json":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4.json","view_paper":"https://pith.science/paper/FBUL7K24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11243&json=true","fetch_graph":"https://pith.science/api/pith-number/FBUL7K242AUPNJMKJV3I4SB4Z4/graph.json","fetch_events":"https://pith.science/api/pith-number/FBUL7K242AUPNJMKJV3I4SB4Z4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/action/storage_attestation","attest_author":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/action/author_attestation","sign_citation":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/action/citation_signature","submit_replication":"https://pith.science/pith/FBUL7K242AUPNJMKJV3I4SB4Z4/action/replication_record"}},"created_at":"2026-05-18T00:14:43.189454+00:00","updated_at":"2026-05-18T00:14:43.189454+00:00"}