{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KNAD4HLKTFSZMJEJUUFGC3MI4M","short_pith_number":"pith:KNAD4HLK","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"},"canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","source":{"kind":"arxiv","id":"1906.11385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11385","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11385v2","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11385","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"KNAD4HLKTFSZ","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_16","alias_value":"KNAD4HLKTFSZMJEJ","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_8","alias_value":"KNAD4HLK","created_at":"2026-07-05T00:13:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KNAD4HLKTFSZMJEJUUFGC3MI4M","target":"record","payload":{"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"},"canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","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"},"source_kind":"arxiv","source_id":"1906.11385","source_version":2,"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-05T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1aIxtbkZ9nr/cRgWRgIlUhGXzePV+eA2aRg+GHgV7CGRMrFrVBh3MQiiB7c62RunXHLTK6yu3j+3HGyxPtcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:02.351683Z"},"content_sha256":"ea785c553bdc8eaf41352280979ea1c1b9e9f358d83e2fbe93d5e7becd1192eb","schema_version":"1.0","event_id":"sha256:ea785c553bdc8eaf41352280979ea1c1b9e9f358d83e2fbe93d5e7becd1192eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KNAD4HLKTFSZMJEJUUFGC3MI4M","target":"graph","payload":{"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"},"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-05T00:13:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNHLPXiUtVIPe41YjXX6peN/DVb2WSZxIvGrVrkgBj7MbEK91STvLTGXtAW6u/rzHs3/3FLFKssjWnU+J9ClCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:53:02.382679Z"},"content_sha256":"ea031a562f3df7c9a5e051954b654d82d673d3c11e2891e08909764d88322256","schema_version":"1.0","event_id":"sha256:ea031a562f3df7c9a5e051954b654d82d673d3c11e2891e08909764d88322256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/bundle.json","state_url":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/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-05T09:53:02Z","links":{"resolver":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M","bundle":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/bundle.json","state":"https://pith.science/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNAD4HLKTFSZMJEJUUFGC3MI4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KNAD4HLKTFSZMJEJUUFGC3MI4M","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":"a16abab0e1accd2a0658153a5be4643c99af0fe360ef365ed75443a5b287d731","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T23:34:46Z","title_canon_sha256":"3a6a52717c78d699a212a195dbf770a34d3c5b18bf4b6423ca8d0c8b214b83fe"},"schema_version":"1.0","source":{"id":"1906.11385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11385","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11385v2","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11385","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_12","alias_value":"KNAD4HLKTFSZ","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_16","alias_value":"KNAD4HLKTFSZMJEJ","created_at":"2026-07-05T00:13:49Z"},{"alias_kind":"pith_short_8","alias_value":"KNAD4HLK","created_at":"2026-07-05T00:13:49Z"}],"graph_snapshots":[{"event_id":"sha256:ea031a562f3df7c9a5e051954b654d82d673d3c11e2891e08909764d88322256","target":"graph","created_at":"2026-07-05T00:13:49Z","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/1906.11385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Percy Liang, Ray Li, Stephen Mussmann","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T23:34:46Z","title":"A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11385","kind":"arxiv","version":2},"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:ea785c553bdc8eaf41352280979ea1c1b9e9f358d83e2fbe93d5e7becd1192eb","target":"record","created_at":"2026-07-05T00:13:49Z","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":"a16abab0e1accd2a0658153a5be4643c99af0fe360ef365ed75443a5b287d731","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T23:34:46Z","title_canon_sha256":"3a6a52717c78d699a212a195dbf770a34d3c5b18bf4b6423ca8d0c8b214b83fe"},"schema_version":"1.0","source":{"id":"1906.11385","kind":"arxiv","version":2}},"canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53403e1d6a9965962489a50a616d88e3347682af48853024cfc9e97a5841839c","first_computed_at":"2026-07-05T00:13:49.426742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:13:49.426742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mn46P1DDPrJnHdEaDZBkK8Id1pq01hjvEQuyIJ1dzyK0jQCzKTRG/EWB2anbhN6wXdIpUygV8OpdC3tXFxbbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:13:49.427196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea785c553bdc8eaf41352280979ea1c1b9e9f358d83e2fbe93d5e7becd1192eb","sha256:ea031a562f3df7c9a5e051954b654d82d673d3c11e2891e08909764d88322256"],"state_sha256":"62d07cdf0479e77b3b513453b673274a13fed6638712947597166bd8dd4c613d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PF4Li4/azhuQwqOA0eCgQq73v5iLVGhs/92nsGcbpk+0J+9u7b9lJmOlpgh88neXIhC4jviJw0mCtvI34r+LAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:53:02.407052Z","bundle_sha256":"b21beeea2578049c3c96d376a67cf89822dc37f8a76bcf0c7d543057d5170b50"}}