{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UZBM75V2IT4EUONUFQQUTWUCC2","short_pith_number":"pith:UZBM75V2","canonical_record":{"source":{"id":"2508.06743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T22:54:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"02c0afe599812f58a19feed444b131134138aa9607f50d3e08d28c7a3d860c25","abstract_canon_sha256":"f28bba6b31d05395e59de3443b54ef3d569944b3441cf098f15182e7e66a451a"},"schema_version":"1.0"},"canonical_sha256":"a642cff6ba44f84a39b42c2149da8216a750e522d6c6203ccef8cdede876bc7b","source":{"kind":"arxiv","id":"2508.06743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06743","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06743v1","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06743","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"UZBM75V2IT4E","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_16","alias_value":"UZBM75V2IT4EUONU","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_8","alias_value":"UZBM75V2","created_at":"2026-07-05T11:51:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UZBM75V2IT4EUONUFQQUTWUCC2","target":"record","payload":{"canonical_record":{"source":{"id":"2508.06743","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T22:54:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"02c0afe599812f58a19feed444b131134138aa9607f50d3e08d28c7a3d860c25","abstract_canon_sha256":"f28bba6b31d05395e59de3443b54ef3d569944b3441cf098f15182e7e66a451a"},"schema_version":"1.0"},"canonical_sha256":"a642cff6ba44f84a39b42c2149da8216a750e522d6c6203ccef8cdede876bc7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:05.944541Z","signature_b64":"c6MtRDycGxnsbA+s1dsPv+X4QY9lETD22jOSHWXHswrPtxFzbBnKrK/1l+/T/JQljS7c4YuarMb7g7nb5eV8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a642cff6ba44f84a39b42c2149da8216a750e522d6c6203ccef8cdede876bc7b","last_reissued_at":"2026-07-05T11:51:05.944054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:05.944054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.06743","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-05T11:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZrNDHBr/nmCg/SXK4qaSJQ73SAZu9b2Tu0IV49kD371QRGjl2Hm66UIDZFYMhBvdBaAp+vpVX3Kws+IzZKpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:02:24.258955Z"},"content_sha256":"33ba550fff0e29f2e21734bf4f8a3502a9cbbf9e34eab05f4f2a64dd55097a03","schema_version":"1.0","event_id":"sha256:33ba550fff0e29f2e21734bf4f8a3502a9cbbf9e34eab05f4f2a64dd55097a03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UZBM75V2IT4EUONUFQQUTWUCC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Schedule-Free Nonconvex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Connor Brown","submitted_at":"2025-08-08T22:54:35Z","abstract_excerpt":"First-order methods underpin most large-scale learning algorithms, yet their classical convergence guarantees hinge on carefully scheduled step-sizes that depend on the total horizon $T$, which is rarely known in advance. The Schedule-Free (SF) method promises optimal performance with hyperparameters that are independent of $T$ by interpolating between Polyak--Ruppert averaging and momentum, but nonconvex analysis of SF has been limited or reliant on strong global assumptions. We introduce a robust Lyapunov framework that, under only $L$-smoothness and lower-boundedness, reduces SF analysis to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06743","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/2508.06743/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-05T11:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOmrPMg7bF9Q42KAlFvPIlqfbLXu7hQ9lT+J1e7yxhwtqJyr5ykAkxKKiecMWYOJ3lqhtgUIz6bDzwyHtFo+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:02:24.259467Z"},"content_sha256":"d34fd12b4ae43436f14ad43b17534a18c0f2d0a9fa8939aa42f7287679b9d6fe","schema_version":"1.0","event_id":"sha256:d34fd12b4ae43436f14ad43b17534a18c0f2d0a9fa8939aa42f7287679b9d6fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZBM75V2IT4EUONUFQQUTWUCC2/bundle.json","state_url":"https://pith.science/pith/UZBM75V2IT4EUONUFQQUTWUCC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZBM75V2IT4EUONUFQQUTWUCC2/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-04T04:02:24Z","links":{"resolver":"https://pith.science/pith/UZBM75V2IT4EUONUFQQUTWUCC2","bundle":"https://pith.science/pith/UZBM75V2IT4EUONUFQQUTWUCC2/bundle.json","state":"https://pith.science/pith/UZBM75V2IT4EUONUFQQUTWUCC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZBM75V2IT4EUONUFQQUTWUCC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UZBM75V2IT4EUONUFQQUTWUCC2","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":"f28bba6b31d05395e59de3443b54ef3d569944b3441cf098f15182e7e66a451a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T22:54:35Z","title_canon_sha256":"02c0afe599812f58a19feed444b131134138aa9607f50d3e08d28c7a3d860c25"},"schema_version":"1.0","source":{"id":"2508.06743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.06743","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"2508.06743v1","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.06743","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"UZBM75V2IT4E","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_16","alias_value":"UZBM75V2IT4EUONU","created_at":"2026-07-05T11:51:05Z"},{"alias_kind":"pith_short_8","alias_value":"UZBM75V2","created_at":"2026-07-05T11:51:05Z"}],"graph_snapshots":[{"event_id":"sha256:d34fd12b4ae43436f14ad43b17534a18c0f2d0a9fa8939aa42f7287679b9d6fe","target":"graph","created_at":"2026-07-05T11:51:05Z","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/2508.06743/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"First-order methods underpin most large-scale learning algorithms, yet their classical convergence guarantees hinge on carefully scheduled step-sizes that depend on the total horizon $T$, which is rarely known in advance. The Schedule-Free (SF) method promises optimal performance with hyperparameters that are independent of $T$ by interpolating between Polyak--Ruppert averaging and momentum, but nonconvex analysis of SF has been limited or reliant on strong global assumptions. We introduce a robust Lyapunov framework that, under only $L$-smoothness and lower-boundedness, reduces SF analysis to","authors_text":"Connor Brown","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T22:54:35Z","title":"Analysis of Schedule-Free Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.06743","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:33ba550fff0e29f2e21734bf4f8a3502a9cbbf9e34eab05f4f2a64dd55097a03","target":"record","created_at":"2026-07-05T11:51:05Z","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":"f28bba6b31d05395e59de3443b54ef3d569944b3441cf098f15182e7e66a451a","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T22:54:35Z","title_canon_sha256":"02c0afe599812f58a19feed444b131134138aa9607f50d3e08d28c7a3d860c25"},"schema_version":"1.0","source":{"id":"2508.06743","kind":"arxiv","version":1}},"canonical_sha256":"a642cff6ba44f84a39b42c2149da8216a750e522d6c6203ccef8cdede876bc7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a642cff6ba44f84a39b42c2149da8216a750e522d6c6203ccef8cdede876bc7b","first_computed_at":"2026-07-05T11:51:05.944054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:05.944054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6MtRDycGxnsbA+s1dsPv+X4QY9lETD22jOSHWXHswrPtxFzbBnKrK/1l+/T/JQljS7c4YuarMb7g7nb5eV8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:05.944541Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.06743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33ba550fff0e29f2e21734bf4f8a3502a9cbbf9e34eab05f4f2a64dd55097a03","sha256:d34fd12b4ae43436f14ad43b17534a18c0f2d0a9fa8939aa42f7287679b9d6fe"],"state_sha256":"7004c0d59d64e125c5897be17de03ab89796916c272e6cca5e598df82ed7b1e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkycrWhTFiDU8teCLFes8kzON8accHY5YwGY91VfCEdTqrWp/brSpSK9Us3fF72bkuoDhGrxkqpr0muPBiPlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:02:24.264641Z","bundle_sha256":"8060c3276c1f52d124e1a77a36b19568ac5f102578091e662e4db7b14256fe0a"}}