{"as_of":"2026-08-10T08:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e585642ba7b8417c89e984ed972ee6517055484e6125e803f4938feb92a25bb","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":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T04:59:25.028499Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":120,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-09T04:59:25.028499Z","title":"Pienaar and Mehdi Amini and Uday Bondhugula and River Riddle and Albert Cohen and Tatiana Sh- peisman and Andy Davis and Nicolas Vasilache and Oleksandr Zi- nenko","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.028499Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:642564a0ee83fba1574abf080a577cc9a0e8a424c246237eac2a8846606a3604","observation_id":"7616ac76-3c74-4928-8ee1-af06b496625d","resolution":{"observed_at":"2026-08-09T04:59:25.028499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2505.04080","last_updated":"2026-05-22T02:05:43Z","snapshot_observed_at":"2026-07-06T21:20:08.242976Z","submitted_at":"2025-05-07T02:42:05Z","title":"MojoFrame: Dataframe Library in Mojo Language","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T08:06:52.192881Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2505.04080"},"observation_digest":"sha256:3a7b83658f023ac7b4365cf29761ba7959198f3991bfacae068639735c4260f8","observation_id":"7c323fe2-d104-4b4b-a42f-84ed515f1f7b","resolution":{"observed_at":"2026-05-25T08:10:31.585716Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-07T12:48:35.068726Z","title":"Mlir: A compiler infrastructure for the end of moore’s law,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23553","last_updated":"2025-05-29T15:31:13Z","snapshot_observed_at":"2026-08-08T13:00:28.313068Z","submitted_at":"2025-05-29T15:31:13Z","title":"A Unified Framework for Mapping and Synthesis of Approximate R-Blocks CGRAs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:48:35.068726Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2505.23553"},"observation_digest":"sha256:9ba9374775930278ebf15cb2dff1fdf58f1b53f69eaf88ad6a4be433f83c3bfb","observation_id":"e908494c-650e-4ee7-86a1-0578fc97c03a","resolution":{"observed_at":"2026-08-07T12:48:35.068726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-07T11:29:56.600962Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.02233","last_updated":"2025-06-02T20:24:32Z","snapshot_observed_at":"2026-08-10T08:13:48.114375Z","submitted_at":"2025-06-02T20:24:32Z","title":"Improving compiler support for SIMD offload using Arm Streaming SVE","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:29:56.600962Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2506.02233"},"observation_digest":"sha256:04a3e6a8d93fc440cc7cfb9554761593e2f42a31429bf553e978eb79227a5583","observation_id":"1560df72-affb-4e3c-b09f-8cf44e6b29ee","resolution":{"observed_at":"2026-08-07T11:29:56.600962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T21:04:49.558995Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.09570","last_updated":"2025-08-27T12:13:45Z","snapshot_observed_at":"2026-08-10T08:13:56.929189Z","submitted_at":"2025-08-13T07:40:25Z","title":"Re-thinking Memory-Bound Limitations in CGRAs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T21:04:49.558995Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2508.09570"},"observation_digest":"sha256:09d854dd4d53c7d2577b9745c708a9982443cf273d895903b1a982005629e035","observation_id":"dc971b20-34fc-4aa1-8912-b51e376f153b","resolution":{"observed_at":"2026-08-05T21:04:49.558995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2509.16248","last_updated":"2026-06-29T23:42:05Z","snapshot_observed_at":"2026-08-04T16:20:44.738594Z","submitted_at":"2025-09-17T17:15:35Z","title":"GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T16:04:29.215393Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2509.16248"},"observation_digest":"sha256:e4f89de61823dd09bfd05d3e4c6d6ce64acd40de8cfabc2d228f5bc5c74033e8","observation_id":"e04ff359-c48e-4e01-a6b6-c6632703e9aa","resolution":{"observed_at":"2026-05-18T16:06:35.039665Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-03T16:42:12.716443Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.12507","last_updated":"2026-07-26T21:30:50Z","snapshot_observed_at":"2026-08-06T19:36:27.056447Z","submitted_at":"2025-12-14T01:11:11Z","title":"ATLAS: Multi-View Code Representation Tool for C and C++ Source Programs","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T16:42:12.716443Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2512.12507"},"observation_digest":"sha256:eb44e1ff7b6e2acd242b34da5b858de2b6536245bd5ff54dbb831182880657a6","observation_id":"87476b99-4296-4d3b-b1cc-ccc1c83af7e0","resolution":{"observed_at":"2026-08-03T16:42:12.716443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-03T13:45:23.834738Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2512.23236","last_updated":"2026-07-06T22:18:07Z","snapshot_observed_at":"2026-08-08T15:31:06.724407Z","submitted_at":"2025-12-29T06:31:55Z","title":"KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta","version":4},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-03T13:45:23.834738Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2512.23236"},"observation_digest":"sha256:3d1862439db8f071c2860bef3f2556830404a3ff5a1fafb163876e2e98cf98b6","observation_id":"f7d6f04c-c5b9-457f-8aaa-d35c3d966914","resolution":{"observed_at":"2026-08-03T13:45:23.834738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2604.07526","last_updated":"2026-04-08T19:04:45Z","snapshot_observed_at":"2026-07-06T22:55:46.307881Z","submitted_at":"2026-04-08T19:04:45Z","title":"From LLM to Silicon: RL-Driven ASIC Architecture Exploration for On-Device AI Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:18:04.530109Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2604.07526"},"observation_digest":"sha256:595dad7546feade6e7fb49941572e1993faac5c2e9e0c46d857913058d5668c4","observation_id":"a42ef834-2714-4f7b-bb22-b96ab766d84f","resolution":{"observed_at":"2026-05-11T07:06:09.506827Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2604.12618","last_updated":"2026-04-14T11:46:34Z","snapshot_observed_at":"2026-07-06T23:00:46.620106Z","submitted_at":"2026-04-14T11:46:34Z","title":"CODO: An Automated Compiler for Comprehensive Dataflow Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-10T14:36:13.820446Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2604.12618"},"observation_digest":"sha256:a35a23f8eb75ad226e06975ef4ddcb47c45ff3f1ff89d4968f0dd2a4b46ff335","observation_id":"64594c5f-80b8-40f0-aeaa-4cb560ab49b9","resolution":{"observed_at":"2026-05-10T14:45:51.919057Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2604.14825","last_updated":"2026-04-16T09:55:23Z","snapshot_observed_at":"2026-08-03T15:09:44.220229Z","submitted_at":"2026-04-16T09:55:23Z","title":"Nautilus: An Auto-Scheduling Tensor Compiler for Efficient Tiled GPU Kernels","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-10T10:21:05.219519Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2604.14825"},"observation_digest":"sha256:5bb825242e23f60c54d2182eeaa68712ba8693d1cfd2712a7737436deb985b5f","observation_id":"79ed6b2b-e40a-4705-bfce-2c60cc725e5c","resolution":{"observed_at":"2026-05-10T10:24:21.480185Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2604.20912","last_updated":"2026-06-15T18:55:55Z","snapshot_observed_at":"2026-08-06T16:23:18.761429Z","submitted_at":"2026-04-22T01:56:58Z","title":"Quantum-HPC Software Stacks and the openQSE Reference Architecture: A Survey","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T01:13:40.137329Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2604.20912"},"observation_digest":"sha256:036801bcfb3d55b33f4eb3c6c1b2ef6161928eb6259139552da30226d707a94a","observation_id":"4384c9d5-07bf-446c-8630-008b9a103be1","resolution":{"observed_at":"2026-05-10T01:15:15.870363Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2605.14690","last_updated":"2026-05-16T21:31:04Z","snapshot_observed_at":"2026-07-06T23:26:04.286377Z","submitted_at":"2026-05-14T11:03:29Z","title":"Integrated photonic computing: towards high-dimensional information processing","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T21:22:57.590347Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2605.14690"},"observation_digest":"sha256:9d5b04601023c9b4b65cb58995b9fc0cae5b86801be0223515a2ff3a713c9a10","observation_id":"95c96a1d-5b75-4916-bf63-290fee8a2130","resolution":{"observed_at":"2026-05-20T21:23:44.276582Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2605.17923","last_updated":"2026-05-18T06:30:31Z","snapshot_observed_at":"2026-08-03T06:19:48.849871Z","submitted_at":"2026-05-18T06:30:31Z","title":"AdaptiveLoad: Towards Efficient Video Diffusion Transformer Training","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-20T01:03:08.765350Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2605.17923"},"observation_digest":"sha256:3ec080bb149bd4f4319cb3c8ccdd8ebb69c234c48838342e03d15b38e3a37aec","observation_id":"93be915f-2d1f-484b-8cfe-b97a475f4faa","resolution":{"observed_at":"2026-05-20T01:03:18.345460Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2606.09312","last_updated":"2026-06-08T10:17:27Z","snapshot_observed_at":"2026-08-04T18:47:31.112351Z","submitted_at":"2026-06-08T10:17:27Z","title":"Toward Compiler World Models: Learning Latent Dynamics for Efficient Tensor Program Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T17:32:44.490621Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2606.09312"},"observation_digest":"sha256:88ba8327951d2e59c8f1d8edab61b384b1863a9ae5b6a10daa7987e47ddb3ebe","observation_id":"7d9bc5c4-3503-4d86-8e7b-8d6aebb903ef","resolution":{"observed_at":"2026-07-03T00:07:27.744519Z","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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":"2002.11054","doi":"10.48550/arxiv.2002.11054","metadata_source":"arxiv_reference","pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mlir: A compiler infrastructure for the end of moore’s law","venue":"arXiv (Cornell University)","work_id":"e31190bc-ed46-4dd0-be3f-07f7546c7444","year":2002},"citing_paper":{"arxiv_id":"2606.20917","last_updated":"2026-06-18T20:12:48Z","snapshot_observed_at":"2026-08-08T11:35:46.812205Z","submitted_at":"2026-06-18T20:12:48Z","title":"NektarIR: A Domain-Specific Compiler for High-Order Finite Element Operations on Heterogeneous Hardware","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T15:08:02.723799Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2606.20917"},"observation_digest":"sha256:f16fe0688361101cd7f5f3bd0651f537364e911f34781b6323d46c77c483c0da","observation_id":"1656d1ba-f231-423a-90ed-7e98307353e6","resolution":{"observed_at":"2026-07-04T05:59:37.223383Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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-08T03:08:14.072886+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T03:08:14.072886+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-02T00:17:24.717495Z","title":"MLIR: A compiler infrastructure for the end of Moore’s law,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.15068","last_updated":"2026-07-16T14:41:17Z","snapshot_observed_at":"2026-08-10T08:13:55.098802Z","submitted_at":"2026-07-16T14:41:17Z","title":"Pattern-Guided Design Space Exploration for FPGA Accelerator Design","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T00:17:24.717495Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2607.15068"},"observation_digest":"sha256:3154529ee716f12efacf80a52bac255a49368168b49ae3c3419c9a6ebcd7adc2","observation_id":"30668b16-dfad-42ab-807e-c86f460a439f","resolution":{"observed_at":"2026-08-02T00:17:24.717495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-01T22:09:53.560657Z","title":"Lattner, M","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.15865","last_updated":"2026-07-25T05:35:04Z","snapshot_observed_at":"2026-08-10T08:13:46.082764Z","submitted_at":"2026-07-17T11:24:45Z","title":"An MLIR-Based Compilation Method for Large Language Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T22:09:53.560657Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2607.15865"},"observation_digest":"sha256:35fcf2f2383ebcec5c9c1778490f36336e28ec2365a71e814e7c54e9e6ec149b","observation_id":"a912323f-319e-4aa3-a768-3abdf1ddffd0","resolution":{"observed_at":"2026-08-01T22:09:53.560657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-02T08:24:00.375168Z","title":"MLIR: A compiler infrastructure for the end of Moore’s law,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.16269","last_updated":"2026-07-07T08:48:39Z","snapshot_observed_at":"2026-08-10T08:13:45.099666Z","submitted_at":"2026-07-07T08:48:39Z","title":"From Intent to Infrastructure: LLM-Driven Agent Compilers for ISAC Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T08:24:00.375168Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2607.16269"},"observation_digest":"sha256:fa2ca409e3e6a9ca2385225cb558f48b4e879452a515d4049441c13e6e95d4dc","observation_id":"e35000e3-a379-468c-a816-1fa89c7d9034","resolution":{"observed_at":"2026-08-02T08:24:00.375168Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-07-31T23:24:28.039849Z","title":"Mlir: A compiler infrastructure for the end of moore’s law.arXiv preprint arXiv:2002.11054, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-08-10T08:13:45.678837Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.039849Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:b846b3d73e5b32c7c329b384901c452cf109a058459f958219d120cff69ca922","observation_id":"9c169599-1e0a-4cc0-a869-2ca5d7482d2a","resolution":{"observed_at":"2026-07-31T23:24:28.039849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-04T00:47:04.979536Z","title":"MLIR: A compiler infrastructure for the end of Moore’s law,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.00325","last_updated":"2026-07-31T22:26:39Z","snapshot_observed_at":"2026-08-09T05:05:43.755572Z","submitted_at":"2026-07-31T22:26:39Z","title":"Triton for MTIA: Bridging the Programming Model Gaps for Custom AI Accelerators","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T00:47:04.979536Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2608.00325"},"observation_digest":"sha256:878772287882ac0b23790477810071669665f1da0be7b4fe8beb2f574d3e439d","observation_id":"02e1d424-56ce-4d40-b0a0-b84cc1bb7f29","resolution":{"observed_at":"2026-08-04T00:47:04.979536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-05T04:38:11.287018Z","title":"arXiv preprint arXiv:2002.11054 , year=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.03983","last_updated":"2026-08-04T17:47:25Z","snapshot_observed_at":"2026-08-09T08:01:07.158923Z","submitted_at":"2026-08-04T17:47:25Z","title":"Can Large Language Models Recover Semantic Optimization Opportunities That Compilers Miss?","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-05T04:38:11.287018Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2608.03983"},"observation_digest":"sha256:13cfe596b2348e7acb53195761b5b2fda24dcd56646896efc886a600d41ffd5b","observation_id":"cd95cba4-552f-4e8f-9590-8fef3b6a761c","resolution":{"observed_at":"2026-08-05T04:38:11.287018Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.11054/citation-record","integrity":"/paper/2002.11054/integrity","json":"/paper/2002.11054/citation-record.json","paper":"/paper/2002.11054"},"outbound":[],"paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law"},"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 22 inbound Pith citation observations for arXiv:2002.11054."}