{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QKEUTLDVBB3E62MTB4CW3PWK47","short_pith_number":"pith:QKEUTLDV","schema_version":"1.0","canonical_sha256":"828949ac7508764f69930f056dbecae7fcd47a7662646901a0548ff6425c6ea7","source":{"kind":"arxiv","id":"1308.4275","version":2},"attestation_state":"computed","paper":{"title":"Efficient estimation of eigenvalue counts in an interval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"(2) Dept. of Electrical, (3) Computer Science & Engineering, Computer Engineering, Edoardo Di Napoli (1), Eric Polizzi (2), Forshungszentrum J\\\"ulich, University of Massachusetts, University of Minnesota.), Yousef Saad (3) ((1) J\\\"ulich Supercomputing Centre","submitted_at":"2013-08-20T10:16:16Z","abstract_excerpt":"Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an exact count is not necessary and methods based on stochastic estimates can be utilized to yield rough approximations. This paper examines a number of techniques tailored to this specific task. It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with a stochastic procedure."},"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":"1308.4275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-20T10:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"4a48d8019404531ddf39ce81a50baff69187ca22837a38db7c2992132d712256","abstract_canon_sha256":"d0452c5a5785e43532713c44e00eda1091563990f901f100c8654b8d06b74d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:49.745730Z","signature_b64":"319UrU9YvZNWAN2wHN9ven4IKy322kJ9Ogya8garjsn2cg+0Mx84QTOv6qbpxbU16emRuB6kXlbwNbbOkuQOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"828949ac7508764f69930f056dbecae7fcd47a7662646901a0548ff6425c6ea7","last_reissued_at":"2026-05-18T02:45:49.745242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:49.745242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient estimation of eigenvalue counts in an interval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"(2) Dept. of Electrical, (3) Computer Science & Engineering, Computer Engineering, Edoardo Di Napoli (1), Eric Polizzi (2), Forshungszentrum J\\\"ulich, University of Massachusetts, University of Minnesota.), Yousef Saad (3) ((1) J\\\"ulich Supercomputing Centre","submitted_at":"2013-08-20T10:16:16Z","abstract_excerpt":"Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an exact count is not necessary and methods based on stochastic estimates can be utilized to yield rough approximations. This paper examines a number of techniques tailored to this specific task. It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with a stochastic procedure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4275","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":"1308.4275","created_at":"2026-05-18T02:45:49.745327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4275v2","created_at":"2026-05-18T02:45:49.745327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4275","created_at":"2026-05-18T02:45:49.745327+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKEUTLDVBB3E","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKEUTLDVBB3E62MT","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKEUTLDV","created_at":"2026-05-18T12:27:57.521954+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/QKEUTLDVBB3E62MTB4CW3PWK47","json":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47.json","graph_json":"https://pith.science/api/pith-number/QKEUTLDVBB3E62MTB4CW3PWK47/graph.json","events_json":"https://pith.science/api/pith-number/QKEUTLDVBB3E62MTB4CW3PWK47/events.json","paper":"https://pith.science/paper/QKEUTLDV"},"agent_actions":{"view_html":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47","download_json":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47.json","view_paper":"https://pith.science/paper/QKEUTLDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4275&json=true","fetch_graph":"https://pith.science/api/pith-number/QKEUTLDVBB3E62MTB4CW3PWK47/graph.json","fetch_events":"https://pith.science/api/pith-number/QKEUTLDVBB3E62MTB4CW3PWK47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47/action/storage_attestation","attest_author":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47/action/author_attestation","sign_citation":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47/action/citation_signature","submit_replication":"https://pith.science/pith/QKEUTLDVBB3E62MTB4CW3PWK47/action/replication_record"}},"created_at":"2026-05-18T02:45:49.745327+00:00","updated_at":"2026-05-18T02:45:49.745327+00:00"}