{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:B7JHYEW4TJUYAPPFMN2LWCHPOP","short_pith_number":"pith:B7JHYEW4","canonical_record":{"source":{"id":"1312.0790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T12:12:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"83cb4be91caeaacd9a8f85fe34bb79b773db4cdd78932bb9b6823c313e2e2fb6","abstract_canon_sha256":"4a1f70b3647d28cafb88226e55d3e9a95eb9c99aab7cce9a625249b381767fe1"},"schema_version":"1.0"},"canonical_sha256":"0fd27c12dc9a69803de56374bb08ef73eb008eb82ae97bb77ce6ae41312ce249","source":{"kind":"arxiv","id":"1312.0790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0790","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0790v2","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0790","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"B7JHYEW4TJUY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B7JHYEW4TJUYAPPF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B7JHYEW4","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:B7JHYEW4TJUYAPPFMN2LWCHPOP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T12:12:23Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"83cb4be91caeaacd9a8f85fe34bb79b773db4cdd78932bb9b6823c313e2e2fb6","abstract_canon_sha256":"4a1f70b3647d28cafb88226e55d3e9a95eb9c99aab7cce9a625249b381767fe1"},"schema_version":"1.0"},"canonical_sha256":"0fd27c12dc9a69803de56374bb08ef73eb008eb82ae97bb77ce6ae41312ce249","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:20.913658Z","signature_b64":"NJZ79IS2JVCfMDEwpC4QwFlabhqAV0v2V9MoX2yCFqNl/pZpe3zuq0wZuZ5a5CBajaWHuwpfKKTrlPnCyVOUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fd27c12dc9a69803de56374bb08ef73eb008eb82ae97bb77ce6ae41312ce249","last_reissued_at":"2026-05-18T02:56:20.913070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:20.913070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0790","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-18T02:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzV2TkrQdT2hLYwTK1ZzhjfYBspDY7lxACa0mSLxlXbAxDoXFdY1jw8KrqxW4AtOVXZ7fEbK/m73cJyosB72Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:20:31.335595Z"},"content_sha256":"0e20e366742cf0194e05cb4b6f6299262e5c13056c984dbfde0b0edc399b8d80","schema_version":"1.0","event_id":"sha256:0e20e366742cf0194e05cb4b6f6299262e5c13056c984dbfde0b0edc399b8d80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:B7JHYEW4TJUYAPPFMN2LWCHPOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Test Set Selection using Active Information Acquisition for Predictive Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Indrajit Bhattacharya, Pankaj Dayama, Sneha Chaudhari, Vinayaka Pandit","submitted_at":"2013-12-03T12:12:23Z","abstract_excerpt":"In this paper, we consider active information acquisition when the prediction model is meant to be applied on a targeted subset of the population. The goal is to label a pre-specified fraction of customers in the target or test set by iteratively querying for information from the non-target or training set. The number of queries is limited by an overall budget. Arising in the context of two rather disparate applications- banking and medical diagnosis, we pose the active information acquisition problem as a constrained optimization problem. We propose two greedy iterative algorithms for solving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0790","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-18T02:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k01CK3TldpzPyBSqgsro7Ogt6C7/Ri76CxNmYCsN0MjiIUSCDcoutiNJ5e7SzdUSzcFgaPwgHRXMGtNEJlH7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:20:31.336341Z"},"content_sha256":"a6b4a3eeb8b3c61c5ae0f9b2c0a6f2fab50b7fd0a28bf4b3f4c025f164c542c9","schema_version":"1.0","event_id":"sha256:a6b4a3eeb8b3c61c5ae0f9b2c0a6f2fab50b7fd0a28bf4b3f4c025f164c542c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/bundle.json","state_url":"https://pith.science/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/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-30T01:20:31Z","links":{"resolver":"https://pith.science/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP","bundle":"https://pith.science/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/bundle.json","state":"https://pith.science/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7JHYEW4TJUYAPPFMN2LWCHPOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:B7JHYEW4TJUYAPPFMN2LWCHPOP","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":"4a1f70b3647d28cafb88226e55d3e9a95eb9c99aab7cce9a625249b381767fe1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T12:12:23Z","title_canon_sha256":"83cb4be91caeaacd9a8f85fe34bb79b773db4cdd78932bb9b6823c313e2e2fb6"},"schema_version":"1.0","source":{"id":"1312.0790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0790","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0790v2","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0790","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"B7JHYEW4TJUY","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"B7JHYEW4TJUYAPPF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"B7JHYEW4","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:a6b4a3eeb8b3c61c5ae0f9b2c0a6f2fab50b7fd0a28bf4b3f4c025f164c542c9","target":"graph","created_at":"2026-05-18T02:56:20Z","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 this paper, we consider active information acquisition when the prediction model is meant to be applied on a targeted subset of the population. The goal is to label a pre-specified fraction of customers in the target or test set by iteratively querying for information from the non-target or training set. The number of queries is limited by an overall budget. Arising in the context of two rather disparate applications- banking and medical diagnosis, we pose the active information acquisition problem as a constrained optimization problem. We propose two greedy iterative algorithms for solving","authors_text":"Indrajit Bhattacharya, Pankaj Dayama, Sneha Chaudhari, Vinayaka Pandit","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T12:12:23Z","title":"Test Set Selection using Active Information Acquisition for Predictive Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0790","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:0e20e366742cf0194e05cb4b6f6299262e5c13056c984dbfde0b0edc399b8d80","target":"record","created_at":"2026-05-18T02:56:20Z","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":"4a1f70b3647d28cafb88226e55d3e9a95eb9c99aab7cce9a625249b381767fe1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-12-03T12:12:23Z","title_canon_sha256":"83cb4be91caeaacd9a8f85fe34bb79b773db4cdd78932bb9b6823c313e2e2fb6"},"schema_version":"1.0","source":{"id":"1312.0790","kind":"arxiv","version":2}},"canonical_sha256":"0fd27c12dc9a69803de56374bb08ef73eb008eb82ae97bb77ce6ae41312ce249","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fd27c12dc9a69803de56374bb08ef73eb008eb82ae97bb77ce6ae41312ce249","first_computed_at":"2026-05-18T02:56:20.913070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:20.913070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJZ79IS2JVCfMDEwpC4QwFlabhqAV0v2V9MoX2yCFqNl/pZpe3zuq0wZuZ5a5CBajaWHuwpfKKTrlPnCyVOUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:20.913658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e20e366742cf0194e05cb4b6f6299262e5c13056c984dbfde0b0edc399b8d80","sha256:a6b4a3eeb8b3c61c5ae0f9b2c0a6f2fab50b7fd0a28bf4b3f4c025f164c542c9"],"state_sha256":"f3f32d18fdca1a0e525318e578130a6715a5ff637c0d3ef1877e3505aed95483"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UO/yri+q02ecrAmjJT0rZzhv1iFFFA/vJg/XtRLjYbl44rzOp3c+6FKUqAFZ74kKhPNrdv7AlYvUTVr29/89Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:20:31.340599Z","bundle_sha256":"a0dfe0b8115e861fbcec13587a142783c2ebfac6f0b2ceb5f33393c9ccec5126"}}