{"as_of":"2026-08-10T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce4121b53332e05b4efb3ab7fb97a054a5a3f90580949ed3bd8406ec93c1f590","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:00:17.401597Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T16:38:40.785048Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-08-07T00:00:17.401597Z","title":"Ben-Artzi, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.15782","last_updated":"2025-06-18T18:00:08Z","snapshot_observed_at":"2026-08-09T13:15:57.475231Z","submitted_at":"2025-06-18T18:00:08Z","title":"Convergent Methods for Koopman Operators on Reproducing Kernel Hilbert Spaces","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:00:17.401597Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2506.15782"},"observation_digest":"sha256:b4f70aca233a5cb216677270171812316b9fab9347d98512878351fd6e4abf3b","observation_id":"81b706f3-3628-4bf2-bd74-a2cca0adde52","resolution":{"observed_at":"2026-08-07T00:00:17.401597Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-08-06T15:11:46.454603Z","title":"Ben-Artzi, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.16915","last_updated":"2025-07-22T18:01:05Z","snapshot_observed_at":"2026-08-10T15:05:42.501373Z","submitted_at":"2025-07-22T18:01:05Z","title":"Avoiding spectral pollution for transfer operators using residuals","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:11:46.454603Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2507.16915"},"observation_digest":"sha256:9a45f78ec1b6c1a644a5c18276fb9a72de48610aef62ed5d5286b6ec58266bf5","observation_id":"81e244a8-72fb-49d7-9f0e-f5301e8010bd","resolution":{"observed_at":"2026-08-06T15:11:46.454603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":"1508.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-07-03T16:38:40.785048Z","title":"Computing spectra--on the solvability complexity index hierarchy and towers of algorithms","venue":null,"work_id":"73652e4a-a445-4a7e-819e-a2e123411869","year":2015},"citing_paper":{"arxiv_id":"2509.16016","last_updated":"2026-05-12T14:14:42Z","snapshot_observed_at":"2026-08-02T14:30:22.719402Z","submitted_at":"2025-09-19T14:26:21Z","title":"Residual SCI Upper Bounds And Lower Witnesses For Koopman Approximate Point Spectra In $L^p$ For $1<p<\\infty$: Extended Version","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-18T15:55:26.009994Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2509.16016"},"observation_digest":"sha256:71d728e0d77b73fafcf036fd4cb366e0fbf24061512ec39cbc1a092a89e73624","observation_id":"78e77ad8-c06f-4424-9ba7-9e9603104c4f","resolution":{"observed_at":"2026-05-18T15:56:34.600546Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-08-03T10:22:29.503904Z","title":"Computing spectra--on the solvability complexity index hierarchy and towers of algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.12044","last_updated":"2026-05-22T14:10:52Z","snapshot_observed_at":"2026-08-07T09:53:12.356500Z","submitted_at":"2026-01-17T13:17:21Z","title":"Endpoint Koopman Spectral Computation: $L^1$ Residual Bounds, $L^\\infty$ Instability, and Point-Spectral SCI Calibration Families","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T10:22:29.503904Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2601.12044"},"observation_digest":"sha256:c451ef3833afca8541e2a79c08868d49103f36b4feec166e6410119eceb14694","observation_id":"c7cbd1db-39b4-4a63-86db-50f9f2e0aa07","resolution":{"observed_at":"2026-08-03T10:22:29.503904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":"1508.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-07-03T16:38:40.785048Z","title":"Computing spectra--on the solvability complexity index hierarchy and towers of algorithms","venue":null,"work_id":"73652e4a-a445-4a7e-819e-a2e123411869","year":2015},"citing_paper":{"arxiv_id":"2604.12750","last_updated":"2026-05-15T09:18:45Z","snapshot_observed_at":"2026-08-03T14:08:22.223941Z","submitted_at":"2026-04-14T13:59:35Z","title":"From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-10T13:46:41.296186Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2604.12750"},"observation_digest":"sha256:4ff99291a035520c97fde85a8d7df13c9b9247248d4792ea49a91f23f2c4fd78","observation_id":"3cd71ab0-6320-4dfa-b3e1-aef125becf46","resolution":{"observed_at":"2026-05-11T11:36:02.416545Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":"1508.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-07-03T16:38:40.785048Z","title":"Computing spectra--on the solvability complexity index hierarchy and towers of algorithms","venue":null,"work_id":"73652e4a-a445-4a7e-819e-a2e123411869","year":2015},"citing_paper":{"arxiv_id":"2604.12750","last_updated":"2026-05-15T09:18:45Z","snapshot_observed_at":"2026-08-03T14:08:22.223941Z","submitted_at":"2026-04-14T13:59:35Z","title":"From Witness-Space Sharpness To Family-Pointwise Exactness For The Solvability Complexity Index","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-19T17:49:32.767635Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2604.12750"},"observation_digest":"sha256:2d86998df5705db5cc382c3643d7107f1101f0652654a8d20a003534c41222ad","observation_id":"41e32581-58b1-44f6-bb66-04369a4ff6ac","resolution":{"observed_at":"2026-05-19T17:52:42.851390Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":"1508.03280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-07-03T16:38:40.785048Z","title":"Computing spectra--on the solvability complexity index hierarchy and towers of algorithms","venue":null,"work_id":"73652e4a-a445-4a7e-819e-a2e123411869","year":2015},"citing_paper":{"arxiv_id":"2606.13250","last_updated":"2026-06-11T12:05:51Z","snapshot_observed_at":"2026-08-09T06:02:12.845239Z","submitted_at":"2026-06-11T12:05:51Z","title":"Finite-Query Collapse and Modal Exact Bases in the SCI Hierarchy","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T05:04:37.009398Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2606.13250"},"observation_digest":"sha256:7460280d30977e1f056715867aae55f24a61a352bee072bbb5d90d8c4c2606bf","observation_id":"10f7bc60-061b-4d19-8be5-c09c338ffd7b","resolution":{"observed_at":"2026-07-03T16:38:40.786727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-08-03T08:54:36.944314Z","title":"Ben-Artzi, M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.29354","last_updated":"2026-07-31T12:38:17Z","snapshot_observed_at":"2026-08-10T06:51:36.978180Z","submitted_at":"2026-07-31T12:38:17Z","title":"Localisation of pseudospectra on discrete groups","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T08:54:36.944314Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2607.29354"},"observation_digest":"sha256:3961e9f2df8c46d079de973e94142cd160bb7345a71113be9eea3b46cd403346","observation_id":"dd49f581-6292-4bb5-b04c-7f2b76b5cf20","resolution":{"observed_at":"2026-08-03T08:54:36.944314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.03280","snapshot_observed_at":"2026-08-05T17:30:21.750028Z","title":"Colbrook, Anders C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.03526","last_updated":"2026-08-04T12:10:28Z","snapshot_observed_at":"2026-08-07T23:12:03.210590Z","submitted_at":"2026-08-04T12:10:28Z","title":"Spectral and Pseudospectral Approximation of Finite-Interaction-Range Operators in Doubling Metric Measure Spaces","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T17:30:21.750028Z"},"links":{"cited_paper":"/paper/1508.03280","citing_paper":"/paper/2608.03526"},"observation_digest":"sha256:88a9bba8ee89dbf9e55f4a9d41bc66a83a04ea0e85f6e29ee0336cb204ec89cb","observation_id":"fb9f1413-9819-4d10-aa57-ee09aff62da3","resolution":{"observed_at":"2026-08-05T17:30:21.750028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1508.03280/citation-record","integrity":"/paper/1508.03280/integrity","json":"/paper/1508.03280/citation-record.json","paper":"/paper/1508.03280"},"outbound":[],"paper":{"arxiv_id":"1508.03280","last_updated":"2020-06-15T17:50:03Z","latest_version":5,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-10T10:11:34.865691Z","submitted_at":"2015-08-13T17:42:14Z","title":"Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:1508.03280."}