{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ECYY5IHEISBANP2GQ5AZV6JFOO","short_pith_number":"pith:ECYY5IHE","schema_version":"1.0","canonical_sha256":"20b18ea0e4448206bf4687419af92573b48389a1971a94a7f2967d6a52679e4b","source":{"kind":"arxiv","id":"0906.4466","version":2},"attestation_state":"computed","paper":{"title":"Level set methods for finding critical points of mountain pass type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Adrian S. Lewis, C.H. Jeffrey Pang","submitted_at":"2009-06-24T13:07:44Z","abstract_excerpt":"Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite dimensional case. We apply these techniques to describe a strategy for the Wilkinson problem of calculating the distance of a matrix to a closest matrix with repeated eigenvalues. Finally, we relate critical points of mountain pass type to nonsmooth and metric critical point theory."},"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":"0906.4466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-06-24T13:07:44Z","cross_cats_sorted":["math.AP","math.OC"],"title_canon_sha256":"e89fb49b447d806db736e838411a4c501cccb7435419f8fdbf62c6ffabf9f19e","abstract_canon_sha256":"b910238fe1cfebc33d43223b4452c7024bd75bd20bcc31a644d07d65532ca0a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.354399Z","signature_b64":"Gzb1YVEcXIEMCh3jhgC/U6b7aRotOOJY7XQ5GfJm1tk5k6xn+T647WMaARomUL8lBjkodep6Ruvc7zZ6WjnQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b18ea0e4448206bf4687419af92573b48389a1971a94a7f2967d6a52679e4b","last_reissued_at":"2026-05-18T04:20:13.353759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.353759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Level set methods for finding critical points of mountain pass type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Adrian S. Lewis, C.H. Jeffrey Pang","submitted_at":"2009-06-24T13:07:44Z","abstract_excerpt":"Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite dimensional case. We apply these techniques to describe a strategy for the Wilkinson problem of calculating the distance of a matrix to a closest matrix with repeated eigenvalues. Finally, we relate critical points of mountain pass type to nonsmooth and metric critical point theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4466","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.4466","created_at":"2026-05-18T04:20:13.353854+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.4466v2","created_at":"2026-05-18T04:20:13.353854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4466","created_at":"2026-05-18T04:20:13.353854+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECYY5IHEISBA","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECYY5IHEISBANP2G","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECYY5IHE","created_at":"2026-05-18T12:25:59.703012+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/ECYY5IHEISBANP2GQ5AZV6JFOO","json":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO.json","graph_json":"https://pith.science/api/pith-number/ECYY5IHEISBANP2GQ5AZV6JFOO/graph.json","events_json":"https://pith.science/api/pith-number/ECYY5IHEISBANP2GQ5AZV6JFOO/events.json","paper":"https://pith.science/paper/ECYY5IHE"},"agent_actions":{"view_html":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO","download_json":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO.json","view_paper":"https://pith.science/paper/ECYY5IHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.4466&json=true","fetch_graph":"https://pith.science/api/pith-number/ECYY5IHEISBANP2GQ5AZV6JFOO/graph.json","fetch_events":"https://pith.science/api/pith-number/ECYY5IHEISBANP2GQ5AZV6JFOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO/action/storage_attestation","attest_author":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO/action/author_attestation","sign_citation":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO/action/citation_signature","submit_replication":"https://pith.science/pith/ECYY5IHEISBANP2GQ5AZV6JFOO/action/replication_record"}},"created_at":"2026-05-18T04:20:13.353854+00:00","updated_at":"2026-05-18T04:20:13.353854+00:00"}