{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PCWCWIG5IXKSVD5GC37MZEOXXW","short_pith_number":"pith:PCWCWIG5","schema_version":"1.0","canonical_sha256":"78ac2b20dd45d52a8fa616fecc91d7bdae2dea19593965febaefcee06eb0b847","source":{"kind":"arxiv","id":"2203.12997","version":3},"attestation_state":"computed","paper":{"title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.GR"],"primary_cat":"cs.CV","authors_text":"Constantin Seibold, Marios Koulakis, M. Saquib Sarfraz, Rainer Stiefelhagen","submitted_at":"2022-03-24T11:41:16Z","abstract_excerpt":"Dimensionality reduction is crucial both for visualization and preprocessing high dimensional data for machine learning. We introduce a novel method based on a hierarchy built on 1-nearest neighbor graphs in the original space which is used to preserve the grouping properties of the data distribution on multiple levels. The core of the proposal is an optimization-free projection that is competitive with the latest versions of t-SNE and UMAP in performance and visualization quality while being an order of magnitude faster in run-time. Furthermore, its interpretable mechanics, the ability to pro"},"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":"2203.12997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-03-24T11:41:16Z","cross_cats_sorted":["cs.AI","cs.DS","cs.GR"],"title_canon_sha256":"f803c34431b46365f9e2b112f084b0f7c13e3048200b37c882db3c92e3c0fcbe","abstract_canon_sha256":"3cef069971c76778c0f4e5cb10017b97572ec21f759d4dd1c64d2788e4d1a9ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:12.345086Z","signature_b64":"ViecScoJtAEd1Pa6gsY0KN09KQ4GOEtfNwcUBfk0J5f7j0KVEGA2JljiWzHu9Rog4xxfe10hDtjjRok8A7Z7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78ac2b20dd45d52a8fa616fecc91d7bdae2dea19593965febaefcee06eb0b847","last_reissued_at":"2026-07-05T04:27:12.344518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:12.344518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.GR"],"primary_cat":"cs.CV","authors_text":"Constantin Seibold, Marios Koulakis, M. Saquib Sarfraz, Rainer Stiefelhagen","submitted_at":"2022-03-24T11:41:16Z","abstract_excerpt":"Dimensionality reduction is crucial both for visualization and preprocessing high dimensional data for machine learning. We introduce a novel method based on a hierarchy built on 1-nearest neighbor graphs in the original space which is used to preserve the grouping properties of the data distribution on multiple levels. The core of the proposal is an optimization-free projection that is competitive with the latest versions of t-SNE and UMAP in performance and visualization quality while being an order of magnitude faster in run-time. Furthermore, its interpretable mechanics, the ability to pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.12997","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.12997/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":"2203.12997","created_at":"2026-07-05T04:27:12.344578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.12997v3","created_at":"2026-07-05T04:27:12.344578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.12997","created_at":"2026-07-05T04:27:12.344578+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCWCWIG5IXKS","created_at":"2026-07-05T04:27:12.344578+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCWCWIG5IXKSVD5G","created_at":"2026-07-05T04:27:12.344578+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCWCWIG5","created_at":"2026-07-05T04:27:12.344578+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/PCWCWIG5IXKSVD5GC37MZEOXXW","json":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW.json","graph_json":"https://pith.science/api/pith-number/PCWCWIG5IXKSVD5GC37MZEOXXW/graph.json","events_json":"https://pith.science/api/pith-number/PCWCWIG5IXKSVD5GC37MZEOXXW/events.json","paper":"https://pith.science/paper/PCWCWIG5"},"agent_actions":{"view_html":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW","download_json":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW.json","view_paper":"https://pith.science/paper/PCWCWIG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.12997&json=true","fetch_graph":"https://pith.science/api/pith-number/PCWCWIG5IXKSVD5GC37MZEOXXW/graph.json","fetch_events":"https://pith.science/api/pith-number/PCWCWIG5IXKSVD5GC37MZEOXXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW/action/storage_attestation","attest_author":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW/action/author_attestation","sign_citation":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW/action/citation_signature","submit_replication":"https://pith.science/pith/PCWCWIG5IXKSVD5GC37MZEOXXW/action/replication_record"}},"created_at":"2026-07-05T04:27:12.344578+00:00","updated_at":"2026-07-05T04:27:12.344578+00:00"}