{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S4ELLAMKOJDVE234YEFZRHERLT","short_pith_number":"pith:S4ELLAMK","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"},"canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","source":{"kind":"arxiv","id":"2605.21033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21033","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21033v1","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21033","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4ELLAMKOJDV","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"S4ELLAMKOJDVE234","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"S4ELLAMK","created_at":"2026-05-21T01:05:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S4ELLAMKOJDVE234YEFZRHERLT","target":"record","payload":{"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"},"canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","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"},"source_kind":"arxiv","source_id":"2605.21033","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-05-21T01:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzxcLVzSh6+7w0BJDcqbkFulRZoUe9iOUqfCpMBGSoAjqPlioCHxZd/PGSotGVMwVDqOV7rWdbjicMh48GB4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:39:46.581729Z"},"content_sha256":"8316cad77255300a5766869cd39e01a13dbfa184b38348382326f6344492ea51","schema_version":"1.0","event_id":"sha256:8316cad77255300a5766869cd39e01a13dbfa184b38348382326f6344492ea51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S4ELLAMKOJDVE234YEFZRHERLT","target":"graph","payload":{"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"},"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-05-21T01:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIbKLVVIFKulcTMojvWH5l+6RTk3HKjTf/VPVx+xL32gPTEhJ0VLhDn/5iaUO6gKuLouqYLanqSSnrvYe8TQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:39:46.582232Z"},"content_sha256":"8af77d5296d396c33f5944e1a747879db5c536b9430ea594f92d2baebea6af91","schema_version":"1.0","event_id":"sha256:8af77d5296d396c33f5944e1a747879db5c536b9430ea594f92d2baebea6af91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/bundle.json","state_url":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4ELLAMKOJDVE234YEFZRHERLT/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-05-24T05:39:46Z","links":{"resolver":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT","bundle":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/bundle.json","state":"https://pith.science/pith/S4ELLAMKOJDVE234YEFZRHERLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4ELLAMKOJDVE234YEFZRHERLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S4ELLAMKOJDVE234YEFZRHERLT","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":"d564bc13d5813811c1f71531aad412a2e83e35b8596ab1afd591b222e0391ed5","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T11:10:15Z","title_canon_sha256":"29d9af4758fbd3f3a32310cf7190c6aef3a7eb7278fecc5abfcb81971cb92efa"},"schema_version":"1.0","source":{"id":"2605.21033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21033","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21033v1","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21033","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4ELLAMKOJDV","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"S4ELLAMKOJDVE234","created_at":"2026-05-21T01:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"S4ELLAMK","created_at":"2026-05-21T01:05:33Z"}],"graph_snapshots":[{"event_id":"sha256:8af77d5296d396c33f5944e1a747879db5c536b9430ea594f92d2baebea6af91","target":"graph","created_at":"2026-05-21T01:05:33Z","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/2605.21033/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aristides Gionis, Guangyi Zhang, Lixu Wang, Lutz Oettershagen","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T11:10:15Z","title":"Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21033","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:8316cad77255300a5766869cd39e01a13dbfa184b38348382326f6344492ea51","target":"record","created_at":"2026-05-21T01:05:33Z","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":"d564bc13d5813811c1f71531aad412a2e83e35b8596ab1afd591b222e0391ed5","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T11:10:15Z","title_canon_sha256":"29d9af4758fbd3f3a32310cf7190c6aef3a7eb7278fecc5abfcb81971cb92efa"},"schema_version":"1.0","source":{"id":"2605.21033","kind":"arxiv","version":1}},"canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9708b5818a7247526b7cc10b989c915cd5e0a95cfd8a1db37a1f98bff8aa003f","first_computed_at":"2026-05-21T01:05:33.404365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:33.404365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBthwCk91IRwnzRpX844hdxosLtMSyqd0UBvyxJlhO3UxyHDwrQecUp6HDepRw6C6ZEHv4iDtTVkUBWwK+DeBg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:33.404885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8316cad77255300a5766869cd39e01a13dbfa184b38348382326f6344492ea51","sha256:8af77d5296d396c33f5944e1a747879db5c536b9430ea594f92d2baebea6af91"],"state_sha256":"23238cf54883520d7b9cd438732080bade2c38968f44fb7fcdac5228c92d7e7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCYqzWmt8X8ENDcX1IMyL+deYTx5dJ11KELZhcH6NmquhZgzFSn0YjvT3ispJ5XWeP+UUKMhKMV302MnglFFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T05:39:46.587648Z","bundle_sha256":"5cd9f0d1b16cfe6e618126ba887502cfa3fe1f220c89cd10c70f214b533a4a31"}}