{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NEV3NOT7LHU2M5JFRB2UUFNK6X","short_pith_number":"pith:NEV3NOT7","canonical_record":{"source":{"id":"1509.03616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"8472af690e5dd1a136cf4a38af8c7980d06b390005d5df787d67e4ef68acc365","abstract_canon_sha256":"6e6a07a5b9abf157f30b1802b0b74a487ec47588fa831e75d702308212e71230"},"schema_version":"1.0"},"canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","source":{"kind":"arxiv","id":"1509.03616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03616","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03616v1","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03616","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"NEV3NOT7LHU2","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEV3NOT7LHU2M5JF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEV3NOT7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NEV3NOT7LHU2M5JFRB2UUFNK6X","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"8472af690e5dd1a136cf4a38af8c7980d06b390005d5df787d67e4ef68acc365","abstract_canon_sha256":"6e6a07a5b9abf157f30b1802b0b74a487ec47588fa831e75d702308212e71230"},"schema_version":"1.0"},"canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:17.316775Z","signature_b64":"XM3zJJaJKC5URLR6ndZJ41Ale+zwFlmFt89WutbyMUFOSrimjSUjiN9v1DXoUDOeAeaGH2r/XbiTrG1ZHzSbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","last_reissued_at":"2026-05-18T01:33:17.316295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:17.316295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03616","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-18T01:33:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjkse+3sg1adIuJX/Iusmcy5JzhnJoFmheNAtjPzOiiXNGu6qJWuDwLITTl190LmhTE0UZX1dD4TNuqcRy9yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:01:51.573880Z"},"content_sha256":"2b5c5875a446c292088f1a1b92011fe44342556e3a844015d4cf0ee85b8362e1","schema_version":"1.0","event_id":"sha256:2b5c5875a446c292088f1a1b92011fe44342556e3a844015d4cf0ee85b8362e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NEV3NOT7LHU2M5JFRB2UUFNK6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Accelerated Methods in Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andre Wibisono, Ashia C. Wilson","submitted_at":"2015-09-11T19:16:17Z","abstract_excerpt":"In convex optimization, there is an {\\em acceleration} phenomenon in which we can boost the convergence rate of certain gradient-based algorithms. We can observe this phenomenon in Nesterov's accelerated gradient descent, accelerated mirror descent, and accelerated cubic-regularized Newton's method, among others. In this paper, we show that the family of higher-order gradient methods in discrete time (generalizing gradient descent) corresponds to a family of first-order rescaled gradient flows in continuous time. On the other hand, the family of {\\em accelerated} higher-order gradient methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03616","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-18T01:33:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l75hKFlT+fyQmCUUMTewxAqQg+77LlnaZZumzU0oJxh4i0taU8eW9s6l64WNvIWOf0nBx8a96KzLajuiRjWZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:01:51.574289Z"},"content_sha256":"5bf5f30d1b108539bf35ec2e1a4f80fa03691f4915fc8ea56befb8835b20a699","schema_version":"1.0","event_id":"sha256:5bf5f30d1b108539bf35ec2e1a4f80fa03691f4915fc8ea56befb8835b20a699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/bundle.json","state_url":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/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-27T07:01:51Z","links":{"resolver":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X","bundle":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/bundle.json","state":"https://pith.science/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEV3NOT7LHU2M5JFRB2UUFNK6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NEV3NOT7LHU2M5JFRB2UUFNK6X","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":"6e6a07a5b9abf157f30b1802b0b74a487ec47588fa831e75d702308212e71230","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","title_canon_sha256":"8472af690e5dd1a136cf4a38af8c7980d06b390005d5df787d67e4ef68acc365"},"schema_version":"1.0","source":{"id":"1509.03616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03616","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03616v1","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03616","created_at":"2026-05-18T01:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"NEV3NOT7LHU2","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEV3NOT7LHU2M5JF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEV3NOT7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:5bf5f30d1b108539bf35ec2e1a4f80fa03691f4915fc8ea56befb8835b20a699","target":"graph","created_at":"2026-05-18T01:33: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":"In convex optimization, there is an {\\em acceleration} phenomenon in which we can boost the convergence rate of certain gradient-based algorithms. We can observe this phenomenon in Nesterov's accelerated gradient descent, accelerated mirror descent, and accelerated cubic-regularized Newton's method, among others. In this paper, we show that the family of higher-order gradient methods in discrete time (generalizing gradient descent) corresponds to a family of first-order rescaled gradient flows in continuous time. On the other hand, the family of {\\em accelerated} higher-order gradient methods ","authors_text":"Andre Wibisono, Ashia C. Wilson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","title":"On Accelerated Methods in Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03616","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:2b5c5875a446c292088f1a1b92011fe44342556e3a844015d4cf0ee85b8362e1","target":"record","created_at":"2026-05-18T01:33: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":"6e6a07a5b9abf157f30b1802b0b74a487ec47588fa831e75d702308212e71230","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-11T19:16:17Z","title_canon_sha256":"8472af690e5dd1a136cf4a38af8c7980d06b390005d5df787d67e4ef68acc365"},"schema_version":"1.0","source":{"id":"1509.03616","kind":"arxiv","version":1}},"canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"692bb6ba7f59e9a6752588754a15aaf5ddd9ffb17d5b9d4270a9c934392f26d0","first_computed_at":"2026-05-18T01:33:17.316295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:17.316295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XM3zJJaJKC5URLR6ndZJ41Ale+zwFlmFt89WutbyMUFOSrimjSUjiN9v1DXoUDOeAeaGH2r/XbiTrG1ZHzSbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:17.316775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b5c5875a446c292088f1a1b92011fe44342556e3a844015d4cf0ee85b8362e1","sha256:5bf5f30d1b108539bf35ec2e1a4f80fa03691f4915fc8ea56befb8835b20a699"],"state_sha256":"7f8d64a9c240ac64ca4f6f0c8bb62a18a4d9e2d817adb564f5e583eac4f61c68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDg+VV5qVESuhnnC0cs24bIhaYQ7ExOauJ3/9FoYecFv6lJQRdnMAbBG5PbYSkA421LfwT2bd6VEAegkFXm7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:01:51.578074Z","bundle_sha256":"92274ab0bd7b4c01d01bb76e496d7fdf3a20d86150f9feab285ac6b9e314627e"}}