{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DFXSQDSSIX5UTATOBGY443YSLV","short_pith_number":"pith:DFXSQDSS","schema_version":"1.0","canonical_sha256":"196f280e5245fb49826e09b1ce6f125d40ee22fb62c74f1c6edfb72af2b575e1","source":{"kind":"arxiv","id":"1508.03280","version":5},"attestation_state":"computed","paper":{"title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"primary_cat":"cs.CC","authors_text":"Anders C. Hansen, Jonathan Ben-Artzi, Markus Seidel, Matthew J. Colbrook, Olavi Nevanlinna","submitted_at":"2015-08-13T17:42:14Z","abstract_excerpt":"This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra $\\mathrm{sp}(A)$ of classes of bounded operators $A = \\{a_{ij}\\}_{i,j \\in \\mathbb{N}} \\in \\mathcal{B}(l^2(\\mathbb{N}))$, given the matrix elements $\\{a_{ij}\\}_{i,j \\in \\mathbb{N}}$, that are sharp in the sense that they achieve the boundary of what a digital computer can achieve. Similarly, for a Schr\\\"odinger operator $H = -\\Delta+V$, determine the existence of algor"},"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":"1508.03280","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-13T17:42:14Z","cross_cats_sorted":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"title_canon_sha256":"32de6983e1b1bfbbf9bffa300bd1dcbe39cee90008e1753ce73067590e83d888","abstract_canon_sha256":"bcb9118dde61a4f62f5eba26a0eb0318ba16842e1c79508dd34ba1f7e761dbf1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:09.747049Z","signature_b64":"yELHpBa8yN9e8k6mptX1dFFi1IDJg1ipXFMYxCTBi+L06kOD/wX/d9a5ZfvrwgwohzTppoe/mR4qHjhiAnjcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"196f280e5245fb49826e09b1ce6f125d40ee22fb62c74f1c6edfb72af2b575e1","last_reissued_at":"2026-07-05T01:10:09.746633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:09.746633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"primary_cat":"cs.CC","authors_text":"Anders C. Hansen, Jonathan Ben-Artzi, Markus Seidel, Matthew J. Colbrook, Olavi Nevanlinna","submitted_at":"2015-08-13T17:42:14Z","abstract_excerpt":"This paper establishes some of the fundamental barriers in the theory of computations and finally settles the long-standing computational spectral problem. That is to determine the existence of algorithms that can compute spectra $\\mathrm{sp}(A)$ of classes of bounded operators $A = \\{a_{ij}\\}_{i,j \\in \\mathbb{N}} \\in \\mathcal{B}(l^2(\\mathbb{N}))$, given the matrix elements $\\{a_{ij}\\}_{i,j \\in \\mathbb{N}}$, that are sharp in the sense that they achieve the boundary of what a digital computer can achieve. Similarly, for a Schr\\\"odinger operator $H = -\\Delta+V$, determine the existence of algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03280","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1508.03280/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1508.03280","created_at":"2026-07-05T01:10:09.746691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03280v5","created_at":"2026-07-05T01:10:09.746691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03280","created_at":"2026-07-05T01:10:09.746691+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFXSQDSSIX5U","created_at":"2026-07-05T01:10:09.746691+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFXSQDSSIX5UTATO","created_at":"2026-07-05T01:10:09.746691+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFXSQDSS","created_at":"2026-07-05T01:10:09.746691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13250","citing_title":"Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12750","citing_title":"From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2509.16016","citing_title":"Residual SCI Upper Bounds And Lower Witnesses For Koopman Approximate Point Spectra In $L^p$ For $1