{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F6CFR3TZJ5GMYPN3LAQTLRS53U","short_pith_number":"pith:F6CFR3TZ","canonical_record":{"source":{"id":"1707.01647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-07-06T06:10:53Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"title_canon_sha256":"281a1fb1f5eecb49080ea2717e7f9bc6406621b7527b8d61d0b89eb6ed200f77","abstract_canon_sha256":"fdc5425e4de048edc9c7070407b5443084cde35e6d9cee1277dc1fdcd6cc98e7"},"schema_version":"1.0"},"canonical_sha256":"2f8458ee794f4ccc3dbb582135c65ddd350ae69298885895c7da938fe8c8e339","source":{"kind":"arxiv","id":"1707.01647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01647","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01647v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01647","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6CFR3TZJ5GM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6CFR3TZJ5GMYPN3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6CFR3TZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F6CFR3TZJ5GMYPN3LAQTLRS53U","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01647","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-07-06T06:10:53Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"title_canon_sha256":"281a1fb1f5eecb49080ea2717e7f9bc6406621b7527b8d61d0b89eb6ed200f77","abstract_canon_sha256":"fdc5425e4de048edc9c7070407b5443084cde35e6d9cee1277dc1fdcd6cc98e7"},"schema_version":"1.0"},"canonical_sha256":"2f8458ee794f4ccc3dbb582135c65ddd350ae69298885895c7da938fe8c8e339","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.960644Z","signature_b64":"yK1RWIk/lVfQxzvKJrlPhgOA4zQsa1Lpo/Co3DXQfw10IVCV3sVTC4fg/gW6bBUwjnu/45TT1pyQeLnOpyUOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8458ee794f4ccc3dbb582135c65ddd350ae69298885895c7da938fe8c8e339","last_reissued_at":"2026-05-18T00:40:47.959932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.959932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01647","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-05-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HH+Pk4/Fmtimbr68yGdDX1r7WsMu6U8i21FfWEAqxmKdxAUzzVHJM16KkEELIAOzfpm9TaCdWi5tCwh/KQemBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:56:58.261025Z"},"content_sha256":"b01973089f6b716966b46b32e1f73d530a88f2df4ffc2aa92492c4c383ec0bdc","schema_version":"1.0","event_id":"sha256:b01973089f6b716966b46b32e1f73d530a88f2df4ffc2aa92492c4c383ec0bdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F6CFR3TZJ5GMYPN3LAQTLRS53U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Analysis of Optimization Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"DaeSung Yu, HyoungSeok Kim, JiHoon Kang, Jungwon Choi, SukHyun Ko, Woomyoung Park, YoonHo Cho, Youngsook Song","submitted_at":"2017-07-06T06:10:53Z","abstract_excerpt":"The regret bound of an optimization algorithms is one of the basic criteria for evaluating the performance of the given algorithm. By inspecting the differences between the regret bounds of traditional algorithms and adaptive one, we provide a guide for choosing an optimizer with respect to the given data set and the loss function. For analysis, we assume that the loss function is convex and its gradient is Lipschitz continuous."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01647","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":""},"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-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGXh3KSc8tg1yH4QvC36BRFEOQYzmIty/aj6TprgLBgEjv9pZGuuzxRtsroe86LMZ1ba0yJffWuE9mV66ChKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:56:58.261807Z"},"content_sha256":"b2386c896d50b9fb216b225197e111dd8e648b0007d932d4561f489ae24d2b91","schema_version":"1.0","event_id":"sha256:b2386c896d50b9fb216b225197e111dd8e648b0007d932d4561f489ae24d2b91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/bundle.json","state_url":"https://pith.science/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/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-31T22:56:58Z","links":{"resolver":"https://pith.science/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U","bundle":"https://pith.science/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/bundle.json","state":"https://pith.science/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6CFR3TZJ5GMYPN3LAQTLRS53U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F6CFR3TZJ5GMYPN3LAQTLRS53U","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":"fdc5425e4de048edc9c7070407b5443084cde35e6d9cee1277dc1fdcd6cc98e7","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-07-06T06:10:53Z","title_canon_sha256":"281a1fb1f5eecb49080ea2717e7f9bc6406621b7527b8d61d0b89eb6ed200f77"},"schema_version":"1.0","source":{"id":"1707.01647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01647","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01647v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01647","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"F6CFR3TZJ5GM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F6CFR3TZJ5GMYPN3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F6CFR3TZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:b2386c896d50b9fb216b225197e111dd8e648b0007d932d4561f489ae24d2b91","target":"graph","created_at":"2026-05-18T00:40: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":"The regret bound of an optimization algorithms is one of the basic criteria for evaluating the performance of the given algorithm. By inspecting the differences between the regret bounds of traditional algorithms and adaptive one, we provide a guide for choosing an optimizer with respect to the given data set and the loss function. For analysis, we assume that the loss function is convex and its gradient is Lipschitz continuous.","authors_text":"DaeSung Yu, HyoungSeok Kim, JiHoon Kang, Jungwon Choi, SukHyun Ko, Woomyoung Park, YoonHo Cho, Youngsook Song","cross_cats":["cs.AI","cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-07-06T06:10:53Z","title":"Convergence Analysis of Optimization Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01647","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:b01973089f6b716966b46b32e1f73d530a88f2df4ffc2aa92492c4c383ec0bdc","target":"record","created_at":"2026-05-18T00:40: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":"fdc5425e4de048edc9c7070407b5443084cde35e6d9cee1277dc1fdcd6cc98e7","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2017-07-06T06:10:53Z","title_canon_sha256":"281a1fb1f5eecb49080ea2717e7f9bc6406621b7527b8d61d0b89eb6ed200f77"},"schema_version":"1.0","source":{"id":"1707.01647","kind":"arxiv","version":1}},"canonical_sha256":"2f8458ee794f4ccc3dbb582135c65ddd350ae69298885895c7da938fe8c8e339","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f8458ee794f4ccc3dbb582135c65ddd350ae69298885895c7da938fe8c8e339","first_computed_at":"2026-05-18T00:40:47.959932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:47.959932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yK1RWIk/lVfQxzvKJrlPhgOA4zQsa1Lpo/Co3DXQfw10IVCV3sVTC4fg/gW6bBUwjnu/45TT1pyQeLnOpyUOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:47.960644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b01973089f6b716966b46b32e1f73d530a88f2df4ffc2aa92492c4c383ec0bdc","sha256:b2386c896d50b9fb216b225197e111dd8e648b0007d932d4561f489ae24d2b91"],"state_sha256":"19199dee3f346e458f373c6878da553b27c21945a4f8b4928c36927be3e5e0d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKTBJKRd2o/CALTzoTJjFrDqki8eJef4rsCoF2oTBaJj1p0R2NDnZxATFd5HC+RpH1VHBncfz7DuzYH+vlGUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:56:58.266285Z","bundle_sha256":"4f51c370d59e92756b22e21882e5ea4654a966806a523584f3c6715523fd7e1c"}}