{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BCX4YKGN7DRWK4XKDRWKH3IUOT","short_pith_number":"pith:BCX4YKGN","canonical_record":{"source":{"id":"2605.10792","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T16:22:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bbcebb08e33dc1967f2dfcf667cda4b4383225e76269e17c3d15bb3742ecd9f1","abstract_canon_sha256":"10642c82112b5a20f0efd6d8eb5645ea8f3a33c2475c01781951705107e879de"},"schema_version":"1.0"},"canonical_sha256":"08afcc28cdf8e36572ea1c6ca3ed1474df2d0d32883aee91de14ed8b2f210243","source":{"kind":"arxiv","id":"2605.10792","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10792","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10792v2","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10792","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"BCX4YKGN7DRW","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"BCX4YKGN7DRWK4XK","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"BCX4YKGN","created_at":"2026-06-08T01:04:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BCX4YKGN7DRWK4XKDRWKH3IUOT","target":"record","payload":{"canonical_record":{"source":{"id":"2605.10792","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T16:22:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bbcebb08e33dc1967f2dfcf667cda4b4383225e76269e17c3d15bb3742ecd9f1","abstract_canon_sha256":"10642c82112b5a20f0efd6d8eb5645ea8f3a33c2475c01781951705107e879de"},"schema_version":"1.0"},"canonical_sha256":"08afcc28cdf8e36572ea1c6ca3ed1474df2d0d32883aee91de14ed8b2f210243","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:07.192172Z","signature_b64":"OEZhUddiT4KumGOoXNqL219qe4u96q200CdkYC3MUeuyHknBIxojAW9tmTrstqBpWKmn53TtaHl+GwW5g8TQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08afcc28cdf8e36572ea1c6ca3ed1474df2d0d32883aee91de14ed8b2f210243","last_reissued_at":"2026-06-08T01:04:07.191269Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:07.191269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.10792","source_version":2,"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-08T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"musJOOhxMsvYuVDw46sufxNN1sOp+2xfm9SNANgcJKdm4S3Ww1YgHgdPghz0tKoEB2qW5kB9V7boLiP4o5tqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:12:50.248563Z"},"content_sha256":"731de41c3d110dec05e95bd63e2970d29f3120e6a67d60911f8242032ebb079c","schema_version":"1.0","event_id":"sha256:731de41c3d110dec05e95bd63e2970d29f3120e6a67d60911f8242032ebb079c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BCX4YKGN7DRWK4XKDRWKH3IUOT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implicit Neural Optimal Transport via Fixed-Point Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation.","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Eric Gelphman, Samy Wu Fung, Stanley Osher, Yesom Park","submitted_at":"2026-05-11T16:22:06Z","abstract_excerpt":"We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem. This yields a stable single-network framework in which dual feasibility is enforced exactly through proximal optimality conditions rather than adversarial training. Despite the inner fixed-point computation, gradients can be computed without differentiating throug"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the proximal fixed-point reformulation of the c-transform can be solved accurately enough in practice to enforce dual feasibility exactly and that gradients computed without implicit differentiation remain faithful to the true optimal transport objective.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A single-network fixed-point formulation for neural optimal transport eliminates adversarial min-max optimization and implicit differentiation while enforcing dual feasibility exactly.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"06c1b1ad1084083c94db86ef60d6a66226dfa37c44c41bdd47fe6438583b8f5f"},"source":{"id":"2605.10792","kind":"arxiv","version":2},"verdict":{"id":"020dc055-777a-4f58-ab63-84ff25c5bc6a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T03:31:10.426088Z","strongest_claim":"We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem.","one_line_summary":"A single-network fixed-point formulation for neural optimal transport eliminates adversarial min-max optimization and implicit differentiation while enforcing dual feasibility exactly.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the proximal fixed-point reformulation of the c-transform can be solved accurately enough in practice to enforce dual feasibility exactly and that gradients computed without implicit differentiation remain faithful to the true optimal transport objective.","pith_extraction_headline":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.10792/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T05:22:00.379229Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T14:35:35.193495Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:17.772124Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:58:51.781274Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"5eacecc0d7c7bec1d28a217a1ad610424c8fe82bfd37b920795977770dc949ed"},"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"},"verdict_id":"020dc055-777a-4f58-ab63-84ff25c5bc6a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXhbda6jiTb9dwkAJkq5NOGKm9Zd0knsL+kJlfHCJStmccb2F14Ee5sESkII0gm2jWMSkytYcCMngPuLvjA+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:12:50.249073Z"},"content_sha256":"4799d1ae1a7ad2b9986e14d11f2e6d75a6620aa145edfe094bb7269c4fde7be4","schema_version":"1.0","event_id":"sha256:4799d1ae1a7ad2b9986e14d11f2e6d75a6620aa145edfe094bb7269c4fde7be4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/bundle.json","state_url":"https://pith.science/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/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-21T06:12:50Z","links":{"resolver":"https://pith.science/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT","bundle":"https://pith.science/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/bundle.json","state":"https://pith.science/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCX4YKGN7DRWK4XKDRWKH3IUOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BCX4YKGN7DRWK4XKDRWKH3IUOT","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":"10642c82112b5a20f0efd6d8eb5645ea8f3a33c2475c01781951705107e879de","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T16:22:06Z","title_canon_sha256":"bbcebb08e33dc1967f2dfcf667cda4b4383225e76269e17c3d15bb3742ecd9f1"},"schema_version":"1.0","source":{"id":"2605.10792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10792","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10792v2","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10792","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"BCX4YKGN7DRW","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_16","alias_value":"BCX4YKGN7DRWK4XK","created_at":"2026-06-08T01:04:07Z"},{"alias_kind":"pith_short_8","alias_value":"BCX4YKGN","created_at":"2026-06-08T01:04:07Z"}],"graph_snapshots":[{"event_id":"sha256:4799d1ae1a7ad2b9986e14d11f2e6d75a6620aa145edfe094bb7269c4fde7be4","target":"graph","created_at":"2026-06-08T01:04:07Z","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 an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the proximal fixed-point reformulation of the c-transform can be solved accurately enough in practice to enforce dual feasibility exactly and that gradients computed without implicit differentiation remain faithful to the true optimal transport objective."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A single-network fixed-point formulation for neural optimal transport eliminates adversarial min-max optimization and implicit differentiation while enforcing dual feasibility exactly."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation."}],"snapshot_sha256":"06c1b1ad1084083c94db86ef60d6a66226dfa37c44c41bdd47fe6438583b8f5f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T05:22:00.379229Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T14:35:35.193495Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:17.772124Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:58:51.781274Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10792/integrity.json","findings":[],"snapshot_sha256":"5eacecc0d7c7bec1d28a217a1ad610424c8fe82bfd37b920795977770dc949ed","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem. This yields a stable single-network framework in which dual feasibility is enforced exactly through proximal optimality conditions rather than adversarial training. Despite the inner fixed-point computation, gradients can be computed without differentiating throug","authors_text":"Eric Gelphman, Samy Wu Fung, Stanley Osher, Yesom Park","cross_cats":["cs.LG"],"headline":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T16:22:06Z","title":"Implicit Neural Optimal Transport via Fixed-Point Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10792","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T03:31:10.426088Z","id":"020dc055-777a-4f58-ab63-84ff25c5bc6a","model_set":{"reader":"grok-4.3"},"one_line_summary":"A single-network fixed-point formulation for neural optimal transport eliminates adversarial min-max optimization and implicit differentiation while enforcing dual feasibility exactly.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A single neural network solves optimal transport by reformulating the c-transform as a proximal fixed-point problem, enforcing dual feasibility exactly without adversarial training or implicit differentiation.","strongest_claim":"We propose an implicit neural formulation of optimal transport that eliminates adversarial min--max optimization and multi-network architectures commonly used in existing approaches. Our key idea is to parameterize a single potential in the Kantorovich dual and reformulate the associated c-transform as a proximal fixed-point problem.","weakest_assumption":"That the proximal fixed-point reformulation of the c-transform can be solved accurately enough in practice to enforce dual feasibility exactly and that gradients computed without implicit differentiation remain faithful to the true optimal transport objective."}},"verdict_id":"020dc055-777a-4f58-ab63-84ff25c5bc6a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:731de41c3d110dec05e95bd63e2970d29f3120e6a67d60911f8242032ebb079c","target":"record","created_at":"2026-06-08T01:04:07Z","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":"10642c82112b5a20f0efd6d8eb5645ea8f3a33c2475c01781951705107e879de","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T16:22:06Z","title_canon_sha256":"bbcebb08e33dc1967f2dfcf667cda4b4383225e76269e17c3d15bb3742ecd9f1"},"schema_version":"1.0","source":{"id":"2605.10792","kind":"arxiv","version":2}},"canonical_sha256":"08afcc28cdf8e36572ea1c6ca3ed1474df2d0d32883aee91de14ed8b2f210243","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08afcc28cdf8e36572ea1c6ca3ed1474df2d0d32883aee91de14ed8b2f210243","first_computed_at":"2026-06-08T01:04:07.191269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:04:07.191269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OEZhUddiT4KumGOoXNqL219qe4u96q200CdkYC3MUeuyHknBIxojAW9tmTrstqBpWKmn53TtaHl+GwW5g8TQBA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:04:07.192172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:731de41c3d110dec05e95bd63e2970d29f3120e6a67d60911f8242032ebb079c","sha256:4799d1ae1a7ad2b9986e14d11f2e6d75a6620aa145edfe094bb7269c4fde7be4"],"state_sha256":"7eeb25fd618baef4474825cdab816af78fe68dbed035fe75a0834a3fdbfef85f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liLsVUJQr5cwb4ikMYjlUveBepx1gEtuFy8RGyt2MoBdgnJKWhwuAcBVTVvLofWp4DP3Ss9jjw9wzQwf5beUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:12:50.251350Z","bundle_sha256":"d84bb3825908052cfb114b99534f0718247961ade71e8d49f4ca610ab86a17c8"}}