{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WWNSOOY7HKTMGXUQW3KVSSV2JL","short_pith_number":"pith:WWNSOOY7","schema_version":"1.0","canonical_sha256":"b59b273b1f3aa6c35e90b6d5594aba4ae6190147c3529698de7e127b47464bd5","source":{"kind":"arxiv","id":"2310.16975","version":3},"attestation_state":"computed","paper":{"title":"Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Deepanshu Verma, Lars Ruthotto, Ricardo Baptista, Youssef Marzouk, Zheyu Oliver Wang","submitted_at":"2023-10-25T20:20:09Z","abstract_excerpt":"We present two neural network approaches that approximate the solutions of static and dynamic $\\unicode{x1D450}\\unicode{x1D45C}\\unicode{x1D45B}\\unicode{x1D451}\\unicode{x1D456}\\unicode{x1D461}\\unicode{x1D456}\\unicode{x1D45C}\\unicode{x1D45B}\\unicode{x1D44E}\\unicode{x1D459}\\unicode{x0020}\\unicode{x1D45C}\\unicode{x1D45D}\\unicode{x1D461}\\unicode{x1D456}\\unicode{x1D45A}\\unicode{x1D44E}\\unicode{x1D459}\\unicode{x0020}\\unicode{x1D461}\\unicode{x1D45F}\\unicode{x1D44E}\\unicode{x1D45B}\\unicode{x1D460}\\unicode{x1D45D}\\unicode{x1D45C}\\unicode{x1D45F}\\unicode{x1D461}$ (COT) problems. Both approaches enable co"},"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":"2310.16975","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-10-25T20:20:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8db5134c10ca5ad581e632a292c9c4bd1c717fc0f3498b9762bcf0f367c5376c","abstract_canon_sha256":"dd325d82a0b6b69e165fbf26bd3c556f893fc334ee661a7f8b649e8402bb079b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:08.598710Z","signature_b64":"wZ+svp1GxFZPeYflbjCNLsfo0MOMCR7lwNvTdurXKBNTgGn9MToaIfap3hJnOYsT9+zVRBLRJa6xmRKSk5wNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b59b273b1f3aa6c35e90b6d5594aba4ae6190147c3529698de7e127b47464bd5","last_reissued_at":"2026-07-05T10:53:08.598251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:08.598251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Deepanshu Verma, Lars Ruthotto, Ricardo Baptista, Youssef Marzouk, Zheyu Oliver Wang","submitted_at":"2023-10-25T20:20:09Z","abstract_excerpt":"We present two neural network approaches that approximate the solutions of static and dynamic $\\unicode{x1D450}\\unicode{x1D45C}\\unicode{x1D45B}\\unicode{x1D451}\\unicode{x1D456}\\unicode{x1D461}\\unicode{x1D456}\\unicode{x1D45C}\\unicode{x1D45B}\\unicode{x1D44E}\\unicode{x1D459}\\unicode{x0020}\\unicode{x1D45C}\\unicode{x1D45D}\\unicode{x1D461}\\unicode{x1D456}\\unicode{x1D45A}\\unicode{x1D44E}\\unicode{x1D459}\\unicode{x0020}\\unicode{x1D461}\\unicode{x1D45F}\\unicode{x1D44E}\\unicode{x1D45B}\\unicode{x1D460}\\unicode{x1D45D}\\unicode{x1D45C}\\unicode{x1D45F}\\unicode{x1D461}$ (COT) problems. Both approaches enable co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.16975","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/2310.16975/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":"2310.16975","created_at":"2026-07-05T10:53:08.598305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.16975v3","created_at":"2026-07-05T10:53:08.598305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.16975","created_at":"2026-07-05T10:53:08.598305+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWNSOOY7HKTM","created_at":"2026-07-05T10:53:08.598305+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWNSOOY7HKTMGXUQ","created_at":"2026-07-05T10:53:08.598305+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWNSOOY7","created_at":"2026-07-05T10:53:08.598305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01164","citing_title":"Tightening Causal Bounds via Covariate-Aware Optimal Transport","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL","json":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL.json","graph_json":"https://pith.science/api/pith-number/WWNSOOY7HKTMGXUQW3KVSSV2JL/graph.json","events_json":"https://pith.science/api/pith-number/WWNSOOY7HKTMGXUQW3KVSSV2JL/events.json","paper":"https://pith.science/paper/WWNSOOY7"},"agent_actions":{"view_html":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL","download_json":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL.json","view_paper":"https://pith.science/paper/WWNSOOY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.16975&json=true","fetch_graph":"https://pith.science/api/pith-number/WWNSOOY7HKTMGXUQW3KVSSV2JL/graph.json","fetch_events":"https://pith.science/api/pith-number/WWNSOOY7HKTMGXUQW3KVSSV2JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL/action/storage_attestation","attest_author":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL/action/author_attestation","sign_citation":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL/action/citation_signature","submit_replication":"https://pith.science/pith/WWNSOOY7HKTMGXUQW3KVSSV2JL/action/replication_record"}},"created_at":"2026-07-05T10:53:08.598305+00:00","updated_at":"2026-07-05T10:53:08.598305+00:00"}