{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:B33AOCETDTBRF2TWKG37G5ABZR","short_pith_number":"pith:B33AOCET","canonical_record":{"source":{"id":"2101.00935","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-04T13:03:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9d244a8585c17e6b53c07790e0114bdc949cc2239022250a3239abca4d563ea","abstract_canon_sha256":"a5c15f5c0958a2432ed10c9d931dc5a8d17f4fa713ccbee0a1d5268620d9027a"},"schema_version":"1.0"},"canonical_sha256":"0ef60708931cc312ea7651b7f37401cc609d2ef44864bb3efe83974a5ee81a14","source":{"kind":"arxiv","id":"2101.00935","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00935","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00935v2","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00935","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"B33AOCETDTBR","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_16","alias_value":"B33AOCETDTBRF2TW","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_8","alias_value":"B33AOCET","created_at":"2026-07-05T02:04:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:B33AOCETDTBRF2TWKG37G5ABZR","target":"record","payload":{"canonical_record":{"source":{"id":"2101.00935","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-04T13:03:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9d244a8585c17e6b53c07790e0114bdc949cc2239022250a3239abca4d563ea","abstract_canon_sha256":"a5c15f5c0958a2432ed10c9d931dc5a8d17f4fa713ccbee0a1d5268620d9027a"},"schema_version":"1.0"},"canonical_sha256":"0ef60708931cc312ea7651b7f37401cc609d2ef44864bb3efe83974a5ee81a14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:59.598684Z","signature_b64":"Iv2rQggXEdtQVA5NFn/mBhbDj8CQAJmFpth5LOEFX8lNChUnIkxEIYh/qlalDKha5inkBFWRioav04F081chCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ef60708931cc312ea7651b7f37401cc609d2ef44864bb3efe83974a5ee81a14","last_reissued_at":"2026-07-05T02:04:59.598324Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:59.598324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.00935","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-05T02:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBUch4KTF/9sMBvCr24WNl4eB+R+74wOP//uYKNYN8cgV/gvK5YKN/gVQ/JKVXJJ+vCc9T5g9pqbphHfsKL/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:52:04.165323Z"},"content_sha256":"f1e3dc4c6009d0273d92395ed9b93e32541883264c27ec6216f352e9854f3ff6","schema_version":"1.0","event_id":"sha256:f1e3dc4c6009d0273d92395ed9b93e32541883264c27ec6216f352e9854f3ff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:B33AOCETDTBRF2TWKG37G5ABZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Methods for Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Mathias Staudigl, Pavel Dvurechensky, Shimrit Shtern","submitted_at":"2021-01-04T13:03:38Z","abstract_excerpt":"First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various applications, including most importantly machine learning, signal processing, imaging and control theory. First-order methods have the potential to provide low accuracy solutions at low computational complexity which makes them an attractive set of tools in large-scale optimization problems. In this survey we cover a number of key developments"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00935","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/2101.00935/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-05T02:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXGo2jHzV4yBX1g124oCD3w6Ya/f+NDQ+VdzhwEW+TELBRJkv/ubMpyiTy9Etku4iuYFUg8VNcuO/HVjtEQ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:52:04.165821Z"},"content_sha256":"c6dbbb809b9d81b2d3cb8d6e37742601eabdb81ea8a78967d27926050129f78e","schema_version":"1.0","event_id":"sha256:c6dbbb809b9d81b2d3cb8d6e37742601eabdb81ea8a78967d27926050129f78e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B33AOCETDTBRF2TWKG37G5ABZR/bundle.json","state_url":"https://pith.science/pith/B33AOCETDTBRF2TWKG37G5ABZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B33AOCETDTBRF2TWKG37G5ABZR/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-03T20:52:04Z","links":{"resolver":"https://pith.science/pith/B33AOCETDTBRF2TWKG37G5ABZR","bundle":"https://pith.science/pith/B33AOCETDTBRF2TWKG37G5ABZR/bundle.json","state":"https://pith.science/pith/B33AOCETDTBRF2TWKG37G5ABZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B33AOCETDTBRF2TWKG37G5ABZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:B33AOCETDTBRF2TWKG37G5ABZR","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":"a5c15f5c0958a2432ed10c9d931dc5a8d17f4fa713ccbee0a1d5268620d9027a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-04T13:03:38Z","title_canon_sha256":"d9d244a8585c17e6b53c07790e0114bdc949cc2239022250a3239abca4d563ea"},"schema_version":"1.0","source":{"id":"2101.00935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00935","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00935v2","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00935","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"B33AOCETDTBR","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_16","alias_value":"B33AOCETDTBRF2TW","created_at":"2026-07-05T02:04:59Z"},{"alias_kind":"pith_short_8","alias_value":"B33AOCET","created_at":"2026-07-05T02:04:59Z"}],"graph_snapshots":[{"event_id":"sha256:c6dbbb809b9d81b2d3cb8d6e37742601eabdb81ea8a78967d27926050129f78e","target":"graph","created_at":"2026-07-05T02:04:59Z","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/2101.00935/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various applications, including most importantly machine learning, signal processing, imaging and control theory. First-order methods have the potential to provide low accuracy solutions at low computational complexity which makes them an attractive set of tools in large-scale optimization problems. In this survey we cover a number of key developments","authors_text":"Mathias Staudigl, Pavel Dvurechensky, Shimrit Shtern","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-04T13:03:38Z","title":"First-Order Methods for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00935","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:f1e3dc4c6009d0273d92395ed9b93e32541883264c27ec6216f352e9854f3ff6","target":"record","created_at":"2026-07-05T02:04:59Z","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":"a5c15f5c0958a2432ed10c9d931dc5a8d17f4fa713ccbee0a1d5268620d9027a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-04T13:03:38Z","title_canon_sha256":"d9d244a8585c17e6b53c07790e0114bdc949cc2239022250a3239abca4d563ea"},"schema_version":"1.0","source":{"id":"2101.00935","kind":"arxiv","version":2}},"canonical_sha256":"0ef60708931cc312ea7651b7f37401cc609d2ef44864bb3efe83974a5ee81a14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ef60708931cc312ea7651b7f37401cc609d2ef44864bb3efe83974a5ee81a14","first_computed_at":"2026-07-05T02:04:59.598324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:59.598324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iv2rQggXEdtQVA5NFn/mBhbDj8CQAJmFpth5LOEFX8lNChUnIkxEIYh/qlalDKha5inkBFWRioav04F081chCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:59.598684Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.00935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1e3dc4c6009d0273d92395ed9b93e32541883264c27ec6216f352e9854f3ff6","sha256:c6dbbb809b9d81b2d3cb8d6e37742601eabdb81ea8a78967d27926050129f78e"],"state_sha256":"47196d4b3fe342bb2334ecb60721762f207dd7ad9bff742eb676c6ae38ebe5c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwavgSo9DOCmE5Nu50InClPvKGp2c339Mk3X6t24i9HQdkYj/PD9XFXl8gADHLtfyD8Z4J4YInvK3Lzjdg6QAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:52:04.169049Z","bundle_sha256":"70513395f7c69282cc7bacde70d546a7c52ca0668da630790253972156f42147"}}