{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6GV57CCJ7WDHSY7PUDGHCCKXD5","short_pith_number":"pith:6GV57CCJ","canonical_record":{"source":{"id":"1712.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-11T18:59:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a3231deed886b6f5e8b0f5fc9120d2fa1e45377231cd28084302d96e29ca1df3","abstract_canon_sha256":"610909c25a91e1ea6793bf57c464cf5e34a8212458f912096700e77a18db3691"},"schema_version":"1.0"},"canonical_sha256":"f1abdf8849fd867963efa0cc7109571f78f8b8109ef9ffadb29e8e355ca69134","source":{"kind":"arxiv","id":"1712.03950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03950","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03950v1","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03950","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"6GV57CCJ7WDH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6GV57CCJ7WDHSY7P","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6GV57CCJ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6GV57CCJ7WDHSY7PUDGHCCKXD5","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-11T18:59:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a3231deed886b6f5e8b0f5fc9120d2fa1e45377231cd28084302d96e29ca1df3","abstract_canon_sha256":"610909c25a91e1ea6793bf57c464cf5e34a8212458f912096700e77a18db3691"},"schema_version":"1.0"},"canonical_sha256":"f1abdf8849fd867963efa0cc7109571f78f8b8109ef9ffadb29e8e355ca69134","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:19.457082Z","signature_b64":"HB+qVTrHNjrmVpmVtD0k4DMQu4hCNG4GZDKs7JCOa6Xu8tQzNvKI9altsSqFgG8iuWHM7mQO6t3Bf1/74VZoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1abdf8849fd867963efa0cc7109571f78f8b8109ef9ffadb29e8e355ca69134","last_reissued_at":"2026-05-18T00:28:19.456343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:19.456343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03950","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:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYRCF47ULc4VR0NzeU20ymhNAWnV4+yZ73ebkDBU5DgLIOzunkc+sHJ4ubrIFXqN8Cb+KRYVzlVZMSsSgWPZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:17:22.050646Z"},"content_sha256":"3b111471b81b7e8515f67ed9047c0cad0a61e18619896073e773259661698829","schema_version":"1.0","event_id":"sha256:3b111471b81b7e8515f67ed9047c0cad0a61e18619896073e773259661698829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6GV57CCJ7WDHSY7PUDGHCCKXD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saving Gradient and Negative Curvature Computations: Finding Local Minima More Efficiently","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Difan Zou, Quanquan Gu, Yaodong Yu","submitted_at":"2017-12-11T18:59:09Z","abstract_excerpt":"We propose a family of nonconvex optimization algorithms that are able to save gradient and negative curvature computations to a large extent, and are guaranteed to find an approximate local minimum with improved runtime complexity. At the core of our algorithms is the division of the entire domain of the objective function into small and large gradient regions: our algorithms only perform gradient descent based procedure in the large gradient region, and only perform negative curvature descent in the small gradient region. Our novel analysis shows that the proposed algorithms can escape the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03950","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:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuSsEpOiIZpd6fT60Qhk3JHIrEm0ynYQTNV09M0UbPQWLH5DJQCv5fg4eMpZMjmlNjn4BgeKtnc2rghpprfMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:17:22.051037Z"},"content_sha256":"40f2a41b00ebdc90d84d0c907481319e29f09a6fe5ee7b3bb489fe44e9c62abd","schema_version":"1.0","event_id":"sha256:40f2a41b00ebdc90d84d0c907481319e29f09a6fe5ee7b3bb489fe44e9c62abd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/bundle.json","state_url":"https://pith.science/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/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-21T08:17:22Z","links":{"resolver":"https://pith.science/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5","bundle":"https://pith.science/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/bundle.json","state":"https://pith.science/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GV57CCJ7WDHSY7PUDGHCCKXD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6GV57CCJ7WDHSY7PUDGHCCKXD5","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":"610909c25a91e1ea6793bf57c464cf5e34a8212458f912096700e77a18db3691","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-11T18:59:09Z","title_canon_sha256":"a3231deed886b6f5e8b0f5fc9120d2fa1e45377231cd28084302d96e29ca1df3"},"schema_version":"1.0","source":{"id":"1712.03950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03950","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03950v1","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03950","created_at":"2026-05-18T00:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"6GV57CCJ7WDH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6GV57CCJ7WDHSY7P","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6GV57CCJ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:40f2a41b00ebdc90d84d0c907481319e29f09a6fe5ee7b3bb489fe44e9c62abd","target":"graph","created_at":"2026-05-18T00:28:19Z","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 propose a family of nonconvex optimization algorithms that are able to save gradient and negative curvature computations to a large extent, and are guaranteed to find an approximate local minimum with improved runtime complexity. At the core of our algorithms is the division of the entire domain of the objective function into small and large gradient regions: our algorithms only perform gradient descent based procedure in the large gradient region, and only perform negative curvature descent in the small gradient region. Our novel analysis shows that the proposed algorithms can escape the s","authors_text":"Difan Zou, Quanquan Gu, Yaodong Yu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-11T18:59:09Z","title":"Saving Gradient and Negative Curvature Computations: Finding Local Minima More Efficiently"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03950","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:3b111471b81b7e8515f67ed9047c0cad0a61e18619896073e773259661698829","target":"record","created_at":"2026-05-18T00:28:19Z","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":"610909c25a91e1ea6793bf57c464cf5e34a8212458f912096700e77a18db3691","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-11T18:59:09Z","title_canon_sha256":"a3231deed886b6f5e8b0f5fc9120d2fa1e45377231cd28084302d96e29ca1df3"},"schema_version":"1.0","source":{"id":"1712.03950","kind":"arxiv","version":1}},"canonical_sha256":"f1abdf8849fd867963efa0cc7109571f78f8b8109ef9ffadb29e8e355ca69134","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1abdf8849fd867963efa0cc7109571f78f8b8109ef9ffadb29e8e355ca69134","first_computed_at":"2026-05-18T00:28:19.456343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:19.456343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HB+qVTrHNjrmVpmVtD0k4DMQu4hCNG4GZDKs7JCOa6Xu8tQzNvKI9altsSqFgG8iuWHM7mQO6t3Bf1/74VZoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:19.457082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b111471b81b7e8515f67ed9047c0cad0a61e18619896073e773259661698829","sha256:40f2a41b00ebdc90d84d0c907481319e29f09a6fe5ee7b3bb489fe44e9c62abd"],"state_sha256":"86de188ccc8adb85e9f009eb404ce81aad92b4fca7527a3b89a887429690a9f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNiDSdWQWgQk6TjtKzxhnUs2Lq8vr4cUSrQFPXNdmejIdAeW/QslEWMEYEd2AD4tleA4brqA8Y+1Nw4oK9SrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T08:17:22.053266Z","bundle_sha256":"4a35ffd782e0802d5c259f6ad7ef237138678dc33cde2c68f07ac20af8d19b46"}}