{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HJVZVQ72YUSTKVLLHXP576RO3Z","short_pith_number":"pith:HJVZVQ72","schema_version":"1.0","canonical_sha256":"3a6b9ac3fac52535556b3ddfdffa2ede5ed1161b254562a66b36eeb73438e936","source":{"kind":"arxiv","id":"2111.01576","version":1},"attestation_state":"computed","paper":{"title":"Provably efficient, succinct, and precise explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2021-11-01T17:35:10Z","abstract_excerpt":"We consider the problem of explaining the predictions of an arbitrary blackbox model $f$: given query access to $f$ and an instance $x$, output a small set of $x$'s features that in conjunction essentially determines $f(x)$. We design an efficient algorithm with provable guarantees on the succinctness and precision of the explanations that it returns. Prior algorithms were either efficient but lacked such guarantees, or achieved such guarantees but were inefficient.\n  We obtain our algorithm via a connection to the problem of {\\sl implicitly} learning decision trees. The implicit nature of thi"},"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":"2111.01576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-01T17:35:10Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"242658f3c785c4a4e7d719c428e609490653ec00a3c2c5391c28e053ce6ba4b3","abstract_canon_sha256":"21125a75e4f4598d23ceb4b72f199e285a9954239d88aa30d3e5a50e02663997"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:30.396911Z","signature_b64":"EqE/9DpINe77vhUNo7EQxwhoo8+cGfVEtEj9GBgPWLLH24sflNcZcdGRULkbNNlXWmegEkBWMp5dCdNhhHnMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6b9ac3fac52535556b3ddfdffa2ede5ed1161b254562a66b36eeb73438e936","last_reissued_at":"2026-07-05T03:28:30.396357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:30.396357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provably efficient, succinct, and precise explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.LG","authors_text":"Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2021-11-01T17:35:10Z","abstract_excerpt":"We consider the problem of explaining the predictions of an arbitrary blackbox model $f$: given query access to $f$ and an instance $x$, output a small set of $x$'s features that in conjunction essentially determines $f(x)$. We design an efficient algorithm with provable guarantees on the succinctness and precision of the explanations that it returns. Prior algorithms were either efficient but lacked such guarantees, or achieved such guarantees but were inefficient.\n  We obtain our algorithm via a connection to the problem of {\\sl implicitly} learning decision trees. The implicit nature of thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.01576","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/2111.01576/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":"2111.01576","created_at":"2026-07-05T03:28:30.396434+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.01576v1","created_at":"2026-07-05T03:28:30.396434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.01576","created_at":"2026-07-05T03:28:30.396434+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJVZVQ72YUST","created_at":"2026-07-05T03:28:30.396434+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJVZVQ72YUSTKVLL","created_at":"2026-07-05T03:28:30.396434+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJVZVQ72","created_at":"2026-07-05T03:28:30.396434+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/HJVZVQ72YUSTKVLLHXP576RO3Z","json":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z.json","graph_json":"https://pith.science/api/pith-number/HJVZVQ72YUSTKVLLHXP576RO3Z/graph.json","events_json":"https://pith.science/api/pith-number/HJVZVQ72YUSTKVLLHXP576RO3Z/events.json","paper":"https://pith.science/paper/HJVZVQ72"},"agent_actions":{"view_html":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z","download_json":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z.json","view_paper":"https://pith.science/paper/HJVZVQ72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.01576&json=true","fetch_graph":"https://pith.science/api/pith-number/HJVZVQ72YUSTKVLLHXP576RO3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/HJVZVQ72YUSTKVLLHXP576RO3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z/action/storage_attestation","attest_author":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z/action/author_attestation","sign_citation":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z/action/citation_signature","submit_replication":"https://pith.science/pith/HJVZVQ72YUSTKVLLHXP576RO3Z/action/replication_record"}},"created_at":"2026-07-05T03:28:30.396434+00:00","updated_at":"2026-07-05T03:28:30.396434+00:00"}