{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UJ4PG3D7AI3EJ7BWE2QVJ67RVN","short_pith_number":"pith:UJ4PG3D7","canonical_record":{"source":{"id":"2408.00598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-01T14:28:34Z","cross_cats_sorted":[],"title_canon_sha256":"25629abc3d841836ead722868555918de7cb769f3a79ed3694c895e136aaf58e","abstract_canon_sha256":"ccd7857c0df6aaa204471e39f1af90944f3715d2dfa5ece7d680cadf26dd7fcc"},"schema_version":"1.0"},"canonical_sha256":"a278f36c7f023644fc3626a154fbf1ab4ed8b13e5b8e1b792c70fd3e53396c28","source":{"kind":"arxiv","id":"2408.00598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00598","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00598v2","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00598","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"UJ4PG3D7AI3E","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_16","alias_value":"UJ4PG3D7AI3EJ7BW","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_8","alias_value":"UJ4PG3D7","created_at":"2026-07-05T10:49:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UJ4PG3D7AI3EJ7BWE2QVJ67RVN","target":"record","payload":{"canonical_record":{"source":{"id":"2408.00598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-01T14:28:34Z","cross_cats_sorted":[],"title_canon_sha256":"25629abc3d841836ead722868555918de7cb769f3a79ed3694c895e136aaf58e","abstract_canon_sha256":"ccd7857c0df6aaa204471e39f1af90944f3715d2dfa5ece7d680cadf26dd7fcc"},"schema_version":"1.0"},"canonical_sha256":"a278f36c7f023644fc3626a154fbf1ab4ed8b13e5b8e1b792c70fd3e53396c28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:45.896485Z","signature_b64":"u9KaxfWonx5GBRHyp+tp/Ih+Lx8JFgHRMlgZgV6X/92R859h4VaCC2uxJBFouVqV/nB2K43M/rkjEwc6SZc7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a278f36c7f023644fc3626a154fbf1ab4ed8b13e5b8e1b792c70fd3e53396c28","last_reissued_at":"2026-07-05T10:49:45.895986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:45.895986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.00598","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-07-05T10:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8ApoMua/n4RkUMZbW9OkAY9JgPaSzMXMq4mHs8ITRsMG+BO26pLwbLBVytyfUiHMdgAAcVS7QUgsifYL39DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:10:49.566786Z"},"content_sha256":"2a8f18342dbec06a2c9daf188f8a1317cc0efc28cf5048a09225e290d93e94dd","schema_version":"1.0","event_id":"sha256:2a8f18342dbec06a2c9daf188f8a1317cc0efc28cf5048a09225e290d93e94dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UJ4PG3D7AI3EJ7BWE2QVJ67RVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Guojun Zhang, Yancheng Yuan, Zhexuan Gu","submitted_at":"2024-08-01T14:28:34Z","abstract_excerpt":"This paper proposes an efficient HOT algorithm for solving the optimal transport (OT) problems with finite supports. We particularly focus on an efficient implementation of the HOT algorithm for the case where the supports are in $\\mathbb{R}^2$ with ground distances calculated by $L_2^2$-norm. Specifically, we design a Halpern accelerating algorithm to solve the equivalent reduced model of the discrete OT problem. Moreover, we derive a novel procedure to solve the involved linear systems in the HOT algorithm in linear time complexity. Consequently, we can obtain an $\\varepsilon$-approximate so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00598","kind":"arxiv","version":2},"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/2408.00598/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-05T10:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/DZ6CcGeR/lBIEavcjQL7z0fZ6jAhc3WjZKvGCUcz4D1NRu0KSDP+mtwZNGHzBYdNvXZZTeQaIgBS8j4RdaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:10:49.567797Z"},"content_sha256":"cad9dc419d99d5eda828028e64f50237b33d7aaa577b62958b4bbe0e565a846b","schema_version":"1.0","event_id":"sha256:cad9dc419d99d5eda828028e64f50237b33d7aaa577b62958b4bbe0e565a846b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/bundle.json","state_url":"https://pith.science/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/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-19T16:10:49Z","links":{"resolver":"https://pith.science/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN","bundle":"https://pith.science/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/bundle.json","state":"https://pith.science/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJ4PG3D7AI3EJ7BWE2QVJ67RVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UJ4PG3D7AI3EJ7BWE2QVJ67RVN","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":"ccd7857c0df6aaa204471e39f1af90944f3715d2dfa5ece7d680cadf26dd7fcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-01T14:28:34Z","title_canon_sha256":"25629abc3d841836ead722868555918de7cb769f3a79ed3694c895e136aaf58e"},"schema_version":"1.0","source":{"id":"2408.00598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.00598","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"2408.00598v2","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00598","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"UJ4PG3D7AI3E","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_16","alias_value":"UJ4PG3D7AI3EJ7BW","created_at":"2026-07-05T10:49:45Z"},{"alias_kind":"pith_short_8","alias_value":"UJ4PG3D7","created_at":"2026-07-05T10:49:45Z"}],"graph_snapshots":[{"event_id":"sha256:cad9dc419d99d5eda828028e64f50237b33d7aaa577b62958b4bbe0e565a846b","target":"graph","created_at":"2026-07-05T10:49:45Z","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/2408.00598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes an efficient HOT algorithm for solving the optimal transport (OT) problems with finite supports. We particularly focus on an efficient implementation of the HOT algorithm for the case where the supports are in $\\mathbb{R}^2$ with ground distances calculated by $L_2^2$-norm. Specifically, we design a Halpern accelerating algorithm to solve the equivalent reduced model of the discrete OT problem. Moreover, we derive a novel procedure to solve the involved linear systems in the HOT algorithm in linear time complexity. Consequently, we can obtain an $\\varepsilon$-approximate so","authors_text":"Defeng Sun, Guojun Zhang, Yancheng Yuan, Zhexuan Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-01T14:28:34Z","title":"HOT: An Efficient Halpern Accelerating Algorithm for Optimal Transport Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00598","kind":"arxiv","version":2},"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:2a8f18342dbec06a2c9daf188f8a1317cc0efc28cf5048a09225e290d93e94dd","target":"record","created_at":"2026-07-05T10:49:45Z","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":"ccd7857c0df6aaa204471e39f1af90944f3715d2dfa5ece7d680cadf26dd7fcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-01T14:28:34Z","title_canon_sha256":"25629abc3d841836ead722868555918de7cb769f3a79ed3694c895e136aaf58e"},"schema_version":"1.0","source":{"id":"2408.00598","kind":"arxiv","version":2}},"canonical_sha256":"a278f36c7f023644fc3626a154fbf1ab4ed8b13e5b8e1b792c70fd3e53396c28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a278f36c7f023644fc3626a154fbf1ab4ed8b13e5b8e1b792c70fd3e53396c28","first_computed_at":"2026-07-05T10:49:45.895986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:45.895986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u9KaxfWonx5GBRHyp+tp/Ih+Lx8JFgHRMlgZgV6X/92R859h4VaCC2uxJBFouVqV/nB2K43M/rkjEwc6SZc7Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:45.896485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.00598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a8f18342dbec06a2c9daf188f8a1317cc0efc28cf5048a09225e290d93e94dd","sha256:cad9dc419d99d5eda828028e64f50237b33d7aaa577b62958b4bbe0e565a846b"],"state_sha256":"378f2242a6b1ee7a4ef476f8fbd35107430b1bf308acb814f5f16e0244c9785a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLMg4nywQ2imBEa15TSzr5X1mYWinZpPoVGu7N24+OG4HWAwuZtO0SYLb8jvFN4VWEtUSpbIMq9A74scOZNXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:10:49.574860Z","bundle_sha256":"97bbbbdd560b6e0f012260a58ebc0beadbd96cfcbb71bc51d198376979c5bf50"}}