{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q4E42MHISZO6JGDY2WBRTQLMID","short_pith_number":"pith:Q4E42MHI","schema_version":"1.0","canonical_sha256":"8709cd30e8965de49878d58319c16c40dd56d341cbc4523a736d0f81e14289cf","source":{"kind":"arxiv","id":"1907.04450","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.04450","created_at":"2026-05-17T23:41:00.299207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04450v1","created_at":"2026-05-17T23:41:00.299207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04450","created_at":"2026-05-17T23:41:00.299207+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4E42MHISZO6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4E42MHISZO6JGDY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4E42MHI","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID","json":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID.json","graph_json":"https://pith.science/api/pith-number/Q4E42MHISZO6JGDY2WBRTQLMID/graph.json","events_json":"https://pith.science/api/pith-number/Q4E42MHISZO6JGDY2WBRTQLMID/events.json","paper":"https://pith.science/paper/Q4E42MHI"},"agent_actions":{"view_html":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID","download_json":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID.json","view_paper":"https://pith.science/paper/Q4E42MHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04450&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4E42MHISZO6JGDY2WBRTQLMID/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4E42MHISZO6JGDY2WBRTQLMID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/action/storage_attestation","attest_author":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/action/author_attestation","sign_citation":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/action/citation_signature","submit_replication":"https://pith.science/pith/Q4E42MHISZO6JGDY2WBRTQLMID/action/replication_record"}},"created_at":"2026-05-17T23:41:00.299207+00:00","updated_at":"2026-05-17T23:41:00.299207+00:00"}