{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XR5EJBNPKIF4OGHOK6L6J7RFOL","short_pith_number":"pith:XR5EJBNP","canonical_record":{"source":{"id":"2606.22669","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-21T21:05:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"724f7a7647e782f3bb098596262cb0c11a3e157036903e5454cc4b49762e4863","abstract_canon_sha256":"c57f59ca0df4fb43f5c06a9a1253b65776579dea9c38b913a6a2789952dfe329"},"schema_version":"1.0"},"canonical_sha256":"bc7a4485af520bc718ee5797e4fe2572fcfd528f0c87d65c9218f592db68c6bb","source":{"kind":"arxiv","id":"2606.22669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22669","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22669v1","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22669","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"XR5EJBNPKIF4","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"XR5EJBNPKIF4OGHO","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"XR5EJBNP","created_at":"2026-06-23T02:13:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XR5EJBNPKIF4OGHOK6L6J7RFOL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.22669","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-21T21:05:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"724f7a7647e782f3bb098596262cb0c11a3e157036903e5454cc4b49762e4863","abstract_canon_sha256":"c57f59ca0df4fb43f5c06a9a1253b65776579dea9c38b913a6a2789952dfe329"},"schema_version":"1.0"},"canonical_sha256":"bc7a4485af520bc718ee5797e4fe2572fcfd528f0c87d65c9218f592db68c6bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:44.366710Z","signature_b64":"VU0Sm8si5qgqIZgsXg5bC2zn4ZEghSF/KQ5ei3+B+XoTWooEh/DbVh0WOk79amRjk6Am83AIuS292fC7QwjXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7a4485af520bc718ee5797e4fe2572fcfd528f0c87d65c9218f592db68c6bb","last_reissued_at":"2026-06-23T02:13:44.366305Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:44.366305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.22669","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-06-23T02:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQRreYZc9w+sdIwIc8hbmvRDjzM7Sz+2c9AdVhckMpFtJq/qccJr4aA80MTvxZaa3SDUZCEfz1ffKRQ6L8K8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:47:23.759828Z"},"content_sha256":"7f0f7c8b225923ade50d10272f627a8d41a89d0c659236b479f1dc34f92ba650","schema_version":"1.0","event_id":"sha256:7f0f7c8b225923ade50d10272f627a8d41a89d0c659236b479f1dc34f92ba650"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XR5EJBNPKIF4OGHOK6L6J7RFOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clipping the Price of Adaptivity at the Tail","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Itai Kreisler, Oliver Hinder, Yair Carmon","submitted_at":"2026-06-21T21:05:59Z","abstract_excerpt":"Adaptive stochastic convex optimization (SCO) methods face a fundamental ``price of adaptivity'' barrier: under the standard set of assumptions, they cannot efficiently adapt to large uncertainty in both the initial distance to optimality and the Lipschitz constant. We circumvent this barrier by requiring a small amount of additional structure common to many learning problems. Specifically, we assume that the objective decomposes into a model and a loss function, enabling us to intervene by modifying the model's output before it passes to the loss function. Under this assumption, we design a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22669","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/2606.22669/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-06-23T02:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SjARt/MiWueA7vrGpwIYW/yn841E1BIobUSOoaXloP0f4Fc/GoJ/8IMQkAxLpAZq+Ftmqf3nBbXD+wPUDhjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:47:23.760339Z"},"content_sha256":"24f49bec05d3a5e1574da06aed0e9d7a2db91dc91b1b3ac1cc55fe45f90dd963","schema_version":"1.0","event_id":"sha256:24f49bec05d3a5e1574da06aed0e9d7a2db91dc91b1b3ac1cc55fe45f90dd963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/bundle.json","state_url":"https://pith.science/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/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-06T22:47:23Z","links":{"resolver":"https://pith.science/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL","bundle":"https://pith.science/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/bundle.json","state":"https://pith.science/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XR5EJBNPKIF4OGHOK6L6J7RFOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XR5EJBNPKIF4OGHOK6L6J7RFOL","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":"c57f59ca0df4fb43f5c06a9a1253b65776579dea9c38b913a6a2789952dfe329","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-21T21:05:59Z","title_canon_sha256":"724f7a7647e782f3bb098596262cb0c11a3e157036903e5454cc4b49762e4863"},"schema_version":"1.0","source":{"id":"2606.22669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22669","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22669v1","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22669","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"XR5EJBNPKIF4","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"XR5EJBNPKIF4OGHO","created_at":"2026-06-23T02:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"XR5EJBNP","created_at":"2026-06-23T02:13:44Z"}],"graph_snapshots":[{"event_id":"sha256:24f49bec05d3a5e1574da06aed0e9d7a2db91dc91b1b3ac1cc55fe45f90dd963","target":"graph","created_at":"2026-06-23T02:13:44Z","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/2606.22669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adaptive stochastic convex optimization (SCO) methods face a fundamental ``price of adaptivity'' barrier: under the standard set of assumptions, they cannot efficiently adapt to large uncertainty in both the initial distance to optimality and the Lipschitz constant. We circumvent this barrier by requiring a small amount of additional structure common to many learning problems. Specifically, we assume that the objective decomposes into a model and a loss function, enabling us to intervene by modifying the model's output before it passes to the loss function. Under this assumption, we design a m","authors_text":"Itai Kreisler, Oliver Hinder, Yair Carmon","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-21T21:05:59Z","title":"Clipping the Price of Adaptivity at the Tail"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22669","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:7f0f7c8b225923ade50d10272f627a8d41a89d0c659236b479f1dc34f92ba650","target":"record","created_at":"2026-06-23T02:13:44Z","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":"c57f59ca0df4fb43f5c06a9a1253b65776579dea9c38b913a6a2789952dfe329","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-21T21:05:59Z","title_canon_sha256":"724f7a7647e782f3bb098596262cb0c11a3e157036903e5454cc4b49762e4863"},"schema_version":"1.0","source":{"id":"2606.22669","kind":"arxiv","version":1}},"canonical_sha256":"bc7a4485af520bc718ee5797e4fe2572fcfd528f0c87d65c9218f592db68c6bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc7a4485af520bc718ee5797e4fe2572fcfd528f0c87d65c9218f592db68c6bb","first_computed_at":"2026-06-23T02:13:44.366305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:44.366305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VU0Sm8si5qgqIZgsXg5bC2zn4ZEghSF/KQ5ei3+B+XoTWooEh/DbVh0WOk79amRjk6Am83AIuS292fC7QwjXCQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:44.366710Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f0f7c8b225923ade50d10272f627a8d41a89d0c659236b479f1dc34f92ba650","sha256:24f49bec05d3a5e1574da06aed0e9d7a2db91dc91b1b3ac1cc55fe45f90dd963"],"state_sha256":"a13a875750146fe38847410ce80c56a3c7f78f3a624584228e533d3f83a31a68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EhTAOVgblEGV8MxNGCLo9EE20PLU8kU8b568P1Yh+VIjnMHNwAZ6L79ZzxoOMCMubbGGOXRFUjKHYFKZ6gFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:47:23.764031Z","bundle_sha256":"c212bfd785f806e9d896e9b3b9b1f6d0e37030f33f3c945b6261b2c02f48ef7a"}}