{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PC73KPLCUM7OLEODBDAMRSEANR","short_pith_number":"pith:PC73KPLC","schema_version":"1.0","canonical_sha256":"78bfb53d62a33ee591c308c0c8c8806c779a6a274be374be6eda473597ddc6b3","source":{"kind":"arxiv","id":"2110.08959","version":2},"attestation_state":"computed","paper":{"title":"Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daichi Amagata, Makoto Onizuka, Takahiro Hara","submitted_at":"2021-10-18T01:02:26Z","abstract_excerpt":"Distance-based outlier detection is widely adopted in many fields, e.g., data mining and machine learning, because it is unsupervised, can be employed in a generic metric space, and does not have any assumptions of data distributions. Data mining and machine learning applications face a challenge of dealing with large datasets, which requires efficient distance-based outlier detection algorithms. Due to the popularization of computational environments with large memory, it is possible to build a main-memory index and detect outliers based on it, which is a promising solution for fast distance-"},"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":"2110.08959","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-10-18T01:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"4ab8722a2b66e215fa649026e5da936944a3649bdb3ce015123089dbb17251fa","abstract_canon_sha256":"e7bec03a150d9cc53184c44949da75d7f62f424bbe35fb97232c799c78292f8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:31.938711Z","signature_b64":"v4P1US2SyRcpUgsyeh8Gr/08kuDhLDu7m2KHAm6ag4k2F84JKjQ1elxU7FSQV14EIiZv53hTmHl4LYlL/W9DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78bfb53d62a33ee591c308c0c8c8806c779a6a274be374be6eda473597ddc6b3","last_reissued_at":"2026-07-05T03:24:31.938210Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:31.938210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daichi Amagata, Makoto Onizuka, Takahiro Hara","submitted_at":"2021-10-18T01:02:26Z","abstract_excerpt":"Distance-based outlier detection is widely adopted in many fields, e.g., data mining and machine learning, because it is unsupervised, can be employed in a generic metric space, and does not have any assumptions of data distributions. Data mining and machine learning applications face a challenge of dealing with large datasets, which requires efficient distance-based outlier detection algorithms. Due to the popularization of computational environments with large memory, it is possible to build a main-memory index and detect outliers based on it, which is a promising solution for fast distance-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08959","kind":"arxiv","version":2},"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/2110.08959/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":"2110.08959","created_at":"2026-07-05T03:24:31.938272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.08959v2","created_at":"2026-07-05T03:24:31.938272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08959","created_at":"2026-07-05T03:24:31.938272+00:00"},{"alias_kind":"pith_short_12","alias_value":"PC73KPLCUM7O","created_at":"2026-07-05T03:24:31.938272+00:00"},{"alias_kind":"pith_short_16","alias_value":"PC73KPLCUM7OLEOD","created_at":"2026-07-05T03:24:31.938272+00:00"},{"alias_kind":"pith_short_8","alias_value":"PC73KPLC","created_at":"2026-07-05T03:24:31.938272+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/PC73KPLCUM7OLEODBDAMRSEANR","json":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR.json","graph_json":"https://pith.science/api/pith-number/PC73KPLCUM7OLEODBDAMRSEANR/graph.json","events_json":"https://pith.science/api/pith-number/PC73KPLCUM7OLEODBDAMRSEANR/events.json","paper":"https://pith.science/paper/PC73KPLC"},"agent_actions":{"view_html":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR","download_json":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR.json","view_paper":"https://pith.science/paper/PC73KPLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.08959&json=true","fetch_graph":"https://pith.science/api/pith-number/PC73KPLCUM7OLEODBDAMRSEANR/graph.json","fetch_events":"https://pith.science/api/pith-number/PC73KPLCUM7OLEODBDAMRSEANR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR/action/storage_attestation","attest_author":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR/action/author_attestation","sign_citation":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR/action/citation_signature","submit_replication":"https://pith.science/pith/PC73KPLCUM7OLEODBDAMRSEANR/action/replication_record"}},"created_at":"2026-07-05T03:24:31.938272+00:00","updated_at":"2026-07-05T03:24:31.938272+00:00"}