{"as_of":"2026-08-14T15:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30b85da3081580b4c4ae5991f0fc1a55af6cb2147aeba4d2ea5d4fa0a215ed64","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:26:51.227598Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T16:26:51.780873Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.06281","last_updated":"2023-12-27T12:50:55Z","snapshot_observed_at":"2026-08-13T05:38:45.361348Z","submitted_at":"2023-10-27T21:58:55Z","title":"Efficient Parallelization of a Ubiquitous Sequential Computation","version":4},"cited_work":{"arxiv_id":"2311.06281","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.06281","snapshot_observed_at":"2026-08-10T16:26:51.780873Z","title":"Efficient Parallelization of a Ubiquitous Sequential Computation","venue":"cs.DS","work_id":"a3dfec93-ed1b-424e-9609-b1d51372ccdf","year":2023},"citing_paper":{"arxiv_id":"2501.13230","last_updated":"2025-04-09T19:05:31Z","snapshot_observed_at":"2026-08-13T12:48:43.506317Z","submitted_at":"2025-01-22T21:30:49Z","title":"Let SSMs be ConvNets: State-space Modeling with Optimal Tensor Contractions","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:51.227598Z"},"links":{"cited_paper":"/paper/2311.06281","citing_paper":"/paper/2501.13230"},"observation_digest":"sha256:0c40cd8084ccc1a04246355bcce5cfa841cc1c246317ce3c52cbfa1833059ccd","observation_id":"e4b38d2a-3b74-4b56-98d4-86fd4a2115f8","resolution":{"observed_at":"2026-08-10T16:26:51.785060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.06281","last_updated":"2023-12-27T12:50:55Z","snapshot_observed_at":"2026-08-13T05:38:45.361348Z","submitted_at":"2023-10-27T21:58:55Z","title":"Efficient Parallelization of a Ubiquitous Sequential Computation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06281","snapshot_observed_at":"2026-08-03T12:09:32.197916Z","title":"Efficient parallelization of an ubiquitous sequential computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.04178","last_updated":"2026-06-06T11:02:56Z","snapshot_observed_at":"2026-08-07T16:34:24.978556Z","submitted_at":"2026-01-07T18:45:29Z","title":"Sound Event Detection with Boundary-Aware Optimization and Inference","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T12:09:32.197916Z"},"links":{"cited_paper":"/paper/2311.06281","citing_paper":"/paper/2601.04178"},"observation_digest":"sha256:718b73e72ebd64ce4cc71b6a41a180b0dbed97234b20b8fd43e4f895ff7a7c8b","observation_id":"604bf770-86dc-48ff-b413-7caa0d0d7ea4","resolution":{"observed_at":"2026-08-03T12:09:32.197916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.06281/citation-record","integrity":"/paper/2311.06281/integrity","json":"/paper/2311.06281/citation-record.json","paper":"/paper/2311.06281"},"outbound":[],"paper":{"arxiv_id":"2311.06281","last_updated":"2023-12-27T12:50:55Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T05:38:45.361348Z","submitted_at":"2023-10-27T21:58:55Z","title":"Efficient Parallelization of a Ubiquitous Sequential Computation"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.06281."}