{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZA4BLYKTBK7C3THVATOG6PTMMQ","short_pith_number":"pith:ZA4BLYKT","canonical_record":{"source":{"id":"1709.05964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T14:17:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c41d6760a5bc36750974d00d092118a655d127f4a44f5b9b4b2a035b7730c9d8","abstract_canon_sha256":"bfb3cb3c594b50639be26fd2f5299acc598544d2c709383e2fcfaa4916f2f60c"},"schema_version":"1.0"},"canonical_sha256":"c83815e1530abe2dccf504dc6f3e6c64274a30734e38d9d37d67ed1cd571225c","source":{"kind":"arxiv","id":"1709.05964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05964","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05964v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05964","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4BLYKTBK7C","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4BLYKTBK7C3THV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4BLYKT","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZA4BLYKTBK7C3THVATOG6PTMMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T14:17:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c41d6760a5bc36750974d00d092118a655d127f4a44f5b9b4b2a035b7730c9d8","abstract_canon_sha256":"bfb3cb3c594b50639be26fd2f5299acc598544d2c709383e2fcfaa4916f2f60c"},"schema_version":"1.0"},"canonical_sha256":"c83815e1530abe2dccf504dc6f3e6c64274a30734e38d9d37d67ed1cd571225c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.651649Z","signature_b64":"dQTTtW4/20Djjz3F3NBQOrgy/Xv4ww8+WfqfaJu+uRtToEIYHCpMwJUsNHgdgiHIBCKi3yj9ULDLVimJS4EODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83815e1530abe2dccf504dc6f3e6c64274a30734e38d9d37d67ed1cd571225c","last_reissued_at":"2026-05-18T00:34:58.650971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.650971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05964","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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwaJSvL+shMSRuqkYOQZaAgeAarSJDM5gyasRi/5TDx1j1TCHKfPLRXoOoIANp9tv9i/lYHQ/0lC/EQUd4QNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:46:03.483049Z"},"content_sha256":"5f94f43f0b352f1e91932e177509b0baef52be26d8d504436573a4a99c0f0440","schema_version":"1.0","event_id":"sha256:5f94f43f0b352f1e91932e177509b0baef52be26d8d504436573a4a99c0f0440"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZA4BLYKTBK7C3THVATOG6PTMMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Why Pay More When You Can Pay Less: A Joint Learning Framework for Active Feature Acquisition and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eunho Yang, Hajin Shim, Sung Ju Hwang","submitted_at":"2017-09-18T14:17:22Z","abstract_excerpt":"We consider the problem of active feature acquisition, where we sequentially select the subset of features in order to achieve the maximum prediction performance in the most cost-effective way. In this work, we formulate this active feature acquisition problem as a reinforcement learning problem, and provide a novel framework for jointly learning both the RL agent and the classifier (environment). We also introduce a more systematic way of encoding subsets of features that can properly handle innate challenge with missing entries in active feature acquisition problems, that uses the orderless "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05964","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-18T00:34:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQ/hNaRG2fK+5Q5dO4roZjK4dUkZ2pg1grNIxMa678TeZev80D8gy8lWye9zrvAA+KdY+nDWiAjEB6Qq+15lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:46:03.483407Z"},"content_sha256":"8263d187b6f5f7c9110b80032351be5866beb13727cb4ead332ff63921fc62d4","schema_version":"1.0","event_id":"sha256:8263d187b6f5f7c9110b80032351be5866beb13727cb4ead332ff63921fc62d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/bundle.json","state_url":"https://pith.science/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/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-04T21:46:03Z","links":{"resolver":"https://pith.science/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ","bundle":"https://pith.science/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/bundle.json","state":"https://pith.science/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZA4BLYKTBK7C3THVATOG6PTMMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZA4BLYKTBK7C3THVATOG6PTMMQ","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":"bfb3cb3c594b50639be26fd2f5299acc598544d2c709383e2fcfaa4916f2f60c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T14:17:22Z","title_canon_sha256":"c41d6760a5bc36750974d00d092118a655d127f4a44f5b9b4b2a035b7730c9d8"},"schema_version":"1.0","source":{"id":"1709.05964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05964","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05964v1","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05964","created_at":"2026-05-18T00:34:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZA4BLYKTBK7C","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZA4BLYKTBK7C3THV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZA4BLYKT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:8263d187b6f5f7c9110b80032351be5866beb13727cb4ead332ff63921fc62d4","target":"graph","created_at":"2026-05-18T00:34:58Z","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 consider the problem of active feature acquisition, where we sequentially select the subset of features in order to achieve the maximum prediction performance in the most cost-effective way. In this work, we formulate this active feature acquisition problem as a reinforcement learning problem, and provide a novel framework for jointly learning both the RL agent and the classifier (environment). We also introduce a more systematic way of encoding subsets of features that can properly handle innate challenge with missing entries in active feature acquisition problems, that uses the orderless ","authors_text":"Eunho Yang, Hajin Shim, Sung Ju Hwang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T14:17:22Z","title":"Why Pay More When You Can Pay Less: A Joint Learning Framework for Active Feature Acquisition and Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05964","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:5f94f43f0b352f1e91932e177509b0baef52be26d8d504436573a4a99c0f0440","target":"record","created_at":"2026-05-18T00:34:58Z","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":"bfb3cb3c594b50639be26fd2f5299acc598544d2c709383e2fcfaa4916f2f60c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-18T14:17:22Z","title_canon_sha256":"c41d6760a5bc36750974d00d092118a655d127f4a44f5b9b4b2a035b7730c9d8"},"schema_version":"1.0","source":{"id":"1709.05964","kind":"arxiv","version":1}},"canonical_sha256":"c83815e1530abe2dccf504dc6f3e6c64274a30734e38d9d37d67ed1cd571225c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c83815e1530abe2dccf504dc6f3e6c64274a30734e38d9d37d67ed1cd571225c","first_computed_at":"2026-05-18T00:34:58.650971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:58.650971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQTTtW4/20Djjz3F3NBQOrgy/Xv4ww8+WfqfaJu+uRtToEIYHCpMwJUsNHgdgiHIBCKi3yj9ULDLVimJS4EODQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:58.651649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f94f43f0b352f1e91932e177509b0baef52be26d8d504436573a4a99c0f0440","sha256:8263d187b6f5f7c9110b80032351be5866beb13727cb4ead332ff63921fc62d4"],"state_sha256":"38fac121ca0b9ff6d8f93ebfee2505c17694533fab03d66f2f9d293e5359f51f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sa+4M+sk6t7d/e4J2K4Q2SCqZqZzh58N4t9PIZiQqtDDbnJUbFr/bg2eGXGDkJgnwEkW1Yj/hXShxqon7PfKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:46:03.485567Z","bundle_sha256":"4adaa092ed14b885a8ae79dd4d4c28387a6952c04e30611514272d63d262d7e8"}}