{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RKHUL4N53UG5Q2MZQKBEKRSQFV","short_pith_number":"pith:RKHUL4N5","canonical_record":{"source":{"id":"1809.02162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e2fde8e23628e843a7722e27f22535b6176c724b3fdbc3b98557a4bf017f50c6","abstract_canon_sha256":"041e37979932dcb8ca503a9e93a677dcf2c939739f505852f511341685d73fce"},"schema_version":"1.0"},"canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","source":{"kind":"arxiv","id":"1809.02162","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02162","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02162v2","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02162","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"RKHUL4N53UG5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RKHUL4N53UG5Q2MZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RKHUL4N5","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RKHUL4N53UG5Q2MZQKBEKRSQFV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e2fde8e23628e843a7722e27f22535b6176c724b3fdbc3b98557a4bf017f50c6","abstract_canon_sha256":"041e37979932dcb8ca503a9e93a677dcf2c939739f505852f511341685d73fce"},"schema_version":"1.0"},"canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:45.296270Z","signature_b64":"KMfQZnn12d11JXCV8va/5co7Cm2pjc85wWzn1OdUPoMr8xXwFYfm4deFrgr6qgqiVIM8+Fg1UrguWzRyAarRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","last_reissued_at":"2026-05-18T00:03:45.295771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:45.295771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02162","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efIZKT7I61LCPFT1jaA7ZrDXH81AHU52Q1cR/zqJpc090T9qlUjU2rlN9BmN7WXG2dBRWJmT8ducETRUVnW6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:41:14.123410Z"},"content_sha256":"d2528dfa744ff48d43f20942f4e057b9bded53e17a7c2a831740d8016cc6b3e5","schema_version":"1.0","event_id":"sha256:d2528dfa744ff48d43f20942f4e057b9bded53e17a7c2a831740d8016cc6b3e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RKHUL4N53UG5Q2MZQKBEKRSQFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Escaping Saddle Points in Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jadbabaie, Aryan Mokhtari, Asuman Ozdaglar","submitted_at":"2018-09-06T18:34:36Z","abstract_excerpt":"In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set $\\mathcal{C}$ is simple for a quadratic objective function. Specifically, our results hold if one can find a $\\rho$-approximate solution of a quadratic program subject to $\\mathcal{C}$ in polynomial time, where $\\rho<1$ is a positive constant that depends on the structure of the set $\\mathcal{C}$. Under this condition, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02162","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:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+exBfidlX5VrFYXEB//rz0XevTuGq0hzsubh2jkMzV0c3vYQ+YGSHfITdU1ho+evCzZIGBJCvxnM2iBdUsICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:41:14.124102Z"},"content_sha256":"ea569edbcfc6bbfec5e8381e744439a9e228b0a9590e775c3a8dc2c67828a47b","schema_version":"1.0","event_id":"sha256:ea569edbcfc6bbfec5e8381e744439a9e228b0a9590e775c3a8dc2c67828a47b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/bundle.json","state_url":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/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-01T00:41:14Z","links":{"resolver":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV","bundle":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/bundle.json","state":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RKHUL4N53UG5Q2MZQKBEKRSQFV","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":"041e37979932dcb8ca503a9e93a677dcf2c939739f505852f511341685d73fce","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","title_canon_sha256":"e2fde8e23628e843a7722e27f22535b6176c724b3fdbc3b98557a4bf017f50c6"},"schema_version":"1.0","source":{"id":"1809.02162","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02162","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02162v2","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02162","created_at":"2026-05-18T00:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"RKHUL4N53UG5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RKHUL4N53UG5Q2MZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RKHUL4N5","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:ea569edbcfc6bbfec5e8381e744439a9e228b0a9590e775c3a8dc2c67828a47b","target":"graph","created_at":"2026-05-18T00:03:45Z","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 this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set $\\mathcal{C}$ is simple for a quadratic objective function. Specifically, our results hold if one can find a $\\rho$-approximate solution of a quadratic program subject to $\\mathcal{C}$ in polynomial time, where $\\rho<1$ is a positive constant that depends on the structure of the set $\\mathcal{C}$. Under this condition, we show","authors_text":"Ali Jadbabaie, Aryan Mokhtari, Asuman Ozdaglar","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","title":"Escaping Saddle Points in Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02162","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:d2528dfa744ff48d43f20942f4e057b9bded53e17a7c2a831740d8016cc6b3e5","target":"record","created_at":"2026-05-18T00:03:45Z","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":"041e37979932dcb8ca503a9e93a677dcf2c939739f505852f511341685d73fce","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","title_canon_sha256":"e2fde8e23628e843a7722e27f22535b6176c724b3fdbc3b98557a4bf017f50c6"},"schema_version":"1.0","source":{"id":"1809.02162","kind":"arxiv","version":2}},"canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","first_computed_at":"2026-05-18T00:03:45.295771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:45.295771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KMfQZnn12d11JXCV8va/5co7Cm2pjc85wWzn1OdUPoMr8xXwFYfm4deFrgr6qgqiVIM8+Fg1UrguWzRyAarRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:45.296270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02162","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2528dfa744ff48d43f20942f4e057b9bded53e17a7c2a831740d8016cc6b3e5","sha256:ea569edbcfc6bbfec5e8381e744439a9e228b0a9590e775c3a8dc2c67828a47b"],"state_sha256":"ef20d931550e781a23c5c2a674d0f8d384a037458ec2705000d6fd99387735e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2azRklut6KBY/HK+rKEXcyC4HvsHgQ5O1DvdvuR8cW2u74fI5Pw51ZIQ+RImxZau3/wVMs2PlqO0w829D3oaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:41:14.127606Z","bundle_sha256":"5c3b3309104cca667c9a5f273b350b45c0bfa3211989b312e608fe2f33ca35a7"}}