{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XHBPQWHNNIT7YYJUD4PNTRQASU","short_pith_number":"pith:XHBPQWHN","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"},"canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","source":{"kind":"arxiv","id":"2009.12981","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XHBPQWHNNIT7YYJUD4PNTRQASU","target":"record","payload":{"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"},"canonical_sha256":"b9c2f858ed6a27fc61341f1ed9c600950725d73cf65035dc43cea126ff480cb7","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"},"source_kind":"arxiv","source_id":"2009.12981","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6OkWH4Wn7OA54h4lUqRokT64JvOJ7bIXObVBwLatnq3czU5PQXQedxOMlCbCxletLMGkwyPTr7RQMzN4OlgZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:32:09.870109Z"},"content_sha256":"dd0f5bd9cb785c45533205b5d40bf806f9b399000ec8dee5717fbcad524b5e07","schema_version":"1.0","event_id":"sha256:dd0f5bd9cb785c45533205b5d40bf806f9b399000ec8dee5717fbcad524b5e07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XHBPQWHNNIT7YYJUD4PNTRQASU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuyYnjFkmTp5GeURiKdxIxR1NZ923Dx3kGrrSLj//9uj+4D0tCkC/9mn+XUefj5G0zsqppF88gR4fAfECmhiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:32:09.871053Z"},"content_sha256":"b1b1f44ec99cacd45a8c6abe95315218eea1ee28aa31daf33ed24194f503e5d7","schema_version":"1.0","event_id":"sha256:b1b1f44ec99cacd45a8c6abe95315218eea1ee28aa31daf33ed24194f503e5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/bundle.json","state_url":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T09:32:09Z","links":{"resolver":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU","bundle":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/bundle.json","state":"https://pith.science/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHBPQWHNNIT7YYJUD4PNTRQASU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrYlPFwv6WVai75EZdU7dYltNJ/a79zqqrCNzk6Jp9haTR2S0Ord0GnccgpshzX8ecmL2bqdgZMa/gbcAkRtDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T09:32:09.877506Z","bundle_sha256":"706c11d2b96d316567100299d5fbbd37f62d19a23bb855b930ece5a04c249cdb"}}