{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q4E42MHISZO6JGDY2WBRTQLMID","short_pith_number":"pith:Q4E42MHI","canonical_record":{"source":{"id":"1907.04450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-09T22:46:41Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"873b238e2c2f783c2b1157279fd299aad4b60ac489bb7062db4304ed86cb22bd","abstract_canon_sha256":"1eb44eb3d5f3aeb43391420c71cefd4623ab6cf7b055708e379a68b2daf9f8cd"},"schema_version":"1.0"},"canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","source":{"kind":"arxiv","id":"1907.04450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04450","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04450v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04450","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q4E42MHISZO6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q4E42MHISZO6JGDY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q4E42MHI","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q4E42MHISZO6JGDY2WBRTQLMID","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-09T22:46:41Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"873b238e2c2f783c2b1157279fd299aad4b60ac489bb7062db4304ed86cb22bd","abstract_canon_sha256":"1eb44eb3d5f3aeb43391420c71cefd4623ab6cf7b055708e379a68b2daf9f8cd"},"schema_version":"1.0"},"canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.299820Z","signature_b64":"Q4dT343gNxn7e7CaEBkpa3Qic3z3AIWQi4RMOQLDLOYWNK4zxznt2v4zAgoAcnbbdoCspI3WeEXLeEPmt3WZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","last_reissued_at":"2026-05-17T23:41:00.299091Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.299091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04450","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBd7o/yrLMwBue5/exmcwRJTCNCgfxzJJjTD9Z1ZrW+HYowieDFrwryWAEmdBNaE/qqQKy9GvGIoMw89f7faBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:57:26.455546Z"},"content_sha256":"89d1bfde58da98ecd196cc239191fd1db3c1db04aed50468e02d3d710503fc41","schema_version":"1.0","event_id":"sha256:89d1bfde58da98ecd196cc239191fd1db3c1db04aed50468e02d3d710503fc41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q4E42MHISZO6JGDY2WBRTQLMID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"math.OC","authors_text":"Bo Yang, Kejun Huang, Meisam Razaviyayn, Mingyi Hong, Songtao Lu","submitted_at":"2019-07-09T22:46:41Z","abstract_excerpt":"This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally intractable, we first show that generic instances of the problem can be solved efficiently. More specifically, for a generic problem instance, certain strict complementarity (SC) condition holds for all Karush-Kuhn-Tucker (KKT) solutions (with probability one). The SC condition is then used to establish an equivalence relationship between two different notions of SOS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04450","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"an1SWjv37JynXWv1ivnsOVGNHR3SUe57BJagJ4nm7/lyetLvC5eJbVkxmtkGYaGp+T8sQ5Ttg2/ACftraFIdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:57:26.456259Z"},"content_sha256":"9a260b6f21a379fd3428e6d0683091c034f80a373025831176f93f09cb0a700f","schema_version":"1.0","event_id":"sha256:9a260b6f21a379fd3428e6d0683091c034f80a373025831176f93f09cb0a700f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/bundle.json","state_url":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4E42MHISZO6JGDY2WBRTQLMID/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-26T02:57:26Z","links":{"resolver":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID","bundle":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/bundle.json","state":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4E42MHISZO6JGDY2WBRTQLMID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q4E42MHISZO6JGDY2WBRTQLMID","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":"1eb44eb3d5f3aeb43391420c71cefd4623ab6cf7b055708e379a68b2daf9f8cd","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-09T22:46:41Z","title_canon_sha256":"873b238e2c2f783c2b1157279fd299aad4b60ac489bb7062db4304ed86cb22bd"},"schema_version":"1.0","source":{"id":"1907.04450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04450","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04450v1","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04450","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q4E42MHISZO6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q4E42MHISZO6JGDY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q4E42MHI","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:9a260b6f21a379fd3428e6d0683091c034f80a373025831176f93f09cb0a700f","target":"graph","created_at":"2026-05-17T23:41:00Z","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":"This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally intractable, we first show that generic instances of the problem can be solved efficiently. More specifically, for a generic problem instance, certain strict complementarity (SC) condition holds for all Karush-Kuhn-Tucker (KKT) solutions (with probability one). The SC condition is then used to establish an equivalence relationship between two different notions of SOS","authors_text":"Bo Yang, Kejun Huang, Meisam Razaviyayn, Mingyi Hong, Songtao Lu","cross_cats":["cs.CC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-09T22:46:41Z","title":"SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04450","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:89d1bfde58da98ecd196cc239191fd1db3c1db04aed50468e02d3d710503fc41","target":"record","created_at":"2026-05-17T23:41:00Z","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":"1eb44eb3d5f3aeb43391420c71cefd4623ab6cf7b055708e379a68b2daf9f8cd","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-09T22:46:41Z","title_canon_sha256":"873b238e2c2f783c2b1157279fd299aad4b60ac489bb7062db4304ed86cb22bd"},"schema_version":"1.0","source":{"id":"1907.04450","kind":"arxiv","version":1}},"canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","first_computed_at":"2026-05-17T23:41:00.299091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.299091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q4dT343gNxn7e7CaEBkpa3Qic3z3AIWQi4RMOQLDLOYWNK4zxznt2v4zAgoAcnbbdoCspI3WeEXLeEPmt3WZBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.299820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d1bfde58da98ecd196cc239191fd1db3c1db04aed50468e02d3d710503fc41","sha256:9a260b6f21a379fd3428e6d0683091c034f80a373025831176f93f09cb0a700f"],"state_sha256":"c7e5a49e9d74336ad8698f23277c8c8bf735bbed25062634b426dc78910e33e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPEuQxcsfhNHxXETRn2/Cn2JGZVDMGS3BkXdDx3+rSx9cmgRZnVWS7LHF5qrD5yxSlaH0DR9Aa4aYNV1VkuRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:57:26.459647Z","bundle_sha256":"269b923b189525cde39870d9d098f955839b66be57abdcc0a3d5786224cd2061"}}