{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I33NTXR426DT44ZDYO5AKMVDTJ","short_pith_number":"pith:I33NTXR4","schema_version":"1.0","canonical_sha256":"46f6d9de3cd7873e7323c3ba0532a39a6a058a4ce8ab55f8ac562ca37bbb841e","source":{"kind":"arxiv","id":"2512.10857","version":2},"attestation_state":"computed","paper":{"title":"Generative Modeling from Black-box Corruptions via Self-Consistent Stochastic Interpolants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An iterative procedure with stochastic interpolants learns a transport map that inverts black-box corruptions to generate clean data from corrupted observations alone.","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chirag Modi, Eric Vanden-Eijnden, Jiequn Han, Joan Bruna","submitted_at":"2025-12-11T17:53:38Z","abstract_excerpt":"Transport-based methods have emerged as a leading paradigm for building generative models from large, clean datasets. However, in many scientific and engineering domains, clean data are often unavailable: instead, we only observe measurements corrupted through a noisy, ill-conditioned channel. A generative model for the original data thus requires solving an inverse problem at the level of distributions. In this work, we introduce a novel approach to this task based on Stochastic Interpolants: we iteratively update a transport map between corrupted and clean data samples using only access to t"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2512.10857","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-11T17:53:38Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"31a7b1cdbc63c2ed2a0f561d652afcbf560723f14f3d56370f77f22804d202b2","abstract_canon_sha256":"0de2b24aeb2a13a3f40cd519c3612eac774ee91b86147128a9b00cef846b768c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.682812Z","signature_b64":"5bgz0wE90noSTbNf+eLOA1nJGSHbX0kNVbQoGwloFhf+kvAV71mQ6numsILtpthBTOvUW5HZIIpqTOAcBX3JDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f6d9de3cd7873e7323c3ba0532a39a6a058a4ce8ab55f8ac562ca37bbb841e","last_reissued_at":"2026-05-18T03:09:32.682284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.682284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Modeling from Black-box Corruptions via Self-Consistent Stochastic Interpolants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An iterative procedure with stochastic interpolants learns a transport map that inverts black-box corruptions to generate clean data from corrupted observations alone.","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chirag Modi, Eric Vanden-Eijnden, Jiequn Han, Joan Bruna","submitted_at":"2025-12-11T17:53:38Z","abstract_excerpt":"Transport-based methods have emerged as a leading paradigm for building generative models from large, clean datasets. However, in many scientific and engineering domains, clean data are often unavailable: instead, we only observe measurements corrupted through a noisy, ill-conditioned channel. A generative model for the original data thus requires solving an inverse problem at the level of distributions. In this work, we introduce a novel approach to this task based on Stochastic Interpolants: we iteratively update a transport map between corrupted and clean data samples using only access to t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under appropriate conditions, this iterative procedure converges towards a self-consistent transport map that effectively inverts the corruption channel, thus enabling a generative model for the clean data.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The iterative procedure converges to the desired self-consistent transport map under appropriate (unspecified in abstract) conditions on the corruption channel and data distributions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SCSI iteratively refines a self-consistent transport map to invert black-box corruptions and enable generative modeling of clean data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An iterative procedure with stochastic interpolants learns a transport map that inverts black-box corruptions to generate clean data from corrupted observations alone.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"274414270b7fcb0cb953207e90a878712024d0a68875a54d0b076c2cb2257fd7"},"source":{"id":"2512.10857","kind":"arxiv","version":2},"verdict":{"id":"e2f790ff-9258-4801-b297-32b50b68459d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T22:59:02.873512Z","strongest_claim":"Under appropriate conditions, this iterative procedure converges towards a self-consistent transport map that effectively inverts the corruption channel, thus enabling a generative model for the clean data.","one_line_summary":"SCSI iteratively refines a self-consistent transport map to invert black-box corruptions and enable generative modeling of clean data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The iterative procedure converges to the desired self-consistent transport map under appropriate (unspecified in abstract) conditions on the corruption channel and data distributions.","pith_extraction_headline":"An iterative procedure with stochastic interpolants learns a transport map that inverts black-box corruptions to generate clean data from corrupted observations alone."},"references":{"count":18,"sample":[{"doi":"","year":null,"title":"Stochastic Interpolants: A Unifying Framework for Flows and Diffusions","work_id":"c2c7dd8f-fbfb-4591-89ec-9a3a0e6744bd","ref_index":1,"cited_arxiv_id":"2303.08797","is_internal_anchor":true},{"doi":"","year":null,"title":"Stochastic interpolants with data-dependent couplings.arXiv preprint arXiv:2310.03725,","work_id":"9d29254d-1e1b-42c3-ac06-35e6ef5d5d16","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Building normalizing flows with stochastic interpolants","work_id":"85ffbc5d-05cf-43b9-88b7-94664bc37be4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Nearlyd-linear convergence bounds for diffusion models via stochastic local- ization.CoRR, abs/2308.03686","work_id":"c042e9f5-74ae-4fea-b435-c2920ccb9e2e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv preprint arXiv:2209.11215 , year =","work_id":"311398cb-1dd2-4542-88ad-c173f1545e4a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":18,"snapshot_sha256":"127863a653e86cbe91bfb68002d676a9c7d9f0c38368d7375417b13848c1ab9b","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b639b8e8390900e35dcda75dd5ccfced9ebc04367101d45e95e4f642d8b5c145"},"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":"2512.10857","created_at":"2026-05-18T03:09:32.682379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.10857v2","created_at":"2026-05-18T03:09:32.682379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.10857","created_at":"2026-05-18T03:09:32.682379+00:00"},{"alias_kind":"pith_short_12","alias_value":"I33NTXR426DT","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"I33NTXR426DT44ZD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"I33NTXR4","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ","json":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ.json","graph_json":"https://pith.science/api/pith-number/I33NTXR426DT44ZDYO5AKMVDTJ/graph.json","events_json":"https://pith.science/api/pith-number/I33NTXR426DT44ZDYO5AKMVDTJ/events.json","paper":"https://pith.science/paper/I33NTXR4"},"agent_actions":{"view_html":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ","download_json":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ.json","view_paper":"https://pith.science/paper/I33NTXR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.10857&json=true","fetch_graph":"https://pith.science/api/pith-number/I33NTXR426DT44ZDYO5AKMVDTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/I33NTXR426DT44ZDYO5AKMVDTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ/action/storage_attestation","attest_author":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ/action/author_attestation","sign_citation":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ/action/citation_signature","submit_replication":"https://pith.science/pith/I33NTXR426DT44ZDYO5AKMVDTJ/action/replication_record"}},"created_at":"2026-05-18T03:09:32.682379+00:00","updated_at":"2026-05-18T03:09:32.682379+00:00"}