{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MPNVDSHI5SXEHYARWHPIQGSIA6","short_pith_number":"pith:MPNVDSHI","schema_version":"1.0","canonical_sha256":"63db51c8e8ecae43e011b1de881a48078c36f019ebd3b86f28f2c7d224babfc7","source":{"kind":"arxiv","id":"1801.09794","version":1},"attestation_state":"computed","paper":{"title":"FEAST Eigensolver for Nonlinear Eigenvalue Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"physics.comp-ph","authors_text":"Agnieszka Mi\\k{e}dlar, Brendan Gavin, Eric Polizzi","submitted_at":"2018-01-29T23:20:50Z","abstract_excerpt":"The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and calculating the eigenpairs in each region independently of the eigenpairs in the other regions. In this paper we present a generalization of the linear FEAST algorithm that can be used to solve nonlinear ei"},"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":"1801.09794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-01-29T23:20:50Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"1bcda0affdb9cebfe25f57643913f633b1825f3c9c492ae3bd956402e2bb605d","abstract_canon_sha256":"eb9180019ef9e2ee1807c21a862066556c9f6afcb4d1a08371e4bd9f1065a164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:53.806173Z","signature_b64":"KQqw3ved+47SI+wFlpd6lzyhmf7XlkvbYu8EmjrybcbcUv5+SnJisu6lMc8xNDUSMPThK1Z3ikEKQYEU/CwqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63db51c8e8ecae43e011b1de881a48078c36f019ebd3b86f28f2c7d224babfc7","last_reissued_at":"2026-05-18T00:24:53.805480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:53.805480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FEAST Eigensolver for Nonlinear Eigenvalue Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"physics.comp-ph","authors_text":"Agnieszka Mi\\k{e}dlar, Brendan Gavin, Eric Polizzi","submitted_at":"2018-01-29T23:20:50Z","abstract_excerpt":"The linear FEAST algorithm is a method for solving linear eigenvalue problems. It uses complex contour integration to calculate the eigenvectors whose eigenvalues that are located inside some user-defined region in the complex plane. This makes it possible to parallelize the process of solving eigenvalue problems by simply dividing the complex plane into a collection of disjoint regions and calculating the eigenpairs in each region independently of the eigenpairs in the other regions. In this paper we present a generalization of the linear FEAST algorithm that can be used to solve nonlinear ei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09794","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":"1801.09794","created_at":"2026-05-18T00:24:53.805601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09794v1","created_at":"2026-05-18T00:24:53.805601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09794","created_at":"2026-05-18T00:24:53.805601+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPNVDSHI5SXE","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPNVDSHI5SXEHYAR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPNVDSHI","created_at":"2026-05-18T12:32:40.477152+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/MPNVDSHI5SXEHYARWHPIQGSIA6","json":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6.json","graph_json":"https://pith.science/api/pith-number/MPNVDSHI5SXEHYARWHPIQGSIA6/graph.json","events_json":"https://pith.science/api/pith-number/MPNVDSHI5SXEHYARWHPIQGSIA6/events.json","paper":"https://pith.science/paper/MPNVDSHI"},"agent_actions":{"view_html":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6","download_json":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6.json","view_paper":"https://pith.science/paper/MPNVDSHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09794&json=true","fetch_graph":"https://pith.science/api/pith-number/MPNVDSHI5SXEHYARWHPIQGSIA6/graph.json","fetch_events":"https://pith.science/api/pith-number/MPNVDSHI5SXEHYARWHPIQGSIA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6/action/storage_attestation","attest_author":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6/action/author_attestation","sign_citation":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6/action/citation_signature","submit_replication":"https://pith.science/pith/MPNVDSHI5SXEHYARWHPIQGSIA6/action/replication_record"}},"created_at":"2026-05-18T00:24:53.805601+00:00","updated_at":"2026-05-18T00:24:53.805601+00:00"}