{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FVTASQXKJP6FIXHA63JOQMSLDX","short_pith_number":"pith:FVTASQXK","schema_version":"1.0","canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","source":{"kind":"arxiv","id":"2306.03301","version":3},"attestation_state":"computed","paper":{"title":"Estimating Conditional Mutual Information for Dynamic Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ian Covert, Soham Gadgil, Su-In Lee","submitted_at":"2023-06-05T23:03:03Z","abstract_excerpt":"Dynamic feature selection, where we sequentially query features to make accurate predictions with a minimal budget, is a promising paradigm to reduce feature acquisition costs and provide transparency into a model's predictions. The problem is challenging, however, as it requires both predicting with arbitrary feature sets and learning a policy to identify valuable selections. Here, we take an information-theoretic perspective and prioritize features based on their mutual information with the response variable. The main challenge is implementing this policy, and we design a new approach that e"},"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":"2306.03301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T23:03:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c7cb27b64d602a447e1be914f2c1e8912d52719857e0e706b1f12075b13b319f","abstract_canon_sha256":"851e21c10c8b5a783408b4ea77e13fec1de75704d740994640fdda969ce12fb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:28.347736Z","signature_b64":"SI/Phzp0PwCZ+yuhIdbcIi+XdubWU2ILFTtJbZloxN2KpuwSUv8HjOSA9uZ/2gDWx2nTOCX5ECk1zVJJjcckCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","last_reissued_at":"2026-07-05T09:04:28.347241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:28.347241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Conditional Mutual Information for Dynamic Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ian Covert, Soham Gadgil, Su-In Lee","submitted_at":"2023-06-05T23:03:03Z","abstract_excerpt":"Dynamic feature selection, where we sequentially query features to make accurate predictions with a minimal budget, is a promising paradigm to reduce feature acquisition costs and provide transparency into a model's predictions. The problem is challenging, however, as it requires both predicting with arbitrary feature sets and learning a policy to identify valuable selections. Here, we take an information-theoretic perspective and prioritize features based on their mutual information with the response variable. The main challenge is implementing this policy, and we design a new approach that e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03301","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.03301/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.03301","created_at":"2026-07-05T09:04:28.347303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.03301v3","created_at":"2026-07-05T09:04:28.347303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03301","created_at":"2026-07-05T09:04:28.347303+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVTASQXKJP6F","created_at":"2026-07-05T09:04:28.347303+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVTASQXKJP6FIXHA","created_at":"2026-07-05T09:04:28.347303+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVTASQXK","created_at":"2026-07-05T09:04:28.347303+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/FVTASQXKJP6FIXHA63JOQMSLDX","json":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX.json","graph_json":"https://pith.science/api/pith-number/FVTASQXKJP6FIXHA63JOQMSLDX/graph.json","events_json":"https://pith.science/api/pith-number/FVTASQXKJP6FIXHA63JOQMSLDX/events.json","paper":"https://pith.science/paper/FVTASQXK"},"agent_actions":{"view_html":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX","download_json":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX.json","view_paper":"https://pith.science/paper/FVTASQXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.03301&json=true","fetch_graph":"https://pith.science/api/pith-number/FVTASQXKJP6FIXHA63JOQMSLDX/graph.json","fetch_events":"https://pith.science/api/pith-number/FVTASQXKJP6FIXHA63JOQMSLDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/action/storage_attestation","attest_author":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/action/author_attestation","sign_citation":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/action/citation_signature","submit_replication":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/action/replication_record"}},"created_at":"2026-07-05T09:04:28.347303+00:00","updated_at":"2026-07-05T09:04:28.347303+00:00"}