{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FACUYPAAI4NLRQGJZJTZHTWZAU","short_pith_number":"pith:FACUYPAA","canonical_record":{"source":{"id":"1812.10186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"057fcdd723652e0a7d18cb239f7f302f58e1f1e0673cb2ed2d4e6da2b4ade994","abstract_canon_sha256":"1c310f49754cc7d33ee98ad846aaf5640c6f5078bdf59e6d44d19155cecc2084"},"schema_version":"1.0"},"canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","source":{"kind":"arxiv","id":"1812.10186","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10186","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10186v3","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10186","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"FACUYPAAI4NL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FACUYPAAI4NLRQGJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FACUYPAA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FACUYPAAI4NLRQGJZJTZHTWZAU","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10186","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"057fcdd723652e0a7d18cb239f7f302f58e1f1e0673cb2ed2d4e6da2b4ade994","abstract_canon_sha256":"1c310f49754cc7d33ee98ad846aaf5640c6f5078bdf59e6d44d19155cecc2084"},"schema_version":"1.0"},"canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.611909Z","signature_b64":"UHueHXIO83CKs3knDDban1Z/iEZ9gCrDE6/QYmpqeXc9L7a5eecn9snM+Uhakv482O8xm6m2JAC0c8dMK2YNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","last_reissued_at":"2026-05-17T23:56:40.611262Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.611262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10186","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-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wT0FPqw5e0F7d9T1aWLVK7/bn5y6m5WuuG9lqxC5UDX3q64eTa1M9wn6f6OsE41wcZD/x1uCiVr0GReG39v4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:30:54.794662Z"},"content_sha256":"a62c07eb27e6b78911bd351814c26f6787654783b3fee1638c801afb0819422e","schema_version":"1.0","event_id":"sha256:a62c07eb27e6b78911bd351814c26f6787654783b3fee1638c801afb0819422e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FACUYPAAI4NLRQGJZJTZHTWZAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Online Gradient Descent with Improved Query Complexity: A Theoretical Revisit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"En Zhu, Jianping Yin, Xinwang Liu, Yawei Zhao","submitted_at":"2018-12-26T00:28:27Z","abstract_excerpt":"We provide a new theoretical analysis framework to investigate online gradient descent in the dynamic environment. Comparing with the previous work, the new framework recovers the state-of-the-art dynamic regret, but does not require extra gradient queries for every iteration. Specifically, when functions are $\\alpha$ strongly convex and $\\beta$ smooth, to achieve the state-of-the-art dynamic regret, the previous work requires $O(\\kappa)$ with $\\kappa = \\frac{\\beta}{\\alpha}$ queries of gradients at every iteration. But, our framework shows that the query complexity can be improved to be $O(1)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10186","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-17T23:56:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ib0PPw9zxoXbqvoo/LQWcrvJiSyZDQAsEI02MOfzthvXbnQasSHl/aKbQ+bVdE9AzZzLkKbjwK4AKZOfArqtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:30:54.795015Z"},"content_sha256":"86515905c295c8f4fc28e12da22c99245636bc2cb6b54a9d4b7414c20b437f64","schema_version":"1.0","event_id":"sha256:86515905c295c8f4fc28e12da22c99245636bc2cb6b54a9d4b7414c20b437f64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/bundle.json","state_url":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/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-05-31T02:30:54Z","links":{"resolver":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU","bundle":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/bundle.json","state":"https://pith.science/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FACUYPAAI4NLRQGJZJTZHTWZAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FACUYPAAI4NLRQGJZJTZHTWZAU","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":"1c310f49754cc7d33ee98ad846aaf5640c6f5078bdf59e6d44d19155cecc2084","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","title_canon_sha256":"057fcdd723652e0a7d18cb239f7f302f58e1f1e0673cb2ed2d4e6da2b4ade994"},"schema_version":"1.0","source":{"id":"1812.10186","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10186","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10186v3","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10186","created_at":"2026-05-17T23:56:40Z"},{"alias_kind":"pith_short_12","alias_value":"FACUYPAAI4NL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FACUYPAAI4NLRQGJ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FACUYPAA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:86515905c295c8f4fc28e12da22c99245636bc2cb6b54a9d4b7414c20b437f64","target":"graph","created_at":"2026-05-17T23:56:40Z","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 provide a new theoretical analysis framework to investigate online gradient descent in the dynamic environment. Comparing with the previous work, the new framework recovers the state-of-the-art dynamic regret, but does not require extra gradient queries for every iteration. Specifically, when functions are $\\alpha$ strongly convex and $\\beta$ smooth, to achieve the state-of-the-art dynamic regret, the previous work requires $O(\\kappa)$ with $\\kappa = \\frac{\\beta}{\\alpha}$ queries of gradients at every iteration. But, our framework shows that the query complexity can be improved to be $O(1)$","authors_text":"En Zhu, Jianping Yin, Xinwang Liu, Yawei Zhao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","title":"Dynamic Online Gradient Descent with Improved Query Complexity: A Theoretical Revisit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10186","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:a62c07eb27e6b78911bd351814c26f6787654783b3fee1638c801afb0819422e","target":"record","created_at":"2026-05-17T23:56:40Z","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":"1c310f49754cc7d33ee98ad846aaf5640c6f5078bdf59e6d44d19155cecc2084","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-26T00:28:27Z","title_canon_sha256":"057fcdd723652e0a7d18cb239f7f302f58e1f1e0673cb2ed2d4e6da2b4ade994"},"schema_version":"1.0","source":{"id":"1812.10186","kind":"arxiv","version":3}},"canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28054c3c00471ab8c0c9ca6793ced9050879ff6789f081359e27e333bf27a4c5","first_computed_at":"2026-05-17T23:56:40.611262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:40.611262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UHueHXIO83CKs3knDDban1Z/iEZ9gCrDE6/QYmpqeXc9L7a5eecn9snM+Uhakv482O8xm6m2JAC0c8dMK2YNAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:40.611909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10186","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a62c07eb27e6b78911bd351814c26f6787654783b3fee1638c801afb0819422e","sha256:86515905c295c8f4fc28e12da22c99245636bc2cb6b54a9d4b7414c20b437f64"],"state_sha256":"80b9f1fa7708111849a76f58292f588a715df163b86002e0aee41363f6772093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0se9/AkrNa/lx7Cfb4M/WjofV0L2ThMI5SeHVbrVwczpMYe7WE17K3jZeM6Vhyb2Oj1+/cokv3AxrucjxQI8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:30:54.798055Z","bundle_sha256":"15b7311f0ca94051ed963bd6c6b1e7c1f455596fe0bcca230cf41bc4fd4eb7c1"}}