{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KEWVUSS5KEGTI55T5DNQDRCIA7","short_pith_number":"pith:KEWVUSS5","canonical_record":{"source":{"id":"1401.3881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"36dceeedad1ae4d4605f5c3f75b4685925319d4a69deb44e94da28fc67063b08","abstract_canon_sha256":"8d5e01e285b9a51503112c143b46ffade3e32a38a9dc54d998c6139bdb0c182d"},"schema_version":"1.0"},"canonical_sha256":"512d5a4a5d510d3477b3e8db01c44807fabdb9cf1eaf7a359a95e07c59959391","source":{"kind":"arxiv","id":"1401.3881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3881","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3881v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3881","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"KEWVUSS5KEGT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KEWVUSS5KEGTI55T","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KEWVUSS5","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KEWVUSS5KEGTI55T5DNQDRCIA7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"36dceeedad1ae4d4605f5c3f75b4685925319d4a69deb44e94da28fc67063b08","abstract_canon_sha256":"8d5e01e285b9a51503112c143b46ffade3e32a38a9dc54d998c6139bdb0c182d"},"schema_version":"1.0"},"canonical_sha256":"512d5a4a5d510d3477b3e8db01c44807fabdb9cf1eaf7a359a95e07c59959391","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.285846Z","signature_b64":"gEuvmthXvWHfIGA7bxwnam14p0h2HD5+QD+hMbXIv1C52pkYVNal+og6JxwIp0DbklffQCTAWdzmNOsQaThkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512d5a4a5d510d3477b3e8db01c44807fabdb9cf1eaf7a359a95e07c59959391","last_reissued_at":"2026-05-18T03:02:06.285300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.285300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3881","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iK/fuQU1vESojT2KkgJGF/gX1AN6Hfd1nYxkmJxHAkUOWirjF6y4TuVgQNGb+1hnmpllOXL0S49Tp9Fb3qT1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:07:34.754491Z"},"content_sha256":"c2105ed7ed3aab75240ef317089693760dd9b890ca75eba9a701415cdf53d199","schema_version":"1.0","event_id":"sha256:c2105ed7ed3aab75240ef317089693760dd9b890ca75eba9a701415cdf53d199"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KEWVUSS5KEGTI55T5DNQDRCIA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lise Getoor, Mustafa Bilgic","submitted_at":"2014-01-16T05:12:42Z","abstract_excerpt":"We address the cost-sensitive feature acquisition problem, where misclassifying an instance is costly but the expected misclassification cost can be reduced by acquiring the values of the missing features. Because acquiring the features is costly as well, the objective is to acquire the right set of features so that the sum of the feature acquisition cost and misclassification cost is minimized. We describe the Value of Information Lattice (VOILA), an optimal and efficient feature subset acquisition framework. Unlike the common practice, which is to acquire features greedily, VOILA can reason "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3881","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zu+ne2Is5pK6Gjckk4pafMoxmQktE8dIO8eafu+7fJSrn/bHuOCBykusNl/PkA8m+hrwUcmXRYptXeYoAgmgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T02:07:34.754822Z"},"content_sha256":"aa56eb82cd590e235e61e9dea42020fd3050bc78dd315cb03ac1e21f0f86a844","schema_version":"1.0","event_id":"sha256:aa56eb82cd590e235e61e9dea42020fd3050bc78dd315cb03ac1e21f0f86a844"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/bundle.json","state_url":"https://pith.science/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/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-27T02:07:34Z","links":{"resolver":"https://pith.science/pith/KEWVUSS5KEGTI55T5DNQDRCIA7","bundle":"https://pith.science/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/bundle.json","state":"https://pith.science/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEWVUSS5KEGTI55T5DNQDRCIA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KEWVUSS5KEGTI55T5DNQDRCIA7","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":"8d5e01e285b9a51503112c143b46ffade3e32a38a9dc54d998c6139bdb0c182d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:12:42Z","title_canon_sha256":"36dceeedad1ae4d4605f5c3f75b4685925319d4a69deb44e94da28fc67063b08"},"schema_version":"1.0","source":{"id":"1401.3881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3881","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3881v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3881","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"KEWVUSS5KEGT","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KEWVUSS5KEGTI55T","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KEWVUSS5","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:aa56eb82cd590e235e61e9dea42020fd3050bc78dd315cb03ac1e21f0f86a844","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"We address the cost-sensitive feature acquisition problem, where misclassifying an instance is costly but the expected misclassification cost can be reduced by acquiring the values of the missing features. Because acquiring the features is costly as well, the objective is to acquire the right set of features so that the sum of the feature acquisition cost and misclassification cost is minimized. We describe the Value of Information Lattice (VOILA), an optimal and efficient feature subset acquisition framework. Unlike the common practice, which is to acquire features greedily, VOILA can reason ","authors_text":"Lise Getoor, Mustafa Bilgic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:12:42Z","title":"Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3881","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:c2105ed7ed3aab75240ef317089693760dd9b890ca75eba9a701415cdf53d199","target":"record","created_at":"2026-05-18T03:02:06Z","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":"8d5e01e285b9a51503112c143b46ffade3e32a38a9dc54d998c6139bdb0c182d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:12:42Z","title_canon_sha256":"36dceeedad1ae4d4605f5c3f75b4685925319d4a69deb44e94da28fc67063b08"},"schema_version":"1.0","source":{"id":"1401.3881","kind":"arxiv","version":1}},"canonical_sha256":"512d5a4a5d510d3477b3e8db01c44807fabdb9cf1eaf7a359a95e07c59959391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512d5a4a5d510d3477b3e8db01c44807fabdb9cf1eaf7a359a95e07c59959391","first_computed_at":"2026-05-18T03:02:06.285300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.285300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gEuvmthXvWHfIGA7bxwnam14p0h2HD5+QD+hMbXIv1C52pkYVNal+og6JxwIp0DbklffQCTAWdzmNOsQaThkBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.285846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2105ed7ed3aab75240ef317089693760dd9b890ca75eba9a701415cdf53d199","sha256:aa56eb82cd590e235e61e9dea42020fd3050bc78dd315cb03ac1e21f0f86a844"],"state_sha256":"1f1cbf799152caf8ef6947920b0348837183eb0e16e9690ea168b91d9eb03111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gk8tLEiC7590uoPh9ytTqvYEYBv8VMUf7ShjmWTGPGTEMX4dr45uLE+DDT7gERzZw8XBmMqOOeFSqoDlt2jDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T02:07:34.756648Z","bundle_sha256":"41e575b3d372c29903dc7621ac87f613bfac01d5f5289ebde134a6b1360c9b7d"}}