{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HXUHOZGUL3RH3DDZEQTAXLDIR4","short_pith_number":"pith:HXUHOZGU","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"},"canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","source":{"kind":"arxiv","id":"2401.11103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11103","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11103v1","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11103","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"HXUHOZGUL3RH","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_16","alias_value":"HXUHOZGUL3RH3DDZ","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_8","alias_value":"HXUHOZGU","created_at":"2026-07-05T07:35:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HXUHOZGUL3RH3DDZEQTAXLDIR4","target":"record","payload":{"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"},"canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","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"},"source_kind":"arxiv","source_id":"2401.11103","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-07-05T07:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5vXroC1587SNaVpL8BjKikp3I98qgRxzL/3mTAYVJXINEjXHfr4lOefXjOS59HafByL+5BMjm97egm7xidCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:02:49.705613Z"},"content_sha256":"a57aeebe15fd1435bc49ed9cbce8ab156987663840b590ceedfc3aa76156a9c8","schema_version":"1.0","event_id":"sha256:a57aeebe15fd1435bc49ed9cbce8ab156987663840b590ceedfc3aa76156a9c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HXUHOZGUL3RH3DDZEQTAXLDIR4","target":"graph","payload":{"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"},"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-07-05T07:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FkCjUaSGN2Y8goSxxYoNulCZ0DQKzWzHloOzm5197E//AptwfUtw+zaITN/CyjGrrEdhF7K7/RUHLSf4A1kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:02:49.706101Z"},"content_sha256":"18e0c4486656ee8b10ff1c32502e92f643de5e124dbf33d0dde9f5cb6d2d00fc","schema_version":"1.0","event_id":"sha256:18e0c4486656ee8b10ff1c32502e92f643de5e124dbf33d0dde9f5cb6d2d00fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/bundle.json","state_url":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/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-08-05T08:02:49Z","links":{"resolver":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4","bundle":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/bundle.json","state":"https://pith.science/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXUHOZGUL3RH3DDZEQTAXLDIR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HXUHOZGUL3RH3DDZEQTAXLDIR4","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":"da3b977e9f80628349e51e1705188058de103772ae7ee60fa21f53c6c8f976a6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-20T03:34:18Z","title_canon_sha256":"11c4c906412466221d78b2815452838915f721e36d73a7cf3d163641dd49996e"},"schema_version":"1.0","source":{"id":"2401.11103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11103","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11103v1","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11103","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"HXUHOZGUL3RH","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_16","alias_value":"HXUHOZGUL3RH3DDZ","created_at":"2026-07-05T07:35:45Z"},{"alias_kind":"pith_short_8","alias_value":"HXUHOZGU","created_at":"2026-07-05T07:35:45Z"}],"graph_snapshots":[{"event_id":"sha256:18e0c4486656ee8b10ff1c32502e92f643de5e124dbf33d0dde9f5cb6d2d00fc","target":"graph","created_at":"2026-07-05T07:35:45Z","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/2401.11103/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jiachen T. Wang, Prateek Mittal, Ruoxi Jia","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-20T03:34:18Z","title":"Efficient Data Shapley for Weighted Nearest Neighbor Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11103","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:a57aeebe15fd1435bc49ed9cbce8ab156987663840b590ceedfc3aa76156a9c8","target":"record","created_at":"2026-07-05T07:35:45Z","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":"da3b977e9f80628349e51e1705188058de103772ae7ee60fa21f53c6c8f976a6","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-20T03:34:18Z","title_canon_sha256":"11c4c906412466221d78b2815452838915f721e36d73a7cf3d163641dd49996e"},"schema_version":"1.0","source":{"id":"2401.11103","kind":"arxiv","version":1}},"canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de87764d45ee27d8c7924260bac688f3ff8cde2baca65b2831dc7bfc1075364","first_computed_at":"2026-07-05T07:35:45.932847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:45.932847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZWdNCbbyUDlDr31qb9Gd7KUFLedoePOQSSaJWn8re6GTdKKNP6dHSQFRZvr/2k7KInsE5SZpAs7neUwMoA8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:45.933488Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a57aeebe15fd1435bc49ed9cbce8ab156987663840b590ceedfc3aa76156a9c8","sha256:18e0c4486656ee8b10ff1c32502e92f643de5e124dbf33d0dde9f5cb6d2d00fc"],"state_sha256":"b451c5275b93926f27ee7e61a503132ed68a86856584b07d576ba31d7b5cd565"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wGtzmaV/XQeoEd+Jgy1Mx8HLTFqGZWC7p25zWUNCVDkiYHh6YAeibiUrrWRC0Zpc4klP8cUGjSEnVDuOzfLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:02:49.710686Z","bundle_sha256":"aaefd61b51312a3c8f85050727d54af590493f89325a65c6676239f0ff773953"}}