{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:74X3SYVXTGXXOC333VUBBA7M25","short_pith_number":"pith:74X3SYVX","canonical_record":{"source":{"id":"2607.11878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T17:57:45Z","cross_cats_sorted":[],"title_canon_sha256":"5b2b9e6e8553bd5fb6d98f4c0b040b25938ee258be5e0f133c9fd2323d09370b","abstract_canon_sha256":"6d0338f2a69dec486bd8d4c3a3f382f1554161cf67fe18bf6ed139fb430acd79"},"schema_version":"1.0"},"canonical_sha256":"ff2fb962b799af770b7bdd681083ecd77be5028ff9454e1dca486a8c0511734e","source":{"kind":"arxiv","id":"2607.11878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11878","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11878v1","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11878","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"74X3SYVXTGXX","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_16","alias_value":"74X3SYVXTGXXOC33","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_8","alias_value":"74X3SYVX","created_at":"2026-07-14T02:22:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:74X3SYVXTGXXOC333VUBBA7M25","target":"record","payload":{"canonical_record":{"source":{"id":"2607.11878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T17:57:45Z","cross_cats_sorted":[],"title_canon_sha256":"5b2b9e6e8553bd5fb6d98f4c0b040b25938ee258be5e0f133c9fd2323d09370b","abstract_canon_sha256":"6d0338f2a69dec486bd8d4c3a3f382f1554161cf67fe18bf6ed139fb430acd79"},"schema_version":"1.0"},"canonical_sha256":"ff2fb962b799af770b7bdd681083ecd77be5028ff9454e1dca486a8c0511734e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:22:37.620512Z","signature_b64":"R1R9zSlvf2N5Ap6CPd6mTzQQ8lI/Qr8yOQPjEwz52PPlh3wAithlhpHeml6cYSZCKyQTQd3aHgCoeDNYqjPODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2fb962b799af770b7bdd681083ecd77be5028ff9454e1dca486a8c0511734e","last_reissued_at":"2026-07-14T02:22:37.619736Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:22:37.619736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.11878","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-07-14T02:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GPSVnteLppzhnOeVTXgtDigXwc5gWfEWE5cWdtXivftXXuKfjNMcQ/ZiiGG4GGAHH8sXOGDMrJPHsNXQOV5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:33:55.967520Z"},"content_sha256":"f6d08fbd7640338fb10bce62ece6fe8c9bfd879232b25d19542102142520f368","schema_version":"1.0","event_id":"sha256:f6d08fbd7640338fb10bce62ece6fe8c9bfd879232b25d19542102142520f368"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:74X3SYVXTGXXOC333VUBBA7M25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ke Tang, Liwei Jiang, Zhe Zhang","submitted_at":"2026-07-13T17:57:45Z","abstract_excerpt":"We study deterministic first-order minimization of a convex function without prior knowledge of the objective's growth, smoothness regime, or associated parameters. We develop anytime, parameter-free bundle-level methods that adapt simultaneously to these unknown properties and attain best-known oracle complexities. For nonsmooth Lipschitz objectives satisfying quadratic growth, the proposed bundle-level W-certificate method (BLW) achieves the optimal complexity without requiring the growth modulus or target accuracy as input. We then introduce an accelerated variant, A-BLW. Without knowing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11878","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11878/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-14T02:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oge/BfRBs45Xs4ZWl37JVkzagbS6DWQR6BANLSoL96Ibbzr4PQQlPuyLNqD/tg9uYt5x/BSD5DUsBibKRQOnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:33:55.968016Z"},"content_sha256":"cf8eb77894ad88375f44173393ac2bb6ccd6883089a5395a1733917366550768","schema_version":"1.0","event_id":"sha256:cf8eb77894ad88375f44173393ac2bb6ccd6883089a5395a1733917366550768"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74X3SYVXTGXXOC333VUBBA7M25/bundle.json","state_url":"https://pith.science/pith/74X3SYVXTGXXOC333VUBBA7M25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74X3SYVXTGXXOC333VUBBA7M25/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-08T12:33:55Z","links":{"resolver":"https://pith.science/pith/74X3SYVXTGXXOC333VUBBA7M25","bundle":"https://pith.science/pith/74X3SYVXTGXXOC333VUBBA7M25/bundle.json","state":"https://pith.science/pith/74X3SYVXTGXXOC333VUBBA7M25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74X3SYVXTGXXOC333VUBBA7M25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:74X3SYVXTGXXOC333VUBBA7M25","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":"6d0338f2a69dec486bd8d4c3a3f382f1554161cf67fe18bf6ed139fb430acd79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T17:57:45Z","title_canon_sha256":"5b2b9e6e8553bd5fb6d98f4c0b040b25938ee258be5e0f133c9fd2323d09370b"},"schema_version":"1.0","source":{"id":"2607.11878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11878","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11878v1","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11878","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"74X3SYVXTGXX","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_16","alias_value":"74X3SYVXTGXXOC33","created_at":"2026-07-14T02:22:37Z"},{"alias_kind":"pith_short_8","alias_value":"74X3SYVX","created_at":"2026-07-14T02:22:37Z"}],"graph_snapshots":[{"event_id":"sha256:cf8eb77894ad88375f44173393ac2bb6ccd6883089a5395a1733917366550768","target":"graph","created_at":"2026-07-14T02:22:37Z","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/2607.11878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study deterministic first-order minimization of a convex function without prior knowledge of the objective's growth, smoothness regime, or associated parameters. We develop anytime, parameter-free bundle-level methods that adapt simultaneously to these unknown properties and attain best-known oracle complexities. For nonsmooth Lipschitz objectives satisfying quadratic growth, the proposed bundle-level W-certificate method (BLW) achieves the optimal complexity without requiring the growth modulus or target accuracy as input. We then introduce an accelerated variant, A-BLW. Without knowing th","authors_text":"Ke Tang, Liwei Jiang, Zhe Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T17:57:45Z","title":"Optimal Parameter-Free First-Order Methods for Convex Optimization with Unknown Growth and Smoothness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11878","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:f6d08fbd7640338fb10bce62ece6fe8c9bfd879232b25d19542102142520f368","target":"record","created_at":"2026-07-14T02:22:37Z","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":"6d0338f2a69dec486bd8d4c3a3f382f1554161cf67fe18bf6ed139fb430acd79","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-13T17:57:45Z","title_canon_sha256":"5b2b9e6e8553bd5fb6d98f4c0b040b25938ee258be5e0f133c9fd2323d09370b"},"schema_version":"1.0","source":{"id":"2607.11878","kind":"arxiv","version":1}},"canonical_sha256":"ff2fb962b799af770b7bdd681083ecd77be5028ff9454e1dca486a8c0511734e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff2fb962b799af770b7bdd681083ecd77be5028ff9454e1dca486a8c0511734e","first_computed_at":"2026-07-14T02:22:37.619736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T02:22:37.619736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R1R9zSlvf2N5Ap6CPd6mTzQQ8lI/Qr8yOQPjEwz52PPlh3wAithlhpHeml6cYSZCKyQTQd3aHgCoeDNYqjPODA==","signature_status":"signed_v1","signed_at":"2026-07-14T02:22:37.620512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6d08fbd7640338fb10bce62ece6fe8c9bfd879232b25d19542102142520f368","sha256:cf8eb77894ad88375f44173393ac2bb6ccd6883089a5395a1733917366550768"],"state_sha256":"d86313da2f185b18e942e76a74059f5ff351deb282327e82f898f346f0b72b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"be4+e8LUNVQjfN+l3Eu8scyGFM/4Bwo2kYidzlGuTTpeMQQqSgygijyBzc5MirFxJ3cQLgCAV4b6wGOtw+XBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:33:55.972893Z","bundle_sha256":"95aa409ad4c37a9419c815adebe9c7ef6bac138a81c5985f8e353e0dd0da102a"}}