{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G4NPQNMYX5MVIMB5DSM44GCKNB","short_pith_number":"pith:G4NPQNMY","canonical_record":{"source":{"id":"1711.08172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"19b990c42249f8af83260a5acd331b3a3cb0c32921f9c517d1056961573a1ec9","abstract_canon_sha256":"2938c922874d5862d8278b77f62d0c3023d064dfe9deec97eec38b05b3229b4d"},"schema_version":"1.0"},"canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","source":{"kind":"arxiv","id":"1711.08172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08172","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08172v2","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08172","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"G4NPQNMYX5MV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4NPQNMYX5MVIMB5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4NPQNMY","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G4NPQNMYX5MVIMB5DSM44GCKNB","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"19b990c42249f8af83260a5acd331b3a3cb0c32921f9c517d1056961573a1ec9","abstract_canon_sha256":"2938c922874d5862d8278b77f62d0c3023d064dfe9deec97eec38b05b3229b4d"},"schema_version":"1.0"},"canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:06.142778Z","signature_b64":"+fBOnqH/W35yLyJj5PLYE5t3/UCVlmVpnq2qYAM7Wl9JL63cHWV1ZuCs6jXZw1Dja5pzttzF6ZN9+82jVSwlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","last_reissued_at":"2026-05-18T00:12:06.142104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:06.142104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08172","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:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krlYu9OOJq9AHVgXMDSC1Kq9LqrcXd+t2F87ZHXszkYBWuBR6zd0Ntn7vvUZfWYF+sdrnSrDqRd1gF6k3+RrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:53.326185Z"},"content_sha256":"2f474da6f75897f0d27feff60aa39f21e0c7e34e44456a7ecb0dc175e94dcb28","schema_version":"1.0","event_id":"sha256:2f474da6f75897f0d27feff60aa39f21e0c7e34e44456a7ecb0dc175e94dcb28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G4NPQNMYX5MVIMB5DSM44GCKNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Wotao Yin, Yifan Chen, Yuejiao Sun","submitted_at":"2017-11-22T08:15:03Z","abstract_excerpt":"Many optimization algorithms converge to stationary points. When the underlying problem is nonconvex, they may get trapped at local minimizers and occasionally stagnate near saddle points. We propose the Run-and-Inspect Method, which adds an \"inspect\" phase to existing algorithms that helps escape from non-global stationary points. The inspection samples a set of points in a radius $R$ around the current point. When a sample point yields a sufficient decrease in the objective, we move there and resume an existing algorithm. If no sufficient decrease is found, the current point is called an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08172","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:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9M4OcmkcDQGZuoQ8uIU0yjwIJoltYSl9ImoSpsNlGZGPZAog4F5ZiBp91cgyQAKc7BIN6PT/4EyxMQVuUPruAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:53.326782Z"},"content_sha256":"3255af61d2fc09e5605009c3e72aaa3eb80a70d6aa83306b6641fbf8b0699fdc","schema_version":"1.0","event_id":"sha256:3255af61d2fc09e5605009c3e72aaa3eb80a70d6aa83306b6641fbf8b0699fdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/bundle.json","state_url":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/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-25T16:58:53Z","links":{"resolver":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB","bundle":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/bundle.json","state":"https://pith.science/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4NPQNMYX5MVIMB5DSM44GCKNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G4NPQNMYX5MVIMB5DSM44GCKNB","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":"2938c922874d5862d8278b77f62d0c3023d064dfe9deec97eec38b05b3229b4d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","title_canon_sha256":"19b990c42249f8af83260a5acd331b3a3cb0c32921f9c517d1056961573a1ec9"},"schema_version":"1.0","source":{"id":"1711.08172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08172","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08172v2","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08172","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"G4NPQNMYX5MV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G4NPQNMYX5MVIMB5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G4NPQNMY","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:3255af61d2fc09e5605009c3e72aaa3eb80a70d6aa83306b6641fbf8b0699fdc","target":"graph","created_at":"2026-05-18T00:12:06Z","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":"Many optimization algorithms converge to stationary points. When the underlying problem is nonconvex, they may get trapped at local minimizers and occasionally stagnate near saddle points. We propose the Run-and-Inspect Method, which adds an \"inspect\" phase to existing algorithms that helps escape from non-global stationary points. The inspection samples a set of points in a radius $R$ around the current point. When a sample point yields a sufficient decrease in the objective, we move there and resume an existing algorithm. If no sufficient decrease is found, the current point is called an app","authors_text":"Wotao Yin, Yifan Chen, Yuejiao Sun","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","title":"Run-and-Inspect Method for Nonconvex Optimization and Global Optimality Bounds for R-Local Minimizers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08172","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:2f474da6f75897f0d27feff60aa39f21e0c7e34e44456a7ecb0dc175e94dcb28","target":"record","created_at":"2026-05-18T00:12:06Z","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":"2938c922874d5862d8278b77f62d0c3023d064dfe9deec97eec38b05b3229b4d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-22T08:15:03Z","title_canon_sha256":"19b990c42249f8af83260a5acd331b3a3cb0c32921f9c517d1056961573a1ec9"},"schema_version":"1.0","source":{"id":"1711.08172","kind":"arxiv","version":2}},"canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"371af83598bf5954303d1c99ce184a684d3c908ffe9e47591b0e1bb8771fc2dd","first_computed_at":"2026-05-18T00:12:06.142104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:06.142104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+fBOnqH/W35yLyJj5PLYE5t3/UCVlmVpnq2qYAM7Wl9JL63cHWV1ZuCs6jXZw1Dja5pzttzF6ZN9+82jVSwlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:06.142778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f474da6f75897f0d27feff60aa39f21e0c7e34e44456a7ecb0dc175e94dcb28","sha256:3255af61d2fc09e5605009c3e72aaa3eb80a70d6aa83306b6641fbf8b0699fdc"],"state_sha256":"a22e5b8eae98b75bc78f8da580b155692e7b04059a6c0d127a31e69fda9b8b16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvpZuN2LjEZkezgN4Jf+IUn1e1Dcby7W3wCQmURdo4D9A5TrkIDslMnJKAydVp2jk15JnLsd+BsMQnbRTP9kDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:58:53.330005Z","bundle_sha256":"bfcfdceb5da06fc2957dde960a8713bfb66361ab23fdd7d57be7ce06ae0e8e97"}}