{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:USS2CBKT6DPZFWYMF7JL6D7ZGK","short_pith_number":"pith:USS2CBKT","schema_version":"1.0","canonical_sha256":"a4a5a10553f0df92db0c2fd2bf0ff932981e56a76b366c148b7e4d75e13a1fa3","source":{"kind":"arxiv","id":"2311.05672","version":3},"attestation_state":"computed","paper":{"title":"Conditional Optimal Transport on Function Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander W. Hsu, Amirhossein Taghvaei, Bamdad Hosseini","submitted_at":"2023-11-09T18:44:42Z","abstract_excerpt":"We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of constrained optimal transport problems that describe block-triangular Monge maps that characterize conditional measures along with their Kantorovich relaxations. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We further tailor our results to the case of Bayesian inference pr"},"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":"2311.05672","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-11-09T18:44:42Z","cross_cats_sorted":["math.PR","stat.CO","stat.ML"],"title_canon_sha256":"526b2a1fa45d107e39ec7129df79b32af4643e44d126b46b7755e6cdb37a8385","abstract_canon_sha256":"8c7a53ec5b64e84d0428a0cbf552252c3785bbea2469070573c3e38b6a9f3ba5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:44.919822Z","signature_b64":"YNtI1/B55p4s7vLiwnxK8yRbvl1VJQN7RXugExODpmkVem54IiZI27j2t+FRqluKtxW5VMuY+N2/XMLH6iQUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a5a10553f0df92db0c2fd2bf0ff932981e56a76b366c148b7e4d75e13a1fa3","last_reissued_at":"2026-07-05T07:41:44.919262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:44.919262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Optimal Transport on Function Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander W. Hsu, Amirhossein Taghvaei, Bamdad Hosseini","submitted_at":"2023-11-09T18:44:42Z","abstract_excerpt":"We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of constrained optimal transport problems that describe block-triangular Monge maps that characterize conditional measures along with their Kantorovich relaxations. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We further tailor our results to the case of Bayesian inference pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05672","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/2311.05672/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":"2311.05672","created_at":"2026-07-05T07:41:44.919319+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.05672v3","created_at":"2026-07-05T07:41:44.919319+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05672","created_at":"2026-07-05T07:41:44.919319+00:00"},{"alias_kind":"pith_short_12","alias_value":"USS2CBKT6DPZ","created_at":"2026-07-05T07:41:44.919319+00:00"},{"alias_kind":"pith_short_16","alias_value":"USS2CBKT6DPZFWYM","created_at":"2026-07-05T07:41:44.919319+00:00"},{"alias_kind":"pith_short_8","alias_value":"USS2CBKT","created_at":"2026-07-05T07:41:44.919319+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06262","citing_title":"Optimal Transport Q-Learning for Flow Policy Steering and Acceleration","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2501.16839","citing_title":"Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK","json":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK.json","graph_json":"https://pith.science/api/pith-number/USS2CBKT6DPZFWYMF7JL6D7ZGK/graph.json","events_json":"https://pith.science/api/pith-number/USS2CBKT6DPZFWYMF7JL6D7ZGK/events.json","paper":"https://pith.science/paper/USS2CBKT"},"agent_actions":{"view_html":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK","download_json":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK.json","view_paper":"https://pith.science/paper/USS2CBKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.05672&json=true","fetch_graph":"https://pith.science/api/pith-number/USS2CBKT6DPZFWYMF7JL6D7ZGK/graph.json","fetch_events":"https://pith.science/api/pith-number/USS2CBKT6DPZFWYMF7JL6D7ZGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK/action/storage_attestation","attest_author":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK/action/author_attestation","sign_citation":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK/action/citation_signature","submit_replication":"https://pith.science/pith/USS2CBKT6DPZFWYMF7JL6D7ZGK/action/replication_record"}},"created_at":"2026-07-05T07:41:44.919319+00:00","updated_at":"2026-07-05T07:41:44.919319+00:00"}