{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UTD4NQJLWB4E6GGJYIYOFQO6YI","short_pith_number":"pith:UTD4NQJL","schema_version":"1.0","canonical_sha256":"a4c7c6c12bb0784f18c9c230e2c1dec234014975613c68fd0102d5017ec126a2","source":{"kind":"arxiv","id":"1910.00204","version":2},"attestation_state":"computed","paper":{"title":"TriMap: Large-scale Dimensionality Reduction Using Triplets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ehsan Amid, Manfred K. Warmuth","submitted_at":"2019-10-01T05:28:57Z","abstract_excerpt":"We introduce \"TriMap\"; a dimensionality reduction technique based on triplet constraints, which preserves the global structure of the data better than the other commonly used methods such as t-SNE, LargeVis, and UMAP. To quantify the global accuracy of the embedding, we introduce a score that roughly reflects the relative placement of the clusters rather than the individual points. We empirically show the excellent performance of TriMap on a large variety of datasets in terms of the quality of the embedding as well as the runtime. On our performance benchmarks, TriMap easily scales to millions"},"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":"1910.00204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-01T05:28:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b39e1a45b84ee32c8b507720417daa6cecf1a5ee1386f200714a872f4d73ad11","abstract_canon_sha256":"02f96bf4f9e33c9ab6afb160730d79c389136b4fa153fa824452464de475b6c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:37.229301Z","signature_b64":"9tbRaWd+77ROJbphXDZiN0UYSGscmH/jE3cWdATamB5hgCXXMu2/fWegswz7CsaOOEt5QuEfnRoyfK2yC0VLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c7c6c12bb0784f18c9c230e2c1dec234014975613c68fd0102d5017ec126a2","last_reissued_at":"2026-07-05T04:08:37.228839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:37.228839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TriMap: Large-scale Dimensionality Reduction Using Triplets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ehsan Amid, Manfred K. Warmuth","submitted_at":"2019-10-01T05:28:57Z","abstract_excerpt":"We introduce \"TriMap\"; a dimensionality reduction technique based on triplet constraints, which preserves the global structure of the data better than the other commonly used methods such as t-SNE, LargeVis, and UMAP. To quantify the global accuracy of the embedding, we introduce a score that roughly reflects the relative placement of the clusters rather than the individual points. We empirically show the excellent performance of TriMap on a large variety of datasets in terms of the quality of the embedding as well as the runtime. On our performance benchmarks, TriMap easily scales to millions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00204","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/1910.00204/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":"1910.00204","created_at":"2026-07-05T04:08:37.228892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00204v2","created_at":"2026-07-05T04:08:37.228892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00204","created_at":"2026-07-05T04:08:37.228892+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTD4NQJLWB4E","created_at":"2026-07-05T04:08:37.228892+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTD4NQJLWB4E6GGJ","created_at":"2026-07-05T04:08:37.228892+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTD4NQJL","created_at":"2026-07-05T04:08:37.228892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08746","citing_title":"Dimensionality Reduction Meets Network Science: Sensemaking on UMAP's kNN Graph","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11428","citing_title":"FastUMAP: Scalable Dimensionality Reduction via Bipartite Landmark Sampling","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04451","citing_title":"On Out-of-sample Embedding in UMAP","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20635","citing_title":"The General Theory of Localization Methods","ref_index":149,"is_internal_anchor":false},{"citing_arxiv_id":"2309.14857","citing_title":"Cluster Exploration using Informative Manifold Projections","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2410.16698","citing_title":"Hyperboloid GPLVM for Discovering Continuous Hierarchies via Nonparametric Estimation","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2503.09101","citing_title":"The Shape of Attraction in UMAP: Exploring the Embedding Forces in Dimensionality Reduction","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20635","citing_title":"The General Theory of Localization Methods","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11428","citing_title":"FastUMAP: Scalable Dimensionality Reduction via Bipartite Landmark Sampling","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16932","citing_title":"Neighbor Embedding for High-Dimensional Sparse Poisson Data","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI","json":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI.json","graph_json":"https://pith.science/api/pith-number/UTD4NQJLWB4E6GGJYIYOFQO6YI/graph.json","events_json":"https://pith.science/api/pith-number/UTD4NQJLWB4E6GGJYIYOFQO6YI/events.json","paper":"https://pith.science/paper/UTD4NQJL"},"agent_actions":{"view_html":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI","download_json":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI.json","view_paper":"https://pith.science/paper/UTD4NQJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00204&json=true","fetch_graph":"https://pith.science/api/pith-number/UTD4NQJLWB4E6GGJYIYOFQO6YI/graph.json","fetch_events":"https://pith.science/api/pith-number/UTD4NQJLWB4E6GGJYIYOFQO6YI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI/action/storage_attestation","attest_author":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI/action/author_attestation","sign_citation":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI/action/citation_signature","submit_replication":"https://pith.science/pith/UTD4NQJLWB4E6GGJYIYOFQO6YI/action/replication_record"}},"created_at":"2026-07-05T04:08:37.228892+00:00","updated_at":"2026-07-05T04:08:37.228892+00:00"}