{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:35DFVJGJWGK6KFKF65Z37GIB3D","short_pith_number":"pith:35DFVJGJ","canonical_record":{"source":{"id":"1805.05751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T13:22:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"66154537cde6c7bb1bf1a7f5cba24bf7b66c1ccb30e99341b26422ee85f92f4f","abstract_canon_sha256":"5f6cea5b6ef9dfe805411b1a338cace7f4b299bdc4f85b8b93b678fc456c471e"},"schema_version":"1.0"},"canonical_sha256":"df465aa4c9b195e51545f773bf9901d8ea2f5526aa7cc070b0c883f794129dd4","source":{"kind":"arxiv","id":"1805.05751","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05751","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05751v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05751","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"35DFVJGJWGK6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35DFVJGJWGK6KFKF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35DFVJGJ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:35DFVJGJWGK6KFKF65Z37GIB3D","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T13:22:45Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"66154537cde6c7bb1bf1a7f5cba24bf7b66c1ccb30e99341b26422ee85f92f4f","abstract_canon_sha256":"5f6cea5b6ef9dfe805411b1a338cace7f4b299bdc4f85b8b93b678fc456c471e"},"schema_version":"1.0"},"canonical_sha256":"df465aa4c9b195e51545f773bf9901d8ea2f5526aa7cc070b0c883f794129dd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:02.923381Z","signature_b64":"quQSZutgpx9NvzFC2MLlbPhpKP7YPV36D0a9OZCNGagevfg5Rv+lIrPRYY1wd83WQ9Ts8mRyX7LExZjJ7k+OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df465aa4c9b195e51545f773bf9901d8ea2f5526aa7cc070b0c883f794129dd4","last_reissued_at":"2026-05-17T23:54:02.922911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:02.922911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05751","source_version":3,"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-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aa8/FIsCYBC6pKKVrUs7pu9EtgceIHZLtHD3d7OwtVIhNcVb43/hykt90zI+aA9oQY0vRq8RSEiaR4I4lbBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:40.556475Z"},"content_sha256":"b5883d2c3f52fa96f55922a95c604b881bb1143c8d86af055d612ed6458eb76e","schema_version":"1.0","event_id":"sha256:b5883d2c3f52fa96f55922a95c604b881bb1143c8d86af055d612ed6458eb76e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:35DFVJGJWGK6KFKF65Z37GIB3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Saddle Point Optimization: A Curvature Exploitation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aurelien Lucchi, Hadi Daneshmand, Leonard Adolphs, Thomas Hofmann","submitted_at":"2018-05-15T13:22:45Z","abstract_excerpt":"Gradient-based optimization methods are the most popular choice for finding local optima for classical minimization and saddle point problems. Here, we highlight a systemic issue of gradient dynamics that arise for saddle point problems, namely the presence of undesired stable stationary points that are no local optima. We propose a novel optimization approach that exploits curvature information in order to escape from these undesired stationary points. We prove that different optimization methods, including gradient method and Adagrad, equipped with curvature exploitation can escape non-optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05751","kind":"arxiv","version":3},"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-17T23:54:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qL/jLHYEyUw/CrgYBehGy8SQ8m7ITxldYVEOjbA+0bk4ed9MZrTXl3xaMB+mhjk2xzxTlrX4bPnm6zvuYfF0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:40.557203Z"},"content_sha256":"c56e04fb0a369fed45f9a3268471587c3e8ae2046d786ed13a46f57ae68a1381","schema_version":"1.0","event_id":"sha256:c56e04fb0a369fed45f9a3268471587c3e8ae2046d786ed13a46f57ae68a1381"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35DFVJGJWGK6KFKF65Z37GIB3D/bundle.json","state_url":"https://pith.science/pith/35DFVJGJWGK6KFKF65Z37GIB3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35DFVJGJWGK6KFKF65Z37GIB3D/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-25T19:36:40Z","links":{"resolver":"https://pith.science/pith/35DFVJGJWGK6KFKF65Z37GIB3D","bundle":"https://pith.science/pith/35DFVJGJWGK6KFKF65Z37GIB3D/bundle.json","state":"https://pith.science/pith/35DFVJGJWGK6KFKF65Z37GIB3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35DFVJGJWGK6KFKF65Z37GIB3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:35DFVJGJWGK6KFKF65Z37GIB3D","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":"5f6cea5b6ef9dfe805411b1a338cace7f4b299bdc4f85b8b93b678fc456c471e","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T13:22:45Z","title_canon_sha256":"66154537cde6c7bb1bf1a7f5cba24bf7b66c1ccb30e99341b26422ee85f92f4f"},"schema_version":"1.0","source":{"id":"1805.05751","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05751","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05751v3","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05751","created_at":"2026-05-17T23:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"35DFVJGJWGK6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"35DFVJGJWGK6KFKF","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"35DFVJGJ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:c56e04fb0a369fed45f9a3268471587c3e8ae2046d786ed13a46f57ae68a1381","target":"graph","created_at":"2026-05-17T23:54:02Z","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":"Gradient-based optimization methods are the most popular choice for finding local optima for classical minimization and saddle point problems. Here, we highlight a systemic issue of gradient dynamics that arise for saddle point problems, namely the presence of undesired stable stationary points that are no local optima. We propose a novel optimization approach that exploits curvature information in order to escape from these undesired stationary points. We prove that different optimization methods, including gradient method and Adagrad, equipped with curvature exploitation can escape non-optim","authors_text":"Aurelien Lucchi, Hadi Daneshmand, Leonard Adolphs, Thomas Hofmann","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T13:22:45Z","title":"Local Saddle Point Optimization: A Curvature Exploitation Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05751","kind":"arxiv","version":3},"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:b5883d2c3f52fa96f55922a95c604b881bb1143c8d86af055d612ed6458eb76e","target":"record","created_at":"2026-05-17T23:54:02Z","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":"5f6cea5b6ef9dfe805411b1a338cace7f4b299bdc4f85b8b93b678fc456c471e","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T13:22:45Z","title_canon_sha256":"66154537cde6c7bb1bf1a7f5cba24bf7b66c1ccb30e99341b26422ee85f92f4f"},"schema_version":"1.0","source":{"id":"1805.05751","kind":"arxiv","version":3}},"canonical_sha256":"df465aa4c9b195e51545f773bf9901d8ea2f5526aa7cc070b0c883f794129dd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df465aa4c9b195e51545f773bf9901d8ea2f5526aa7cc070b0c883f794129dd4","first_computed_at":"2026-05-17T23:54:02.922911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:02.922911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quQSZutgpx9NvzFC2MLlbPhpKP7YPV36D0a9OZCNGagevfg5Rv+lIrPRYY1wd83WQ9Ts8mRyX7LExZjJ7k+OAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:02.923381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05751","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5883d2c3f52fa96f55922a95c604b881bb1143c8d86af055d612ed6458eb76e","sha256:c56e04fb0a369fed45f9a3268471587c3e8ae2046d786ed13a46f57ae68a1381"],"state_sha256":"9b5b4d4c77c46886287a5051f415e6b15075010b82bee465a16e51fd8f39b723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo7IurWzTw3cjCeaSEgX76Xzd1nINho9EgwPB8uOEtTq2jfKd+2myQO45NdFIo78xsD+18U12BUnjD2tYq2QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:36:40.561580Z","bundle_sha256":"78f3851d08afd51c938583bc006e78348b5638c582177b32e0d25d7c3483f7c6"}}