{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4STWBAHMIZYI67JOEWLH6GVEE2","short_pith_number":"pith:4STWBAHM","schema_version":"1.0","canonical_sha256":"e4a76080ec46708f7d2e25967f1aa42687fbd4d912a5f9615ff813501bd7ffdd","source":{"kind":"arxiv","id":"2307.09816","version":2},"attestation_state":"computed","paper":{"title":"Manifold Learning with Sparse Regularised Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Geoffrey Schiebinger, Gilles Mordant, Stephen Zhang, Tetsuya Matsumoto","submitted_at":"2023-07-19T08:05:46Z","abstract_excerpt":"Manifold learning is a central task in modern statistics and data science. Many datasets (cells, documents, images, molecules) can be represented as point clouds embedded in a high dimensional ambient space, however the degrees of freedom intrinsic to the data are usually far fewer than the number of ambient dimensions. The task of detecting a latent manifold along which the data are embedded is a prerequisite for a wide family of downstream analyses. Real-world datasets are subject to noisy observations and sampling, so that distilling information about the underlying manifold is a major chal"},"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":"2307.09816","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-07-19T08:05:46Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"5c488ed910cd8f5835458a009eaf7dbba19480f6271969b2f6f8b50127f336bc","abstract_canon_sha256":"ad904c36771fffb0bc698ea5a2b275c37f0a16c988b9ea0c4edc88e7ae64a7eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:13.798101Z","signature_b64":"r6Ey8b2XhAKE6kV41nokd/55SnR58FOjMVk/LROen+4rxLg/QfDOBIY7LvnPf3SpEySopEb6LmKMsuzJeUbQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a76080ec46708f7d2e25967f1aa42687fbd4d912a5f9615ff813501bd7ffdd","last_reissued_at":"2026-07-05T10:15:13.797598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:13.797598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Manifold Learning with Sparse Regularised Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Geoffrey Schiebinger, Gilles Mordant, Stephen Zhang, Tetsuya Matsumoto","submitted_at":"2023-07-19T08:05:46Z","abstract_excerpt":"Manifold learning is a central task in modern statistics and data science. Many datasets (cells, documents, images, molecules) can be represented as point clouds embedded in a high dimensional ambient space, however the degrees of freedom intrinsic to the data are usually far fewer than the number of ambient dimensions. The task of detecting a latent manifold along which the data are embedded is a prerequisite for a wide family of downstream analyses. Real-world datasets are subject to noisy observations and sampling, so that distilling information about the underlying manifold is a major chal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.09816","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/2307.09816/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":"2307.09816","created_at":"2026-07-05T10:15:13.797661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.09816v2","created_at":"2026-07-05T10:15:13.797661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.09816","created_at":"2026-07-05T10:15:13.797661+00:00"},{"alias_kind":"pith_short_12","alias_value":"4STWBAHMIZYI","created_at":"2026-07-05T10:15:13.797661+00:00"},{"alias_kind":"pith_short_16","alias_value":"4STWBAHMIZYI67JO","created_at":"2026-07-05T10:15:13.797661+00:00"},{"alias_kind":"pith_short_8","alias_value":"4STWBAHM","created_at":"2026-07-05T10:15:13.797661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27175","citing_title":"Polyak-Lojasiewicz Inequality for Quadratically Regularized Optimal Transport","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2412.12007","citing_title":"The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2509.08547","citing_title":"Linear Convergence of Gradient Descent for Quadratically Regularized Optimal Transport","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.00843","citing_title":"Sharp local sparsity of regularized optimal transport","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2","json":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2.json","graph_json":"https://pith.science/api/pith-number/4STWBAHMIZYI67JOEWLH6GVEE2/graph.json","events_json":"https://pith.science/api/pith-number/4STWBAHMIZYI67JOEWLH6GVEE2/events.json","paper":"https://pith.science/paper/4STWBAHM"},"agent_actions":{"view_html":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2","download_json":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2.json","view_paper":"https://pith.science/paper/4STWBAHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.09816&json=true","fetch_graph":"https://pith.science/api/pith-number/4STWBAHMIZYI67JOEWLH6GVEE2/graph.json","fetch_events":"https://pith.science/api/pith-number/4STWBAHMIZYI67JOEWLH6GVEE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2/action/storage_attestation","attest_author":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2/action/author_attestation","sign_citation":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2/action/citation_signature","submit_replication":"https://pith.science/pith/4STWBAHMIZYI67JOEWLH6GVEE2/action/replication_record"}},"created_at":"2026-07-05T10:15:13.797661+00:00","updated_at":"2026-07-05T10:15:13.797661+00:00"}