{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UBL4MN7OLW7GFUPPCRQUNNF7UP","short_pith_number":"pith:UBL4MN7O","schema_version":"1.0","canonical_sha256":"a057c637ee5dbe62d1ef146146b4bfa3efa19a23c9d9bb51aceaf0f3d0a61860","source":{"kind":"arxiv","id":"1902.03694","version":2},"attestation_state":"computed","paper":{"title":"Acceleration via Symplectic Discretization of High-Resolution Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Bin Shi, Michael I. Jordan, Simon S. Du, Weijie J. Su","submitted_at":"2019-02-11T01:13:18Z","abstract_excerpt":"We study first-order optimization methods obtained by discretizing ordinary differential equations (ODEs) corresponding to Nesterov's accelerated gradient methods (NAGs) and Polyak's heavy-ball method. We consider three discretization schemes: an explicit Euler scheme, an implicit Euler scheme, and a symplectic scheme. We show that the optimization algorithm generated by applying the symplectic scheme to a high-resolution ODE proposed by Shi et al. [2018] achieves an accelerated rate for minimizing smooth strongly convex functions. On the other hand, the resulting algorithm either fails to ach"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1902.03694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-11T01:13:18Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"d3e2ca4741d8e1360781390c8ffba17b5e683a7a15a9756d1b5f0cec441fea71","abstract_canon_sha256":"fe7f5e74f424f2edd73bfe39bea3dac9e859cd40a6e3eb38abb93a3a4b451a3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:32.732089Z","signature_b64":"PF4cB2i/ojtr+Dyhr61522InUYO/uqbD1JS2XWMXjUbF6cjVnulgXq80cS9BCCEAVKWZke0P4epZVft7pKWBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a057c637ee5dbe62d1ef146146b4bfa3efa19a23c9d9bb51aceaf0f3d0a61860","last_reissued_at":"2026-07-05T00:16:32.731558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:32.731558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acceleration via Symplectic Discretization of High-Resolution Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Bin Shi, Michael I. Jordan, Simon S. Du, Weijie J. Su","submitted_at":"2019-02-11T01:13:18Z","abstract_excerpt":"We study first-order optimization methods obtained by discretizing ordinary differential equations (ODEs) corresponding to Nesterov's accelerated gradient methods (NAGs) and Polyak's heavy-ball method. We consider three discretization schemes: an explicit Euler scheme, an implicit Euler scheme, and a symplectic scheme. We show that the optimization algorithm generated by applying the symplectic scheme to a high-resolution ODE proposed by Shi et al. [2018] achieves an accelerated rate for minimizing smooth strongly convex functions. On the other hand, the resulting algorithm either fails to ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03694","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.03694/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.03694","created_at":"2026-07-05T00:16:32.731628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03694v2","created_at":"2026-07-05T00:16:32.731628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03694","created_at":"2026-07-05T00:16:32.731628+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBL4MN7OLW7G","created_at":"2026-07-05T00:16:32.731628+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBL4MN7OLW7GFUPP","created_at":"2026-07-05T00:16:32.731628+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBL4MN7O","created_at":"2026-07-05T00:16:32.731628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.10426","citing_title":"On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP","json":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP.json","graph_json":"https://pith.science/api/pith-number/UBL4MN7OLW7GFUPPCRQUNNF7UP/graph.json","events_json":"https://pith.science/api/pith-number/UBL4MN7OLW7GFUPPCRQUNNF7UP/events.json","paper":"https://pith.science/paper/UBL4MN7O"},"agent_actions":{"view_html":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP","download_json":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP.json","view_paper":"https://pith.science/paper/UBL4MN7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03694&json=true","fetch_graph":"https://pith.science/api/pith-number/UBL4MN7OLW7GFUPPCRQUNNF7UP/graph.json","fetch_events":"https://pith.science/api/pith-number/UBL4MN7OLW7GFUPPCRQUNNF7UP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP/action/storage_attestation","attest_author":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP/action/author_attestation","sign_citation":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP/action/citation_signature","submit_replication":"https://pith.science/pith/UBL4MN7OLW7GFUPPCRQUNNF7UP/action/replication_record"}},"created_at":"2026-07-05T00:16:32.731628+00:00","updated_at":"2026-07-05T00:16:32.731628+00:00"}