{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:W4ZJI4XCGBCMVZNQN3232DF5KN","short_pith_number":"pith:W4ZJI4XC","schema_version":"1.0","canonical_sha256":"b7329472e23044cae5b06ef5bd0cbd53416356d2de201f93dec5f155ade33202","source":{"kind":"arxiv","id":"2307.04102","version":1},"attestation_state":"computed","paper":{"title":"A generative flow for conditional sampling via optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alfin Hou, Anupam Bhakta, Daniel Pocklington, Giulio Trigila, Isa Lyubimova, Jason Alfonso, Josef Sajonz, Noam Gal, Ricardo Baptista, Ryan Tsai","submitted_at":"2023-07-09T05:36:26Z","abstract_excerpt":"Sampling conditional distributions is a fundamental task for Bayesian inference and density estimation. Generative models, such as normalizing flows and generative adversarial networks, characterize conditional distributions by learning a transport map that pushes forward a simple reference (e.g., a standard Gaussian) to a target distribution. While these approaches successfully describe many non-Gaussian problems, their performance is often limited by parametric bias and the reliability of gradient-based (adversarial) optimizers to learn these transformations. This work proposes a non-paramet"},"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.04102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-07-09T05:36:26Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"78a70a8d18a20369fd262095fd0c0358b8f90b298665415769d43758311cb0b2","abstract_canon_sha256":"c6016032f6404fa8357136f6729ca22ad3ae8abee863d6c5f140cf6c6fd76e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:08.771491Z","signature_b64":"7zezcQlKBvdjP6qq1OEb3ELRe9rFU4c0N/Ehmmb8wH328F1aNG4VqaJ+/Dd0nx3xcONbs3MWA9riAscWlVu3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7329472e23044cae5b06ef5bd0cbd53416356d2de201f93dec5f155ade33202","last_reissued_at":"2026-07-05T06:29:08.771034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:08.771034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generative flow for conditional sampling via optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alfin Hou, Anupam Bhakta, Daniel Pocklington, Giulio Trigila, Isa Lyubimova, Jason Alfonso, Josef Sajonz, Noam Gal, Ricardo Baptista, Ryan Tsai","submitted_at":"2023-07-09T05:36:26Z","abstract_excerpt":"Sampling conditional distributions is a fundamental task for Bayesian inference and density estimation. Generative models, such as normalizing flows and generative adversarial networks, characterize conditional distributions by learning a transport map that pushes forward a simple reference (e.g., a standard Gaussian) to a target distribution. While these approaches successfully describe many non-Gaussian problems, their performance is often limited by parametric bias and the reliability of gradient-based (adversarial) optimizers to learn these transformations. This work proposes a non-paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04102","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/2307.04102/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.04102","created_at":"2026-07-05T06:29:08.771089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.04102v1","created_at":"2026-07-05T06:29:08.771089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04102","created_at":"2026-07-05T06:29:08.771089+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4ZJI4XCGBCM","created_at":"2026-07-05T06:29:08.771089+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4ZJI4XCGBCMVZNQ","created_at":"2026-07-05T06:29:08.771089+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4ZJI4XC","created_at":"2026-07-05T06:29:08.771089+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12077","citing_title":"The Missing GAP: From Solving Square Jigsaw Puzzles to Handling Real World Archaeological Fragments","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN","json":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN.json","graph_json":"https://pith.science/api/pith-number/W4ZJI4XCGBCMVZNQN3232DF5KN/graph.json","events_json":"https://pith.science/api/pith-number/W4ZJI4XCGBCMVZNQN3232DF5KN/events.json","paper":"https://pith.science/paper/W4ZJI4XC"},"agent_actions":{"view_html":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN","download_json":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN.json","view_paper":"https://pith.science/paper/W4ZJI4XC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.04102&json=true","fetch_graph":"https://pith.science/api/pith-number/W4ZJI4XCGBCMVZNQN3232DF5KN/graph.json","fetch_events":"https://pith.science/api/pith-number/W4ZJI4XCGBCMVZNQN3232DF5KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN/action/storage_attestation","attest_author":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN/action/author_attestation","sign_citation":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN/action/citation_signature","submit_replication":"https://pith.science/pith/W4ZJI4XCGBCMVZNQN3232DF5KN/action/replication_record"}},"created_at":"2026-07-05T06:29:08.771089+00:00","updated_at":"2026-07-05T06:29:08.771089+00:00"}