{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LPTVQO4HTO66DU32SOXRMORE22","short_pith_number":"pith:LPTVQO4H","canonical_record":{"source":{"id":"1605.02970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"713db4d25fb1a192b6554fe3c2618acd58490fe6b56b27c44018bdbc6cbbff56","abstract_canon_sha256":"731df4e7c91a29e68c7ee9a14f65e8dab537bbd9df504ae47b870080d66b48d4"},"schema_version":"1.0"},"canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","source":{"kind":"arxiv","id":"1605.02970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02970","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02970v1","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02970","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"LPTVQO4HTO66","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPTVQO4HTO66DU32","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPTVQO4H","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LPTVQO4HTO66DU32SOXRMORE22","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"713db4d25fb1a192b6554fe3c2618acd58490fe6b56b27c44018bdbc6cbbff56","abstract_canon_sha256":"731df4e7c91a29e68c7ee9a14f65e8dab537bbd9df504ae47b870080d66b48d4"},"schema_version":"1.0"},"canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:08.020732Z","signature_b64":"sAXYYiPEswLiScpNTVcA+JorVlrAO54LIrQMk3szFEh+4chGd3yHZCumL3Y9UWy2AJPKSo6hGIpgzFocUxAgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","last_reissued_at":"2026-05-18T01:15:08.019414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:08.019414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02970","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-05-18T01:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jb1/6yiBN6tn0pKiY3D2SqISZZ4iSSrpcyY1Nd+iqNcMLfOL1kE4UtP1Ape12yHllOBFWqWflWYoNjEEDWcHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:19.826759Z"},"content_sha256":"aec55a71cf13cb679cb66aaf6ad782c179b4fe32c1ce0fbf2de279226e5c7018","schema_version":"1.0","event_id":"sha256:aec55a71cf13cb679cb66aaf6ad782c179b4fe32c1ce0fbf2de279226e5c7018"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LPTVQO4HTO66DU32SOXRMORE22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexey Chernov, Pavel Dvurechensky","submitted_at":"2016-05-10T12:15:18Z","abstract_excerpt":"In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality constraints. A number of optimization problems in applications can be stated in this form, examples being the entropy-linear programming, the ridge regression, the elastic net, the regularized optimal transport, etc. We extend the Fast Gradient Method applied to the dual problem in order to make it primal-dual so that it allows not only to solve the dual problem, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02970","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":""},"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-05-18T01:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw6/y574HbxeCgqZht0et3/dlUuGOeWY8X5uPCss9WZYzJbzV1rccS1qrlwd3n0O31ZCr2OYSABr8qo1xTE9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:19.827106Z"},"content_sha256":"c395629171ef257c83212aeaebe0f638eff26589a9e2d6c28e68a531ded07153","schema_version":"1.0","event_id":"sha256:c395629171ef257c83212aeaebe0f638eff26589a9e2d6c28e68a531ded07153"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/bundle.json","state_url":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPTVQO4HTO66DU32SOXRMORE22/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-01T16:46:19Z","links":{"resolver":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22","bundle":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/bundle.json","state":"https://pith.science/pith/LPTVQO4HTO66DU32SOXRMORE22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPTVQO4HTO66DU32SOXRMORE22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LPTVQO4HTO66DU32SOXRMORE22","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":"731df4e7c91a29e68c7ee9a14f65e8dab537bbd9df504ae47b870080d66b48d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","title_canon_sha256":"713db4d25fb1a192b6554fe3c2618acd58490fe6b56b27c44018bdbc6cbbff56"},"schema_version":"1.0","source":{"id":"1605.02970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02970","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02970v1","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02970","created_at":"2026-05-18T01:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"LPTVQO4HTO66","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPTVQO4HTO66DU32","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPTVQO4H","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:c395629171ef257c83212aeaebe0f638eff26589a9e2d6c28e68a531ded07153","target":"graph","created_at":"2026-05-18T01:15:08Z","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"},"paper":{"abstract_excerpt":"In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality constraints. A number of optimization problems in applications can be stated in this form, examples being the entropy-linear programming, the ridge regression, the elastic net, the regularized optimal transport, etc. We extend the Fast Gradient Method applied to the dual problem in order to make it primal-dual so that it allows not only to solve the dual problem, b","authors_text":"Alexander Gasnikov, Alexey Chernov, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02970","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:aec55a71cf13cb679cb66aaf6ad782c179b4fe32c1ce0fbf2de279226e5c7018","target":"record","created_at":"2026-05-18T01:15:08Z","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":"731df4e7c91a29e68c7ee9a14f65e8dab537bbd9df504ae47b870080d66b48d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-10T12:15:18Z","title_canon_sha256":"713db4d25fb1a192b6554fe3c2618acd58490fe6b56b27c44018bdbc6cbbff56"},"schema_version":"1.0","source":{"id":"1605.02970","kind":"arxiv","version":1}},"canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be7583b879bbde1d37a93af163a24d6837ff73f976b043b67c0dee031b2b8dd","first_computed_at":"2026-05-18T01:15:08.019414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:08.019414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAXYYiPEswLiScpNTVcA+JorVlrAO54LIrQMk3szFEh+4chGd3yHZCumL3Y9UWy2AJPKSo6hGIpgzFocUxAgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:08.020732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec55a71cf13cb679cb66aaf6ad782c179b4fe32c1ce0fbf2de279226e5c7018","sha256:c395629171ef257c83212aeaebe0f638eff26589a9e2d6c28e68a531ded07153"],"state_sha256":"336f3ec57d6652ddf8d5685ccc53953236042b6868c73be935a1beb56ecfa84f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CU4pB1Ej01F4+zHKxtE+WqH9EH9xyi9+aUCeUiUWocNt3Sm51Ng5J3Dp6I2qhx55lZNzSgnZdfYI3290VzJjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:46:19.829152Z","bundle_sha256":"87eb3bbae6f2c76c43fb33e70de69c3067785914d16d3b2893e10dc0614ead77"}}