{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RELSDDVXLFSZO76MMVR5OQW6JJ","short_pith_number":"pith:RELSDDVX","schema_version":"1.0","canonical_sha256":"8917218eb75965977fcc6563d742de4a7ccd3139405acce4759e723f15eef6fd","source":{"kind":"arxiv","id":"2010.03962","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.03962","created_at":"2026-07-05T01:41:25.533170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.03962v1","created_at":"2026-07-05T01:41:25.533170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03962","created_at":"2026-07-05T01:41:25.533170+00:00"},{"alias_kind":"pith_short_12","alias_value":"RELSDDVXLFSZ","created_at":"2026-07-05T01:41:25.533170+00:00"},{"alias_kind":"pith_short_16","alias_value":"RELSDDVXLFSZO76M","created_at":"2026-07-05T01:41:25.533170+00:00"},{"alias_kind":"pith_short_8","alias_value":"RELSDDVX","created_at":"2026-07-05T01:41:25.533170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ","json":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ.json","graph_json":"https://pith.science/api/pith-number/RELSDDVXLFSZO76MMVR5OQW6JJ/graph.json","events_json":"https://pith.science/api/pith-number/RELSDDVXLFSZO76MMVR5OQW6JJ/events.json","paper":"https://pith.science/paper/RELSDDVX"},"agent_actions":{"view_html":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ","download_json":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ.json","view_paper":"https://pith.science/paper/RELSDDVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.03962&json=true","fetch_graph":"https://pith.science/api/pith-number/RELSDDVXLFSZO76MMVR5OQW6JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RELSDDVXLFSZO76MMVR5OQW6JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/action/storage_attestation","attest_author":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/action/author_attestation","sign_citation":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/action/citation_signature","submit_replication":"https://pith.science/pith/RELSDDVXLFSZO76MMVR5OQW6JJ/action/replication_record"}},"created_at":"2026-07-05T01:41:25.533170+00:00","updated_at":"2026-07-05T01:41:25.533170+00:00"}