{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GLBJRSCCGFCLUI6YKQELNZW3TA","short_pith_number":"pith:GLBJRSCC","canonical_record":{"source":{"id":"1802.03653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-10T21:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"1501987aa9efd34f13a205e4ed999ddeddadd94f52a8ed0f87941423b99a1dfe","abstract_canon_sha256":"5ec515b2237c5a42fc042a5830b6254f7b700c7b18d5e73264f9879087713235"},"schema_version":"1.0"},"canonical_sha256":"32c298c8423144ba23d85408b6e6db98140bea24196e56402030c296c43a746b","source":{"kind":"arxiv","id":"1802.03653","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03653","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03653v2","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03653","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"GLBJRSCCGFCL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GLBJRSCCGFCLUI6Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GLBJRSCC","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GLBJRSCCGFCLUI6YKQELNZW3TA","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-10T21:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"1501987aa9efd34f13a205e4ed999ddeddadd94f52a8ed0f87941423b99a1dfe","abstract_canon_sha256":"5ec515b2237c5a42fc042a5830b6254f7b700c7b18d5e73264f9879087713235"},"schema_version":"1.0"},"canonical_sha256":"32c298c8423144ba23d85408b6e6db98140bea24196e56402030c296c43a746b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:16.176030Z","signature_b64":"ajxEaJoDRNfLrEOpQqnW/5mCUd/m02NJwBEkJPF2OJ/0dGaKLxw790E1HJx5Ez/Bh8D6K/aXcIHIkI3hx33DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32c298c8423144ba23d85408b6e6db98140bea24196e56402030c296c43a746b","last_reissued_at":"2026-05-18T00:23:16.175261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:16.175261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03653","source_version":2,"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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6nAeuctVt5cKob+5GVnc4zgLYkIKDGZ1oBLLQmDAnfg0F9RxXl9oYFhZQKMvTeSg0HEZSI120KDDFNwWEPRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:58.850461Z"},"content_sha256":"6699da42334d5c8afdce1ba006bc9dc06380bc02f98fdabd1548dc31bb016dd0","schema_version":"1.0","event_id":"sha256:6699da42334d5c8afdce1ba006bc9dc06380bc02f98fdabd1548dc31bb016dd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GLBJRSCCGFCLUI6YKQELNZW3TA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Symplectic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Ashia C. Wilson, Michael Betancourt, Michael I. Jordan","submitted_at":"2018-02-10T21:45:46Z","abstract_excerpt":"Accelerated gradient methods have had significant impact in machine learning -- in particular the theoretical side of machine learning -- due to their ability to achieve oracle lower bounds. But their heuristic construction has hindered their full integration into the practical machine-learning algorithmic toolbox, and has limited their scope. In this paper we build on recent work which casts acceleration as a phenomenon best explained in continuous time, and we augment that picture by providing a systematic methodology for converting continuous-time dynamics into discrete-time algorithms whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03653","kind":"arxiv","version":2},"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:23:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yrIzqC276tpHyT67jVNnJ5MLXvsYOrienadAzU9E3FBlqXgGcsCLP8pJk93pkvMNafr3edPapZP8v/g06SNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:36:58.850809Z"},"content_sha256":"0ade9eadc60f48870967aa521c7ce385aee6c08a43dbab5d634afc188365a975","schema_version":"1.0","event_id":"sha256:0ade9eadc60f48870967aa521c7ce385aee6c08a43dbab5d634afc188365a975"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/bundle.json","state_url":"https://pith.science/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/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-06-03T02:36:58Z","links":{"resolver":"https://pith.science/pith/GLBJRSCCGFCLUI6YKQELNZW3TA","bundle":"https://pith.science/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/bundle.json","state":"https://pith.science/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLBJRSCCGFCLUI6YKQELNZW3TA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GLBJRSCCGFCLUI6YKQELNZW3TA","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":"5ec515b2237c5a42fc042a5830b6254f7b700c7b18d5e73264f9879087713235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-10T21:45:46Z","title_canon_sha256":"1501987aa9efd34f13a205e4ed999ddeddadd94f52a8ed0f87941423b99a1dfe"},"schema_version":"1.0","source":{"id":"1802.03653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03653","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03653v2","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03653","created_at":"2026-05-18T00:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"GLBJRSCCGFCL","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GLBJRSCCGFCLUI6Y","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GLBJRSCC","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:0ade9eadc60f48870967aa521c7ce385aee6c08a43dbab5d634afc188365a975","target":"graph","created_at":"2026-05-18T00:23:16Z","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":"Accelerated gradient methods have had significant impact in machine learning -- in particular the theoretical side of machine learning -- due to their ability to achieve oracle lower bounds. But their heuristic construction has hindered their full integration into the practical machine-learning algorithmic toolbox, and has limited their scope. In this paper we build on recent work which casts acceleration as a phenomenon best explained in continuous time, and we augment that picture by providing a systematic methodology for converting continuous-time dynamics into discrete-time algorithms whil","authors_text":"Ashia C. Wilson, Michael Betancourt, Michael I. Jordan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-10T21:45:46Z","title":"On Symplectic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03653","kind":"arxiv","version":2},"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:6699da42334d5c8afdce1ba006bc9dc06380bc02f98fdabd1548dc31bb016dd0","target":"record","created_at":"2026-05-18T00:23:16Z","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":"5ec515b2237c5a42fc042a5830b6254f7b700c7b18d5e73264f9879087713235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-10T21:45:46Z","title_canon_sha256":"1501987aa9efd34f13a205e4ed999ddeddadd94f52a8ed0f87941423b99a1dfe"},"schema_version":"1.0","source":{"id":"1802.03653","kind":"arxiv","version":2}},"canonical_sha256":"32c298c8423144ba23d85408b6e6db98140bea24196e56402030c296c43a746b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32c298c8423144ba23d85408b6e6db98140bea24196e56402030c296c43a746b","first_computed_at":"2026-05-18T00:23:16.175261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:16.175261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ajxEaJoDRNfLrEOpQqnW/5mCUd/m02NJwBEkJPF2OJ/0dGaKLxw790E1HJx5Ez/Bh8D6K/aXcIHIkI3hx33DAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:16.176030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6699da42334d5c8afdce1ba006bc9dc06380bc02f98fdabd1548dc31bb016dd0","sha256:0ade9eadc60f48870967aa521c7ce385aee6c08a43dbab5d634afc188365a975"],"state_sha256":"83ba2173aedfe9afda70eeb4ab4577ac7a72c07cc06e436c4799d8ea762e7f96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ih5CsKvZJrECImI/S5k+HAeu8+O0sU1Ih9pRjkLz4+dYPkhTmcRvxKYUgeeZ2VMwulxMkFxGzXdCvNi7ioujDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:36:58.852733Z","bundle_sha256":"f19a97e21a5fad96ac5423874a9209260a5ffa1c86511a0af2cc0d697c87b917"}}