{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4G3DP3LUMBDKLDLHMODJJ2VYKZ","short_pith_number":"pith:4G3DP3LU","canonical_record":{"source":{"id":"1611.00756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T19:58:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"38a6fbc54f003db772c6372642b1a82cc1ffba95312a2a3b4c17bf58fea679f6","abstract_canon_sha256":"83f781d5bf1d5c49191282fa62ca3aceb28e56b8c7b34b7ffa8319ee70d596f0"},"schema_version":"1.0"},"canonical_sha256":"e1b637ed746046a58d67638694eab856766cc293bc7c465063cdbaeb89cb37d4","source":{"kind":"arxiv","id":"1611.00756","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00756","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00756v2","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00756","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"4G3DP3LUMBDK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4G3DP3LUMBDKLDLH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4G3DP3LU","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4G3DP3LUMBDKLDLHMODJJ2VYKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T19:58:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"38a6fbc54f003db772c6372642b1a82cc1ffba95312a2a3b4c17bf58fea679f6","abstract_canon_sha256":"83f781d5bf1d5c49191282fa62ca3aceb28e56b8c7b34b7ffa8319ee70d596f0"},"schema_version":"1.0"},"canonical_sha256":"e1b637ed746046a58d67638694eab856766cc293bc7c465063cdbaeb89cb37d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:33.828850Z","signature_b64":"gXczdv4yRBOBHHIWN8OlH2Dl/znKNp2GgiGVS2vfWJfIiGNwD67O6hQPnTOVapnRAE11NUEaUDeU1OwfrmLaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1b637ed746046a58d67638694eab856766cc293bc7c465063cdbaeb89cb37d4","last_reissued_at":"2026-05-18T00:51:33.828444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:33.828444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00756","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:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9rdhcJ7/Hn11S9mq8AK/c8kV26QRQu7Qnqrt23uiXOiXFED+1nA15ZUL7GFiFzh15y1r77fqAjz9/x1LpWdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:50:03.312820Z"},"content_sha256":"a180bd34968c30ef8f980ed997b10abbb61d8c7c3371413a91c48c96423d0f51","schema_version":"1.0","event_id":"sha256:a180bd34968c30ef8f980ed997b10abbb61d8c7c3371413a91c48c96423d0f51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4G3DP3LUMBDKLDLHMODJJ2VYKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Methods for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","submitted_at":"2016-11-02T19:58:30Z","abstract_excerpt":"We present an accelerated gradient method for non-convex optimization problems with Lipschitz continuous first and second derivatives. The method requires time $O(\\epsilon^{-7/4} \\log(1/ \\epsilon) )$ to find an $\\epsilon$-stationary point, meaning a point $x$ such that $\\|\\nabla f(x)\\| \\le \\epsilon$. The method improves upon the $O(\\epsilon^{-2} )$ complexity of gradient descent and provides the additional second-order guarantee that $\\nabla^2 f(x) \\succeq -O(\\epsilon^{1/2})I$ for the computed $x$. Furthermore, our method is Hessian free, i.e. it only requires gradient computations, and is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00756","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:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euE8mrPISp+IN5KoeH0Ww+thMm7r2VVj9zJ7RoSA0eKOAEly+YpNat4e++3T9wvs9zLDaoz91iiR2MIymrJjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:50:03.313364Z"},"content_sha256":"425aadbef6c1f893cb2cf0bca3d86b89d096fe13d4426e559604a94584d92fa6","schema_version":"1.0","event_id":"sha256:425aadbef6c1f893cb2cf0bca3d86b89d096fe13d4426e559604a94584d92fa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/bundle.json","state_url":"https://pith.science/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/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-05T21:50:03Z","links":{"resolver":"https://pith.science/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ","bundle":"https://pith.science/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/bundle.json","state":"https://pith.science/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4G3DP3LUMBDKLDLHMODJJ2VYKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4G3DP3LUMBDKLDLHMODJJ2VYKZ","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":"83f781d5bf1d5c49191282fa62ca3aceb28e56b8c7b34b7ffa8319ee70d596f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T19:58:30Z","title_canon_sha256":"38a6fbc54f003db772c6372642b1a82cc1ffba95312a2a3b4c17bf58fea679f6"},"schema_version":"1.0","source":{"id":"1611.00756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00756","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00756v2","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00756","created_at":"2026-05-18T00:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"4G3DP3LUMBDK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4G3DP3LUMBDKLDLH","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4G3DP3LU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:425aadbef6c1f893cb2cf0bca3d86b89d096fe13d4426e559604a94584d92fa6","target":"graph","created_at":"2026-05-18T00:51:33Z","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 present an accelerated gradient method for non-convex optimization problems with Lipschitz continuous first and second derivatives. The method requires time $O(\\epsilon^{-7/4} \\log(1/ \\epsilon) )$ to find an $\\epsilon$-stationary point, meaning a point $x$ such that $\\|\\nabla f(x)\\| \\le \\epsilon$. The method improves upon the $O(\\epsilon^{-2} )$ complexity of gradient descent and provides the additional second-order guarantee that $\\nabla^2 f(x) \\succeq -O(\\epsilon^{1/2})I$ for the computed $x$. Furthermore, our method is Hessian free, i.e. it only requires gradient computations, and is the","authors_text":"Aaron Sidford, John C. Duchi, Oliver Hinder, Yair Carmon","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T19:58:30Z","title":"Accelerated Methods for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00756","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:a180bd34968c30ef8f980ed997b10abbb61d8c7c3371413a91c48c96423d0f51","target":"record","created_at":"2026-05-18T00:51:33Z","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":"83f781d5bf1d5c49191282fa62ca3aceb28e56b8c7b34b7ffa8319ee70d596f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T19:58:30Z","title_canon_sha256":"38a6fbc54f003db772c6372642b1a82cc1ffba95312a2a3b4c17bf58fea679f6"},"schema_version":"1.0","source":{"id":"1611.00756","kind":"arxiv","version":2}},"canonical_sha256":"e1b637ed746046a58d67638694eab856766cc293bc7c465063cdbaeb89cb37d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1b637ed746046a58d67638694eab856766cc293bc7c465063cdbaeb89cb37d4","first_computed_at":"2026-05-18T00:51:33.828444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:33.828444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXczdv4yRBOBHHIWN8OlH2Dl/znKNp2GgiGVS2vfWJfIiGNwD67O6hQPnTOVapnRAE11NUEaUDeU1OwfrmLaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:33.828850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a180bd34968c30ef8f980ed997b10abbb61d8c7c3371413a91c48c96423d0f51","sha256:425aadbef6c1f893cb2cf0bca3d86b89d096fe13d4426e559604a94584d92fa6"],"state_sha256":"22aadac69b9aeb4a1d48ea6170be7017c27c1ec3a7c428722537b636d53d8c64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf3WI8oMK/9u0+t7LwRzOOUysIO1oarkIzxOh09eSMrnlN6HG/w55xCo4CUHydu9o+Pga6Uvsu6KwgVUKCwfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:50:03.317227Z","bundle_sha256":"cc8d0b74824b114071c1ce5d2007f2e6db97971045a0261328fe7ce90211a221"}}