{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W5ZZBKZP3CZXMH7L6BGCBWUDAK","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":"b4fca23b385107d96dfd8faa84ac07adb1f33b162dc3058918b9059dac783843","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-23T09:24:59Z","title_canon_sha256":"20cd0b8630e81dc316c3212208e1ccee5f5fdadb027a2d502888e92909d535ed"},"schema_version":"1.0","source":{"id":"1605.06950","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06950","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06950v4","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06950","created_at":"2026-05-18T00:46:26Z"},{"alias_kind":"pith_short_12","alias_value":"W5ZZBKZP3CZX","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W5ZZBKZP3CZXMH7L","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W5ZZBKZP","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:38ad7f5d7080e9edb98d4034f57dd8f40b717f44d01e6ac68806ace553a6e17d","target":"graph","created_at":"2026-05-18T00:46:26Z","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":"We present a new algorithm, trimed, for obtaining the medoid of a set, that is the element of the set which minimises the mean distance to all other elements. The algorithm is shown to have, under certain assumptions, expected run time O(N^(3/2)) in R^d where N is the set size, making it the first sub-quadratic exact medoid algorithm for d>1. Experiments show that it performs very well on spatial network data, frequently requiring two orders of magnitude fewer distance calculations than state-of-the-art approximate algorithms. As an application, we show how trimed can be used as a component in","authors_text":"Fran\\c{c}ois Fleuret, James Newling","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-23T09:24:59Z","title":"A Sub-Quadratic Exact Medoid Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06950","kind":"arxiv","version":4},"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:391cd3c1670b6062ae9038a9b329b1192db80fab5ee28d14034593c4c4ad375d","target":"record","created_at":"2026-05-18T00:46:26Z","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":"b4fca23b385107d96dfd8faa84ac07adb1f33b162dc3058918b9059dac783843","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-23T09:24:59Z","title_canon_sha256":"20cd0b8630e81dc316c3212208e1ccee5f5fdadb027a2d502888e92909d535ed"},"schema_version":"1.0","source":{"id":"1605.06950","kind":"arxiv","version":4}},"canonical_sha256":"b77390ab2fd8b3761febf04c20da8302b9cb6e2f9db22b22a1f589fb6b1a5f53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b77390ab2fd8b3761febf04c20da8302b9cb6e2f9db22b22a1f589fb6b1a5f53","first_computed_at":"2026-05-18T00:46:26.456677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:26.456677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6RVPL4VYAbQasboTWe/lS6mgZafsj+jfUylyZBEvcB+Lw/+Qs2Wa6X+OBeQm/Hey0/dYg28hZeF2/Q0ieEcFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:26.457384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06950","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:391cd3c1670b6062ae9038a9b329b1192db80fab5ee28d14034593c4c4ad375d","sha256:38ad7f5d7080e9edb98d4034f57dd8f40b717f44d01e6ac68806ace553a6e17d"],"state_sha256":"1e3db77fc6118e3f076753f4c2483aac4cc140a6edc7bba492ffcb7669b09b45"}