{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XHBPQWHNNIT7YYJUD4PNTRQASU","short_pith_number":"pith:XHBPQWHN","schema_version":"1.0","canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","source":{"kind":"arxiv","id":"2009.12981","version":4},"attestation_state":"computed","paper":{"title":"Parametric UMAP embeddings for representation and semi-supervised learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Leland McInnes, Timothy Q Gentner, Tim Sainburg","submitted_at":"2020-09-27T23:45:00Z","abstract_excerpt":"UMAP is a non-parametric graph-based dimensionality reduction algorithm using applied Riemannian geometry and algebraic topology to find low-dimensional embeddings of structured data. The UMAP algorithm consists of two steps: (1) Compute a graphical representation of a dataset (fuzzy simplicial complex), and (2) Through stochastic gradient descent, optimize a low-dimensional embedding of the graph. Here, we extend the second step of UMAP to a parametric optimization over neural network weights, learning a parametric relationship between data and embedding. We first demonstrate that Parametric "},"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":"2009.12981","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-27T23:45:00Z","cross_cats_sorted":["cs.CG","q-bio.QM","stat.ML"],"title_canon_sha256":"556241d409afb154a2f217c03df73cabf687558f49eb6f34a2d24cb8b7431350","abstract_canon_sha256":"90279892c6bce0d23aa52bebb06346b6bd55194fcf898b83a24f16933befb83e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:27.439755Z","signature_b64":"n3rnVM5rNn/qWxtx/PQTHVQDOUmwMNURk+/gR8zEqzoDS5TbPhDOWfhDBFpwr2V9y7JeYvVN6KDKQUcUm1u6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","last_reissued_at":"2026-07-05T03:09:27.439190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:27.439190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parametric UMAP embeddings for representation and semi-supervised learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","q-bio.QM","stat.ML"],"primary_cat":"cs.LG","authors_text":"Leland McInnes, Timothy Q Gentner, Tim Sainburg","submitted_at":"2020-09-27T23:45:00Z","abstract_excerpt":"UMAP is a non-parametric graph-based dimensionality reduction algorithm using applied Riemannian geometry and algebraic topology to find low-dimensional embeddings of structured data. The UMAP algorithm consists of two steps: (1) Compute a graphical representation of a dataset (fuzzy simplicial complex), and (2) Through stochastic gradient descent, optimize a low-dimensional embedding of the graph. Here, we extend the second step of UMAP to a parametric optimization over neural network weights, learning a parametric relationship between data and embedding. We first demonstrate that Parametric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12981","kind":"arxiv","version":4},"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/2009.12981/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":"2009.12981","created_at":"2026-07-05T03:09:27.439251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.12981v4","created_at":"2026-07-05T03:09:27.439251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12981","created_at":"2026-07-05T03:09:27.439251+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHBPQWHNNIT7","created_at":"2026-07-05T03:09:27.439251+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHBPQWHNNIT7YYJU","created_at":"2026-07-05T03:09:27.439251+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHBPQWHN","created_at":"2026-07-05T03:09:27.439251+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.16494","citing_title":"Manifold Learning for Personalized and Label-Free Detection of Cardiac Arrhythmias","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2603.02275","citing_title":"A Comparative Study of UMAP and Other Dimensionality Reduction Methods","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU","json":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU.json","graph_json":"https://pith.science/api/pith-number/XHBPQWHNNIT7YYJUD4PNTRQASU/graph.json","events_json":"https://pith.science/api/pith-number/XHBPQWHNNIT7YYJUD4PNTRQASU/events.json","paper":"https://pith.science/paper/XHBPQWHN"},"agent_actions":{"view_html":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU","download_json":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU.json","view_paper":"https://pith.science/paper/XHBPQWHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.12981&json=true","fetch_graph":"https://pith.science/api/pith-number/XHBPQWHNNIT7YYJUD4PNTRQASU/graph.json","fetch_events":"https://pith.science/api/pith-number/XHBPQWHNNIT7YYJUD4PNTRQASU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/action/storage_attestation","attest_author":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/action/author_attestation","sign_citation":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/action/citation_signature","submit_replication":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/action/replication_record"}},"created_at":"2026-07-05T03:09:27.439251+00:00","updated_at":"2026-07-05T03:09:27.439251+00:00"}