{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YFLPUHIVKEUD5AYVPN46S2QWJO","short_pith_number":"pith:YFLPUHIV","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"},"canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","source":{"kind":"arxiv","id":"1003.0722","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0722","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0722v3","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0722","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"YFLPUHIVKEUD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YFLPUHIVKEUD5AYV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YFLPUHIV","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YFLPUHIVKEUD5AYVPN46S2QWJO","target":"record","payload":{"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"},"canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","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"},"source_kind":"arxiv","source_id":"1003.0722","source_version":3,"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:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lnW+pIsrqp48DBVVHsOjSViQBYx2TsRcZ1xVvzq1tigi6uLr7zyW8OJ34pqFVxe4sJLxkIEXjKTNwKWO+ASDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:47:04.556174Z"},"content_sha256":"9dc13c0f28aa618adf87fcdd59e6d39f70336537345337f6e14b7b54cb1f10f8","schema_version":"1.0","event_id":"sha256:9dc13c0f28aa618adf87fcdd59e6d39f70336537345337f6e14b7b54cb1f10f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YFLPUHIVKEUD5AYVPN46S2QWJO","target":"graph","payload":{"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"},"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:46:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqkzC15EogSicS19YL+n0l8U3vnOiwkOqytvZf4V2KYhwH+Ikt5M9WCCWiEiVIyz6Poc0rnNrIAOjKWlhdaQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:47:04.556893Z"},"content_sha256":"aa7965e8796cc61003bbd2d54ea215debdadfb50fc6de7792aff9291036aba23","schema_version":"1.0","event_id":"sha256:aa7965e8796cc61003bbd2d54ea215debdadfb50fc6de7792aff9291036aba23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/bundle.json","state_url":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/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-09T11:47:04Z","links":{"resolver":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO","bundle":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/bundle.json","state":"https://pith.science/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFLPUHIVKEUD5AYVPN46S2QWJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YFLPUHIVKEUD5AYVPN46S2QWJO","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":"df7264f9e63670ea46ea4f5252169eff47c97cd4aceccbcb6290cf5cc4a40ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-03T03:58:29Z","title_canon_sha256":"1f0a05a47cee51368227094f2f57f43deb1aa1cd6daf088d4d6d34947d0d67fd"},"schema_version":"1.0","source":{"id":"1003.0722","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0722","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0722v3","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0722","created_at":"2026-05-18T00:46:02Z"},{"alias_kind":"pith_short_12","alias_value":"YFLPUHIVKEUD","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YFLPUHIVKEUD5AYV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YFLPUHIV","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:aa7965e8796cc61003bbd2d54ea215debdadfb50fc6de7792aff9291036aba23","target":"graph","created_at":"2026-05-18T00:46:02Z","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 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","authors_text":"Anupam Gupta, R. Ravi, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-03T03:58:29Z","title":"Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0722","kind":"arxiv","version":3},"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:9dc13c0f28aa618adf87fcdd59e6d39f70336537345337f6e14b7b54cb1f10f8","target":"record","created_at":"2026-05-18T00:46:02Z","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":"df7264f9e63670ea46ea4f5252169eff47c97cd4aceccbcb6290cf5cc4a40ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-03T03:58:29Z","title_canon_sha256":"1f0a05a47cee51368227094f2f57f43deb1aa1cd6daf088d4d6d34947d0d67fd"},"schema_version":"1.0","source":{"id":"1003.0722","kind":"arxiv","version":3}},"canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c156fa1d1551283e83157b79e96a164badb6a05a4f4c5275a94c61e0f72d6960","first_computed_at":"2026-05-18T00:46:02.974688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:02.974688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+R8JtdD9nhLr0A0gXvIyHFnf2NEwb60Udy6Z79DumiYCX9fQ+t67Ep/qMmfD3g8g1CGjk1N/kicGXx2NKxLhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:02.975254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.0722","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dc13c0f28aa618adf87fcdd59e6d39f70336537345337f6e14b7b54cb1f10f8","sha256:aa7965e8796cc61003bbd2d54ea215debdadfb50fc6de7792aff9291036aba23"],"state_sha256":"7082b9d485833489afe43682fdff1abffcc804e3e6f0c1fbd50c37581bc495b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MDPKrPYEiuW4I7v2Kzyfqa9YZSWICnCLKJjDai2JlAPVOuk87mYNh+8GI/8JGMiKEWkBapuvQ6AXlBvxOC6cDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:47:04.560611Z","bundle_sha256":"b8483b8aeca3d0160a1662ea748f996f184b5360ac574734317f18e79f2e7f31"}}