{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JOTYLL4VCOQGHSC6P62L7SS63L","short_pith_number":"pith:JOTYLL4V","canonical_record":{"source":{"id":"2409.13096","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-19T21:40:57Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"bbedae43cbaed5dd5b77d3c6bd72de57ae8bfb2cf5943c376b8e9efe48204503","abstract_canon_sha256":"d996de9739efecde1775aefc488f3f22cc9bf8ae7a79272a56fe140361c0a4ef"},"schema_version":"1.0"},"canonical_sha256":"4ba785af9513a063c85e7fb4bfca5edaf440730e0c0a7da915de67a88e154f1f","source":{"kind":"arxiv","id":"2409.13096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13096","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13096v2","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13096","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"JOTYLL4VCOQG","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_16","alias_value":"JOTYLL4VCOQGHSC6","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_8","alias_value":"JOTYLL4V","created_at":"2026-07-05T09:11:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JOTYLL4VCOQGHSC6P62L7SS63L","target":"record","payload":{"canonical_record":{"source":{"id":"2409.13096","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-19T21:40:57Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"bbedae43cbaed5dd5b77d3c6bd72de57ae8bfb2cf5943c376b8e9efe48204503","abstract_canon_sha256":"d996de9739efecde1775aefc488f3f22cc9bf8ae7a79272a56fe140361c0a4ef"},"schema_version":"1.0"},"canonical_sha256":"4ba785af9513a063c85e7fb4bfca5edaf440730e0c0a7da915de67a88e154f1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:48.352443Z","signature_b64":"nDtE7QpDPbtIrBCVzHKAhoC4BaNxlrnsl5Qnwi9jM+cSplqKOjteGBGCaQYRuZ1+b1UfHO+L5oJdy0W6FYgyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ba785af9513a063c85e7fb4bfca5edaf440730e0c0a7da915de67a88e154f1f","last_reissued_at":"2026-07-05T09:11:48.352066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:48.352066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.13096","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-05T09:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJngioN9Zbj1xkfNYFQfLOzKIQqw8fxZCx00wwf76Nuu34TXWCqsqxvKyuR7GOA2TmS7O8WlAFzXGYggTdMaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:22:19.288829Z"},"content_sha256":"6b094f23f96e7a00ec6e32226ae1ace7ca07aeb2e336db36e0c5a42396b8418e","schema_version":"1.0","event_id":"sha256:6b094f23f96e7a00ec6e32226ae1ace7ca07aeb2e336db36e0c5a42396b8418e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JOTYLL4VCOQGHSC6P62L7SS63L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast decision tree learning solves hard coding-theoretic problems","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":"2024-09-19T21:40:57Z","abstract_excerpt":"We connect the problem of properly PAC learning decision trees to the parameterized Nearest Codeword Problem ($k$-NCP). Despite significant effort by the respective communities, algorithmic progress on both problems has been stuck: the fastest known algorithm for the former runs in quasipolynomial time (Ehrenfeucht and Haussler 1989) and the best known approximation ratio for the latter is $O(n/\\log n)$ (Berman and Karpinsky 2002; Alon, Panigrahy, and Yekhanin 2009). Research on both problems has thus far proceeded independently with no known connections.\n  We show that $\\textit{any}$ improvem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13096","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/2409.13096/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-05T09:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pa44LyQK+I1eSfT6lep/GbZD5U3Z3xmL/fJGrmLX2N5jjTBnf3AqPxkirRpl1UznYdN4GhA5UWpc3Jv6K/sbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:22:19.289209Z"},"content_sha256":"a383be2ea6d1e69d9b7b885da59120cc3cce1f2536a1bc4416afef57d3a1c978","schema_version":"1.0","event_id":"sha256:a383be2ea6d1e69d9b7b885da59120cc3cce1f2536a1bc4416afef57d3a1c978"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOTYLL4VCOQGHSC6P62L7SS63L/bundle.json","state_url":"https://pith.science/pith/JOTYLL4VCOQGHSC6P62L7SS63L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOTYLL4VCOQGHSC6P62L7SS63L/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-07-07T10:22:19Z","links":{"resolver":"https://pith.science/pith/JOTYLL4VCOQGHSC6P62L7SS63L","bundle":"https://pith.science/pith/JOTYLL4VCOQGHSC6P62L7SS63L/bundle.json","state":"https://pith.science/pith/JOTYLL4VCOQGHSC6P62L7SS63L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOTYLL4VCOQGHSC6P62L7SS63L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JOTYLL4VCOQGHSC6P62L7SS63L","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":"d996de9739efecde1775aefc488f3f22cc9bf8ae7a79272a56fe140361c0a4ef","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-19T21:40:57Z","title_canon_sha256":"bbedae43cbaed5dd5b77d3c6bd72de57ae8bfb2cf5943c376b8e9efe48204503"},"schema_version":"1.0","source":{"id":"2409.13096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13096","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13096v2","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13096","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"JOTYLL4VCOQG","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_16","alias_value":"JOTYLL4VCOQGHSC6","created_at":"2026-07-05T09:11:48Z"},{"alias_kind":"pith_short_8","alias_value":"JOTYLL4V","created_at":"2026-07-05T09:11:48Z"}],"graph_snapshots":[{"event_id":"sha256:a383be2ea6d1e69d9b7b885da59120cc3cce1f2536a1bc4416afef57d3a1c978","target":"graph","created_at":"2026-07-05T09:11:48Z","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/2409.13096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We connect the problem of properly PAC learning decision trees to the parameterized Nearest Codeword Problem ($k$-NCP). Despite significant effort by the respective communities, algorithmic progress on both problems has been stuck: the fastest known algorithm for the former runs in quasipolynomial time (Ehrenfeucht and Haussler 1989) and the best known approximation ratio for the latter is $O(n/\\log n)$ (Berman and Karpinsky 2002; Alon, Panigrahy, and Yekhanin 2009). Research on both problems has thus far proceeded independently with no known connections.\n  We show that $\\textit{any}$ improvem","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":"2024-09-19T21:40:57Z","title":"Fast decision tree learning solves hard coding-theoretic problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13096","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:6b094f23f96e7a00ec6e32226ae1ace7ca07aeb2e336db36e0c5a42396b8418e","target":"record","created_at":"2026-07-05T09:11:48Z","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":"d996de9739efecde1775aefc488f3f22cc9bf8ae7a79272a56fe140361c0a4ef","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-09-19T21:40:57Z","title_canon_sha256":"bbedae43cbaed5dd5b77d3c6bd72de57ae8bfb2cf5943c376b8e9efe48204503"},"schema_version":"1.0","source":{"id":"2409.13096","kind":"arxiv","version":2}},"canonical_sha256":"4ba785af9513a063c85e7fb4bfca5edaf440730e0c0a7da915de67a88e154f1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ba785af9513a063c85e7fb4bfca5edaf440730e0c0a7da915de67a88e154f1f","first_computed_at":"2026-07-05T09:11:48.352066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:11:48.352066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDtE7QpDPbtIrBCVzHKAhoC4BaNxlrnsl5Qnwi9jM+cSplqKOjteGBGCaQYRuZ1+b1UfHO+L5oJdy0W6FYgyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:11:48.352443Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.13096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b094f23f96e7a00ec6e32226ae1ace7ca07aeb2e336db36e0c5a42396b8418e","sha256:a383be2ea6d1e69d9b7b885da59120cc3cce1f2536a1bc4416afef57d3a1c978"],"state_sha256":"bb68a5b4162683e3211f38913aad1ca26626020a7b824fe5de44c142bb41a68e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIl+kTqMKiknmLCxn4mYvvwLj1AbpTH5FvOEPDhIuHIggdoEav90u2E9bYItxfLqIIVSZE8JutLoHYOFaB96Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:22:19.291197Z","bundle_sha256":"81db6de9dcfaef1e4893119703cd34f6d00761998f22887ae2a356aade5884e2"}}