{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RELSDDVXLFSZO76MMVR5OQW6JJ","short_pith_number":"pith:RELSDDVX","canonical_record":{"source":{"id":"2010.03962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-04T23:12:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce03c45ccaad02a9ac249fd0c01f54443c6225a2ea54fd1a79d306d17c906760","abstract_canon_sha256":"b87308ed34023c6bed05205b91c4c91080d3e53943b81faf8d84c08f2b9d61a2"},"schema_version":"1.0"},"canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","source":{"kind":"arxiv","id":"2010.03962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03962","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03962v1","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03962","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"RELSDDVXLFSZ","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_16","alias_value":"RELSDDVXLFSZO76M","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_8","alias_value":"RELSDDVX","created_at":"2026-07-05T01:41:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RELSDDVXLFSZO76MMVR5OQW6JJ","target":"record","payload":{"canonical_record":{"source":{"id":"2010.03962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-04T23:12:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ce03c45ccaad02a9ac249fd0c01f54443c6225a2ea54fd1a79d306d17c906760","abstract_canon_sha256":"b87308ed34023c6bed05205b91c4c91080d3e53943b81faf8d84c08f2b9d61a2"},"schema_version":"1.0"},"canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:25.533577Z","signature_b64":"Rr18HLb5iVloXmTXPgoMQvn2fccb3C7GnlggEgo2YtpVarx1JN/8N0CJr4yWLWMu3Kr4zs/xWUr4NLKjl/d2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","last_reissued_at":"2026-07-05T01:41:25.533113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:25.533113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.03962","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-07-05T01:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GwsFkmdNbLJUoW3HKM1vQCVI17rDL7zPuFy/+aaIAnyOYsqQ7KwRuRR1kdcfN2sH8KLX4qR9+r6YkRNMw9PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:31:22.142231Z"},"content_sha256":"bc49b9c38578d3462e3db6bb177b66570b265257ce81e7e1560f6b71e9806963","schema_version":"1.0","event_id":"sha256:bc49b9c38578d3462e3db6bb177b66570b265257ce81e7e1560f6b71e9806963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RELSDDVXLFSZO76MMVR5OQW6JJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Test-Cost Sensitive Methods for Identifying Nearby Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Christopher Leung, Seung Gyu Hyun","submitted_at":"2020-10-04T23:12:28Z","abstract_excerpt":"Real-world applications that involve missing values are often constrained by the cost to obtain data. Test-cost sensitive, or costly feature, methods additionally consider the cost of acquiring features. Such methods have been extensively studied in the problem of classification. In this paper, we study a related problem of test-cost sensitive methods to identify nearby points from a large set, given a new point with some unknown feature values. We present two models, one based on a tree and another based on Deep Reinforcement Learning. In our simulations, we show that the models outperform ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03962","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.03962/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-05T01:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WELLubOypuAat3gnmkxLA1maAT+X/6PUKadl24NQme8zyu8l0pA73vVGnJH67K9MCXo3L8uiXYbdo1yOFJyKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:31:22.143173Z"},"content_sha256":"55ac3dc9f95fdf1949f30e0f3ad54fef02a4e272d2a577d440c67277d37c1fc7","schema_version":"1.0","event_id":"sha256:55ac3dc9f95fdf1949f30e0f3ad54fef02a4e272d2a577d440c67277d37c1fc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/bundle.json","state_url":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/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-04T22:31:22Z","links":{"resolver":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ","bundle":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/bundle.json","state":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RELSDDVXLFSZO76MMVR5OQW6JJ","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":"b87308ed34023c6bed05205b91c4c91080d3e53943b81faf8d84c08f2b9d61a2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-04T23:12:28Z","title_canon_sha256":"ce03c45ccaad02a9ac249fd0c01f54443c6225a2ea54fd1a79d306d17c906760"},"schema_version":"1.0","source":{"id":"2010.03962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03962","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03962v1","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03962","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"RELSDDVXLFSZ","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_16","alias_value":"RELSDDVXLFSZO76M","created_at":"2026-07-05T01:41:25Z"},{"alias_kind":"pith_short_8","alias_value":"RELSDDVX","created_at":"2026-07-05T01:41:25Z"}],"graph_snapshots":[{"event_id":"sha256:55ac3dc9f95fdf1949f30e0f3ad54fef02a4e272d2a577d440c67277d37c1fc7","target":"graph","created_at":"2026-07-05T01:41:25Z","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/2010.03962/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-world applications that involve missing values are often constrained by the cost to obtain data. Test-cost sensitive, or costly feature, methods additionally consider the cost of acquiring features. Such methods have been extensively studied in the problem of classification. In this paper, we study a related problem of test-cost sensitive methods to identify nearby points from a large set, given a new point with some unknown feature values. We present two models, one based on a tree and another based on Deep Reinforcement Learning. In our simulations, we show that the models outperform ra","authors_text":"Christopher Leung, Seung Gyu Hyun","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-04T23:12:28Z","title":"Test-Cost Sensitive Methods for Identifying Nearby Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03962","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:bc49b9c38578d3462e3db6bb177b66570b265257ce81e7e1560f6b71e9806963","target":"record","created_at":"2026-07-05T01:41:25Z","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":"b87308ed34023c6bed05205b91c4c91080d3e53943b81faf8d84c08f2b9d61a2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-04T23:12:28Z","title_canon_sha256":"ce03c45ccaad02a9ac249fd0c01f54443c6225a2ea54fd1a79d306d17c906760"},"schema_version":"1.0","source":{"id":"2010.03962","kind":"arxiv","version":1}},"canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","first_computed_at":"2026-07-05T01:41:25.533113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:41:25.533113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rr18HLb5iVloXmTXPgoMQvn2fccb3C7GnlggEgo2YtpVarx1JN/8N0CJr4yWLWMu3Kr4zs/xWUr4NLKjl/d2CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:41:25.533577Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.03962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc49b9c38578d3462e3db6bb177b66570b265257ce81e7e1560f6b71e9806963","sha256:55ac3dc9f95fdf1949f30e0f3ad54fef02a4e272d2a577d440c67277d37c1fc7"],"state_sha256":"09a0fc083673dd37119907561684c84b62a11b10a9286eeed7df14cf9bff3a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doAnfp3oQtzqv2MAZYoutmaTE7x4T5B5d8XJCeY1LO5n9r4XJYg7FOmV1/2IPYCxzgGVoMYVrjVmU+Ua80b5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:31:22.148260Z","bundle_sha256":"1a487a1e04318cf40e0fcbccc33749e13fdf410ec925cf9b5c2d8086a5c7203b"}}