{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JSXCBDS3KFS42UIUWSA3DO6TS2","short_pith_number":"pith:JSXCBDS3","schema_version":"1.0","canonical_sha256":"4cae208e5b5165cd5114b481b1bbd396a55a1cb78f245a273dfc959179d77fae","source":{"kind":"arxiv","id":"2006.07985","version":2},"attestation_state":"computed","paper":{"title":"Explaining Predictions by Approximating the Local Decision Boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Georgios Vlassopoulos, Henry Brighton, Tim van Erven, Vlado Menkovski","submitted_at":"2020-06-14T19:12:42Z","abstract_excerpt":"Constructing accurate model-agnostic explanations for opaque machine learning models remains a challenging task. Classification models for high-dimensional data, like images, are often inherently complex. To reduce this complexity, individual predictions may be explained locally, either in terms of a simpler local surrogate model or by communicating how the predictions contrast with those of another class. However, existing approaches still fall short in the following ways: a) they measure locality using a (Euclidean) metric that is not meaningful for non-linear high-dimensional data; or b) th"},"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":"2006.07985","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-14T19:12:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"41aee6e5707f0afa718ca52cbbd19235c97d64c25f4024c31e620fa3639a38fc","abstract_canon_sha256":"e55d4ae6b10e35f08d74c43ad575bd81837d63271abb008f9dc40c7378e52d78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:27.835534Z","signature_b64":"NLCy7N15yKbk3hGbRejcqobdzcmRs73ts3NPjTNceUNyxPpFEYovpz5H9KmIaZ1yrJC9/9csin23+IP76hEbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cae208e5b5165cd5114b481b1bbd396a55a1cb78f245a273dfc959179d77fae","last_reissued_at":"2026-07-05T01:45:27.834960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:27.834960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explaining Predictions by Approximating the Local Decision Boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Georgios Vlassopoulos, Henry Brighton, Tim van Erven, Vlado Menkovski","submitted_at":"2020-06-14T19:12:42Z","abstract_excerpt":"Constructing accurate model-agnostic explanations for opaque machine learning models remains a challenging task. Classification models for high-dimensional data, like images, are often inherently complex. To reduce this complexity, individual predictions may be explained locally, either in terms of a simpler local surrogate model or by communicating how the predictions contrast with those of another class. However, existing approaches still fall short in the following ways: a) they measure locality using a (Euclidean) metric that is not meaningful for non-linear high-dimensional data; or b) th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07985","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/2006.07985/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":"2006.07985","created_at":"2026-07-05T01:45:27.835026+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.07985v2","created_at":"2026-07-05T01:45:27.835026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07985","created_at":"2026-07-05T01:45:27.835026+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSXCBDS3KFS4","created_at":"2026-07-05T01:45:27.835026+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSXCBDS3KFS42UIU","created_at":"2026-07-05T01:45:27.835026+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSXCBDS3","created_at":"2026-07-05T01:45:27.835026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17616","citing_title":"Conditional Attribution for Root Cause Analysis in Time-Series Anomaly Detection","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2","json":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2.json","graph_json":"https://pith.science/api/pith-number/JSXCBDS3KFS42UIUWSA3DO6TS2/graph.json","events_json":"https://pith.science/api/pith-number/JSXCBDS3KFS42UIUWSA3DO6TS2/events.json","paper":"https://pith.science/paper/JSXCBDS3"},"agent_actions":{"view_html":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2","download_json":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2.json","view_paper":"https://pith.science/paper/JSXCBDS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.07985&json=true","fetch_graph":"https://pith.science/api/pith-number/JSXCBDS3KFS42UIUWSA3DO6TS2/graph.json","fetch_events":"https://pith.science/api/pith-number/JSXCBDS3KFS42UIUWSA3DO6TS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2/action/storage_attestation","attest_author":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2/action/author_attestation","sign_citation":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2/action/citation_signature","submit_replication":"https://pith.science/pith/JSXCBDS3KFS42UIUWSA3DO6TS2/action/replication_record"}},"created_at":"2026-07-05T01:45:27.835026+00:00","updated_at":"2026-07-05T01:45:27.835026+00:00"}