{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Q24MSG7RAEVA546Z6COERWFWBU","short_pith_number":"pith:Q24MSG7R","canonical_record":{"source":{"id":"2202.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-09T15:15:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bd75ef123af0f0b52ba34a2de5d1aa48305c902ea332cefc6e6efbbd37fe67da","abstract_canon_sha256":"287d55d3036f5047d45e826a60bf62073f24c1e4b8e30b81d453c30c696bf92e"},"schema_version":"1.0"},"canonical_sha256":"86b8c91bf1012a0ef3d9f09c48d8b60d2279b5385e6234f51f24eacb616cb9a6","source":{"kind":"arxiv","id":"2202.04509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.04509","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"2202.04509v1","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.04509","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q24MSG7RAEVA","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_16","alias_value":"Q24MSG7RAEVA546Z","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_8","alias_value":"Q24MSG7R","created_at":"2026-07-05T03:55:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Q24MSG7RAEVA546Z6COERWFWBU","target":"record","payload":{"canonical_record":{"source":{"id":"2202.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-09T15:15:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bd75ef123af0f0b52ba34a2de5d1aa48305c902ea332cefc6e6efbbd37fe67da","abstract_canon_sha256":"287d55d3036f5047d45e826a60bf62073f24c1e4b8e30b81d453c30c696bf92e"},"schema_version":"1.0"},"canonical_sha256":"86b8c91bf1012a0ef3d9f09c48d8b60d2279b5385e6234f51f24eacb616cb9a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:38.191989Z","signature_b64":"zMFH8w/yfDZ+cxHwr50+MJYAQBRWYUN4hc8X+J0F/+uhxJJzC34nx7zt7oYCj/CySEm1TA/A5mYfo0cqmw3yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86b8c91bf1012a0ef3d9f09c48d8b60d2279b5385e6234f51f24eacb616cb9a6","last_reissued_at":"2026-07-05T03:55:38.191601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:38.191601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.04509","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-05T03:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmGHpVRhBUlUIaVeHX1aM282M9X44K/LQ9WIlv1cMsRT9M4fwadsJ2uDwntK7xspQzjplerArqx+nnNqoEtgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:32:55.489722Z"},"content_sha256":"5a0cc065d500be241afe91133920fc1e3116d3e229718f5e38e1b7a454c331cf","schema_version":"1.0","event_id":"sha256:5a0cc065d500be241afe91133920fc1e3116d3e229718f5e38e1b7a454c331cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Q24MSG7RAEVA546Z6COERWFWBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Giulio Biroli, Maria Refinetti, St\\'ephane d'Ascoli","submitted_at":"2022-02-09T15:15:39Z","abstract_excerpt":"Learning rate schedules are ubiquitously used to speed up and improve optimisation. Many different policies have been introduced on an empirical basis, and theoretical analyses have been developed for convex settings. However, in many realistic problems the loss-landscape is high-dimensional and non convex -- a case for which results are scarce. In this paper we present a first analytical study of the role of learning rate scheduling in this setting, focusing on Langevin optimization with a learning rate decaying as $\\eta(t)=t^{-\\beta}$. We begin by considering models where the loss is a Gauss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.04509","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/2202.04509/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-05T03:55:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOlDY8Y+8d8XyWaBr9USJBzmLWpAPz/eWm/Ti2hAj4dzZG/w0ncL5HFazB4cGxmGNKvoM0CtqDvRghHt6xCKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:32:55.490225Z"},"content_sha256":"502d9673b01e398f39befd943a5de31ae48ec1d0a90a49aff90a7277b2409d70","schema_version":"1.0","event_id":"sha256:502d9673b01e398f39befd943a5de31ae48ec1d0a90a49aff90a7277b2409d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q24MSG7RAEVA546Z6COERWFWBU/bundle.json","state_url":"https://pith.science/pith/Q24MSG7RAEVA546Z6COERWFWBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q24MSG7RAEVA546Z6COERWFWBU/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-03T16:32:55Z","links":{"resolver":"https://pith.science/pith/Q24MSG7RAEVA546Z6COERWFWBU","bundle":"https://pith.science/pith/Q24MSG7RAEVA546Z6COERWFWBU/bundle.json","state":"https://pith.science/pith/Q24MSG7RAEVA546Z6COERWFWBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q24MSG7RAEVA546Z6COERWFWBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Q24MSG7RAEVA546Z6COERWFWBU","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":"287d55d3036f5047d45e826a60bf62073f24c1e4b8e30b81d453c30c696bf92e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-09T15:15:39Z","title_canon_sha256":"bd75ef123af0f0b52ba34a2de5d1aa48305c902ea332cefc6e6efbbd37fe67da"},"schema_version":"1.0","source":{"id":"2202.04509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.04509","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"2202.04509v1","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.04509","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q24MSG7RAEVA","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_16","alias_value":"Q24MSG7RAEVA546Z","created_at":"2026-07-05T03:55:38Z"},{"alias_kind":"pith_short_8","alias_value":"Q24MSG7R","created_at":"2026-07-05T03:55:38Z"}],"graph_snapshots":[{"event_id":"sha256:502d9673b01e398f39befd943a5de31ae48ec1d0a90a49aff90a7277b2409d70","target":"graph","created_at":"2026-07-05T03:55:38Z","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/2202.04509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning rate schedules are ubiquitously used to speed up and improve optimisation. Many different policies have been introduced on an empirical basis, and theoretical analyses have been developed for convex settings. However, in many realistic problems the loss-landscape is high-dimensional and non convex -- a case for which results are scarce. In this paper we present a first analytical study of the role of learning rate scheduling in this setting, focusing on Langevin optimization with a learning rate decaying as $\\eta(t)=t^{-\\beta}$. We begin by considering models where the loss is a Gauss","authors_text":"Giulio Biroli, Maria Refinetti, St\\'ephane d'Ascoli","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-09T15:15:39Z","title":"Optimal learning rate schedules in high-dimensional non-convex optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.04509","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:5a0cc065d500be241afe91133920fc1e3116d3e229718f5e38e1b7a454c331cf","target":"record","created_at":"2026-07-05T03:55:38Z","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":"287d55d3036f5047d45e826a60bf62073f24c1e4b8e30b81d453c30c696bf92e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-09T15:15:39Z","title_canon_sha256":"bd75ef123af0f0b52ba34a2de5d1aa48305c902ea332cefc6e6efbbd37fe67da"},"schema_version":"1.0","source":{"id":"2202.04509","kind":"arxiv","version":1}},"canonical_sha256":"86b8c91bf1012a0ef3d9f09c48d8b60d2279b5385e6234f51f24eacb616cb9a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86b8c91bf1012a0ef3d9f09c48d8b60d2279b5385e6234f51f24eacb616cb9a6","first_computed_at":"2026-07-05T03:55:38.191601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:55:38.191601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMFH8w/yfDZ+cxHwr50+MJYAQBRWYUN4hc8X+J0F/+uhxJJzC34nx7zt7oYCj/CySEm1TA/A5mYfo0cqmw3yDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:55:38.191989Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.04509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a0cc065d500be241afe91133920fc1e3116d3e229718f5e38e1b7a454c331cf","sha256:502d9673b01e398f39befd943a5de31ae48ec1d0a90a49aff90a7277b2409d70"],"state_sha256":"9573fe7bc75d9d8574349ae35c800a6833f8b66100ac745e77c98dd9c28b8881"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF8WaygguuuEPBJChEA6CBxy7b/757icoKOayU9M8YIOP0wS/QEwFzKa01NE302/OGbY0+Gr42Vk8btowg5XAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:32:55.495122Z","bundle_sha256":"05885b7dfa33b6b504cb7144fe6b9a34553e6ebe98d9ca2401028b476b8d70cc"}}