{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:U5HCQOHPOJNRWWXJOELP74ISEI","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":"c426c914d85c0330085320b8ac97a7c683f28337ca24f46528bf355a0892e93b","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-01T22:12:47Z","title_canon_sha256":"dadcb8ddf137587ff7283448d878898762be485e917d4dea112bce47d3a7f1af"},"schema_version":"1.0","source":{"id":"2109.00637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.00637","created_at":"2026-07-05T03:27:35Z"},{"alias_kind":"arxiv_version","alias_value":"2109.00637v2","created_at":"2026-07-05T03:27:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00637","created_at":"2026-07-05T03:27:35Z"},{"alias_kind":"pith_short_12","alias_value":"U5HCQOHPOJNR","created_at":"2026-07-05T03:27:35Z"},{"alias_kind":"pith_short_16","alias_value":"U5HCQOHPOJNRWWXJ","created_at":"2026-07-05T03:27:35Z"},{"alias_kind":"pith_short_8","alias_value":"U5HCQOHP","created_at":"2026-07-05T03:27:35Z"}],"graph_snapshots":[{"event_id":"sha256:236ee8d0a7a62c55bf456890cff3a9995bb8c4f7fdc0e86d71d31b50d198cb93","target":"graph","created_at":"2026-07-05T03:27:35Z","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/2109.00637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an $n^{O(\\log\\log n)}$-time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over $\\{\\pm 1\\}^n$. Even in the realizable setting, the previous fastest runtime was $n^{O(\\log n)}$, a consequence of a classic algorithm of Ehrenfeucht and Haussler. Our algorithm shares similarities with practical heuristics for learning decision trees, which we augment with additional ideas to circumvent known lower bounds against these heuristics. To analyze our algorithm, we prove a new structural result for decision trees that strengthens a ","authors_text":"Guy Blanc, Jane Lange, Li-Yang Tan, Mingda Qiao","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-01T22:12:47Z","title":"Properly learning decision trees in almost polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00637","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:bb1c0e131055f2ff7e605b967c6744f7ee7a265f26546da329adc2d26c550b07","target":"record","created_at":"2026-07-05T03:27:35Z","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":"c426c914d85c0330085320b8ac97a7c683f28337ca24f46528bf355a0892e93b","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-01T22:12:47Z","title_canon_sha256":"dadcb8ddf137587ff7283448d878898762be485e917d4dea112bce47d3a7f1af"},"schema_version":"1.0","source":{"id":"2109.00637","kind":"arxiv","version":2}},"canonical_sha256":"a74e2838ef725b1b5ae97116fff112223d05c9808f9b7f80adadeca12def8fd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a74e2838ef725b1b5ae97116fff112223d05c9808f9b7f80adadeca12def8fd7","first_computed_at":"2026-07-05T03:27:35.351053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:27:35.351053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w1C0POq0A6FdAVeBtxCqxyyYRd2ZTDQRcaIiGXv5eSn6KongUBBrQ8Akim9an2vEMuYqJk8aEVo8OZfd3SPTCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:27:35.351465Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.00637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb1c0e131055f2ff7e605b967c6744f7ee7a265f26546da329adc2d26c550b07","sha256:236ee8d0a7a62c55bf456890cff3a9995bb8c4f7fdc0e86d71d31b50d198cb93"],"state_sha256":"8c725b7b014dea3353286a9a3b353c6e90ce48880efa4c327e1a9d56f6d2a2b7"}