{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TYJRYHIES6XMWTEDIONCPCFLSW","short_pith_number":"pith:TYJRYHIE","canonical_record":{"source":{"id":"1911.07375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-18T00:25:31Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"6ba0231cc2f085d0a3ca28f97b4dd6e333a11a9c3b90995fec4eb29ebfbefbe6","abstract_canon_sha256":"a371b205b5f918980d5bd72fc103dd3d965fc22d48c68346c9c4f9c443f8c10a"},"schema_version":"1.0"},"canonical_sha256":"9e131c1d0497aecb4c83439a2788ab959659904ab30f375c12461ff20a5281f8","source":{"kind":"arxiv","id":"1911.07375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07375","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07375v1","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07375","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_12","alias_value":"TYJRYHIES6XM","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYJRYHIES6XMWTED","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYJRYHIE","created_at":"2026-07-05T00:19:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TYJRYHIES6XMWTEDIONCPCFLSW","target":"record","payload":{"canonical_record":{"source":{"id":"1911.07375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-18T00:25:31Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"6ba0231cc2f085d0a3ca28f97b4dd6e333a11a9c3b90995fec4eb29ebfbefbe6","abstract_canon_sha256":"a371b205b5f918980d5bd72fc103dd3d965fc22d48c68346c9c4f9c443f8c10a"},"schema_version":"1.0"},"canonical_sha256":"9e131c1d0497aecb4c83439a2788ab959659904ab30f375c12461ff20a5281f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:46.266701Z","signature_b64":"qy4gG+F7O2Oi8l037zk92YzUqg7/pCpZ/RuJcYiutgAuzSImNuSf4kXmCeOPhpYRpwz1lrgCCvlIZtpEkGIvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e131c1d0497aecb4c83439a2788ab959659904ab30f375c12461ff20a5281f8","last_reissued_at":"2026-07-05T00:19:46.266290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:46.266290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.07375","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-05T00:19:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFBuVPM/zPlS4PlzX7Cl4NMmmqCn3PGHVKUZvA9AGwFowhDEtWxrKpGn2269czchUjgpGXbhTzCuwP56+AkhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:40:16.083719Z"},"content_sha256":"d50ebcfabab26b84059ee46683c27dc041d269ed93255da8dc363e4011904019","schema_version":"1.0","event_id":"sha256:d50ebcfabab26b84059ee46683c27dc041d269ed93255da8dc363e4011904019"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TYJRYHIES6XMWTEDIONCPCFLSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-down induction of decision trees: rigorous guarantees and inherent limitations","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":"2019-11-18T00:25:31Z","abstract_excerpt":"Consider the following heuristic for building a decision tree for a function $f : \\{0,1\\}^n \\to \\{\\pm 1\\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the left and right subtrees respectively; terminate once the tree is an $\\varepsilon$-approximation of $f$. We analyze the quality of this heuristic, obtaining near-matching upper and lower bounds:\n  $\\circ$ Upper bound: For every $f$ with decision tree size $s$ and every $\\varepsilon \\in (0,\\frac1{2})$, this heuristic builds a decision tree of size at most $s^{O(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07375","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/1911.07375/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-05T00:19:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3X5DCYJrut0qafCbVUOaN7wJGyHamHMnYTQ+G29Tt7P1LbHVqv9eup29JKEDvFfP3CBtRgdjDHXhW3jFP+R6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:40:16.084098Z"},"content_sha256":"725d7cc907281286fdcb0d1b38d4e85ee61972d2159f05a17681bac063e4aeb5","schema_version":"1.0","event_id":"sha256:725d7cc907281286fdcb0d1b38d4e85ee61972d2159f05a17681bac063e4aeb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYJRYHIES6XMWTEDIONCPCFLSW/bundle.json","state_url":"https://pith.science/pith/TYJRYHIES6XMWTEDIONCPCFLSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYJRYHIES6XMWTEDIONCPCFLSW/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:40:16Z","links":{"resolver":"https://pith.science/pith/TYJRYHIES6XMWTEDIONCPCFLSW","bundle":"https://pith.science/pith/TYJRYHIES6XMWTEDIONCPCFLSW/bundle.json","state":"https://pith.science/pith/TYJRYHIES6XMWTEDIONCPCFLSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYJRYHIES6XMWTEDIONCPCFLSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TYJRYHIES6XMWTEDIONCPCFLSW","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":"a371b205b5f918980d5bd72fc103dd3d965fc22d48c68346c9c4f9c443f8c10a","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-18T00:25:31Z","title_canon_sha256":"6ba0231cc2f085d0a3ca28f97b4dd6e333a11a9c3b90995fec4eb29ebfbefbe6"},"schema_version":"1.0","source":{"id":"1911.07375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07375","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07375v1","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07375","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_12","alias_value":"TYJRYHIES6XM","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYJRYHIES6XMWTED","created_at":"2026-07-05T00:19:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYJRYHIE","created_at":"2026-07-05T00:19:46Z"}],"graph_snapshots":[{"event_id":"sha256:725d7cc907281286fdcb0d1b38d4e85ee61972d2159f05a17681bac063e4aeb5","target":"graph","created_at":"2026-07-05T00:19:46Z","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/1911.07375/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider the following heuristic for building a decision tree for a function $f : \\{0,1\\}^n \\to \\{\\pm 1\\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the left and right subtrees respectively; terminate once the tree is an $\\varepsilon$-approximation of $f$. We analyze the quality of this heuristic, obtaining near-matching upper and lower bounds:\n  $\\circ$ Upper bound: For every $f$ with decision tree size $s$ and every $\\varepsilon \\in (0,\\frac1{2})$, this heuristic builds a decision tree of size at most $s^{O(\\","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":"2019-11-18T00:25:31Z","title":"Top-down induction of decision trees: rigorous guarantees and inherent limitations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07375","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:d50ebcfabab26b84059ee46683c27dc041d269ed93255da8dc363e4011904019","target":"record","created_at":"2026-07-05T00:19:46Z","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":"a371b205b5f918980d5bd72fc103dd3d965fc22d48c68346c9c4f9c443f8c10a","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-18T00:25:31Z","title_canon_sha256":"6ba0231cc2f085d0a3ca28f97b4dd6e333a11a9c3b90995fec4eb29ebfbefbe6"},"schema_version":"1.0","source":{"id":"1911.07375","kind":"arxiv","version":1}},"canonical_sha256":"9e131c1d0497aecb4c83439a2788ab959659904ab30f375c12461ff20a5281f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e131c1d0497aecb4c83439a2788ab959659904ab30f375c12461ff20a5281f8","first_computed_at":"2026-07-05T00:19:46.266290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:46.266290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qy4gG+F7O2Oi8l037zk92YzUqg7/pCpZ/RuJcYiutgAuzSImNuSf4kXmCeOPhpYRpwz1lrgCCvlIZtpEkGIvDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:46.266701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.07375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d50ebcfabab26b84059ee46683c27dc041d269ed93255da8dc363e4011904019","sha256:725d7cc907281286fdcb0d1b38d4e85ee61972d2159f05a17681bac063e4aeb5"],"state_sha256":"6315788a2e4b1f9fc6255412a8ebed7a50c7aeb9bf458cc1f685eb8ec05db6a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikUZmQd16w3NVtPyGlEtn7IlFa8vtU+rGwaloh5LVOD2kGc9jhF0w5wULpD7uet4VIqfETPDXwqWlMl5iV/AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:40:16.086090Z","bundle_sha256":"1275d821410eecff2cfbfda1beacc04908695a95f312a7486ff6d178018598f4"}}