{"as_of":"2026-08-17T00:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91c4fd633b03f4afb16dbd6fcc683e526089ecb44166d3915973dd8f7bfc671c","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:41:12.792697Z","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-05-20T22:09:07.403808Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.09158","snapshot_observed_at":"2026-08-14T13:41:12.792697Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"1908.05245","last_updated":"2020-07-07T13:31:59Z","snapshot_observed_at":"2026-08-16T04:42:27.082917Z","submitted_at":"2019-08-13T15:34:35Z","title":"Efficient Parallel-in-Time Solution of Time-Periodic Problems Using a Multi-Harmonic Coarse Grid Correction","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:41:12.792697Z"},"links":{"cited_paper":"/paper/2005.09158","citing_paper":"/paper/1908.05245"},"observation_digest":"sha256:33d155413d254b7ff26f74596013da811623e594fe5a50a4c983f08ddd41bc40","observation_id":"e5538434-aac0-4ee6-9c01-afdf025df539","resolution":{"observed_at":"2026-08-14T13:41:12.792697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.09158","snapshot_observed_at":"2026-08-11T23:35:46.976607Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.02425","last_updated":"2024-12-03T12:42:29Z","snapshot_observed_at":"2026-08-16T08:40:12.614039Z","submitted_at":"2024-12-03T12:42:29Z","title":"Efficient parallel inversion of ParaOpt preconditioners","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:35:46.976607Z"},"links":{"cited_paper":"/paper/2005.09158","citing_paper":"/paper/2412.02425"},"observation_digest":"sha256:cf15a8310f0a258e5b1341ca7feae5395499b9646411937c3ec3e386bd5018be","observation_id":"4517a450-4201-46c4-8b17-141cbc3d18d3","resolution":{"observed_at":"2026-08-11T23:35:46.976607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.09158","snapshot_observed_at":"2026-08-07T04:27:35.653166Z","title":"ParaDiag: parallel-in- time algorithms based on the diagonalization technique,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.10820","last_updated":"2025-06-12T15:38:56Z","snapshot_observed_at":"2026-08-13T20:01:28.478219Z","submitted_at":"2025-06-12T15:38:56Z","title":"A Combined Parallel-in-time Direct Inverse (ParaDIn)-Parareal Method for Nonlinear Differential Equations","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:27:35.653166Z"},"links":{"cited_paper":"/paper/2005.09158","citing_paper":"/paper/2506.10820"},"observation_digest":"sha256:e41c2b815ca03739485ba3d6fc4ffd8177f48819aba2dbfce49b6c3a00eb083c","observation_id":"d31711ed-80c8-4ca4-95a6-f07f7e278c6a","resolution":{"observed_at":"2026-08-07T04:27:35.653166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","version":4},"cited_work":{"arxiv_id":"2005.09158","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.09158","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","venue":null,"work_id":"9053d505-b1bc-46fa-9437-54e962df7a8e","year":2005},"citing_paper":{"arxiv_id":"2605.11979","last_updated":"2026-05-17T04:29:15Z","snapshot_observed_at":"2026-07-06T23:23:44.276236Z","submitted_at":"2026-05-12T11:33:59Z","title":"Optimized Two-Step Coarse Propagators in Parareal Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T04:49:45.844241Z"},"links":{"cited_paper":"/paper/2005.09158","citing_paper":"/paper/2605.11979"},"observation_digest":"sha256:b56669bfcc06f896fcaf83eee6997fd4dc9495bd7ab7225839f6ebf78d630d01","observation_id":"558e2b16-52fd-44d6-b20f-86dfbc3863c1","resolution":{"observed_at":"2026-05-13T04:52:17.076924Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","version":4},"cited_work":{"arxiv_id":"2005.09158","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2005.09158","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique","venue":null,"work_id":"9053d505-b1bc-46fa-9437-54e962df7a8e","year":2005},"citing_paper":{"arxiv_id":"2605.11979","last_updated":"2026-05-17T04:29:15Z","snapshot_observed_at":"2026-07-06T23:23:44.276236Z","submitted_at":"2026-05-12T11:33:59Z","title":"Optimized Two-Step Coarse Propagators in Parareal Algorithms","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T22:06:28.855133Z"},"links":{"cited_paper":"/paper/2005.09158","citing_paper":"/paper/2605.11979"},"observation_digest":"sha256:a64cbea3993468af48ea61572b5f514210ad42e36bbc20f7e893e953efbdcdfb","observation_id":"deeb9a04-72f1-44b0-94a5-7343964b69a6","resolution":{"observed_at":"2026-05-20T22:09:07.406117Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2005.09158/citation-record","integrity":"/paper/2005.09158/integrity","json":"/paper/2005.09158/citation-record.json","paper":"/paper/2005.09158"},"outbound":[],"paper":{"arxiv_id":"2005.09158","last_updated":"2021-04-14T01:46:53Z","latest_version":4,"primary_category":"math.NA","snapshot_observed_at":"2026-08-16T13:09:16.657108Z","submitted_at":"2020-05-19T01:32:46Z","title":"ParaDiag: parallel-in-time algorithms based on the diagonalization technique"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2005.09158."}