{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:25Q7SQPZMJAOPX3RLM44A6JHMV","short_pith_number":"pith:25Q7SQPZ","canonical_record":{"source":{"id":"2604.06531","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-08T00:04:52Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"ca6d193d7b0700966f32bcb9ebfcad48127f8a1b3178eb07792c49cde03731b6","abstract_canon_sha256":"bd10599143f844ac615b30ed1b0ca55d4b5a2ac88c5223198c59743ce3cf61b9"},"schema_version":"1.0"},"canonical_sha256":"d761f941f96240e7df715b39c07927655261717af370aa559426005d79529497","source":{"kind":"arxiv","id":"2604.06531","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.06531","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"2604.06531v3","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.06531","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"25Q7SQPZMJAO","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_16","alias_value":"25Q7SQPZMJAOPX3R","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_8","alias_value":"25Q7SQPZ","created_at":"2026-06-19T16:09:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:25Q7SQPZMJAOPX3RLM44A6JHMV","target":"record","payload":{"canonical_record":{"source":{"id":"2604.06531","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-08T00:04:52Z","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"ca6d193d7b0700966f32bcb9ebfcad48127f8a1b3178eb07792c49cde03731b6","abstract_canon_sha256":"bd10599143f844ac615b30ed1b0ca55d4b5a2ac88c5223198c59743ce3cf61b9"},"schema_version":"1.0"},"canonical_sha256":"d761f941f96240e7df715b39c07927655261717af370aa559426005d79529497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:57.964059Z","signature_b64":"82aO1Fah77Et6b8XVtXaaqkdMGOOpC3/vZvBCLcG6v1gGzkHwhp3UCbphlb6O4rYI/k+HgcVMfuLZ96kCBtfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d761f941f96240e7df715b39c07927655261717af370aa559426005d79529497","last_reissued_at":"2026-06-19T16:09:57.963602Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:57.963602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.06531","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pC+eg1luynpc0HzThg0nTFY7X23QKJvefkucv2Z0+42lafnMXy9v/I0O5k/5lTfEhVmxlJhsQbE/3I34E7VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:09:29.705142Z"},"content_sha256":"c65e36fad32705630e9c4dabad0b814962e045a605f3a0969bc0f6c912c9ced8","schema_version":"1.0","event_id":"sha256:c65e36fad32705630e9c4dabad0b814962e045a605f3a0969bc0f6c912c9ced8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:25Q7SQPZMJAOPX3RLM44A6JHMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Sinkhorn Algorithm for Mean-Field Schr\\\"odinger Bridge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems.","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Abhishek Halder, Asmaa Eldesoukey, Yongxin Chen","submitted_at":"2026-04-08T00:04:52Z","abstract_excerpt":"The mean-field Schr\\\"odinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution from another by a fixed deadline. Unlike the standard Schr\\\"odinger bridge, the dynamical constraint for MFSB is the mean-field limit of a population of interacting agents with controls. It serves as a natural model for large-scale multi-agent systems. The MFSB is computationally challenging because the nonlocal interaction makes the problem nonconvex. We propose a generalization of the Hopf-Cole transform for "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The mild assumptions on the interaction potential are sufficient to guarantee convergence of the recursive algorithm; the abstract does not specify what these assumptions are or whether they hold for typical repulsive/attractive potentials used in applications.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A generalized Hopf-Cole transform enables a convergent Sinkhorn-type algorithm for solving the nonconvex mean-field Schrödinger bridge problem via integro-PDEs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"884e8d5d5675b8221e7f0427dcc8a14b3c71718b063d17b43fce4965ab86df59"},"source":{"id":"2604.06531","kind":"arxiv","version":3},"verdict":{"id":"f79ef262-ad30-4474-bc20-4924aae4ae9b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T18:39:15.811107Z","strongest_claim":"We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm.","one_line_summary":"A generalized Hopf-Cole transform enables a convergent Sinkhorn-type algorithm for solving the nonconvex mean-field Schrödinger bridge problem via integro-PDEs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The mild assumptions on the interaction potential are sufficient to guarantee convergence of the recursive algorithm; the abstract does not specify what these assumptions are or whether they hold for typical repulsive/attractive potentials used in applications.","pith_extraction_headline":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.06531/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":2,"snapshot_sha256":"762f2a07a18068b7b86c7ddb5fa560b674dc50fe2d225ceb4f49d0124b31eefd"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f79ef262-ad30-4474-bc20-4924aae4ae9b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwiZgmcGt+bih5/uQkmTkppLX3lkMEp5j09dv63p6zvm+P8VeawQZTuO8AchpRWTwWO/1pMvel7nkd/hUZKzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:09:29.705646Z"},"content_sha256":"b5dc684c27bebc8f12849d136e3c428155e9105a9bf31dd4f737681aac3559ad","schema_version":"1.0","event_id":"sha256:b5dc684c27bebc8f12849d136e3c428155e9105a9bf31dd4f737681aac3559ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/bundle.json","state_url":"https://pith.science/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T00:09:29Z","links":{"resolver":"https://pith.science/pith/25Q7SQPZMJAOPX3RLM44A6JHMV","bundle":"https://pith.science/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/bundle.json","state":"https://pith.science/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25Q7SQPZMJAOPX3RLM44A6JHMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:25Q7SQPZMJAOPX3RLM44A6JHMV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bd10599143f844ac615b30ed1b0ca55d4b5a2ac88c5223198c59743ce3cf61b9","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-08T00:04:52Z","title_canon_sha256":"ca6d193d7b0700966f32bcb9ebfcad48127f8a1b3178eb07792c49cde03731b6"},"schema_version":"1.0","source":{"id":"2604.06531","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.06531","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"2604.06531v3","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.06531","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"25Q7SQPZMJAO","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_16","alias_value":"25Q7SQPZMJAOPX3R","created_at":"2026-06-19T16:09:57Z"},{"alias_kind":"pith_short_8","alias_value":"25Q7SQPZ","created_at":"2026-06-19T16:09:57Z"}],"graph_snapshots":[{"event_id":"sha256:b5dc684c27bebc8f12849d136e3c428155e9105a9bf31dd4f737681aac3559ad","target":"graph","created_at":"2026-06-19T16:09:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The mild assumptions on the interaction potential are sufficient to guarantee convergence of the recursive algorithm; the abstract does not specify what these assumptions are or whether they hold for typical repulsive/attractive potentials used in applications."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A generalized Hopf-Cole transform enables a convergent Sinkhorn-type algorithm for solving the nonconvex mean-field Schrödinger bridge problem via integro-PDEs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems."}],"snapshot_sha256":"884e8d5d5675b8221e7f0427dcc8a14b3c71718b063d17b43fce4965ab86df59"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"762f2a07a18068b7b86c7ddb5fa560b674dc50fe2d225ceb4f49d0124b31eefd"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.06531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The mean-field Schr\\\"odinger bridge (MFSB) problem concerns designing a minimum-effort controller that guides a diffusion process with nonlocal interaction to reach a given distribution from another by a fixed deadline. Unlike the standard Schr\\\"odinger bridge, the dynamical constraint for MFSB is the mean-field limit of a population of interacting agents with controls. It serves as a natural model for large-scale multi-agent systems. The MFSB is computationally challenging because the nonlocal interaction makes the problem nonconvex. We propose a generalization of the Hopf-Cole transform for ","authors_text":"Abhishek Halder, Asmaa Eldesoukey, Yongxin Chen","cross_cats":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"headline":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-08T00:04:52Z","title":"A Generalized Sinkhorn Algorithm for Mean-Field Schr\\\"odinger Bridge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.06531","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T18:39:15.811107Z","id":"f79ef262-ad30-4474-bc20-4924aae4ae9b","model_set":{"reader":"grok-4.3"},"one_line_summary":"A generalized Hopf-Cole transform enables a convergent Sinkhorn-type algorithm for solving the nonconvex mean-field Schrödinger bridge problem via integro-PDEs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A generalized Hopf-Cole transform yields a Sinkhorn-type recursive algorithm for mean-field Schrödinger bridge problems.","strongest_claim":"We propose a generalization of the Hopf-Cole transform for MFSB and, building on it, design a Sinkhorn-type recursive algorithm to solve the associated system of integro-PDEs. Under mild assumptions on the interaction potential, we discuss convergence guarantees for the proposed algorithm.","weakest_assumption":"The mild assumptions on the interaction potential are sufficient to guarantee convergence of the recursive algorithm; the abstract does not specify what these assumptions are or whether they hold for typical repulsive/attractive potentials used in applications."}},"verdict_id":"f79ef262-ad30-4474-bc20-4924aae4ae9b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c65e36fad32705630e9c4dabad0b814962e045a605f3a0969bc0f6c912c9ced8","target":"record","created_at":"2026-06-19T16:09:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bd10599143f844ac615b30ed1b0ca55d4b5a2ac88c5223198c59743ce3cf61b9","cross_cats_sorted":["cs.LG","cs.MA","cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-08T00:04:52Z","title_canon_sha256":"ca6d193d7b0700966f32bcb9ebfcad48127f8a1b3178eb07792c49cde03731b6"},"schema_version":"1.0","source":{"id":"2604.06531","kind":"arxiv","version":3}},"canonical_sha256":"d761f941f96240e7df715b39c07927655261717af370aa559426005d79529497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d761f941f96240e7df715b39c07927655261717af370aa559426005d79529497","first_computed_at":"2026-06-19T16:09:57.963602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:57.963602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82aO1Fah77Et6b8XVtXaaqkdMGOOpC3/vZvBCLcG6v1gGzkHwhp3UCbphlb6O4rYI/k+HgcVMfuLZ96kCBtfBQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:57.964059Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.06531","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c65e36fad32705630e9c4dabad0b814962e045a605f3a0969bc0f6c912c9ced8","sha256:b5dc684c27bebc8f12849d136e3c428155e9105a9bf31dd4f737681aac3559ad"],"state_sha256":"b5c426bcfddeba6305ec948355195ce467a033896968a02c6d41e1fae5a82a28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWLETOtruagR8sk0yhn74vOgn7nqf2zW+8mSt2hBrWmUBi2oJrTux4pKGX1cvYHnXvbuJ7MqH3dzJm5b8CreDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T00:09:29.708054Z","bundle_sha256":"9416652bf7c47f556927fbaa2f783c398b82f8c0a213d7422265314559946cca"}}