{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C7CI7MELAPJUNVYSM4H5RRAN3G","short_pith_number":"pith:C7CI7MEL","schema_version":"1.0","canonical_sha256":"17c48fb08b03d346d712670fd8c40dd99c01e70885ad14f3bbdd40fc7002f140","source":{"kind":"arxiv","id":"2405.06734","version":1},"attestation_state":"computed","paper":{"title":"Neural Estimation Of Entropic Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Tao Wang, Ziv Goldfeld","submitted_at":"2024-05-10T17:48:15Z","abstract_excerpt":"Optimal transport (OT) serves as a natural framework for comparing probability measures, with applications in statistics, machine learning, and applied mathematics. Alas, statistical estimation and exact computation of the OT distances suffer from the curse of dimensionality. To circumvent these issues, entropic regularization has emerged as a remedy that enables parametric estimation rates via plug-in and efficient computation using Sinkhorn iterations. Motivated by further scaling up entropic OT (EOT) to data dimensions and sample sizes that appear in modern machine learning applications, we"},"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":"2405.06734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-05-10T17:48:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"293323c6070b6b7fa9237e0c5610cb2eb3812a23efc0b9e57879f82d99d78103","abstract_canon_sha256":"72764f6c66e33c6e2595043f20f543bd8dd30b69c3a1a015c6efc3eae1af0480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:11.086798Z","signature_b64":"ILBq8BYnaxJ3RmCgFthwU851bhDqSAKVwS8X/hsfyHZ3ITeBkbPeVtzB0BWIX3sTzbhcNTN0FwvaxpuvIbkwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17c48fb08b03d346d712670fd8c40dd99c01e70885ad14f3bbdd40fc7002f140","last_reissued_at":"2026-07-05T08:18:11.086299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:11.086299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Estimation Of Entropic Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Tao Wang, Ziv Goldfeld","submitted_at":"2024-05-10T17:48:15Z","abstract_excerpt":"Optimal transport (OT) serves as a natural framework for comparing probability measures, with applications in statistics, machine learning, and applied mathematics. Alas, statistical estimation and exact computation of the OT distances suffer from the curse of dimensionality. To circumvent these issues, entropic regularization has emerged as a remedy that enables parametric estimation rates via plug-in and efficient computation using Sinkhorn iterations. Motivated by further scaling up entropic OT (EOT) to data dimensions and sample sizes that appear in modern machine learning applications, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.06734","kind":"arxiv","version":1},"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/2405.06734/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":"2405.06734","created_at":"2026-07-05T08:18:11.086371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.06734v1","created_at":"2026-07-05T08:18:11.086371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.06734","created_at":"2026-07-05T08:18:11.086371+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7CI7MELAPJU","created_at":"2026-07-05T08:18:11.086371+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7CI7MELAPJUNVYS","created_at":"2026-07-05T08:18:11.086371+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7CI7MEL","created_at":"2026-07-05T08:18:11.086371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00573","citing_title":"Neural Estimation for Scaling Entropic Multimarginal Optimal Transport","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G","json":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G.json","graph_json":"https://pith.science/api/pith-number/C7CI7MELAPJUNVYSM4H5RRAN3G/graph.json","events_json":"https://pith.science/api/pith-number/C7CI7MELAPJUNVYSM4H5RRAN3G/events.json","paper":"https://pith.science/paper/C7CI7MEL"},"agent_actions":{"view_html":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G","download_json":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G.json","view_paper":"https://pith.science/paper/C7CI7MEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.06734&json=true","fetch_graph":"https://pith.science/api/pith-number/C7CI7MELAPJUNVYSM4H5RRAN3G/graph.json","fetch_events":"https://pith.science/api/pith-number/C7CI7MELAPJUNVYSM4H5RRAN3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G/action/storage_attestation","attest_author":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G/action/author_attestation","sign_citation":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G/action/citation_signature","submit_replication":"https://pith.science/pith/C7CI7MELAPJUNVYSM4H5RRAN3G/action/replication_record"}},"created_at":"2026-07-05T08:18:11.086371+00:00","updated_at":"2026-07-05T08:18:11.086371+00:00"}