{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XMYZ72PZI7G7CJKYJGKSRG72BS","short_pith_number":"pith:XMYZ72PZ","canonical_record":{"source":{"id":"1309.5547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-22T01:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"26c0ebdf1f54e5ab6248dfe61135d8216fdb14a5cc21546e1e2b7adef0a80dc4","abstract_canon_sha256":"62d55f385f6c4e0c71404c2a55ff9388fb9f0944d0f9b47394d9956c604b3088"},"schema_version":"1.0"},"canonical_sha256":"bb319fe9f947cdf125584995289bfa0c933a323cac825d9e997b1371cb8c9866","source":{"kind":"arxiv","id":"1309.5547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5547","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5547v1","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5547","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"XMYZ72PZI7G7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XMYZ72PZI7G7CJKY","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XMYZ72PZ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XMYZ72PZI7G7CJKYJGKSRG72BS","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-22T01:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"26c0ebdf1f54e5ab6248dfe61135d8216fdb14a5cc21546e1e2b7adef0a80dc4","abstract_canon_sha256":"62d55f385f6c4e0c71404c2a55ff9388fb9f0944d0f9b47394d9956c604b3088"},"schema_version":"1.0"},"canonical_sha256":"bb319fe9f947cdf125584995289bfa0c933a323cac825d9e997b1371cb8c9866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:36.021465Z","signature_b64":"cr4MU7cnNVYz+xWVh0NJww22U26QlpvembtOtBcotHV1p2hSH2e1c2i8LtxxXL4kAl8H17BV2n4vzobZ4u77CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb319fe9f947cdf125584995289bfa0c933a323cac825d9e997b1371cb8c9866","last_reissued_at":"2026-05-18T03:12:36.020733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:36.020733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5547","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-18T03:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNEz8gf32s2tZ2oPGDwt46Mfqt4INKUNTXx4tqfy1UKjna0EsCrKE1Qv07fNnAgZ4efg+BICfeTernGqtSlZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:58:29.581199Z"},"content_sha256":"1a7ed7597af3a56651fa4fba5a53752159212f6a82ab82fc5a65d8e5296e0223","schema_version":"1.0","event_id":"sha256:1a7ed7597af3a56651fa4fba5a53752159212f6a82ab82fc5a65d8e5296e0223"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XMYZ72PZI7G7CJKYJGKSRG72BS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bundle-Level Type Methods Uniformly Optimal for Smooth and Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanghui Lan","submitted_at":"2013-09-22T01:35:07Z","abstract_excerpt":"The main goal of this paper is to develop uniformly optimal first-order methods for convex programming (CP). By uniform optimality we mean that the first-order methods themselves do not require the input of any problem parameters, but can still achieve the best possible iteration complexity bounds. By incorporating a multi-step acceleration scheme into the well-known bundle-level method, we develop an accelerated bundle-level (ABL) method, and show that it can achieve the optimal complexity for solving a general class of black-box CP problems without requiring the input of any smoothness infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5547","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-18T03:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+G7rL62JvZD+WEB9Yi1TZKbz9xhAUEBYJLMmTMQ76NxhKOxIOtuG6XcCxfkDsSEFzOeT5ieYI9oH/pljqkoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:58:29.581561Z"},"content_sha256":"a17a8fc2aae2a2c9beb950a0f571af40f4a8f8c54ec963eca09624db9e34b8e7","schema_version":"1.0","event_id":"sha256:a17a8fc2aae2a2c9beb950a0f571af40f4a8f8c54ec963eca09624db9e34b8e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/bundle.json","state_url":"https://pith.science/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/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-12T07:58:29Z","links":{"resolver":"https://pith.science/pith/XMYZ72PZI7G7CJKYJGKSRG72BS","bundle":"https://pith.science/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/bundle.json","state":"https://pith.science/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMYZ72PZI7G7CJKYJGKSRG72BS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XMYZ72PZI7G7CJKYJGKSRG72BS","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":"62d55f385f6c4e0c71404c2a55ff9388fb9f0944d0f9b47394d9956c604b3088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-22T01:35:07Z","title_canon_sha256":"26c0ebdf1f54e5ab6248dfe61135d8216fdb14a5cc21546e1e2b7adef0a80dc4"},"schema_version":"1.0","source":{"id":"1309.5547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5547","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5547v1","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5547","created_at":"2026-05-18T03:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"XMYZ72PZI7G7","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XMYZ72PZI7G7CJKY","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XMYZ72PZ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:a17a8fc2aae2a2c9beb950a0f571af40f4a8f8c54ec963eca09624db9e34b8e7","target":"graph","created_at":"2026-05-18T03:12:36Z","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":"The main goal of this paper is to develop uniformly optimal first-order methods for convex programming (CP). By uniform optimality we mean that the first-order methods themselves do not require the input of any problem parameters, but can still achieve the best possible iteration complexity bounds. By incorporating a multi-step acceleration scheme into the well-known bundle-level method, we develop an accelerated bundle-level (ABL) method, and show that it can achieve the optimal complexity for solving a general class of black-box CP problems without requiring the input of any smoothness infor","authors_text":"Guanghui Lan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-22T01:35:07Z","title":"Bundle-Level Type Methods Uniformly Optimal for Smooth and Nonsmooth Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5547","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:1a7ed7597af3a56651fa4fba5a53752159212f6a82ab82fc5a65d8e5296e0223","target":"record","created_at":"2026-05-18T03:12:36Z","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":"62d55f385f6c4e0c71404c2a55ff9388fb9f0944d0f9b47394d9956c604b3088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-22T01:35:07Z","title_canon_sha256":"26c0ebdf1f54e5ab6248dfe61135d8216fdb14a5cc21546e1e2b7adef0a80dc4"},"schema_version":"1.0","source":{"id":"1309.5547","kind":"arxiv","version":1}},"canonical_sha256":"bb319fe9f947cdf125584995289bfa0c933a323cac825d9e997b1371cb8c9866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb319fe9f947cdf125584995289bfa0c933a323cac825d9e997b1371cb8c9866","first_computed_at":"2026-05-18T03:12:36.020733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:36.020733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cr4MU7cnNVYz+xWVh0NJww22U26QlpvembtOtBcotHV1p2hSH2e1c2i8LtxxXL4kAl8H17BV2n4vzobZ4u77CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:36.021465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a7ed7597af3a56651fa4fba5a53752159212f6a82ab82fc5a65d8e5296e0223","sha256:a17a8fc2aae2a2c9beb950a0f571af40f4a8f8c54ec963eca09624db9e34b8e7"],"state_sha256":"93883fb2c0d852e568c21b604f6dd18710be6a9d853b5b80b8686dfe9f15e186"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixEPrztHh5IuHa3jGP5m9I/lJVXx15I+z0Df7GcLhi2cIwBlt2iancDWlBveHe0qu4wnF79HkjpjFvIVON4oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T07:58:29.583613Z","bundle_sha256":"f663ca84cfe12a0a3997af91236d3ad42d3cc554be1d4de0b61a6d384b1beee7"}}