{"as_of":"2026-08-22T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c866e4ba19be4017f22200121b012dc9773c9ac947837da5f192bc7ce8309beb","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T18:06:24.596951Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.00601/citation-record","integrity":"/paper/2606.00601/integrity","json":"/paper/2606.00601/citation-record.json","paper":"/paper/2606.00601"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Efficiently modeling long sequences with structured state spaces","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:7594891220b10bde5b802896e9fe864c99ee92f1da8c8700300a78b360196985","observation_id":"9a05910c-3775-4700-878d-e1656d8047f9","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-08-17T20:47:46.242385Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":"2312.00752","doi":"10.48550/arxiv.2312.00752","metadata_source":"pith","pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","venue":"cs.LG","work_id":"4ee75248-1199-492c-a52f-6661e0f4adff","year":2023},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:d57215034645a5dc835256009a1c7feb8d4a8dfda63c030d4e02adaec5fa5a2f","observation_id":"dbb490c4-64c4-4ee3-bd94-ab7ee3201155","resolution":{"observed_at":"2026-07-01T20:46:13.302512Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T20:38:14.544227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T20:38:14.544227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Daniel Hillis and Guy L","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:5ad9129c1d4888a64c858ead7b95a91159e82bde8f250dd8c4a1157a1c788c8d","observation_id":"8f03a9e1-699d-4755-a25f-bc77249cbe67","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Blelloch","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:9cc3235546e329edf954ad26185f795599b77a5a7a8a2ae88c6a566dede895e2","observation_id":"a5a2ebd1-b929-4df1-927e-5e433d126c41","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Triton: An intermediate language and compiler for tiled neural network computations","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:f1cac377c1468fc82a5706c201d088d0fb0f2cb6fff59764016d2e1268ab78f1","observation_id":"df13fe4e-abea-482f-8db6-46a7d00ba5f6","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Cutlass: Fast linear algebra in cuda c++","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:a7028325acff276cb98b8b90f4dd836eb180884a79c5b68e947af069c2a9c24c","observation_id":"cb7b8f42-a3f1-41c9-96e6-0976bdf71e46","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Fu, Stefano Ermon, Atri Rudra, and Christopher R´e","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:539d3e8d8a8acbc458d5bdecba8524e363cf8603d4ee5281808561b07f6f16cb","observation_id":"babdff5c-194b-4ebe-b509-149012e2c139","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Halide: A language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines.ACM SIGPLAN Notices, 48(6):519–530, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:0929149867a5cde661ff7a3d1c4c27a2ac3bfca56aaafe4219402fa3b30413c5","observation_id":"902c4592-23fb-4a5b-bacc-cd2ff6ac9758","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Tvm: An automated end-to-end op- timizing compiler for deep learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:61f2ea144d6309484b5af0e5a861556133da3f1f509a98243a5f6cd151f75729","observation_id":"1647c6f1-2897-488a-8884-8f668eea1f75","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04730","last_updated":"2018-06-29T00:16:36Z","snapshot_observed_at":"2026-08-14T19:46:17.506277Z","submitted_at":"2018-02-13T16:53:01Z","title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions","version":3},"cited_work":{"arxiv_id":"1802.04730","doi":"10.48550/arxiv.1802.04730","metadata_source":"pith","pith_arxiv_id":"1802.04730","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions","venue":"cs.PL","work_id":"448252d3-da60-4ee7-a060-3bb809e066e6","year":2018},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"cited_paper":"/paper/1802.04730","citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:3bce2dace9141737aac07b35070e20c4c6ffa111e2c404e2bc2e03910f2deece","observation_id":"d59b115b-7c64-41c7-a8c1-3e02f0f7f44c","resolution":{"observed_at":"2026-07-01T20:46:13.302754Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-05-24T22:23:28.197089+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T22:23:28.197089+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:710403b59703553b81157c34c05a51b72d468019116a2c65019d5f13594a4f7c","observation_id":"8cf9ab52-6663-44aa-8628-09026ee0c49b","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"IREE: Intermediate representation execution environment","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:8f47fd9432dc6bf5d01c51055a2b1c51cef3128ad743b01ece1752ab4675bf06","observation_id":"5504ed30-e37b-44ec-be0a-dc841201b6fd","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:06:24.596951Z","title":"TensorIR: An abstraction for automatic tensorized program op- timization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T18:06:24.596951Z"},"links":{"citing_paper":"/paper/2606.00601"},"observation_digest":"sha256:a6d48d43799e3b77cf46d169d7ec629c8ad8d139ad107223ea3f4c582460cd8e","observation_id":"13651f35-5adf-4228-be5c-63e46406be92","resolution":{"observed_at":"2026-06-28T18:06:24.596951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.00601","last_updated":"2026-05-30T07:58:02Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-17T06:14:39.339130Z","submitted_at":"2026-05-30T07:58:02Z","title":"ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":13},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2606.00601."}