{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:BCQMECKSLCOOO6Q2HL5RFHVYFU","short_pith_number":"pith:BCQMECKS","canonical_record":{"source":{"id":"2110.11738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-22T12:16:08Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"d8f24dfab4bd83dd47b758f91b0d24e6b6789b64d874493d4e28b6d3291cb30f","abstract_canon_sha256":"ffb25a656bfb3be8bf9c794858a1899eae53d39ea5de75c68e3c54cdf0c61c7c"},"schema_version":"1.0"},"canonical_sha256":"08a0c20952589ce77a1a3afb129eb82d34932480cab78656c4f7aaeb5f3df0f4","source":{"kind":"arxiv","id":"2110.11738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11738","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11738v1","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11738","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_12","alias_value":"BCQMECKSLCOO","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_16","alias_value":"BCQMECKSLCOOO6Q2","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_8","alias_value":"BCQMECKS","created_at":"2026-07-05T03:24:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:BCQMECKSLCOOO6Q2HL5RFHVYFU","target":"record","payload":{"canonical_record":{"source":{"id":"2110.11738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-22T12:16:08Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"d8f24dfab4bd83dd47b758f91b0d24e6b6789b64d874493d4e28b6d3291cb30f","abstract_canon_sha256":"ffb25a656bfb3be8bf9c794858a1899eae53d39ea5de75c68e3c54cdf0c61c7c"},"schema_version":"1.0"},"canonical_sha256":"08a0c20952589ce77a1a3afb129eb82d34932480cab78656c4f7aaeb5f3df0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:50.637347Z","signature_b64":"7OaZb6bJSf0WRn3sv2v2GFviLvmi49HYK4lOXMn+/7I4eedUb/aTt6EHnjQWRo14OV24SxBimxmiH3Y7ScS8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08a0c20952589ce77a1a3afb129eb82d34932480cab78656c4f7aaeb5f3df0f4","last_reissued_at":"2026-07-05T03:24:50.636919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:50.636919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.11738","source_version":1,"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-07-05T03:24:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbIY/OUSjwHa35FNddQ36CRMhEFuKpwugf+fqGddADo55mDdeXAF5v3phVKapJBEY15ih1AY5ARftgmgckSVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:40:28.106588Z"},"content_sha256":"ba73f36e6bbf5f9f675b47aab64038eef9af0f686b63fc65ba11f4f8410a4fe0","schema_version":"1.0","event_id":"sha256:ba73f36e6bbf5f9f675b47aab64038eef9af0f686b63fc65ba11f4f8410a4fe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:BCQMECKSLCOOO6Q2HL5RFHVYFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Jacob Lindb\\\"ack, Mikael Johansson, Vien V. Mai","submitted_at":"2021-10-22T12:16:08Z","abstract_excerpt":"We develop a fast and reliable method for solving large-scale optimal transport (OT) problems at an unprecedented combination of speed and accuracy. Built on the celebrated Douglas-Rachford splitting technique, our method tackles the original OT problem directly instead of solving an approximate regularized problem, as many state-of-the-art techniques do. This allows us to provide sparse transport plans and avoid numerical issues of methods that use entropic regularization. The algorithm has the same cost per iteration as the popular Sinkhorn method, and each iteration can be executed efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11738","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/2110.11738/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:24:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMO7uevZxzfy6HGeMI7ND1JpVVoCJCDigCBQC4kQqCMnAi1RvkCxdJvy0Ld3Hj/uImJsWt0TU8vKtRKVNHAWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:40:28.107389Z"},"content_sha256":"55231d11959c1f84f0679ff19689514a81aea2c043a07e76a104f5d7a748f738","schema_version":"1.0","event_id":"sha256:55231d11959c1f84f0679ff19689514a81aea2c043a07e76a104f5d7a748f738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/bundle.json","state_url":"https://pith.science/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/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-08-08T13:40:28Z","links":{"resolver":"https://pith.science/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU","bundle":"https://pith.science/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/bundle.json","state":"https://pith.science/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCQMECKSLCOOO6Q2HL5RFHVYFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:BCQMECKSLCOOO6Q2HL5RFHVYFU","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":"ffb25a656bfb3be8bf9c794858a1899eae53d39ea5de75c68e3c54cdf0c61c7c","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-22T12:16:08Z","title_canon_sha256":"d8f24dfab4bd83dd47b758f91b0d24e6b6789b64d874493d4e28b6d3291cb30f"},"schema_version":"1.0","source":{"id":"2110.11738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.11738","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"arxiv_version","alias_value":"2110.11738v1","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11738","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_12","alias_value":"BCQMECKSLCOO","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_16","alias_value":"BCQMECKSLCOOO6Q2","created_at":"2026-07-05T03:24:50Z"},{"alias_kind":"pith_short_8","alias_value":"BCQMECKS","created_at":"2026-07-05T03:24:50Z"}],"graph_snapshots":[{"event_id":"sha256:55231d11959c1f84f0679ff19689514a81aea2c043a07e76a104f5d7a748f738","target":"graph","created_at":"2026-07-05T03:24:50Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.11738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a fast and reliable method for solving large-scale optimal transport (OT) problems at an unprecedented combination of speed and accuracy. Built on the celebrated Douglas-Rachford splitting technique, our method tackles the original OT problem directly instead of solving an approximate regularized problem, as many state-of-the-art techniques do. This allows us to provide sparse transport plans and avoid numerical issues of methods that use entropic regularization. The algorithm has the same cost per iteration as the popular Sinkhorn method, and each iteration can be executed efficien","authors_text":"Jacob Lindb\\\"ack, Mikael Johansson, Vien V. Mai","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-22T12:16:08Z","title":"A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11738","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ba73f36e6bbf5f9f675b47aab64038eef9af0f686b63fc65ba11f4f8410a4fe0","target":"record","created_at":"2026-07-05T03:24:50Z","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":"ffb25a656bfb3be8bf9c794858a1899eae53d39ea5de75c68e3c54cdf0c61c7c","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-10-22T12:16:08Z","title_canon_sha256":"d8f24dfab4bd83dd47b758f91b0d24e6b6789b64d874493d4e28b6d3291cb30f"},"schema_version":"1.0","source":{"id":"2110.11738","kind":"arxiv","version":1}},"canonical_sha256":"08a0c20952589ce77a1a3afb129eb82d34932480cab78656c4f7aaeb5f3df0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08a0c20952589ce77a1a3afb129eb82d34932480cab78656c4f7aaeb5f3df0f4","first_computed_at":"2026-07-05T03:24:50.636919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:24:50.636919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OaZb6bJSf0WRn3sv2v2GFviLvmi49HYK4lOXMn+/7I4eedUb/aTt6EHnjQWRo14OV24SxBimxmiH3Y7ScS8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:24:50.637347Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.11738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba73f36e6bbf5f9f675b47aab64038eef9af0f686b63fc65ba11f4f8410a4fe0","sha256:55231d11959c1f84f0679ff19689514a81aea2c043a07e76a104f5d7a748f738"],"state_sha256":"d9375ae7177595494a4264e090cc38ef1a593241ee810c279838e8a03a6e9557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcE6C8pasBiTpNnBla0ON3AqQaW6iBtzhJAJwbx4kuGQvKTltwSkXPHJ1HxM5rDffatbBPyPVxjanvyJs+5TBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:40:28.118740Z","bundle_sha256":"e353e1daaf50b5120ad03dcf707c0a84a267d864befa3010897d669bb9a007b5"}}