{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DFXSQDSSIX5UTATOBGY443YSLV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bcb9118dde61a4f62f5eba26a0eb0318ba16842e1c79508dd34ba1f7e761dbf1","cross_cats_sorted":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-13T17:42:14Z","title_canon_sha256":"32de6983e1b1bfbbf9bffa300bd1dcbe39cee90008e1753ce73067590e83d888"},"schema_version":"1.0","source":{"id":"1508.03280","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03280","created_at":"2026-07-05T01:10:09Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03280v5","created_at":"2026-07-05T01:10:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03280","created_at":"2026-07-05T01:10:09Z"},{"alias_kind":"pith_short_12","alias_value":"DFXSQDSSIX5U","created_at":"2026-07-05T01:10:09Z"},{"alias_kind":"pith_short_16","alias_value":"DFXSQDSSIX5UTATO","created_at":"2026-07-05T01:10:09Z"},{"alias_kind":"pith_short_8","alias_value":"DFXSQDSS","created_at":"2026-07-05T01:10:09Z"}],"graph_snapshots":[{"event_id":"sha256:5f0807852c4ab6c7fa90527b4edb0a196e892c9139116175a3b5be1c469d69c1","target":"graph","created_at":"2026-07-05T01:10:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1508.03280/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anders C. Hansen, Jonathan Ben-Artzi, Markus Seidel, Matthew J. Colbrook, Olavi Nevanlinna","cross_cats":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03280","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:be02047aa0eda2de27f56da6e441f61c74b9b99d48e01eefb706ba0261af050f","target":"record","created_at":"2026-07-05T01:10:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bcb9118dde61a4f62f5eba26a0eb0318ba16842e1c79508dd34ba1f7e761dbf1","cross_cats_sorted":["cs.NA","math-ph","math.LO","math.MP","math.NA","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-13T17:42:14Z","title_canon_sha256":"32de6983e1b1bfbbf9bffa300bd1dcbe39cee90008e1753ce73067590e83d888"},"schema_version":"1.0","source":{"id":"1508.03280","kind":"arxiv","version":5}},"canonical_sha256":"196f280e5245fb49826e09b1ce6f125d40ee22fb62c74f1c6edfb72af2b575e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"196f280e5245fb49826e09b1ce6f125d40ee22fb62c74f1c6edfb72af2b575e1","first_computed_at":"2026-07-05T01:10:09.746633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:09.746633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yELHpBa8yN9e8k6mptX1dFFi1IDJg1ipXFMYxCTBi+L06kOD/wX/d9a5ZfvrwgwohzTppoe/mR4qHjhiAnjcDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:09.747049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03280","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be02047aa0eda2de27f56da6e441f61c74b9b99d48e01eefb706ba0261af050f","sha256:5f0807852c4ab6c7fa90527b4edb0a196e892c9139116175a3b5be1c469d69c1"],"state_sha256":"1594ac058cd216be3816fbd8d8453a8b9b392bff78c90332992db5d06280d213"}