{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S4ELLAMKOJDVE234YEFZRHERLT","short_pith_number":"pith:S4ELLAMK","schema_version":"1.0","canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","source":{"kind":"arxiv","id":"2605.21033","version":1},"attestation_state":"computed","paper":{"title":"Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aristides Gionis, Guangyi Zhang, Lixu Wang, Lutz Oettershagen","submitted_at":"2026-05-20T11:10:15Z","abstract_excerpt":"Data valuation, the task of quantifying the contribution of individual data points to model performance, has emerged as a fundamental challenge in machine learning. Game-theoretic approaches, such as the Banzhaf value, offer principled frameworks for fair data valuation; however, they suffer from exponential computational complexity. We address this challenge by developing efficient algorithms specifically tailored for computing Banzhaf values in $k$-nearest neighbor ($k$NN) classifiers. We first establish the theoretical hardness of the problem by proving that it is \\#P-hard. Despite this int"},"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":"2605.21033","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T11:10:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"29d9af4758fbd3f3a32310cf7190c6aef3a7eb7278fecc5abfcb81971cb92efa","abstract_canon_sha256":"d564bc13d5813811c1f71531aad412a2e83e35b8596ab1afd591b222e0391ed5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:33.404885Z","signature_b64":"oBthwCk91IRwnzRpX844hdxosLtMSyqd0UBvyxJlhO3UxyHDwrQecUp6HDepRw6C6ZEHv4iDtTVkUBWwK+DeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","last_reissued_at":"2026-05-21T01:05:33.404365Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:33.404365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Aristides Gionis, Guangyi Zhang, Lixu Wang, Lutz Oettershagen","submitted_at":"2026-05-20T11:10:15Z","abstract_excerpt":"Data valuation, the task of quantifying the contribution of individual data points to model performance, has emerged as a fundamental challenge in machine learning. Game-theoretic approaches, such as the Banzhaf value, offer principled frameworks for fair data valuation; however, they suffer from exponential computational complexity. We address this challenge by developing efficient algorithms specifically tailored for computing Banzhaf values in $k$-nearest neighbor ($k$NN) classifiers. We first establish the theoretical hardness of the problem by proving that it is \\#P-hard. Despite this int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21033","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/2605.21033/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":"2605.21033","created_at":"2026-05-21T01:05:33.404475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21033v1","created_at":"2026-05-21T01:05:33.404475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21033","created_at":"2026-05-21T01:05:33.404475+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4ELLAMKOJDV","created_at":"2026-05-21T01:05:33.404475+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4ELLAMKOJDVE234","created_at":"2026-05-21T01:05:33.404475+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4ELLAMK","created_at":"2026-05-21T01:05:33.404475+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/S4ELLAMKOJDVE234YEFZRHERLT","json":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT.json","graph_json":"https://pith.science/api/pith-number/S4ELLAMKOJDVE234YEFZRHERLT/graph.json","events_json":"https://pith.science/api/pith-number/S4ELLAMKOJDVE234YEFZRHERLT/events.json","paper":"https://pith.science/paper/S4ELLAMK"},"agent_actions":{"view_html":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT","download_json":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT.json","view_paper":"https://pith.science/paper/S4ELLAMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21033&json=true","fetch_graph":"https://pith.science/api/pith-number/S4ELLAMKOJDVE234YEFZRHERLT/graph.json","fetch_events":"https://pith.science/api/pith-number/S4ELLAMKOJDVE234YEFZRHERLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/action/storage_attestation","attest_author":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/action/author_attestation","sign_citation":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/action/citation_signature","submit_replication":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/action/replication_record"}},"created_at":"2026-05-21T01:05:33.404475+00:00","updated_at":"2026-05-21T01:05:33.404475+00:00"}