{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XHBPQWHNNIT7YYJUD4PNTRQASU","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":"90279892c6bce0d23aa52bebb06346b6bd55194fcf898b83a24f16933befb83e","cross_cats_sorted":["cs.CG","q-bio.QM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-27T23:45:00Z","title_canon_sha256":"556241d409afb154a2f217c03df73cabf687558f49eb6f34a2d24cb8b7431350"},"schema_version":"1.0","source":{"id":"2009.12981","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.12981","created_at":"2026-07-05T03:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2009.12981v4","created_at":"2026-07-05T03:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12981","created_at":"2026-07-05T03:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"XHBPQWHNNIT7","created_at":"2026-07-05T03:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"XHBPQWHNNIT7YYJU","created_at":"2026-07-05T03:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"XHBPQWHN","created_at":"2026-07-05T03:09:27Z"}],"graph_snapshots":[{"event_id":"sha256:b1b1f44ec99cacd45a8c6abe95315218eea1ee28aa31daf33ed24194f503e5d7","target":"graph","created_at":"2026-07-05T03:09:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.12981/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Leland McInnes, Timothy Q Gentner, Tim Sainburg","cross_cats":["cs.CG","q-bio.QM","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-27T23:45:00Z","title":"Parametric UMAP embeddings for representation and semi-supervised learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12981","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:dd0f5bd9cb785c45533205b5d40bf806f9b399000ec8dee5717fbcad524b5e07","target":"record","created_at":"2026-07-05T03:09:27Z","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":"90279892c6bce0d23aa52bebb06346b6bd55194fcf898b83a24f16933befb83e","cross_cats_sorted":["cs.CG","q-bio.QM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-27T23:45:00Z","title_canon_sha256":"556241d409afb154a2f217c03df73cabf687558f49eb6f34a2d24cb8b7431350"},"schema_version":"1.0","source":{"id":"2009.12981","kind":"arxiv","version":4}},"canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","first_computed_at":"2026-07-05T03:09:27.439190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:09:27.439190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n3rnVM5rNn/qWxtx/PQTHVQDOUmwMNURk+/gR8zEqzoDS5TbPhDOWfhDBFpwr2V9y7JeYvVN6KDKQUcUm1u6Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:09:27.439755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.12981","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd0f5bd9cb785c45533205b5d40bf806f9b399000ec8dee5717fbcad524b5e07","sha256:b1b1f44ec99cacd45a8c6abe95315218eea1ee28aa31daf33ed24194f503e5d7"],"state_sha256":"e17a956a115c9dc84840192fb37c026a24602e7fc8f02805a7a5f90bcb273046"}