{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LZF6ZGKEDM56XNTWP6C72ME7P4","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":"68868b070c0c6a84777b5db81eb185bb4904c30aa2b5dd44d52b63c45a5f19ce","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-10-12T16:25:48Z","title_canon_sha256":"5757fe664fc2c8007428fd2fd35c2790e17677905d03e43bf37b9798bdcac797"},"schema_version":"1.0","source":{"id":"2210.06375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.06375","created_at":"2026-07-05T05:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"2210.06375v1","created_at":"2026-07-05T05:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06375","created_at":"2026-07-05T05:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"LZF6ZGKEDM56","created_at":"2026-07-05T05:05:59Z"},{"alias_kind":"pith_short_16","alias_value":"LZF6ZGKEDM56XNTW","created_at":"2026-07-05T05:05:59Z"},{"alias_kind":"pith_short_8","alias_value":"LZF6ZGKE","created_at":"2026-07-05T05:05:59Z"}],"graph_snapshots":[{"event_id":"sha256:fa3a6ce5f9f63078eb74fc3479f678ac67328e93e21f37a2ed541216520bd019","target":"graph","created_at":"2026-07-05T05:05:59Z","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/2210.06375/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We establish new hardness results for decision tree optimization problems, adding to a line of work that dates back to Hyafil and Rivest in 1976. We prove, under randomized ETH, superpolynomial lower bounds for two basic problems: given an explicit representation of a function $f$ and a generator for a distribution $\\mathcal{D}$, construct a small decision tree approximator for $f$ under $\\mathcal{D}$, and decide if there is a small decision tree approximator for $f$ under $\\mathcal{D}$.\n  Our results imply new lower bounds for distribution-free PAC learning and testing of decision trees, sett","authors_text":"Caleb Koch, Carmen Strassle, Li-Yang Tan","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-10-12T16:25:48Z","title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06375","kind":"arxiv","version":1},"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:f62931ad0db85952837cf086cc7f8fddcd8873c756da6af8f4695986f34acdef","target":"record","created_at":"2026-07-05T05:05:59Z","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":"68868b070c0c6a84777b5db81eb185bb4904c30aa2b5dd44d52b63c45a5f19ce","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-10-12T16:25:48Z","title_canon_sha256":"5757fe664fc2c8007428fd2fd35c2790e17677905d03e43bf37b9798bdcac797"},"schema_version":"1.0","source":{"id":"2210.06375","kind":"arxiv","version":1}},"canonical_sha256":"5e4bec99441b3bebb6767f85fd309f7f177654a9ce61487cf93d7baa52564b7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e4bec99441b3bebb6767f85fd309f7f177654a9ce61487cf93d7baa52564b7b","first_computed_at":"2026-07-05T05:05:59.735553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:05:59.735553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RUk+oOfBVTx+be20p3Ufa2gVbrSVkbpWHRbUlnylfzqIi7d1D2VHYpFgesneQIjqry6YwPOAdU3Kkffe+muwAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:05:59.736077Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.06375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f62931ad0db85952837cf086cc7f8fddcd8873c756da6af8f4695986f34acdef","sha256:fa3a6ce5f9f63078eb74fc3479f678ac67328e93e21f37a2ed541216520bd019"],"state_sha256":"e90eb7fabe48b8d81df409bc53f863486792bb2121a6542b0ecc5118de40648c"}