{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZHQZ334IQBI2BCNFBHXQTVHSMW","short_pith_number":"pith:ZHQZ334I","canonical_record":{"source":{"id":"1901.00243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"3a1f0b8c405f63a60ddb26cdaa569dce843650462a31c7a13c82a07915c4e702","abstract_canon_sha256":"e2272e17ed388528f034a9cb4a9411d321fe48a522eb2dd2a0706fb6f3b54b83"},"schema_version":"1.0"},"canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","source":{"kind":"arxiv","id":"1901.00243","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00243","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00243v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00243","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZHQZ334IQBI2","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZHQZ334IQBI2BCNF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZHQZ334I","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZHQZ334IQBI2BCNFBHXQTVHSMW","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"3a1f0b8c405f63a60ddb26cdaa569dce843650462a31c7a13c82a07915c4e702","abstract_canon_sha256":"e2272e17ed388528f034a9cb4a9411d321fe48a522eb2dd2a0706fb6f3b54b83"},"schema_version":"1.0"},"canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.714055Z","signature_b64":"MBD+cxPvpUlyBbdEVEk7YD6HtuTqHRHr4jHhymLq9gVyueTxnlmOARH69Ykri9CDTncaaDcQi9uNKiAGH6j2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","last_reissued_at":"2026-05-17T23:53:49.713417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.713417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00243","source_version":2,"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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAQDEk3ih276RrU+EhfapFki2ayBBFBejF0+GYbrufvCitmO6YUhOMoPIi9JzfdTbyf/WkaoI/4MAvYGDvEyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:08.161857Z"},"content_sha256":"658f8a9e7e1128181a92db55fcf7529d28aea7a402f89be3464968057cec8683","schema_version":"1.0","event_id":"sha256:658f8a9e7e1128181a92db55fcf7529d28aea7a402f89be3464968057cec8683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZHQZ334IQBI2BCNFBHXQTVHSMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kimmo Karkkainen, Majid Sarrafzadeh, Mohammad Kachuee, Orpaz Goldstein, Sajad Darabi","submitted_at":"2019-01-02T02:33:54Z","abstract_excerpt":"In many real-world learning scenarios, features are only acquirable at a cost constrained under a budget. In this paper, we propose a novel approach for cost-sensitive feature acquisition at the prediction-time. The suggested method acquires features incrementally based on a context-aware feature-value function. We formulate the problem in the reinforcement learning paradigm, and introduce a reward function based on the utility of each feature. Specifically, MC dropout sampling is used to measure expected variations of the model uncertainty which is used as a feature-value function. Furthermor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00243","kind":"arxiv","version":2},"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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrCs4JRkX6Qj7DdyjKXivxxOs3kMl+B/dVXdD+gFM9SfXMMn29xDret8daU77TUHfVxtGTL/ugSo3/2JC0+WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:08.162541Z"},"content_sha256":"b7ed61c0904b28ce9746aa4b4be7f6841c77b9b05d57a810e28d479748d79b35","schema_version":"1.0","event_id":"sha256:b7ed61c0904b28ce9746aa4b4be7f6841c77b9b05d57a810e28d479748d79b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/bundle.json","state_url":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/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-05-25T21:44:08Z","links":{"resolver":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW","bundle":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/bundle.json","state":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZHQZ334IQBI2BCNFBHXQTVHSMW","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":"e2272e17ed388528f034a9cb4a9411d321fe48a522eb2dd2a0706fb6f3b54b83","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","title_canon_sha256":"3a1f0b8c405f63a60ddb26cdaa569dce843650462a31c7a13c82a07915c4e702"},"schema_version":"1.0","source":{"id":"1901.00243","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00243","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00243v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00243","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZHQZ334IQBI2","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZHQZ334IQBI2BCNF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZHQZ334I","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:b7ed61c0904b28ce9746aa4b4be7f6841c77b9b05d57a810e28d479748d79b35","target":"graph","created_at":"2026-05-17T23:53:49Z","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":"In many real-world learning scenarios, features are only acquirable at a cost constrained under a budget. In this paper, we propose a novel approach for cost-sensitive feature acquisition at the prediction-time. The suggested method acquires features incrementally based on a context-aware feature-value function. We formulate the problem in the reinforcement learning paradigm, and introduce a reward function based on the utility of each feature. Specifically, MC dropout sampling is used to measure expected variations of the model uncertainty which is used as a feature-value function. Furthermor","authors_text":"Kimmo Karkkainen, Majid Sarrafzadeh, Mohammad Kachuee, Orpaz Goldstein, Sajad Darabi","cross_cats":["cs.AI","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00243","kind":"arxiv","version":2},"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:658f8a9e7e1128181a92db55fcf7529d28aea7a402f89be3464968057cec8683","target":"record","created_at":"2026-05-17T23:53:49Z","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":"e2272e17ed388528f034a9cb4a9411d321fe48a522eb2dd2a0706fb6f3b54b83","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","title_canon_sha256":"3a1f0b8c405f63a60ddb26cdaa569dce843650462a31c7a13c82a07915c4e702"},"schema_version":"1.0","source":{"id":"1901.00243","kind":"arxiv","version":2}},"canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","first_computed_at":"2026-05-17T23:53:49.713417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:49.713417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MBD+cxPvpUlyBbdEVEk7YD6HtuTqHRHr4jHhymLq9gVyueTxnlmOARH69Ykri9CDTncaaDcQi9uNKiAGH6j2AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:49.714055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00243","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:658f8a9e7e1128181a92db55fcf7529d28aea7a402f89be3464968057cec8683","sha256:b7ed61c0904b28ce9746aa4b4be7f6841c77b9b05d57a810e28d479748d79b35"],"state_sha256":"78dc4b736a3d6a56175b13aca6198c0a455d8adaa3d92ba2bf9c391db1313617"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKrOqg7w8JHxUy1EYTrBdQsyb5uXY0z2EJuzN6k2kYCZRV85Bl3qzcXSw9hQtm1lS2p2y44fDK6HMjZb7XzQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:44:08.168428Z","bundle_sha256":"2b3471d0fd780d655b3cc25c40441d36636dab6238534f8e50fe4ae2eb340900"}}