{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MP6W7MRA43PM6K7FC4SJR4X77J","short_pith_number":"pith:MP6W7MRA","schema_version":"1.0","canonical_sha256":"63fd6fb220e6decf2be5172498f2fffa51560832aef9ac51e423225c26115de3","source":{"kind":"arxiv","id":"2307.04093","version":1},"attestation_state":"computed","paper":{"title":"Properly Learning Decision Trees with Queries Is NP-Hard","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":"2023-07-09T04:29:43Z","abstract_excerpt":"We prove that it is NP-hard to properly PAC learn decision trees with queries, resolving a longstanding open problem in learning theory (Bshouty 1993; Guijarro-Lavin-Raghavan 1999; Mehta-Raghavan 2002; Feldman 2016). While there has been a long line of work, dating back to (Pitt-Valiant 1988), establishing the hardness of properly learning decision trees from random examples, the more challenging setting of query learners necessitates different techniques and there were no previous lower bounds. En route to our main result, we simplify and strengthen the best known lower bounds for a different"},"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":"2307.04093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-07-09T04:29:43Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"d9510fe0a4779a77173b95e35b038dd9f7496383140180a7e66a80f745d0371b","abstract_canon_sha256":"116f1045257550af62a7dc0c6e84ce931839ad97b09d9fb06381981fe1ecf97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:08.523801Z","signature_b64":"kcphHvSOhNuM6JSYtEECznUpmi5VZYcEgaIQOSSltyrouDRLUq3YbEweliwxOrZ+RobZWE33oi/uwT6Xblk5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63fd6fb220e6decf2be5172498f2fffa51560832aef9ac51e423225c26115de3","last_reissued_at":"2026-07-05T06:29:08.523374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:08.523374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properly Learning Decision Trees with Queries Is NP-Hard","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":"2023-07-09T04:29:43Z","abstract_excerpt":"We prove that it is NP-hard to properly PAC learn decision trees with queries, resolving a longstanding open problem in learning theory (Bshouty 1993; Guijarro-Lavin-Raghavan 1999; Mehta-Raghavan 2002; Feldman 2016). While there has been a long line of work, dating back to (Pitt-Valiant 1988), establishing the hardness of properly learning decision trees from random examples, the more challenging setting of query learners necessitates different techniques and there were no previous lower bounds. En route to our main result, we simplify and strengthen the best known lower bounds for a different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04093","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/2307.04093/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":"2307.04093","created_at":"2026-07-05T06:29:08.523433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04093v1","created_at":"2026-07-05T06:29:08.523433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04093","created_at":"2026-07-05T06:29:08.523433+00:00"},{"alias_kind":"pith_short_12","alias_value":"MP6W7MRA43PM","created_at":"2026-07-05T06:29:08.523433+00:00"},{"alias_kind":"pith_short_16","alias_value":"MP6W7MRA43PM6K7F","created_at":"2026-07-05T06:29:08.523433+00:00"},{"alias_kind":"pith_short_8","alias_value":"MP6W7MRA","created_at":"2026-07-05T06:29:08.523433+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/MP6W7MRA43PM6K7FC4SJR4X77J","json":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J.json","graph_json":"https://pith.science/api/pith-number/MP6W7MRA43PM6K7FC4SJR4X77J/graph.json","events_json":"https://pith.science/api/pith-number/MP6W7MRA43PM6K7FC4SJR4X77J/events.json","paper":"https://pith.science/paper/MP6W7MRA"},"agent_actions":{"view_html":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J","download_json":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J.json","view_paper":"https://pith.science/paper/MP6W7MRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04093&json=true","fetch_graph":"https://pith.science/api/pith-number/MP6W7MRA43PM6K7FC4SJR4X77J/graph.json","fetch_events":"https://pith.science/api/pith-number/MP6W7MRA43PM6K7FC4SJR4X77J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J/action/storage_attestation","attest_author":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J/action/author_attestation","sign_citation":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J/action/citation_signature","submit_replication":"https://pith.science/pith/MP6W7MRA43PM6K7FC4SJR4X77J/action/replication_record"}},"created_at":"2026-07-05T06:29:08.523433+00:00","updated_at":"2026-07-05T06:29:08.523433+00:00"}