{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FVYCFFKIGD5V3AN55GJP4WBFND","short_pith_number":"pith:FVYCFFKI","canonical_record":{"source":{"id":"2006.00743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-01T06:44:07Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"cf7d422c60e24119f2a6fede5fa75d586cfee24f21e84c6cff02fa6f08641c43","abstract_canon_sha256":"906dd7057748c96c6e9a960cf50ec406de98dee5a42295e029899d3742b397d3"},"schema_version":"1.0"},"canonical_sha256":"2d7022954830fb5d81bde992fe582568f5ad73e9bf7e3ca2815a99ddc7b37a96","source":{"kind":"arxiv","id":"2006.00743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00743","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00743v1","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00743","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"FVYCFFKIGD5V","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_16","alias_value":"FVYCFFKIGD5V3AN5","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_8","alias_value":"FVYCFFKI","created_at":"2026-07-05T01:07:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FVYCFFKIGD5V3AN55GJP4WBFND","target":"record","payload":{"canonical_record":{"source":{"id":"2006.00743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-01T06:44:07Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"cf7d422c60e24119f2a6fede5fa75d586cfee24f21e84c6cff02fa6f08641c43","abstract_canon_sha256":"906dd7057748c96c6e9a960cf50ec406de98dee5a42295e029899d3742b397d3"},"schema_version":"1.0"},"canonical_sha256":"2d7022954830fb5d81bde992fe582568f5ad73e9bf7e3ca2815a99ddc7b37a96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:04.974854Z","signature_b64":"HVtDiiaBBfzsrB+QJHKA4K9H5KZ/Gh3QC8Fj5/JvQ/5KGOIgpf/m+VFjDH5W/P9UAYI+RrB/iImDDsPZ38mvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7022954830fb5d81bde992fe582568f5ad73e9bf7e3ca2815a99ddc7b37a96","last_reissued_at":"2026-07-05T01:07:04.974349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:04.974349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.00743","source_version":1,"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-05T01:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5I9/mHIZGAeOD31T196qafvmCAaFFmD61WMU82sMWDSOETVD+z4mPOilnbQYu9xrmre+srorG57Nq7SgafGcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:56:53.203530Z"},"content_sha256":"de77f98a5ecfc333ca21364cb1456be942d47ad7763d2727a44aecf194386a48","schema_version":"1.0","event_id":"sha256:de77f98a5ecfc333ca21364cb1456be942d47ad7763d2727a44aecf194386a48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FVYCFFKIGD5V3AN55GJP4WBFND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable guarantees for decision tree induction: the agnostic setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2020-06-01T06:44:07Z","abstract_excerpt":"We give strengthened provable guarantees on the performance of widely employed and empirically successful {\\sl top-down decision tree learning heuristics}. While prior works have focused on the realizable setting, we consider the more realistic and challenging {\\sl agnostic} setting. We show that for all monotone functions~$f$ and parameters $s\\in \\mathbb{N}$, these heuristics construct a decision tree of size $s^{\\tilde{O}((\\log s)/\\varepsilon^2)}$ that achieves error $\\le \\mathsf{opt}_s + \\varepsilon$, where $\\mathsf{opt}_s$ denotes the error of the optimal size-$s$ decision tree for $f$. Pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00743","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/2006.00743/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-05T01:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41pu6+ZsYl1LtxMD/A4ZwAayhaGleYRq49bWqeycvTncBcdgispJJRz2hJfzA9nughptAHgtXQpkOxVLdZgiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:56:53.203902Z"},"content_sha256":"ae2f5e71f2066d16598c1dcbdc5341aa30ce0fb9a6387bfb8acde771ca008478","schema_version":"1.0","event_id":"sha256:ae2f5e71f2066d16598c1dcbdc5341aa30ce0fb9a6387bfb8acde771ca008478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVYCFFKIGD5V3AN55GJP4WBFND/bundle.json","state_url":"https://pith.science/pith/FVYCFFKIGD5V3AN55GJP4WBFND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVYCFFKIGD5V3AN55GJP4WBFND/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-07T11:56:53Z","links":{"resolver":"https://pith.science/pith/FVYCFFKIGD5V3AN55GJP4WBFND","bundle":"https://pith.science/pith/FVYCFFKIGD5V3AN55GJP4WBFND/bundle.json","state":"https://pith.science/pith/FVYCFFKIGD5V3AN55GJP4WBFND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVYCFFKIGD5V3AN55GJP4WBFND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FVYCFFKIGD5V3AN55GJP4WBFND","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":"906dd7057748c96c6e9a960cf50ec406de98dee5a42295e029899d3742b397d3","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-01T06:44:07Z","title_canon_sha256":"cf7d422c60e24119f2a6fede5fa75d586cfee24f21e84c6cff02fa6f08641c43"},"schema_version":"1.0","source":{"id":"2006.00743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00743","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00743v1","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00743","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"FVYCFFKIGD5V","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_16","alias_value":"FVYCFFKIGD5V3AN5","created_at":"2026-07-05T01:07:04Z"},{"alias_kind":"pith_short_8","alias_value":"FVYCFFKI","created_at":"2026-07-05T01:07:04Z"}],"graph_snapshots":[{"event_id":"sha256:ae2f5e71f2066d16598c1dcbdc5341aa30ce0fb9a6387bfb8acde771ca008478","target":"graph","created_at":"2026-07-05T01:07:04Z","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/2006.00743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give strengthened provable guarantees on the performance of widely employed and empirically successful {\\sl top-down decision tree learning heuristics}. While prior works have focused on the realizable setting, we consider the more realistic and challenging {\\sl agnostic} setting. We show that for all monotone functions~$f$ and parameters $s\\in \\mathbb{N}$, these heuristics construct a decision tree of size $s^{\\tilde{O}((\\log s)/\\varepsilon^2)}$ that achieves error $\\le \\mathsf{opt}_s + \\varepsilon$, where $\\mathsf{opt}_s$ denotes the error of the optimal size-$s$ decision tree for $f$. Pr","authors_text":"Guy Blanc, Jane Lange, Li-Yang Tan","cross_cats":["cs.CC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-01T06:44:07Z","title":"Provable guarantees for decision tree induction: the agnostic setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00743","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:de77f98a5ecfc333ca21364cb1456be942d47ad7763d2727a44aecf194386a48","target":"record","created_at":"2026-07-05T01:07:04Z","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":"906dd7057748c96c6e9a960cf50ec406de98dee5a42295e029899d3742b397d3","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-06-01T06:44:07Z","title_canon_sha256":"cf7d422c60e24119f2a6fede5fa75d586cfee24f21e84c6cff02fa6f08641c43"},"schema_version":"1.0","source":{"id":"2006.00743","kind":"arxiv","version":1}},"canonical_sha256":"2d7022954830fb5d81bde992fe582568f5ad73e9bf7e3ca2815a99ddc7b37a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7022954830fb5d81bde992fe582568f5ad73e9bf7e3ca2815a99ddc7b37a96","first_computed_at":"2026-07-05T01:07:04.974349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:04.974349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HVtDiiaBBfzsrB+QJHKA4K9H5KZ/Gh3QC8Fj5/JvQ/5KGOIgpf/m+VFjDH5W/P9UAYI+RrB/iImDDsPZ38mvAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:04.974854Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de77f98a5ecfc333ca21364cb1456be942d47ad7763d2727a44aecf194386a48","sha256:ae2f5e71f2066d16598c1dcbdc5341aa30ce0fb9a6387bfb8acde771ca008478"],"state_sha256":"6999a1b982fb450a8b82a5744128a10b61c9d2914fff32f26c5351e905b71147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AjVeulVdxTf5DjUuMT5dASK/JOfSmJA99zfhpu6VzjXsR9XTqIAUbMy3WKhOXEnaoff8o2BwQz93ETYQVckUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:56:53.205998Z","bundle_sha256":"cd831275671ab1a2308ef1ec1621b29c073ed15357c262c339c3ffa8a9c46bae"}}