{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T4WX3DKB4LFZQWKPNXLTCV5UMQ","short_pith_number":"pith:T4WX3DKB","canonical_record":{"source":{"id":"1810.02024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T02:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"7b07138b91218c681bf1d1ff3a53f27a15fb20d58beacd44eea301555ff1802b","abstract_canon_sha256":"c7ecc2b192225504ea1524b7dbc7d6bb5ad73be0e594dd02a49e1b4f7dbfb14c"},"schema_version":"1.0"},"canonical_sha256":"9f2d7d8d41e2cb98594f6dd73157b46403992f52bce82e6e48cf802d39ace5e1","source":{"kind":"arxiv","id":"1810.02024","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02024","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02024v2","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02024","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_12","alias_value":"T4WX3DKB4LFZ","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_16","alias_value":"T4WX3DKB4LFZQWKP","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_8","alias_value":"T4WX3DKB","created_at":"2026-07-05T01:07:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T4WX3DKB4LFZQWKPNXLTCV5UMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02024","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T02:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"7b07138b91218c681bf1d1ff3a53f27a15fb20d58beacd44eea301555ff1802b","abstract_canon_sha256":"c7ecc2b192225504ea1524b7dbc7d6bb5ad73be0e594dd02a49e1b4f7dbfb14c"},"schema_version":"1.0"},"canonical_sha256":"9f2d7d8d41e2cb98594f6dd73157b46403992f52bce82e6e48cf802d39ace5e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:36.163897Z","signature_b64":"DlpnTyD6dTnFQ62vAdtXy0uP0WBruWAv2Pt4F+FAD6i8MRTjxtSbYCCiFRQ0TUaufIOxxn7q7WI+Z0StoHwqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2d7d8d41e2cb98594f6dd73157b46403992f52bce82e6e48cf802d39ace5e1","last_reissued_at":"2026-07-05T01:07:36.163441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:36.163441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02024","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-07-05T01:07:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3V5lNHZ7gS00ZNo8dWXcy1AxFN6zq1xlNbMmu1Deb70BmeWzDqqfD7RclU3xVa4a456yOM3PCu+d868dJ5ipDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:24:48.110200Z"},"content_sha256":"39eaef6d6c10995795d678254cc74ea7e95ecc393b95d4ada2f09f39e1229f2c","schema_version":"1.0","event_id":"sha256:39eaef6d6c10995795d678254cc74ea7e95ecc393b95d4ada2f09f39e1229f2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T4WX3DKB4LFZQWKPNXLTCV5UMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jason D. Lee, Maher Nouiehed, Meisam Razaviyayn","submitted_at":"2018-10-04T02:03:58Z","abstract_excerpt":"We consider the problem of finding an approximate second-order stationary point of a constrained non-convex optimization problem. We first show that, unlike the gradient descent method for unconstrained optimization, the vanilla projected gradient descent algorithm may converge to a strict saddle point even when there is only a single linear constraint. We then provide a hardness result by showing that checking $(\\epsilon_g,\\epsilon_H)$-second order stationarity is NP-hard even in the presence of linear constraints. Despite our hardness result, we identify instances of the problem for which ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02024","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/1810.02024/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"},"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-07-05T01:07:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DlEZTEsXyBjayxRIcG0hiEJxkr/vDC70O9i31yp6n9HvSJbjlB83ynIZGMRQ9sdzM+DRCsZcFk6rBt80QwiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T18:24:48.110696Z"},"content_sha256":"9d08a5a08b1889a93f0ba36aefe802c58e4cf36564b07466b7d5f45dcc12a1c7","schema_version":"1.0","event_id":"sha256:9d08a5a08b1889a93f0ba36aefe802c58e4cf36564b07466b7d5f45dcc12a1c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/bundle.json","state_url":"https://pith.science/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/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-08-08T18:24:48Z","links":{"resolver":"https://pith.science/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ","bundle":"https://pith.science/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/bundle.json","state":"https://pith.science/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4WX3DKB4LFZQWKPNXLTCV5UMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T4WX3DKB4LFZQWKPNXLTCV5UMQ","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":"c7ecc2b192225504ea1524b7dbc7d6bb5ad73be0e594dd02a49e1b4f7dbfb14c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T02:03:58Z","title_canon_sha256":"7b07138b91218c681bf1d1ff3a53f27a15fb20d58beacd44eea301555ff1802b"},"schema_version":"1.0","source":{"id":"1810.02024","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02024","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02024v2","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02024","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_12","alias_value":"T4WX3DKB4LFZ","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_16","alias_value":"T4WX3DKB4LFZQWKP","created_at":"2026-07-05T01:07:36Z"},{"alias_kind":"pith_short_8","alias_value":"T4WX3DKB","created_at":"2026-07-05T01:07:36Z"}],"graph_snapshots":[{"event_id":"sha256:9d08a5a08b1889a93f0ba36aefe802c58e4cf36564b07466b7d5f45dcc12a1c7","target":"graph","created_at":"2026-07-05T01:07:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.02024/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding an approximate second-order stationary point of a constrained non-convex optimization problem. We first show that, unlike the gradient descent method for unconstrained optimization, the vanilla projected gradient descent algorithm may converge to a strict saddle point even when there is only a single linear constraint. We then provide a hardness result by showing that checking $(\\epsilon_g,\\epsilon_H)$-second order stationarity is NP-hard even in the presence of linear constraints. Despite our hardness result, we identify instances of the problem for which ch","authors_text":"Jason D. Lee, Maher Nouiehed, Meisam Razaviyayn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T02:03:58Z","title":"Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02024","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:39eaef6d6c10995795d678254cc74ea7e95ecc393b95d4ada2f09f39e1229f2c","target":"record","created_at":"2026-07-05T01:07:36Z","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":"c7ecc2b192225504ea1524b7dbc7d6bb5ad73be0e594dd02a49e1b4f7dbfb14c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T02:03:58Z","title_canon_sha256":"7b07138b91218c681bf1d1ff3a53f27a15fb20d58beacd44eea301555ff1802b"},"schema_version":"1.0","source":{"id":"1810.02024","kind":"arxiv","version":2}},"canonical_sha256":"9f2d7d8d41e2cb98594f6dd73157b46403992f52bce82e6e48cf802d39ace5e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2d7d8d41e2cb98594f6dd73157b46403992f52bce82e6e48cf802d39ace5e1","first_computed_at":"2026-07-05T01:07:36.163441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:07:36.163441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DlpnTyD6dTnFQ62vAdtXy0uP0WBruWAv2Pt4F+FAD6i8MRTjxtSbYCCiFRQ0TUaufIOxxn7q7WI+Z0StoHwqCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:07:36.163897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02024","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39eaef6d6c10995795d678254cc74ea7e95ecc393b95d4ada2f09f39e1229f2c","sha256:9d08a5a08b1889a93f0ba36aefe802c58e4cf36564b07466b7d5f45dcc12a1c7"],"state_sha256":"d9aabf3b92ba1e1be49f0bf9f5c93aaa4e369524f0860536a12a1984e6e1cc59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ual4Qz5Y+eD0Yv0Y2e+g6L+hEnna5/O97bSkYbcISYlGbeu1dTK/rrTHMv8iMJHTEoFVPXQOoi+L911wXKj8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T18:24:48.114603Z","bundle_sha256":"802b62529fba1300ac9ce73fd2de78420e9137723bbf342f553e6d98b3104406"}}