{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6K5MYH4VDRXF4XVFFQ5SHKIINI","short_pith_number":"pith:6K5MYH4V","canonical_record":{"source":{"id":"2109.12004","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"1a4f1ee7cd71f18437b06c901c44e3e07c4a7b9a530ea5ff2942820a49e483d3","abstract_canon_sha256":"c3579ffa8cd084709025221808d6cf34c2e85377164167872d64b525f46f1fe2"},"schema_version":"1.0"},"canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","source":{"kind":"arxiv","id":"2109.12004","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12004","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12004v3","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12004","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"6K5MYH4VDRXF","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"6K5MYH4VDRXF4XVF","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"6K5MYH4V","created_at":"2026-07-05T08:17:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6K5MYH4VDRXF4XVFFQ5SHKIINI","target":"record","payload":{"canonical_record":{"source":{"id":"2109.12004","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"1a4f1ee7cd71f18437b06c901c44e3e07c4a7b9a530ea5ff2942820a49e483d3","abstract_canon_sha256":"c3579ffa8cd084709025221808d6cf34c2e85377164167872d64b525f46f1fe2"},"schema_version":"1.0"},"canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:53.710910Z","signature_b64":"JI5FhUZBiQM8FiuKT3pV6roYnFBpcuTcqZmqZMZibIpVG6FYkt0CgWE6h7JDCzCYh/4AmmlJN3L7/4jMbiKHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","last_reissued_at":"2026-07-05T08:17:53.710476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:53.710476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.12004","source_version":3,"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-05T08:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6cqKNhuaEPTlHIKnaIh8iSlqUCQN3iKEEmkvJR2Gx+Dq6F4oOcxACU+utPtXSYyyocI4w+oHviGTa1t4YsYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:42:26.547464Z"},"content_sha256":"43425ac9f29880669e2f88b329dbb160dbdd97c6cfcf75cf3636d4818761fc4f","schema_version":"1.0","event_id":"sha256:43425ac9f29880669e2f88b329dbb160dbdd97c6cfcf75cf3636d4818761fc4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6K5MYH4VDRXF4XVFFQ5SHKIINI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropic estimation of optimal transport maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aram-Alexandre Pooladian, Jonathan Niles-Weed","submitted_at":"2021-09-24T14:57:26Z","abstract_excerpt":"We develop a computationally tractable method for estimating the optimal map between two distributions over $\\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our estimator -- the \\emph{barycentric projection} of the optimal entropic plan -- is easy to compute using Sinkhorn's algorithm. As a result, unlike current approaches for map estimation, which are slow to evaluate when the dimension or number of samples is large, our approach is parallelizable and extremely efficient even for massive data sets. Under smoothness assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12004","kind":"arxiv","version":3},"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/2109.12004/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-05T08:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/KYtfmkpcHBPTviOs4YFNLU7DOjSjcJgU5xrkyLfCVgSAm2yPmSJma08jw1n4CHlP1OZC+Jj4eRhDTh0+p6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:42:26.548189Z"},"content_sha256":"96dfce7fb4bb47e21830b667198edb9d568a1173dbade0012d3837dc533ac653","schema_version":"1.0","event_id":"sha256:96dfce7fb4bb47e21830b667198edb9d568a1173dbade0012d3837dc533ac653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/bundle.json","state_url":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/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-08T19:42:26Z","links":{"resolver":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI","bundle":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/bundle.json","state":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6K5MYH4VDRXF4XVFFQ5SHKIINI","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":"c3579ffa8cd084709025221808d6cf34c2e85377164167872d64b525f46f1fe2","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","title_canon_sha256":"1a4f1ee7cd71f18437b06c901c44e3e07c4a7b9a530ea5ff2942820a49e483d3"},"schema_version":"1.0","source":{"id":"2109.12004","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.12004","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2109.12004v3","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12004","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"6K5MYH4VDRXF","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"6K5MYH4VDRXF4XVF","created_at":"2026-07-05T08:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"6K5MYH4V","created_at":"2026-07-05T08:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:96dfce7fb4bb47e21830b667198edb9d568a1173dbade0012d3837dc533ac653","target":"graph","created_at":"2026-07-05T08:17:53Z","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/2109.12004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a computationally tractable method for estimating the optimal map between two distributions over $\\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our estimator -- the \\emph{barycentric projection} of the optimal entropic plan -- is easy to compute using Sinkhorn's algorithm. As a result, unlike current approaches for map estimation, which are slow to evaluate when the dimension or number of samples is large, our approach is parallelizable and extremely efficient even for massive data sets. Under smoothness assum","authors_text":"Aram-Alexandre Pooladian, Jonathan Niles-Weed","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","title":"Entropic estimation of optimal transport maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12004","kind":"arxiv","version":3},"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:43425ac9f29880669e2f88b329dbb160dbdd97c6cfcf75cf3636d4818761fc4f","target":"record","created_at":"2026-07-05T08:17:53Z","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":"c3579ffa8cd084709025221808d6cf34c2e85377164167872d64b525f46f1fe2","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","title_canon_sha256":"1a4f1ee7cd71f18437b06c901c44e3e07c4a7b9a530ea5ff2942820a49e483d3"},"schema_version":"1.0","source":{"id":"2109.12004","kind":"arxiv","version":3}},"canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","first_computed_at":"2026-07-05T08:17:53.710476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:17:53.710476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JI5FhUZBiQM8FiuKT3pV6roYnFBpcuTcqZmqZMZibIpVG6FYkt0CgWE6h7JDCzCYh/4AmmlJN3L7/4jMbiKHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:17:53.710910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.12004","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43425ac9f29880669e2f88b329dbb160dbdd97c6cfcf75cf3636d4818761fc4f","sha256:96dfce7fb4bb47e21830b667198edb9d568a1173dbade0012d3837dc533ac653"],"state_sha256":"f67d7d26a3895b5e3a7e8e2d856cff62d281033ac3aed7fe913e9335669ee8cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hI3cy6E8N7ufNlXgf9Khq2KjaqGlI2eyTfqvnITvKEYJZUsWj8IZg8jbULbFIXwkB64EKUzdstJcDsMWAFDCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:42:26.552793Z","bundle_sha256":"674ae68a607a5b5e85871219b45633049264c94db816348cf142d9d208511910"}}