{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DUV7722UTW7RN3O27BFVATKKBI","short_pith_number":"pith:DUV7722U","canonical_record":{"source":{"id":"1509.05760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-18T19:49:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d341db43eb7cb8b1e6c9bbf508b68169927124201b135791d76b3f723a570ab0","abstract_canon_sha256":"81a8c0b354182895cfa9556c907c244e375462ea4182795885b11e617fbc1d83"},"schema_version":"1.0"},"canonical_sha256":"1d2bffeb549dbf16eddaf84b504d4a0a06c130e675f47b98df0259bc69dabf69","source":{"kind":"arxiv","id":"1509.05760","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05760","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05760v3","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05760","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"DUV7722UTW7R","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUV7722UTW7RN3O2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUV7722U","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DUV7722UTW7RN3O27BFVATKKBI","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-18T19:49:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d341db43eb7cb8b1e6c9bbf508b68169927124201b135791d76b3f723a570ab0","abstract_canon_sha256":"81a8c0b354182895cfa9556c907c244e375462ea4182795885b11e617fbc1d83"},"schema_version":"1.0"},"canonical_sha256":"1d2bffeb549dbf16eddaf84b504d4a0a06c130e675f47b98df0259bc69dabf69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:17.581082Z","signature_b64":"X5SukgpBjBwCteET8acoELxjqxRc7Mt/wVB8cPq+btvUuFSiqRNh+ppejqVnLKKV9KYZHGqCoHzkAN4o3k1GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2bffeb549dbf16eddaf84b504d4a0a06c130e675f47b98df0259bc69dabf69","last_reissued_at":"2026-05-18T01:30:17.580357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:17.580357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05760","source_version":3,"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-18T01:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qlqd87AgI+/7Dqg62AvPfAsk1lCL1Oy7vY1otof2rmwztclziFrrqlkbPTSP0H/9fBQZmJ6brEcZg0wq1BAwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:48:12.393419Z"},"content_sha256":"2553e2d60660de5770e9b9876d5048168593bf961ddbdc49404997d84b164fdf","schema_version":"1.0","event_id":"sha256:2553e2d60660de5770e9b9876d5048168593bf961ddbdc49404997d84b164fdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DUV7722UTW7RN3O27BFVATKKBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Optimization via Adaptive Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Mehryar Mohri, Scott Yang","submitted_at":"2015-09-18T19:49:54Z","abstract_excerpt":"We present a powerful general framework for designing data-dependent optimization algorithms, building upon and unifying recent techniques in adaptive regularization, optimistic gradient predictions, and problem-dependent randomization. We first present a series of new regret guarantees that hold at any time and under very minimal assumptions, and then show how different relaxations recover existing algorithms, both basic as well as more recent sophisticated ones. Finally, we show how combining adaptivity, optimism, and problem-dependent randomization can guide the design of algorithms that be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05760","kind":"arxiv","version":3},"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-18T01:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lyv9yXSwcOLfEteIzE8j8hp+71A44cKF3v+ZoCuSS+iJHPe+xvtgDvuiTFBYLmCAcZYKx2hmJg2Q+d4ScnfgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:48:12.393879Z"},"content_sha256":"3a7962abd5f2fe682b64bb85cd09e592e541974c2244c92af5626da1c1322529","schema_version":"1.0","event_id":"sha256:3a7962abd5f2fe682b64bb85cd09e592e541974c2244c92af5626da1c1322529"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUV7722UTW7RN3O27BFVATKKBI/bundle.json","state_url":"https://pith.science/pith/DUV7722UTW7RN3O27BFVATKKBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUV7722UTW7RN3O27BFVATKKBI/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-18T18:48:12Z","links":{"resolver":"https://pith.science/pith/DUV7722UTW7RN3O27BFVATKKBI","bundle":"https://pith.science/pith/DUV7722UTW7RN3O27BFVATKKBI/bundle.json","state":"https://pith.science/pith/DUV7722UTW7RN3O27BFVATKKBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUV7722UTW7RN3O27BFVATKKBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DUV7722UTW7RN3O27BFVATKKBI","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":"81a8c0b354182895cfa9556c907c244e375462ea4182795885b11e617fbc1d83","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-18T19:49:54Z","title_canon_sha256":"d341db43eb7cb8b1e6c9bbf508b68169927124201b135791d76b3f723a570ab0"},"schema_version":"1.0","source":{"id":"1509.05760","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05760","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05760v3","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05760","created_at":"2026-05-18T01:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"DUV7722UTW7R","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DUV7722UTW7RN3O2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DUV7722U","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:3a7962abd5f2fe682b64bb85cd09e592e541974c2244c92af5626da1c1322529","target":"graph","created_at":"2026-05-18T01:30:17Z","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":"We present a powerful general framework for designing data-dependent optimization algorithms, building upon and unifying recent techniques in adaptive regularization, optimistic gradient predictions, and problem-dependent randomization. We first present a series of new regret guarantees that hold at any time and under very minimal assumptions, and then show how different relaxations recover existing algorithms, both basic as well as more recent sophisticated ones. Finally, we show how combining adaptivity, optimism, and problem-dependent randomization can guide the design of algorithms that be","authors_text":"Mehryar Mohri, Scott Yang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-18T19:49:54Z","title":"Accelerating Optimization via Adaptive Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05760","kind":"arxiv","version":3},"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:2553e2d60660de5770e9b9876d5048168593bf961ddbdc49404997d84b164fdf","target":"record","created_at":"2026-05-18T01:30:17Z","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":"81a8c0b354182895cfa9556c907c244e375462ea4182795885b11e617fbc1d83","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-18T19:49:54Z","title_canon_sha256":"d341db43eb7cb8b1e6c9bbf508b68169927124201b135791d76b3f723a570ab0"},"schema_version":"1.0","source":{"id":"1509.05760","kind":"arxiv","version":3}},"canonical_sha256":"1d2bffeb549dbf16eddaf84b504d4a0a06c130e675f47b98df0259bc69dabf69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d2bffeb549dbf16eddaf84b504d4a0a06c130e675f47b98df0259bc69dabf69","first_computed_at":"2026-05-18T01:30:17.580357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:17.580357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5SukgpBjBwCteET8acoELxjqxRc7Mt/wVB8cPq+btvUuFSiqRNh+ppejqVnLKKV9KYZHGqCoHzkAN4o3k1GAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:17.581082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05760","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2553e2d60660de5770e9b9876d5048168593bf961ddbdc49404997d84b164fdf","sha256:3a7962abd5f2fe682b64bb85cd09e592e541974c2244c92af5626da1c1322529"],"state_sha256":"f7679aff6fea31acd59fd68189ed1679b97b47c19369400e64d23948ef4966b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgSAD/rRfQBP9sWvVkrqHPBLsc52WFzqlPfePs3R7GoFlsNeWvMluaDYAzIwnFBWG1c6Gw/tbqe9H+YhoNX4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:48:12.397900Z","bundle_sha256":"1b65be888ffdc39985ac76b1fec49708b8fce4617953c2ad8aa3b918da428a5f"}}