{"as_of":"2026-08-09T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff0470d66a7c239bcf90525205ecb4fca780c73a221b1ddffb6059c03a1cdeb3","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":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:45:01.246999Z","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":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-06T22:45:01.246999Z","title":"TileLang : A composable tiled programming model for AI systems, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20807","last_updated":"2025-08-22T08:48:16Z","snapshot_observed_at":"2026-08-09T05:06:01.680759Z","submitted_at":"2025-06-25T19:59:34Z","title":"GPU Kernel Scientist: An LLM-Driven Framework for Iterative Kernel Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:45:01.246999Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2506.20807"},"observation_digest":"sha256:0193b27a28e969fd4eaade564c6e8482a0381d41e34823bef6f993f740b8498e","observation_id":"f7812b6c-9fa6-4a9a-8e69-14f708612a31","resolution":{"observed_at":"2026-08-06T22:45:01.246999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-04T23:12:28.753602Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06794","last_updated":"2025-09-08T15:22:51Z","snapshot_observed_at":"2026-08-09T05:05:53.555653Z","submitted_at":"2025-09-08T15:22:51Z","title":"Dato: A Task-Based Programming Model for Dataflow Accelerators","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T23:12:28.753602Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2509.06794"},"observation_digest":"sha256:719c68701de8dff3ed25e8ede2ac641e0007023f939063e42f542c31080422b1","observation_id":"e05efdbf-3f95-4b9c-b5fc-57d8100cd5d4","resolution":{"observed_at":"2026-08-04T23:12:28.753602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2512.22168","last_updated":"2026-05-12T10:39:26Z","snapshot_observed_at":"2026-08-08T00:22:50.022619Z","submitted_at":"2025-12-17T11:26:58Z","title":"TileLoom: Automatic Dataflow Planning for Tile-Based Languages on Spatial Dataflow Accelerators","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-16T21:55:59.146697Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2512.22168"},"observation_digest":"sha256:a19f0317c0351adb86fa049f91ecbc9218cc742b821c63b3f58d6aceaa07a796","observation_id":"e399262f-3842-4ef2-bce6-5f376decc2a7","resolution":{"observed_at":"2026-05-16T21:58:35.776402Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2512.24880","last_updated":"2026-01-05T16:51:18Z","snapshot_observed_at":"2026-08-03T01:54:33.526522Z","submitted_at":"2025-12-31T14:16:26Z","title":"mHC: Manifold-Constrained Hyper-Connections","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-15T12:31:48.001520Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2512.24880"},"observation_digest":"sha256:993ab9e1777148221ec29304bb3756e5c96eabcf7ebdb53511ace89ab2f4d6aa","observation_id":"997d48ae-c69d-456d-8142-e90e76e5fafd","resolution":{"observed_at":"2026-05-15T12:31:48.093687Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2603.23566","last_updated":"2026-05-16T02:26:58Z","snapshot_observed_at":"2026-07-06T22:50:23.931381Z","submitted_at":"2026-03-24T08:54:53Z","title":"AscendOptimizer: Episodic Agent for Ascend NPU Operator Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T10:16:15.305706Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2603.23566"},"observation_digest":"sha256:b7c68902b2e99a9201e6cac1e1cc08f155a3f8b2549619f4d923a1409eb1be37","observation_id":"dce00cc6-6238-47aa-8e50-d70f4497d759","resolution":{"observed_at":"2026-05-21T10:20:00.022432Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-07-13T16:19:49.419805Z","title":"io/blog/qwen3.5","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.28457","last_updated":"2026-06-24T09:39:21Z","snapshot_observed_at":"2026-08-02T09:49:06.093893Z","submitted_at":"2026-03-30T13:59:38Z","title":"Three non-Hermitian random matrix universality classes of complex edge statistics: Spacing ratios and distributions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T16:19:49.419805Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2603.28457"},"observation_digest":"sha256:2ab099a7960da47372761895fdd989642520e984492257db99ae686fb2cd105d","observation_id":"3ebbd156-3b4d-401a-9d38-fd15dd93d23e","resolution":{"observed_at":"2026-07-13T16:19:49.419805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2603.28458","last_updated":"2026-04-06T09:47:34Z","snapshot_observed_at":"2026-08-02T11:27:36.874895Z","submitted_at":"2026-03-30T13:59:51Z","title":"HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-14T21:40:28.854082Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2603.28458"},"observation_digest":"sha256:3b898994e0b8a07a7808f942ee9a4fb39efd7d1811d30d5d17dabceb78b23112","observation_id":"3455f206-60c2-4b94-851f-5743b96fccb7","resolution":{"observed_at":"2026-05-14T21:43:00.742163Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2603.29002","last_updated":"2026-05-30T00:45:53Z","snapshot_observed_at":"2026-08-07T01:05:48.341497Z","submitted_at":"2026-03-30T21:03:39Z","title":"Understand and Accelerate Memory Processing Pipeline for Large Language Model Inference","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-14T00:25:49.807277Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2603.29002"},"observation_digest":"sha256:9543bffe0999b8b8c3ec8d65246b6b6b2a82056d8c520d58203340e0f5b2049e","observation_id":"de52d198-43a2-4703-aa77-6e5e537cc704","resolution":{"observed_at":"2026-05-14T00:28:30.007283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2604.04750","last_updated":"2026-04-09T14:13:19Z","snapshot_observed_at":"2026-07-06T22:53:37.357996Z","submitted_at":"2026-04-06T15:16:35Z","title":"DeepStack: Scalable and Accurate Design Space Exploration for Distributed 3D-Stacked AI Accelerators","version":2},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-05-10T19:04:17.725111Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2604.04750"},"observation_digest":"sha256:45cc173d338bbbebcbe52cb9a958f098beb89f6ec7a593ce7df0c30732d91ae2","observation_id":"7c11a0fc-b328-4a4a-8270-069347c57de4","resolution":{"observed_at":"2026-05-10T23:30:52.079984Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2604.08044","last_updated":"2026-04-09T09:48:43Z","snapshot_observed_at":"2026-07-06T22:57:13.745326Z","submitted_at":"2026-04-09T09:48:43Z","title":"A Full-Stack Performance Evaluation Infrastructure for 3D-DRAM-based LLM Accelerators","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-10T17:28:25.827990Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2604.08044"},"observation_digest":"sha256:6859f3d8958c8c4a26b44ce45e6313a106321bb086c54702196520c58f0783de","observation_id":"1f06ac26-a4bc-4d19-8de6-05f897b86828","resolution":{"observed_at":"2026-05-11T06:46:07.457333Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"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":41,"source":"pdf_text","source_observed_at":"2026-05-10T10:21:05.219519Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2604.14825"},"observation_digest":"sha256:9f555e7cba9d753d5433752b7c0b98a43cd4ad63c23a9112f0af7f98037d912c","observation_id":"f2eac8a2-6e33-4f1e-a0bd-4270aaeaa874","resolution":{"observed_at":"2026-05-10T10:24:21.507935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2604.15911","last_updated":"2026-04-17T10:11:39Z","snapshot_observed_at":"2026-07-06T23:03:21.422544Z","submitted_at":"2026-04-17T10:11:39Z","title":"Efficient Video Diffusion Models: Advancements and Challenges","version":1},"reference_index":135,"source":"pdf_text","source_observed_at":"2026-05-10T08:28:29.706249Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2604.15911"},"observation_digest":"sha256:32eb15d9496509603972794eafb6ed9696b2c4c54888d402d0c1d72be1e68801","observation_id":"659cf9aa-8f94-4876-a963-0adb95dd01a8","resolution":{"observed_at":"2026-05-10T09:03:25.980485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2604.16864","last_updated":"2026-04-18T06:28:21Z","snapshot_observed_at":"2026-08-02T05:52:50.560554Z","submitted_at":"2026-04-18T06:28:21Z","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-10T07:15:19.184970Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2604.16864"},"observation_digest":"sha256:a107f340d26952b661abbf1f0da205a3fa13013b2b41f981f6554c7e98af9bc9","observation_id":"c1189766-8a6d-4904-a39b-0e6228d61046","resolution":{"observed_at":"2026-05-10T07:16:54.205503Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.02568","last_updated":"2026-05-04T13:19:29Z","snapshot_observed_at":"2026-08-09T04:39:32.729075Z","submitted_at":"2026-05-04T13:19:29Z","title":"StreamIndex: Memory-Bounded Compressed Sparse Attention via Streaming Top-k","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-08T18:44:42.456111Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.02568"},"observation_digest":"sha256:af19297a2459c9cf6d7d963826547daa9ca0a59e731c7f08e83c2d879ed7efdd","observation_id":"fa2f9d04-acc3-42db-bd55-6e78c71de0c0","resolution":{"observed_at":"2026-05-09T06:15:37.661463Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.04569","last_updated":"2026-05-28T14:50:27Z","snapshot_observed_at":"2026-07-06T23:17:18.486586Z","submitted_at":"2026-05-06T07:15:29Z","title":"LIVEditor-14B: Lightning Unified Video Editing via In-Context Sparse Attention","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-01T00:24:30.573122Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.04569"},"observation_digest":"sha256:69e169ecfb183335dd0cc97272001835ea4dd08381637bd9254b6f8fc3f3a78f","observation_id":"56e971bf-0b8b-4923-a3ac-5d1367843215","resolution":{"observed_at":"2026-07-01T00:25:09.286031Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.06057","last_updated":"2026-05-12T04:22:34Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T11:41:54Z","title":"FalconGEMM: Surpassing Hardware Peaks with Lower-Complexity Matrix Multiplication","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T05:26:58.011502Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.06057"},"observation_digest":"sha256:359b05980961a7dee1378f384d250d2416cd4a6803a1fcede76cd0d5b35043bf","observation_id":"537c2d2c-9fba-4ac0-ab76-87addedc2bfd","resolution":{"observed_at":"2026-05-08T23:49:28.408465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.06057","last_updated":"2026-05-12T04:22:34Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T11:41:54Z","title":"FalconGEMM: Surpassing Hardware Peaks with Lower-Complexity Matrix Multiplication","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-13T07:24:26.619370Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.06057"},"observation_digest":"sha256:4ba407be5b961f248f06249cd5ffd73490d40d8ea25bb06141f3253318781b7a","observation_id":"5a196b4a-c9b4-436d-83cb-434da99bac61","resolution":{"observed_at":"2026-05-13T07:27:28.653903Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.10905","last_updated":"2026-05-14T17:37:37Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:46:01Z","title":"TLX: Hardware-Native, Evolvable MIMW GPU Compiler for Large-scale Production Environments","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-12T03:55:15.475044Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.10905"},"observation_digest":"sha256:5dbf332cb66d42a937602e6f4a97b98ce491c6122a4a96ab40e427345ee9e265","observation_id":"40594b1d-6e0a-4a18-8a35-30537b1fef5a","resolution":{"observed_at":"2026-05-12T03:56:21.753930Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.10905","last_updated":"2026-05-14T17:37:37Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:46:01Z","title":"TLX: Hardware-Native, Evolvable MIMW GPU Compiler for Large-scale Production Environments","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-15T05:08:56.760052Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.10905"},"observation_digest":"sha256:7aebd2f25cf33d3cead0f7028559e63f28ccc017e5dd11b64ceda8a1bfc67207","observation_id":"91d6c671-a8a9-4737-bbc1-f88afb905fb0","resolution":{"observed_at":"2026-05-15T05:09:44.735022Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.19269","last_updated":"2026-05-20T17:38:24Z","snapshot_observed_at":"2026-07-06T23:30:02.207108Z","submitted_at":"2026-05-19T02:30:43Z","title":"CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T07:19:22.751655Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.19269"},"observation_digest":"sha256:d71c1e422eea080f7f1ab0fabcd6e69a2f3348e8b04f5a8818c3ed567eea11ea","observation_id":"6c7d74bc-c8f8-45a8-b0ab-20281daa1a7b","resolution":{"observed_at":"2026-05-20T07:23:07.114467Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.19269","last_updated":"2026-05-20T17:38:24Z","snapshot_observed_at":"2026-07-06T23:30:02.207108Z","submitted_at":"2026-05-19T02:30:43Z","title":"CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T07:20:56.839167Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.19269"},"observation_digest":"sha256:fcfd0212d40c5def88e36be8a3da9357131563b04badb347eb007e42233477e2","observation_id":"93ac2fb3-711b-4f76-bae0-29f94ac07ca4","resolution":{"observed_at":"2026-05-21T07:24:02.576504Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.19652","last_updated":"2026-07-29T03:55:18Z","snapshot_observed_at":"2026-08-02T13:41:13.148990Z","submitted_at":"2026-05-19T10:42:29Z","title":"Characterizing Real-World Bugs in Tile Programs for Automated Bug Detection","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-05-20T04:38:27.237998Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.19652"},"observation_digest":"sha256:fb8826fc86da6db23b359bc06ae8ff6c5920fd4b827e6c601375d75c9a7c289b","observation_id":"c21491ab-3ddc-46bb-a448-fe137d2e39ee","resolution":{"observed_at":"2026-05-20T04:43:03.843036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-02T13:41:17.760532Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.19652","last_updated":"2026-07-29T03:55:18Z","snapshot_observed_at":"2026-08-02T13:41:13.148990Z","submitted_at":"2026-05-19T10:42:29Z","title":"Characterizing Real-World Bugs in Tile Programs for Automated Bug Detection","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:17.760532Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.19652"},"observation_digest":"sha256:c2bb9e7850944236c3fa2519ae38c7146b7fec8aebcfd32ccfa54552122dc91d","observation_id":"6ce1c360-ea1c-49b9-8306-377a0ca7282d","resolution":{"observed_at":"2026-08-02T13:41:17.760532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.25954","last_updated":"2026-05-25T15:29:49Z","snapshot_observed_at":"2026-08-01T23:32:04.047479Z","submitted_at":"2026-05-25T15:29:49Z","title":"Step-TP: A Grounded, Step-Level Dataset with Chain-of-Thought Reasoning for LLM-Guided Tensor Program Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T23:16:05.110912Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.25954"},"observation_digest":"sha256:ac362786c048eb07ddbdfbb79d85d14de091a334cfd8633c2d988162f17fcef9","observation_id":"7a082034-eb87-4900-ade6-1e19ba36e6be","resolution":{"observed_at":"2026-06-29T23:24:01.884689Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.29734","last_updated":"2026-05-28T10:29:01Z","snapshot_observed_at":"2026-08-02T06:59:49.356682Z","submitted_at":"2026-05-28T10:29:01Z","title":"HTAM: Hierarchical Transition-Attended Memory for Operator Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-29T07:26:46.105050Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.29734"},"observation_digest":"sha256:a6a7d2d41da16844783e64484d04ee261f478c07267479fe2456b9c1719e93ce","observation_id":"7891eb7e-4355-46d8-bdb5-d5cb3c2ae5ec","resolution":{"observed_at":"2026-06-29T07:33:14.028916Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2605.30325","last_updated":"2026-05-28T17:57:07Z","snapshot_observed_at":"2026-07-06T23:39:38.845840Z","submitted_at":"2026-05-28T17:57:07Z","title":"Veda: Scalable Video Diffusion via Distilled Sparse Attention","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T07:54:13.390911Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2605.30325"},"observation_digest":"sha256:0253f5917a2d65e6c70efca478fafab4e985c0f35f142177577dd72cde2abb81","observation_id":"d3a98175-31d8-48a8-88a2-c4677e270e17","resolution":{"observed_at":"2026-06-29T08:03:14.690543Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2606.13392","last_updated":"2026-06-11T14:23:41Z","snapshot_observed_at":"2026-08-06T06:40:14.278655Z","submitted_at":"2026-06-11T14:23:41Z","title":"MiniMax Sparse Attention","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-06-27T06:29:46.190303Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2606.13392"},"observation_digest":"sha256:f4e0b107ff54f7e6745566629547afeb26e95c65fb06fe0ea23eb7230a761772","observation_id":"60547d81-f204-43f3-a7cf-84d027d8203d","resolution":{"observed_at":"2026-07-03T15:28:34.099252Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2606.26344","last_updated":"2026-06-24T19:37:12Z","snapshot_observed_at":"2026-08-07T23:11:05.890145Z","submitted_at":"2026-06-24T19:37:12Z","title":"Axon: A Synthesizing Superoptimizer for Tensor Programs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-26T00:38:59.372894Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2606.26344"},"observation_digest":"sha256:ab02edc0f45b6418c1511729d5d3216ca9c9e5a04d64d4bf6c3845a8fd966430","observation_id":"2da31b37-9ccc-40f8-b8bf-e4513d30d686","resolution":{"observed_at":"2026-07-04T16:29:57.097811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":"2504.17577","doi":"10.48550/arxiv.2504.17577","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TileLang: A composable tiled programming model for AI systems","venue":"ArXiv.org","work_id":"d23477a7-29b7-478d-b57d-4a841906c2c6","year":2025},"citing_paper":{"arxiv_id":"2606.27153","last_updated":"2026-06-25T15:23:03Z","snapshot_observed_at":"2026-08-06T10:33:11.959253Z","submitted_at":"2026-06-25T15:23:03Z","title":"DMuon: Efficient Distributed Muon Training with Near-Adam Overhead","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T02:41:02.917064Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2606.27153"},"observation_digest":"sha256:a4227dc26c32e5e7165cd90ca7802c3f33f4580a49216de818be221f937b327f","observation_id":"9f40efc5-5a9f-4a6f-8efa-6fc841ebe4bc","resolution":{"observed_at":"2026-07-04T14:39:58.544586Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-07-12T09:35:12.908124Z","title":"arXiv preprint arXiv:2504.17577 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02584","last_updated":"2026-07-11T01:46:15Z","snapshot_observed_at":"2026-08-08T14:50:05.364337Z","submitted_at":"2026-07-01T02:44:10Z","title":"RotateAttention: RoPE-Aware Rotation and Range Rectification for INT4 Quantized Attention in Video Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-12T09:35:12.908124Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2607.02584"},"observation_digest":"sha256:8eca4dfd5172abbbb596ef0b80c0e93fe82c830d95a0ca9ae7dc8240a114c11c","observation_id":"477465c0-89ad-46ec-b53a-bd232bbb3bd6","resolution":{"observed_at":"2026-07-12T09:35:12.908124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-07-14T16:53:34.398685Z","title":"arXiv preprint arXiv:2504.17577 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02584","last_updated":"2026-07-11T01:46:15Z","snapshot_observed_at":"2026-08-08T14:50:05.364337Z","submitted_at":"2026-07-01T02:44:10Z","title":"RotateAttention: RoPE-Aware Rotation and Range Rectification for INT4 Quantized Attention in Video Generation","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T16:53:34.398685Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2607.02584"},"observation_digest":"sha256:077eaf15944380c7dd4a05b17cc5b012180aa8b248733c0970f20bb17cdc4cb1","observation_id":"8aabfc79-03de-404a-89e9-7ceb0285db45","resolution":{"observed_at":"2026-07-14T16:53:34.398685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-07-14T05:56:09.845073Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11262","last_updated":"2026-07-13T08:45:24Z","snapshot_observed_at":"2026-08-09T05:05:44.826966Z","submitted_at":"2026-07-13T08:45:24Z","title":"GPU-Tile-Sim: A Tile-Centric GPU Simulation Framework for LLM Hardware-Software Co-Design","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T05:56:09.845073Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2607.11262"},"observation_digest":"sha256:b00cbd7c31f961a028ac93ec82af6f770c5143a51cdd806e51fc27e5e7e03c7d","observation_id":"8235d1e2-b9a6-4916-aa12-3ec59d3e368c","resolution":{"observed_at":"2026-07-14T05:56:09.845073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-04T00:47:04.618034Z","title":"Available: https://arxiv.org/abs/ 2504.17577","venue":null,"work_id":null,"year":null},"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":28,"source":"pdf_text","source_observed_at":"2026-08-04T00:47:04.618034Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2608.00325"},"observation_digest":"sha256:f9917db611ef66e8cdfb73f3b30c0e7e019539953aa18515b1e845c76c24151d","observation_id":"d65e691a-ccc2-4f86-b295-5f52761c23f4","resolution":{"observed_at":"2026-08-04T00:47:04.618034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17577","snapshot_observed_at":"2026-08-06T13:04:14.167825Z","title":"arXiv preprint arXiv:2504.17577 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04956","last_updated":"2026-08-05T15:27:26Z","snapshot_observed_at":"2026-08-08T23:13:39.797567Z","submitted_at":"2026-08-05T15:27:26Z","title":"ContextMaster: Interactive Multi-Shot Video Creation via Fixed-Budget Sparse Context Routing","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T13:04:14.167825Z"},"links":{"cited_paper":"/paper/2504.17577","citing_paper":"/paper/2608.04956"},"observation_digest":"sha256:a7fd0789989bf296b715c8e19c43f1f7dea08e97fc2d46a407d65db410cad19f","observation_id":"7d12df1c-a8eb-4dbc-93cf-2a6139c56abe","resolution":{"observed_at":"2026-08-06T13:04:14.167825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.17577/citation-record","integrity":"/paper/2504.17577/integrity","json":"/paper/2504.17577/citation-record.json","paper":"/paper/2504.17577"},"outbound":[],"paper":{"arxiv_id":"2504.17577","last_updated":"2025-04-27T11:11:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T05:05:36.269081Z","submitted_at":"2025-04-24T14:08:49Z","title":"TileLang: A Composable Tiled Programming Model for AI Systems"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:2504.17577."}