{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KNAD4HLKTFSZMJEJUUFGC3MI4M","short_pith_number":"pith:KNAD4HLK","schema_version":"1.0","canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","source":{"kind":"arxiv","id":"1906.11385","version":2},"attestation_state":"computed","paper":{"title":"A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DS","authors_text":"Percy Liang, Ray Li, Stephen Mussmann","submitted_at":"2019-06-26T23:34:46Z","abstract_excerpt":"Decision Tree is a classic formulation of active learning: given $n$ hypotheses with nonnegative weights summing to 1 and a set of tests that each partition the hypotheses, output a decision tree using the provided tests that uniquely identifies each hypothesis and has minimum (weighted) average depth. Previous works showed that the greedy algorithm achieves a $O(\\log n)$ approximation ratio for this problem and it is NP-hard beat a $O(\\log n)$ approximation, settling the complexity of the problem.\n  However, for Uniform Decision Tree, i.e. Decision Tree with uniform weights, the story is more"},"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":"1906.11385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T23:34:46Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"3a6a52717c78d699a212a195dbf770a34d3c5b18bf4b6423ca8d0c8b214b83fe","abstract_canon_sha256":"a16abab0e1accd2a0658153a5be4643c99af0fe360ef365ed75443a5b287d731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:49.427196Z","signature_b64":"Mn46P1DDPrJnHdEaDZBkK8Id1pq01hjvEQuyIJ1dzyK0jQCzKTRG/EWB2anbhN6wXdIpUygV8OpdC3tXFxbbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","last_reissued_at":"2026-07-05T00:13:49.426742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:49.426742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DS","authors_text":"Percy Liang, Ray Li, Stephen Mussmann","submitted_at":"2019-06-26T23:34:46Z","abstract_excerpt":"Decision Tree is a classic formulation of active learning: given $n$ hypotheses with nonnegative weights summing to 1 and a set of tests that each partition the hypotheses, output a decision tree using the provided tests that uniquely identifies each hypothesis and has minimum (weighted) average depth. Previous works showed that the greedy algorithm achieves a $O(\\log n)$ approximation ratio for this problem and it is NP-hard beat a $O(\\log n)$ approximation, settling the complexity of the problem.\n  However, for Uniform Decision Tree, i.e. Decision Tree with uniform weights, the story is more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11385","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.11385/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":"1906.11385","created_at":"2026-07-05T00:13:49.426807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11385v2","created_at":"2026-07-05T00:13:49.426807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11385","created_at":"2026-07-05T00:13:49.426807+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNAD4HLKTFSZ","created_at":"2026-07-05T00:13:49.426807+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNAD4HLKTFSZMJEJ","created_at":"2026-07-05T00:13:49.426807+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNAD4HLK","created_at":"2026-07-05T00:13:49.426807+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/KNAD4HLKTFSZMJEJUUFGC3MI4M","json":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M.json","graph_json":"https://pith.science/api/pith-number/KNAD4HLKTFSZMJEJUUFGC3MI4M/graph.json","events_json":"https://pith.science/api/pith-number/KNAD4HLKTFSZMJEJUUFGC3MI4M/events.json","paper":"https://pith.science/paper/KNAD4HLK"},"agent_actions":{"view_html":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M","download_json":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M.json","view_paper":"https://pith.science/paper/KNAD4HLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11385&json=true","fetch_graph":"https://pith.science/api/pith-number/KNAD4HLKTFSZMJEJUUFGC3MI4M/graph.json","fetch_events":"https://pith.science/api/pith-number/KNAD4HLKTFSZMJEJUUFGC3MI4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/action/storage_attestation","attest_author":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/action/author_attestation","sign_citation":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/action/citation_signature","submit_replication":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/action/replication_record"}},"created_at":"2026-07-05T00:13:49.426807+00:00","updated_at":"2026-07-05T00:13:49.426807+00:00"}