{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HXUHOZGUL3RH3DDZEQTAXLDIR4","short_pith_number":"pith:HXUHOZGU","schema_version":"1.0","canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","source":{"kind":"arxiv","id":"2401.11103","version":1},"attestation_state":"computed","paper":{"title":"Efficient Data Shapley for Weighted Nearest Neighbor Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Jiachen T. Wang, Prateek Mittal, Ruoxi Jia","submitted_at":"2024-01-20T03:34:18Z","abstract_excerpt":"This work aims to address an open problem in data valuation literature concerning the efficient computation of Data Shapley for weighted $K$ nearest neighbor algorithm (WKNN-Shapley). By considering the accuracy of hard-label KNN with discretized weights as the utility function, we reframe the computation of WKNN-Shapley into a counting problem and introduce a quadratic-time algorithm, presenting a notable improvement from $O(N^K)$, the best result from existing literature. We develop a deterministic approximation algorithm that further improves computational efficiency while maintaining the k"},"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":"2401.11103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-20T03:34:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"11c4c906412466221d78b2815452838915f721e36d73a7cf3d163641dd49996e","abstract_canon_sha256":"da3b977e9f80628349e51e1705188058de103772ae7ee60fa21f53c6c8f976a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:45.933488Z","signature_b64":"fZWdNCbbyUDlDr31qb9Gd7KUFLedoePOQSSaJWn8re6GTdKKNP6dHSQFRZvr/2k7KInsE5SZpAs7neUwMoA8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","last_reissued_at":"2026-07-05T07:35:45.932847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:45.932847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Data Shapley for Weighted Nearest Neighbor Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Jiachen T. Wang, Prateek Mittal, Ruoxi Jia","submitted_at":"2024-01-20T03:34:18Z","abstract_excerpt":"This work aims to address an open problem in data valuation literature concerning the efficient computation of Data Shapley for weighted $K$ nearest neighbor algorithm (WKNN-Shapley). By considering the accuracy of hard-label KNN with discretized weights as the utility function, we reframe the computation of WKNN-Shapley into a counting problem and introduce a quadratic-time algorithm, presenting a notable improvement from $O(N^K)$, the best result from existing literature. We develop a deterministic approximation algorithm that further improves computational efficiency while maintaining the k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11103","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/2401.11103/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":"2401.11103","created_at":"2026-07-05T07:35:45.932908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11103v1","created_at":"2026-07-05T07:35:45.932908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11103","created_at":"2026-07-05T07:35:45.932908+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXUHOZGUL3RH","created_at":"2026-07-05T07:35:45.932908+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXUHOZGUL3RH3DDZ","created_at":"2026-07-05T07:35:45.932908+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXUHOZGU","created_at":"2026-07-05T07:35:45.932908+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/HXUHOZGUL3RH3DDZEQTAXLDIR4","json":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4.json","graph_json":"https://pith.science/api/pith-number/HXUHOZGUL3RH3DDZEQTAXLDIR4/graph.json","events_json":"https://pith.science/api/pith-number/HXUHOZGUL3RH3DDZEQTAXLDIR4/events.json","paper":"https://pith.science/paper/HXUHOZGU"},"agent_actions":{"view_html":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4","download_json":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4.json","view_paper":"https://pith.science/paper/HXUHOZGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11103&json=true","fetch_graph":"https://pith.science/api/pith-number/HXUHOZGUL3RH3DDZEQTAXLDIR4/graph.json","fetch_events":"https://pith.science/api/pith-number/HXUHOZGUL3RH3DDZEQTAXLDIR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/action/storage_attestation","attest_author":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/action/author_attestation","sign_citation":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/action/citation_signature","submit_replication":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/action/replication_record"}},"created_at":"2026-07-05T07:35:45.932908+00:00","updated_at":"2026-07-05T07:35:45.932908+00:00"}