{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:I4KQLUGIILGXCMIHNCFKHZSLVJ","short_pith_number":"pith:I4KQLUGI","schema_version":"1.0","canonical_sha256":"471505d0c842cd713107688aa3e64baa4175ddfa13b6f10e0a014ccceb1c780a","source":{"kind":"arxiv","id":"2012.08735","version":2},"attestation_state":"computed","paper":{"title":"Reconstructing decision trees","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-12-16T04:18:00Z","abstract_excerpt":"We give the first {\\sl reconstruction algorithm} for decision trees: given queries to a function $f$ that is $\\mathrm{opt}$-close to a size-$s$ decision tree, our algorithm provides query access to a decision tree $T$ where:\n  $\\circ$ $T$ has size $S = s^{O((\\log s)^2/\\varepsilon^3)}$;\n  $\\circ$ $\\mathrm{dist}(f,T)\\le O(\\mathrm{opt})+\\varepsilon$;\n  $\\circ$ Every query to $T$ is answered with $\\mathrm{poly}((\\log s)/\\varepsilon)\\cdot \\log n$ queries to $f$ and in $\\mathrm{poly}((\\log s)/\\varepsilon)\\cdot n\\log n$ time.\n  This yields a {\\sl tolerant tester} that distinguishes functions that are"},"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":"2012.08735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-16T04:18:00Z","cross_cats_sorted":["cs.CC","cs.LG"],"title_canon_sha256":"109bbce0d7f818d7c0c7dc93c200f6bcc9c48fad3570ff8ec8d34f7cfae90d69","abstract_canon_sha256":"ec9a9760b7e6e010da0fc7cf957eb8281ce722deee176f4c61ec568589691e66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:08.646448Z","signature_b64":"mXtrZ2BFYeT/HcWhs9/9ALY6wLLfFv9Y3eLgAZTKuSx4f7hIOPVqKUpaOHN6Om7J4iGOovqUdWyXSd51rdTGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"471505d0c842cd713107688aa3e64baa4175ddfa13b6f10e0a014ccceb1c780a","last_reissued_at":"2026-07-05T04:25:08.645732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:08.645732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstructing decision trees","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-12-16T04:18:00Z","abstract_excerpt":"We give the first {\\sl reconstruction algorithm} for decision trees: given queries to a function $f$ that is $\\mathrm{opt}$-close to a size-$s$ decision tree, our algorithm provides query access to a decision tree $T$ where:\n  $\\circ$ $T$ has size $S = s^{O((\\log s)^2/\\varepsilon^3)}$;\n  $\\circ$ $\\mathrm{dist}(f,T)\\le O(\\mathrm{opt})+\\varepsilon$;\n  $\\circ$ Every query to $T$ is answered with $\\mathrm{poly}((\\log s)/\\varepsilon)\\cdot \\log n$ queries to $f$ and in $\\mathrm{poly}((\\log s)/\\varepsilon)\\cdot n\\log n$ time.\n  This yields a {\\sl tolerant tester} that distinguishes functions that are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08735","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/2012.08735/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":"2012.08735","created_at":"2026-07-05T04:25:08.645824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.08735v2","created_at":"2026-07-05T04:25:08.645824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08735","created_at":"2026-07-05T04:25:08.645824+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4KQLUGIILGX","created_at":"2026-07-05T04:25:08.645824+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4KQLUGIILGXCMIH","created_at":"2026-07-05T04:25:08.645824+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4KQLUGI","created_at":"2026-07-05T04:25:08.645824+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/I4KQLUGIILGXCMIHNCFKHZSLVJ","json":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ.json","graph_json":"https://pith.science/api/pith-number/I4KQLUGIILGXCMIHNCFKHZSLVJ/graph.json","events_json":"https://pith.science/api/pith-number/I4KQLUGIILGXCMIHNCFKHZSLVJ/events.json","paper":"https://pith.science/paper/I4KQLUGI"},"agent_actions":{"view_html":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ","download_json":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ.json","view_paper":"https://pith.science/paper/I4KQLUGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.08735&json=true","fetch_graph":"https://pith.science/api/pith-number/I4KQLUGIILGXCMIHNCFKHZSLVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/I4KQLUGIILGXCMIHNCFKHZSLVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ/action/storage_attestation","attest_author":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ/action/author_attestation","sign_citation":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ/action/citation_signature","submit_replication":"https://pith.science/pith/I4KQLUGIILGXCMIHNCFKHZSLVJ/action/replication_record"}},"created_at":"2026-07-05T04:25:08.645824+00:00","updated_at":"2026-07-05T04:25:08.645824+00:00"}