{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:45DWCVI346SLO636Y7BXIBQQNO","short_pith_number":"pith:45DWCVI3","canonical_record":{"source":{"id":"2105.10370","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-21T14:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"0bcb1eb4fa61a392aafc9ae4183b0f04a4101b36795ee60c00d55b7d1e51f36e","abstract_canon_sha256":"6cc8d4b26f244aaeb85864e44fb8c9ba255434fbe5d9277db2fbef181f1e2424"},"schema_version":"1.0"},"canonical_sha256":"e74761551be7a4b77b7ec7c37406106b9ced11328ca4aea2401f9c1e8a12b36d","source":{"kind":"arxiv","id":"2105.10370","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.10370","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"2105.10370v3","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10370","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"45DWCVI346SL","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_16","alias_value":"45DWCVI346SLO636","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_8","alias_value":"45DWCVI3","created_at":"2026-07-05T04:23:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:45DWCVI346SLO636Y7BXIBQQNO","target":"record","payload":{"canonical_record":{"source":{"id":"2105.10370","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-21T14:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"0bcb1eb4fa61a392aafc9ae4183b0f04a4101b36795ee60c00d55b7d1e51f36e","abstract_canon_sha256":"6cc8d4b26f244aaeb85864e44fb8c9ba255434fbe5d9277db2fbef181f1e2424"},"schema_version":"1.0"},"canonical_sha256":"e74761551be7a4b77b7ec7c37406106b9ced11328ca4aea2401f9c1e8a12b36d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:35.257335Z","signature_b64":"27p0wFNFnyDAtKnkiMZjgY16bJEeN+l6WxrGCgMVCACysrLKncDQBd1AC0xaEEXNXtBD0VFjl9iuFOyIejUIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e74761551be7a4b77b7ec7c37406106b9ced11328ca4aea2401f9c1e8a12b36d","last_reissued_at":"2026-07-05T04:23:35.256744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:35.256744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.10370","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-07-05T04:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcG7YtCnDUOio2Wfbxf7mlXQ+D17RaziZK7toaU3Hq1ra4sAWXaVu79biY9qKrukF4wc63tazuUUy4uc22knBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:32:22.102242Z"},"content_sha256":"06e335c983155cf0d377041c223d8663e16d4efd1bd511ce6e4258d0af4de789","schema_version":"1.0","event_id":"sha256:06e335c983155cf0d377041c223d8663e16d4efd1bd511ce6e4258d0af4de789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:45DWCVI346SLO636Y7BXIBQQNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bregman Proximal Point Algorithm Revisited: A New Inexact Version and its Inertial Variant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Lei Yang","submitted_at":"2021-05-21T14:23:55Z","abstract_excerpt":"We study a general convex optimization problem, which covers various classic problems in different areas and particularly includes many optimal transport related problems arising in recent years. To solve this problem, we revisit the classic Bregman proximal point algorithm (BPPA) and introduce a new inexact stopping condition for solving the subproblems, which can circumvent the underlying feasibility difficulty often appearing in existing inexact conditions when the problem has a complex feasible set. Our inexact condition also covers several existing inexact conditions as special cases and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10370","kind":"arxiv","version":3},"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/2105.10370/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-05T04:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1llI928mwVUOLScbvxSw1g2LPyb3OSF7VHDMJGQIF1yfGlWfl704I0mDuG1eL1Z2+tspfi3O2y2MciPPSGMSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:32:22.103095Z"},"content_sha256":"c048ef420718a03c67af8f83b26fcb625a1a410aead363ba98cc5e85c54a474d","schema_version":"1.0","event_id":"sha256:c048ef420718a03c67af8f83b26fcb625a1a410aead363ba98cc5e85c54a474d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45DWCVI346SLO636Y7BXIBQQNO/bundle.json","state_url":"https://pith.science/pith/45DWCVI346SLO636Y7BXIBQQNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45DWCVI346SLO636Y7BXIBQQNO/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-14T06:32:22Z","links":{"resolver":"https://pith.science/pith/45DWCVI346SLO636Y7BXIBQQNO","bundle":"https://pith.science/pith/45DWCVI346SLO636Y7BXIBQQNO/bundle.json","state":"https://pith.science/pith/45DWCVI346SLO636Y7BXIBQQNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45DWCVI346SLO636Y7BXIBQQNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:45DWCVI346SLO636Y7BXIBQQNO","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":"6cc8d4b26f244aaeb85864e44fb8c9ba255434fbe5d9277db2fbef181f1e2424","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-21T14:23:55Z","title_canon_sha256":"0bcb1eb4fa61a392aafc9ae4183b0f04a4101b36795ee60c00d55b7d1e51f36e"},"schema_version":"1.0","source":{"id":"2105.10370","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.10370","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"2105.10370v3","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10370","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"45DWCVI346SL","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_16","alias_value":"45DWCVI346SLO636","created_at":"2026-07-05T04:23:35Z"},{"alias_kind":"pith_short_8","alias_value":"45DWCVI3","created_at":"2026-07-05T04:23:35Z"}],"graph_snapshots":[{"event_id":"sha256:c048ef420718a03c67af8f83b26fcb625a1a410aead363ba98cc5e85c54a474d","target":"graph","created_at":"2026-07-05T04:23:35Z","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/2105.10370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a general convex optimization problem, which covers various classic problems in different areas and particularly includes many optimal transport related problems arising in recent years. To solve this problem, we revisit the classic Bregman proximal point algorithm (BPPA) and introduce a new inexact stopping condition for solving the subproblems, which can circumvent the underlying feasibility difficulty often appearing in existing inexact conditions when the problem has a complex feasible set. Our inexact condition also covers several existing inexact conditions as special cases and ","authors_text":"Kim-Chuan Toh, Lei Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-21T14:23:55Z","title":"Bregman Proximal Point Algorithm Revisited: A New Inexact Version and its Inertial Variant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10370","kind":"arxiv","version":3},"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:06e335c983155cf0d377041c223d8663e16d4efd1bd511ce6e4258d0af4de789","target":"record","created_at":"2026-07-05T04:23:35Z","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":"6cc8d4b26f244aaeb85864e44fb8c9ba255434fbe5d9277db2fbef181f1e2424","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-21T14:23:55Z","title_canon_sha256":"0bcb1eb4fa61a392aafc9ae4183b0f04a4101b36795ee60c00d55b7d1e51f36e"},"schema_version":"1.0","source":{"id":"2105.10370","kind":"arxiv","version":3}},"canonical_sha256":"e74761551be7a4b77b7ec7c37406106b9ced11328ca4aea2401f9c1e8a12b36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e74761551be7a4b77b7ec7c37406106b9ced11328ca4aea2401f9c1e8a12b36d","first_computed_at":"2026-07-05T04:23:35.256744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:23:35.256744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"27p0wFNFnyDAtKnkiMZjgY16bJEeN+l6WxrGCgMVCACysrLKncDQBd1AC0xaEEXNXtBD0VFjl9iuFOyIejUIAg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:23:35.257335Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.10370","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06e335c983155cf0d377041c223d8663e16d4efd1bd511ce6e4258d0af4de789","sha256:c048ef420718a03c67af8f83b26fcb625a1a410aead363ba98cc5e85c54a474d"],"state_sha256":"39996b422769e39e0edd4345db3be5e1432f892542032275d2a94b881a642246"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnlwcbfymCUyrH2Jz1tYCwm8vbGUzWYqZqXj+eMK9CgI+wzsdStWd//Eb/GdGvnT2KS/COrIzSOsxG4n5WN2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:32:22.109100Z","bundle_sha256":"09c5775940aed5d835431c1b645f637a1b19e2aeaab0f15dd2427fba3cc9e599"}}