{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CGODGLY7OB2OHTEAZQGZU7K3C4","short_pith_number":"pith:CGODGLY7","canonical_record":{"source":{"id":"1210.6853","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-25T14:25:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"95f5ebf12c1d395dac0a4db7e430ab7ea1f611f35e33657c3cf30548f9851219","abstract_canon_sha256":"e4bcd97dbaf5eee9e7c0b2be51ea42177d33cd7f0a54d9040263b1ef64e46b47"},"schema_version":"1.0"},"canonical_sha256":"119c332f1f7074e3cc80cc0d9a7d5b171c9338a3e8e343fc5cb97b9d2c7db910","source":{"kind":"arxiv","id":"1210.6853","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6853","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6853v4","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6853","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"CGODGLY7OB2O","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGODGLY7OB2OHTEA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGODGLY7","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CGODGLY7OB2OHTEAZQGZU7K3C4","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6853","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-25T14:25:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"95f5ebf12c1d395dac0a4db7e430ab7ea1f611f35e33657c3cf30548f9851219","abstract_canon_sha256":"e4bcd97dbaf5eee9e7c0b2be51ea42177d33cd7f0a54d9040263b1ef64e46b47"},"schema_version":"1.0"},"canonical_sha256":"119c332f1f7074e3cc80cc0d9a7d5b171c9338a3e8e343fc5cb97b9d2c7db910","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.116116Z","signature_b64":"jT9IRFvgLyqUaqgjn8lh/RGg9/y1U7TP8s18BWqXvLoBJBpGYHGC+yFLhuc0Rta8DRUlj1QIoI3TicXN+MRsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119c332f1f7074e3cc80cc0d9a7d5b171c9338a3e8e343fc5cb97b9d2c7db910","last_reissued_at":"2026-05-18T02:51:24.115617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.115617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6853","source_version":4,"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-18T02:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgcCNP2QNwAxW92atd3OS1FRxVhZhp9bjY70t8aqdXGYnlhP3gkeun761wdYfUujwhM1zlL2ks3uzDEd3puiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:10.644409Z"},"content_sha256":"5f47c85a3e45d5996f4dc2c1c8129322b8e5821e7df71aa0c076f3cec7915328","schema_version":"1.0","event_id":"sha256:5f47c85a3e45d5996f4dc2c1c8129322b8e5821e7df71aa0c076f3cec7915328"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CGODGLY7OB2OHTEAZQGZU7K3C4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On solving large scale polynomial convex problems by randomized first-order algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aharon Ben-Tal, Arkadi Nemirovski","submitted_at":"2012-10-25T14:25:39Z","abstract_excerpt":"One of the most attractive recent approaches to processing well-structured large-scale convex optimization problems is based on smooth convex-concave saddle point reformu-lation of the problem of interest and solving the resulting problem by a fast First Order saddle point method utilizing smoothness of the saddle point cost function. In this paper, we demonstrate that when the saddle point cost function is polynomial, the precise gra-dients of the cost function required by deterministic First Order saddle point algorithms and becoming prohibitively computationally expensive in the extremely l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6853","kind":"arxiv","version":4},"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-18T02:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJQnTpEeoVLmne0K8Z9eMv4qsYDuiAHU7moblu6uUB15t0RPDRma3jCVLhMlWE8nTBFbAAVe8gbJrUgluLLtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:10.645173Z"},"content_sha256":"d0ca1bd8f06c5471e787c2f350c15143a64e32e6423ec312c202b93be0e56861","schema_version":"1.0","event_id":"sha256:d0ca1bd8f06c5471e787c2f350c15143a64e32e6423ec312c202b93be0e56861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/bundle.json","state_url":"https://pith.science/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/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-05-31T07:31:10Z","links":{"resolver":"https://pith.science/pith/CGODGLY7OB2OHTEAZQGZU7K3C4","bundle":"https://pith.science/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/bundle.json","state":"https://pith.science/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGODGLY7OB2OHTEAZQGZU7K3C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CGODGLY7OB2OHTEAZQGZU7K3C4","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":"e4bcd97dbaf5eee9e7c0b2be51ea42177d33cd7f0a54d9040263b1ef64e46b47","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-25T14:25:39Z","title_canon_sha256":"95f5ebf12c1d395dac0a4db7e430ab7ea1f611f35e33657c3cf30548f9851219"},"schema_version":"1.0","source":{"id":"1210.6853","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6853","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6853v4","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6853","created_at":"2026-05-18T02:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"CGODGLY7OB2O","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CGODGLY7OB2OHTEA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CGODGLY7","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:d0ca1bd8f06c5471e787c2f350c15143a64e32e6423ec312c202b93be0e56861","target":"graph","created_at":"2026-05-18T02:51:24Z","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":"One of the most attractive recent approaches to processing well-structured large-scale convex optimization problems is based on smooth convex-concave saddle point reformu-lation of the problem of interest and solving the resulting problem by a fast First Order saddle point method utilizing smoothness of the saddle point cost function. In this paper, we demonstrate that when the saddle point cost function is polynomial, the precise gra-dients of the cost function required by deterministic First Order saddle point algorithms and becoming prohibitively computationally expensive in the extremely l","authors_text":"Aharon Ben-Tal, Arkadi Nemirovski","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-25T14:25:39Z","title":"On solving large scale polynomial convex problems by randomized first-order algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6853","kind":"arxiv","version":4},"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:5f47c85a3e45d5996f4dc2c1c8129322b8e5821e7df71aa0c076f3cec7915328","target":"record","created_at":"2026-05-18T02:51:24Z","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":"e4bcd97dbaf5eee9e7c0b2be51ea42177d33cd7f0a54d9040263b1ef64e46b47","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-25T14:25:39Z","title_canon_sha256":"95f5ebf12c1d395dac0a4db7e430ab7ea1f611f35e33657c3cf30548f9851219"},"schema_version":"1.0","source":{"id":"1210.6853","kind":"arxiv","version":4}},"canonical_sha256":"119c332f1f7074e3cc80cc0d9a7d5b171c9338a3e8e343fc5cb97b9d2c7db910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119c332f1f7074e3cc80cc0d9a7d5b171c9338a3e8e343fc5cb97b9d2c7db910","first_computed_at":"2026-05-18T02:51:24.115617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:24.115617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jT9IRFvgLyqUaqgjn8lh/RGg9/y1U7TP8s18BWqXvLoBJBpGYHGC+yFLhuc0Rta8DRUlj1QIoI3TicXN+MRsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:24.116116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6853","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f47c85a3e45d5996f4dc2c1c8129322b8e5821e7df71aa0c076f3cec7915328","sha256:d0ca1bd8f06c5471e787c2f350c15143a64e32e6423ec312c202b93be0e56861"],"state_sha256":"ecc608232bd5cf49b1dbf0013e0991b9e660e86df597616be502ce822d1e2bc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bP1vr2ModjVIBhYpVs/eI1nhYsBviS8B8MJ8cDz76zWeCr0CukYS9gvSNZcq5AJGBRsmmjBBRuDYeULkK8l0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:31:10.648152Z","bundle_sha256":"72ee13cf53427b9799594e405cdb517a7d5dbd850bb1e4c48d8eb5342f442df0"}}