{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FVTASQXKJP6FIXHA63JOQMSLDX","short_pith_number":"pith:FVTASQXK","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"},"canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","source":{"kind":"arxiv","id":"2306.03301","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.03301","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2306.03301v3","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03301","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"FVTASQXKJP6F","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVTASQXKJP6FIXHA","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVTASQXK","created_at":"2026-07-05T09:04:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FVTASQXKJP6FIXHA63JOQMSLDX","target":"record","payload":{"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"},"canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","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"},"source_kind":"arxiv","source_id":"2306.03301","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-07-05T09:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kz0S8SLwCG2u3aRC7eagFIlPNt/n8/OvRBf1czWAIiC6NCk7yM9GyZWjjRTlqXq03I40bLwM5+4/CtO/gOIkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:27:55.076256Z"},"content_sha256":"5b1f50770cbaa45df6970c45a18e2e9e5e837b5a974ba5f4f30f3951505fa8f2","schema_version":"1.0","event_id":"sha256:5b1f50770cbaa45df6970c45a18e2e9e5e837b5a974ba5f4f30f3951505fa8f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FVTASQXKJP6FIXHA63JOQMSLDX","target":"graph","payload":{"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"},"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-07-05T09:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u++JnwiYYqySKrUmZMkML9pKyJWX35BguSXLIcgOgXsB393PtI/zyt12c/F7gk2xG61Y4GNoDy7blRQjSbaeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T06:27:55.077909Z"},"content_sha256":"55541bed6d17c0b5a5cf86b1f88157dcbb96820115b219b63e6ffeab0c51b348","schema_version":"1.0","event_id":"sha256:55541bed6d17c0b5a5cf86b1f88157dcbb96820115b219b63e6ffeab0c51b348"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/bundle.json","state_url":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVTASQXKJP6FIXHA63JOQMSLDX/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-08-05T06:27:55Z","links":{"resolver":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX","bundle":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/bundle.json","state":"https://pith.science/pith/FVTASQXKJP6FIXHA63JOQMSLDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVTASQXKJP6FIXHA63JOQMSLDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FVTASQXKJP6FIXHA63JOQMSLDX","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":"851e21c10c8b5a783408b4ea77e13fec1de75704d740994640fdda969ce12fb1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T23:03:03Z","title_canon_sha256":"c7cb27b64d602a447e1be914f2c1e8912d52719857e0e706b1f12075b13b319f"},"schema_version":"1.0","source":{"id":"2306.03301","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.03301","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2306.03301v3","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03301","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"FVTASQXKJP6F","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVTASQXKJP6FIXHA","created_at":"2026-07-05T09:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVTASQXK","created_at":"2026-07-05T09:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:55541bed6d17c0b5a5cf86b1f88157dcbb96820115b219b63e6ffeab0c51b348","target":"graph","created_at":"2026-07-05T09:04:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.03301/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ian Covert, Soham Gadgil, Su-In Lee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T23:03:03Z","title":"Estimating Conditional Mutual Information for Dynamic Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03301","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:5b1f50770cbaa45df6970c45a18e2e9e5e837b5a974ba5f4f30f3951505fa8f2","target":"record","created_at":"2026-07-05T09:04:28Z","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":"851e21c10c8b5a783408b4ea77e13fec1de75704d740994640fdda969ce12fb1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-05T23:03:03Z","title_canon_sha256":"c7cb27b64d602a447e1be914f2c1e8912d52719857e0e706b1f12075b13b319f"},"schema_version":"1.0","source":{"id":"2306.03301","kind":"arxiv","version":3}},"canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d660942ea4bfc545ce0f6d2e8324b1dceac1d87f715aaa8d895137fdca9407d","first_computed_at":"2026-07-05T09:04:28.347241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:04:28.347241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SI/Phzp0PwCZ+yuhIdbcIi+XdubWU2ILFTtJbZloxN2KpuwSUv8HjOSA9uZ/2gDWx2nTOCX5ECk1zVJJjcckCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:04:28.347736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.03301","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b1f50770cbaa45df6970c45a18e2e9e5e837b5a974ba5f4f30f3951505fa8f2","sha256:55541bed6d17c0b5a5cf86b1f88157dcbb96820115b219b63e6ffeab0c51b348"],"state_sha256":"15872a576e983fc0c7d29baada348d8393cb84b4f8dd0a55e80cfc9fe341f09f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEP7FSnvLf7hk8WAjOQw/2HLxA3aJ8tgVHuKqi5/yXzC45a3ss3qBwJvwQql5yJPASXZ3zd716QImOQltK7ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T06:27:55.083654Z","bundle_sha256":"2079b2b13b1bd2cecfef3f64c4bfdb701d4622e5066dad44b00f40560b5e0a1b"}}