{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LZF6ZGKEDM56XNTWP6C72ME7P4","short_pith_number":"pith:LZF6ZGKE","schema_version":"1.0","canonical_sha256":"5e4bec99441b3bebb6767f85fd309f7f177654a9ce61487cf93d7baa52564b7b","source":{"kind":"arxiv","id":"2210.06375","version":1},"attestation_state":"computed","paper":{"title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Caleb Koch, Carmen Strassle, Li-Yang Tan","submitted_at":"2022-10-12T16:25:48Z","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"},"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":"2210.06375","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-10-12T16:25:48Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"5757fe664fc2c8007428fd2fd35c2790e17677905d03e43bf37b9798bdcac797","abstract_canon_sha256":"68868b070c0c6a84777b5db81eb185bb4904c30aa2b5dd44d52b63c45a5f19ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:59.736077Z","signature_b64":"RUk+oOfBVTx+be20p3Ufa2gVbrSVkbpWHRbUlnylfzqIi7d1D2VHYpFgesneQIjqry6YwPOAdU3Kkffe+muwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4bec99441b3bebb6767f85fd309f7f177654a9ce61487cf93d7baa52564b7b","last_reissued_at":"2026-07-05T05:05:59.735553Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:59.735553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superpolynomial Lower Bounds for Decision Tree Learning and Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Caleb Koch, Carmen Strassle, Li-Yang Tan","submitted_at":"2022-10-12T16:25:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06375","kind":"arxiv","version":1},"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/2210.06375/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":"2210.06375","created_at":"2026-07-05T05:05:59.735636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06375v1","created_at":"2026-07-05T05:05:59.735636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06375","created_at":"2026-07-05T05:05:59.735636+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZF6ZGKEDM56","created_at":"2026-07-05T05:05:59.735636+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZF6ZGKEDM56XNTW","created_at":"2026-07-05T05:05:59.735636+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZF6ZGKE","created_at":"2026-07-05T05:05:59.735636+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/LZF6ZGKEDM56XNTWP6C72ME7P4","json":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4.json","graph_json":"https://pith.science/api/pith-number/LZF6ZGKEDM56XNTWP6C72ME7P4/graph.json","events_json":"https://pith.science/api/pith-number/LZF6ZGKEDM56XNTWP6C72ME7P4/events.json","paper":"https://pith.science/paper/LZF6ZGKE"},"agent_actions":{"view_html":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4","download_json":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4.json","view_paper":"https://pith.science/paper/LZF6ZGKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06375&json=true","fetch_graph":"https://pith.science/api/pith-number/LZF6ZGKEDM56XNTWP6C72ME7P4/graph.json","fetch_events":"https://pith.science/api/pith-number/LZF6ZGKEDM56XNTWP6C72ME7P4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4/action/storage_attestation","attest_author":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4/action/author_attestation","sign_citation":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4/action/citation_signature","submit_replication":"https://pith.science/pith/LZF6ZGKEDM56XNTWP6C72ME7P4/action/replication_record"}},"created_at":"2026-07-05T05:05:59.735636+00:00","updated_at":"2026-07-05T05:05:59.735636+00:00"}