{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XRXTCOIX6EVM7PGAWVZFR26XOS","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":"4a8905be566e43b657cb79869ea87a88ea808c29f6805be3b1c93c099557ef5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-25T07:24:40Z","title_canon_sha256":"afe0a5237fe051252c4c59a30cfd0c33c319f19497c90fea31c219a05ae79f71"},"schema_version":"1.0","source":{"id":"1502.07073","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07073","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07073v3","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07073","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"XRXTCOIX6EVM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XRXTCOIX6EVM7PGA","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XRXTCOIX","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:808f2d3c457261cf2b5e87d987b6d6cfd0dc6693f7f64444574fa68f66e02a06","target":"graph","created_at":"2026-05-18T01:42:47Z","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":"Strongly adaptive algorithms are algorithms whose performance on every time interval is close to optimal. We present a reduction that can transform standard low-regret algorithms to strongly adaptive. As a consequence, we derive simple, yet efficient, strongly adaptive algorithms for a handful of problems.","authors_text":"Alon Gonen, Amit Daniely, Shai Shalev-Shwartz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-25T07:24:40Z","title":"Strongly Adaptive Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07073","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:c59e13db2c33a4ce00e0e8f7e45e30914170e169728fd4090377450e73aa47c4","target":"record","created_at":"2026-05-18T01:42:47Z","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":"4a8905be566e43b657cb79869ea87a88ea808c29f6805be3b1c93c099557ef5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-25T07:24:40Z","title_canon_sha256":"afe0a5237fe051252c4c59a30cfd0c33c319f19497c90fea31c219a05ae79f71"},"schema_version":"1.0","source":{"id":"1502.07073","kind":"arxiv","version":3}},"canonical_sha256":"bc6f313917f12acfbcc0b57258ebd774b135982f8d62af79598065025b8b6048","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc6f313917f12acfbcc0b57258ebd774b135982f8d62af79598065025b8b6048","first_computed_at":"2026-05-18T01:42:47.700840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.700840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8zLzo6WQaaXsLGQQJSPJtaznlrkSG1HjNLAKHlBxOHyyJ0EwrHgeEDYorZr6gTRm+rkL9HILQdTqH6uIMruxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.701670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07073","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c59e13db2c33a4ce00e0e8f7e45e30914170e169728fd4090377450e73aa47c4","sha256:808f2d3c457261cf2b5e87d987b6d6cfd0dc6693f7f64444574fa68f66e02a06"],"state_sha256":"cc6ae5a84045f907d2682b2f4e6c9e95967ba5d048e9c5a991de5f8ddcaad1fe"}