{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YFLPUHIVKEUD5AYVPN46S2QWJO","short_pith_number":"pith:YFLPUHIV","schema_version":"1.0","canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","source":{"kind":"arxiv","id":"1003.0722","version":3},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, R. Ravi, Viswanath Nagarajan","submitted_at":"2010-03-03T03:58:29Z","abstract_excerpt":"We consider the problem of constructing optimal decision trees: given a collection of tests which can disambiguate between a set of $m$ possible diseases, each test having a cost, and the a-priori likelihood of the patient having any particular disease, what is a good adaptive strategy to perform these tests to minimize the expected cost to identify the disease? We settle the approximability of this problem by giving a tight $O(\\log m)$-approximation algorithm. We also consider a more substantial generalization, the Adaptive TSP problem. Given an underlying metric space, a random subset $S$ of"},"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":"1003.0722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-03T03:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"1f0a05a47cee51368227094f2f57f43deb1aa1cd6daf088d4d6d34947d0d67fd","abstract_canon_sha256":"df7264f9e63670ea46ea4f5252169eff47c97cd4aceccbcb6290cf5cc4a40ffe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:02.975254Z","signature_b64":"+R8JtdD9nhLr0A0gXvIyHFnf2NEwb60Udy6Z79DumiYCX9fQ+t67Ep/qMmfD3g8g1CGjk1N/kicGXx2NKxLhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","last_reissued_at":"2026-05-18T00:46:02.974688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:02.974688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, R. Ravi, Viswanath Nagarajan","submitted_at":"2010-03-03T03:58:29Z","abstract_excerpt":"We consider the problem of constructing optimal decision trees: given a collection of tests which can disambiguate between a set of $m$ possible diseases, each test having a cost, and the a-priori likelihood of the patient having any particular disease, what is a good adaptive strategy to perform these tests to minimize the expected cost to identify the disease? We settle the approximability of this problem by giving a tight $O(\\log m)$-approximation algorithm. We also consider a more substantial generalization, the Adaptive TSP problem. Given an underlying metric space, a random subset $S$ of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0722","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1003.0722","created_at":"2026-05-18T00:46:02.974770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.0722v3","created_at":"2026-05-18T00:46:02.974770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0722","created_at":"2026-05-18T00:46:02.974770+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFLPUHIVKEUD","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFLPUHIVKEUD5AYV","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFLPUHIV","created_at":"2026-05-18T12:26:17.028572+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/YFLPUHIVKEUD5AYVPN46S2QWJO","json":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO.json","graph_json":"https://pith.science/api/pith-number/YFLPUHIVKEUD5AYVPN46S2QWJO/graph.json","events_json":"https://pith.science/api/pith-number/YFLPUHIVKEUD5AYVPN46S2QWJO/events.json","paper":"https://pith.science/paper/YFLPUHIV"},"agent_actions":{"view_html":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO","download_json":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO.json","view_paper":"https://pith.science/paper/YFLPUHIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.0722&json=true","fetch_graph":"https://pith.science/api/pith-number/YFLPUHIVKEUD5AYVPN46S2QWJO/graph.json","fetch_events":"https://pith.science/api/pith-number/YFLPUHIVKEUD5AYVPN46S2QWJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/action/storage_attestation","attest_author":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/action/author_attestation","sign_citation":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/action/citation_signature","submit_replication":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/action/replication_record"}},"created_at":"2026-05-18T00:46:02.974770+00:00","updated_at":"2026-05-18T00:46:02.974770+00:00"}