{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZKI5FK6B6HGFB7DAYQ2U7XX4HD","short_pith_number":"pith:ZKI5FK6B","canonical_record":{"source":{"id":"1711.00817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-02T17:00:05Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"ed66ff03b32d516e80bfebf15b97defb96c7fab056a236eda10a03b798d2b741","abstract_canon_sha256":"21bf5257dd6bda4e4108f0f236e479b82901e0336212b8c8cec59e4c091a0848"},"schema_version":"1.0"},"canonical_sha256":"ca91d2abc1f1cc50fc60c4354fdefc38cc281f70cc752b7ced41b20abf89a8e6","source":{"kind":"arxiv","id":"1711.00817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00817","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00817v3","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00817","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZKI5FK6B6HGF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKI5FK6B6HGFB7DA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKI5FK6B","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZKI5FK6B6HGFB7DAYQ2U7XX4HD","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-02T17:00:05Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"ed66ff03b32d516e80bfebf15b97defb96c7fab056a236eda10a03b798d2b741","abstract_canon_sha256":"21bf5257dd6bda4e4108f0f236e479b82901e0336212b8c8cec59e4c091a0848"},"schema_version":"1.0"},"canonical_sha256":"ca91d2abc1f1cc50fc60c4354fdefc38cc281f70cc752b7ced41b20abf89a8e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:11.087647Z","signature_b64":"Oixxf6mGBGagZG0k0S84ZkPFxCV2lnpgOVrrolNSfRYgM5gxRCk8OQvcTYd2sMmQZzlZ22wtxmLkLH3HB3IJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca91d2abc1f1cc50fc60c4354fdefc38cc281f70cc752b7ced41b20abf89a8e6","last_reissued_at":"2026-05-18T00:31:11.086894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:11.086894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00817","source_version":3,"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-18T00:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gMX2XPIrfxxdcbd9y4R2UhVPCFZhdAkiOrEiXhX2+l9c1N/YXz2WosKN8pngw9mz1sBOYkWqAC190cNpTqrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:20:34.502428Z"},"content_sha256":"d31059d11b65892858c903e90812f18e62d0b3303615c45378d699e51bfde9a0","schema_version":"1.0","event_id":"sha256:d31059d11b65892858c903e90812f18e62d0b3303615c45378d699e51bfde9a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZKI5FK6B6HGFB7DAYQ2U7XX4HD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Medoids in almost linear time via multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"David Tse, Govinda M. Kamath, Martin J. Zhang, Vasilis Ntranos, Vivek Bagaria","submitted_at":"2017-11-02T17:00:05Z","abstract_excerpt":"Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which uses O(n log n) distance evaluations to compute the medoid with high probability. Med-dit is based on a connection with the multi-armed bandit problem. We evaluate the performance of Med-dit empirically on the Netflix-prize and the single-cell RNA-Seq datasets, containing hundreds of thousands of points living in tens of thousands of dimensions, and observe a 5-10x improvement in performance over the current state of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00817","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpvtsMwPuMKT6PcrcaeM/KTXUKH3EUtmHJR8NiFHwrZL+aH6mniWRSY3Cy2z1a2OP3YgjzgyhJXW8JnKfesGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:20:34.502783Z"},"content_sha256":"babd0e57d5c93c6f441c29eae7f3d93866f3228c6a8b88186c5607fe2fea6d09","schema_version":"1.0","event_id":"sha256:babd0e57d5c93c6f441c29eae7f3d93866f3228c6a8b88186c5607fe2fea6d09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/bundle.json","state_url":"https://pith.science/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/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-28T06:20:34Z","links":{"resolver":"https://pith.science/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD","bundle":"https://pith.science/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/bundle.json","state":"https://pith.science/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKI5FK6B6HGFB7DAYQ2U7XX4HD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZKI5FK6B6HGFB7DAYQ2U7XX4HD","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":"21bf5257dd6bda4e4108f0f236e479b82901e0336212b8c8cec59e4c091a0848","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-02T17:00:05Z","title_canon_sha256":"ed66ff03b32d516e80bfebf15b97defb96c7fab056a236eda10a03b798d2b741"},"schema_version":"1.0","source":{"id":"1711.00817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00817","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00817v3","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00817","created_at":"2026-05-18T00:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZKI5FK6B6HGF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKI5FK6B6HGFB7DA","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKI5FK6B","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:babd0e57d5c93c6f441c29eae7f3d93866f3228c6a8b88186c5607fe2fea6d09","target":"graph","created_at":"2026-05-18T00:31:11Z","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"},"paper":{"abstract_excerpt":"Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit which uses O(n log n) distance evaluations to compute the medoid with high probability. Med-dit is based on a connection with the multi-armed bandit problem. We evaluate the performance of Med-dit empirically on the Netflix-prize and the single-cell RNA-Seq datasets, containing hundreds of thousands of points living in tens of thousands of dimensions, and observe a 5-10x improvement in performance over the current state of","authors_text":"David Tse, Govinda M. Kamath, Martin J. Zhang, Vasilis Ntranos, Vivek Bagaria","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-02T17:00:05Z","title":"Medoids in almost linear time via multi-armed bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00817","kind":"arxiv","version":3},"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:d31059d11b65892858c903e90812f18e62d0b3303615c45378d699e51bfde9a0","target":"record","created_at":"2026-05-18T00:31:11Z","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":"21bf5257dd6bda4e4108f0f236e479b82901e0336212b8c8cec59e4c091a0848","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-02T17:00:05Z","title_canon_sha256":"ed66ff03b32d516e80bfebf15b97defb96c7fab056a236eda10a03b798d2b741"},"schema_version":"1.0","source":{"id":"1711.00817","kind":"arxiv","version":3}},"canonical_sha256":"ca91d2abc1f1cc50fc60c4354fdefc38cc281f70cc752b7ced41b20abf89a8e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca91d2abc1f1cc50fc60c4354fdefc38cc281f70cc752b7ced41b20abf89a8e6","first_computed_at":"2026-05-18T00:31:11.086894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:11.086894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oixxf6mGBGagZG0k0S84ZkPFxCV2lnpgOVrrolNSfRYgM5gxRCk8OQvcTYd2sMmQZzlZ22wtxmLkLH3HB3IJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:11.087647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d31059d11b65892858c903e90812f18e62d0b3303615c45378d699e51bfde9a0","sha256:babd0e57d5c93c6f441c29eae7f3d93866f3228c6a8b88186c5607fe2fea6d09"],"state_sha256":"03cf456a4f6a4d58020d75ad727eb5965fd5ba6877ad5c2e994cc93089b7a4cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cNyolT1qWShZtC3S5bpPTMCJiy04zyNV3W4BJLv4+IVaScikRD9c6iNgF+XObcU+tdPpDk9wQee194M+3OzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:20:34.504771Z","bundle_sha256":"c7b7234c360cac0e7409489ebdd6b25bbf4dc0a9ad7195afc9970c584a3db323"}}