{"as_of":"2026-08-13T04:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4001c2540a2524e2ac81926b59ee10557daa8af66a1127f024cf62624ad803bd","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:18:02.043090Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.22169/citation-record","integrity":"/paper/2506.22169/integrity","json":"/paper/2506.22169/citation-record.json","paper":"/paper/2506.22169"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:57.168913Z","title":"Antman: Dynamic scaling on gpu clusters for deep learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.168913Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:1579a69953b66048b688d9fc2d3927fb70a0b70cba5afebdfe1a196219e587f6","observation_id":"bbecee42-bc13-46f1-92d9-93486ec9e986","resolution":{"observed_at":"2026-08-06T22:17:57.168913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:57.209280Z","title":"Whale: Efficient giant model training over heterogeneous gpus,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.209280Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:dee67186e07002fd7ce0838147ebc035cdb40a71e74112475ac92b6ebbd51c20","observation_id":"1185e513-39cc-4cef-9cdb-7eaecf1325c5","resolution":{"observed_at":"2026-08-06T22:17:57.209280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:09.306931Z","title":"Mpmoe: Memory efficient moe for pre-trained models with adaptive pipeline parallelism,","venue":null,"work_id":"345f0c62-08cf-46b6-a2e0-14300d183953","year":2024},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.265068Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:96f78cbc4dfbb51c902e1f6395e3a4ae335db881644562a0f8c937a405840b2b","observation_id":"c7e8f312-35ea-4203-b8ea-bf9f81a6929d","resolution":{"observed_at":"2026-08-06T22:18:09.420985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:09.060110Z","title":"Redundancy-free high-performance dynamic GNN training with hier- archical pipeline parallelism,","venue":null,"work_id":"c97a2ce4-c05c-439c-ad78-a7e6771d37d9","year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.366815Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:b066334796ef6d01856f1256f8e59702c42b5458019ea466ed90985d1ac92987","observation_id":"76aae5cd-6491-4bda-8d2e-1532eca578ce","resolution":{"observed_at":"2026-08-06T22:18:09.191149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.895553Z","title":"Chimera: An analytical optimizing framework for effective compute-intensive operators fusion,","venue":null,"work_id":"2cac8817-d227-46aa-a8ce-8331b9ef1db5","year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.415899Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:f202ad5a252a45cd96d02846fb8c9dc18c8111d634ac123df8a034983ec83b02","observation_id":"11ae06a4-6f9f-4b71-b3a3-30d625fc11a2","resolution":{"observed_at":"2026-08-06T22:18:08.976798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.746685Z","title":"Dnnfusion: accelerating deep neural networks execution with advanced operator fusion,","venue":null,"work_id":"4dfa94fd-abf3-4253-95d9-d16e35f02555","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.516353Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:7b40efecb4d7833415a1ef85b40d72d00418b9a94a4a7228a7aa6466febd2ec2","observation_id":"40d23f88-78ec-45c4-a560-a1071ee9986e","resolution":{"observed_at":"2026-08-06T22:18:08.820890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.575440Z","title":"Astitch: enabling a new multi- dimensional optimization space for memory-intensive ML training and inference on modern SIMT architectures,","venue":null,"work_id":"17f22f46-6c0f-4bf2-85dc-32ef72aa1c90","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.599031Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:91204625c8f4fa175e18a9aae15af294c0430bd4467cda98cf513f559eac296c","observation_id":"e259b4ca-baa6-4ae6-8110-70c333860490","resolution":{"observed_at":"2026-08-06T22:18:08.657288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.411978Z","title":"Nvidia cublas","venue":null,"work_id":"e314739f-71cf-47d0-940a-fd8ff012e1d8","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.686091Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:ea86690fa0250520545a6bad27aac7a5647ba240094582bc3a901e769c7feb42","observation_id":"89b07b5c-2f64-422d-8bca-4e012988ba5c","resolution":{"observed_at":"2026-08-06T22:18:08.480013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.257620Z","title":"Nvidia cudnn","venue":null,"work_id":"5d2775eb-2dd9-4302-9a68-523d3c8e51de","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.794966Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:3cf4d88efcd910ff0010d9fb9bcecbc408e3a7a54e35c9ade7a096044278a73c","observation_id":"a7463e97-cdba-46a5-8226-b6c0b1eb8fbb","resolution":{"observed_at":"2026-08-06T22:18:08.320639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:08.043011Z","title":"Nvidia cutlass","venue":null,"work_id":"a2b5f8f2-135a-4043-b4f8-770c088b847d","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.833125Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:cf50d2b57254c648213bf3fde075680f776bb4a8e4d4028180081e2fec5297d3","observation_id":"854fd778-21d7-419f-9b60-aab00d04dcfb","resolution":{"observed_at":"2026-08-06T22:18:08.146636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.921605Z","title":"Nvidia tensorrt","venue":null,"work_id":"d43bb5d4-4992-4707-9d61-4b55aa3223b5","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:57.951859Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:fd338c1c85be54aef0b46d2ce442f23a46dd6ef158b236578acbd37a8a074a46","observation_id":"ede060d9-800d-4524-8bb7-0330a19fc813","resolution":{"observed_at":"2026-08-06T22:18:07.966648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.821787Z","title":"Mpipemoe: Memory efficient moe for pre-trained models with adaptive pipeline parallelism,","venue":null,"work_id":"5a493556-7e40-43de-ad31-322ca3a44140","year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.032881Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:dd8be7e290cd98744e4d0c705c031b81d5d66f61f04a35470b3651ea9aaa1c80","observation_id":"42a04fc8-f71d-47df-9713-a4516b44d7fa","resolution":{"observed_at":"2026-08-06T22:18:07.873222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.709479Z","title":"Ansor: Generating high-performance tensor programs for deep learning,","venue":null,"work_id":"4d88ad2b-964e-4acd-b910-104a5f4d3f7f","year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.151591Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:e3b45d1b7347b81840eec36d1c2931087d4f6c27aa4f456e11adcc4008509f08","observation_id":"3d5b6d4f-535c-4e2b-b2b8-d076fe0ae1d1","resolution":{"observed_at":"2026-08-06T22:18:07.739342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.597058Z","title":"Learning to optimize tensor programs,","venue":null,"work_id":"579f2136-ad49-4d47-82f2-7ce043e6976a","year":2018},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.210833Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:ab379ee8bc4cb5442d28f4eefff6086ffa96a461559e15a3a518e16dc2998c13","observation_id":"91b5adab-a47a-4d82-8ab8-b8ac17f1de39","resolution":{"observed_at":"2026-08-06T22:18:07.636632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.473703Z","title":"Tiramisu: A polyhedral compiler for expressing fast and portable code,","venue":null,"work_id":"dc722299-e3f1-4ce9-af84-1242762d5b95","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.354573Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:b232cadecbffb04594e91f4f868408869288a00d3de0de48143377ad6385285a","observation_id":"db245a2a-f1fb-427a-92c9-9fe5077cb374","resolution":{"observed_at":"2026-08-06T22:18:07.509586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.366824Z","title":"Astra: Exploiting predictability to optimize deep learning,","venue":null,"work_id":"e2202d57-6495-478a-810a-a92fbb76860e","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.407201Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:712cbc8a3999e209a87867b100990789a069adf3e4fa9c7862608e3697cc98eb","observation_id":"14913f6e-2781-4798-af21-dc23ad56e7cf","resolution":{"observed_at":"2026-08-06T22:18:07.418515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.263752Z","title":"TASO: optimizing deep learning computation with automatic genera- tion of graph substitutions,","venue":null,"work_id":"5bf63f0c-fbed-4c1f-8d9b-61ffa59efbf7","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.533271Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:52b02d0eb64c33e270b210eef0612bc714a27cbd0b9d4d76de69ab3b4f37e8d9","observation_id":"c94434b6-7232-405f-baa9-59cba381aaac","resolution":{"observed_at":"2026-08-06T22:18:07.317022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.165340Z","title":"Scalable kernel fusion for memory-bound GPU applications,","venue":null,"work_id":"c0bc0322-801e-4802-8afb-6d42bd6ed206","year":2014},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.593356Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:be0f30ac099d57f50220ec45b82fa1ccd5d0649bdd0c5497413f8d75f6b7b5c3","observation_id":"f5de12cf-1279-4361-b77d-755584ea987a","resolution":{"observed_at":"2026-08-06T22:18:07.197903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:07.051066Z","title":"AKG: automatic kernel generation for neural processing units using polyhedral transformations,","venue":null,"work_id":"9a6f3af3-d1b6-4b92-95b9-1af6cd2e908f","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.722719Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:f4ff5ce148e1e6a8d976c47a02492a40495c01c10890721dca6a659ae19e4f8b","observation_id":"d9eef3ca-6525-4084-b69c-59a27eeebd11","resolution":{"observed_at":"2026-08-06T22:18:07.097573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04730","last_updated":"2018-06-29T00:16:36Z","snapshot_observed_at":"2026-08-07T06:36:37.208888Z","submitted_at":"2018-02-13T16:53:01Z","title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04730","snapshot_observed_at":"2026-08-06T22:17:58.793850Z","title":"Tensor comprehen- sions: Framework-agnostic high-performance machine learning abstrac- tions,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.793850Z"},"links":{"cited_paper":"/paper/1802.04730","citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:241349ca1416d0bdadc2e90ad31ba50c05c35bc7f25da7aa5e1dec7e3cc1767e","observation_id":"38be9a61-80d0-4911-a323-514c7c633aba","resolution":{"observed_at":"2026-08-06T22:17:58.793850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.943167Z","title":"Tensorflow xla","venue":null,"work_id":"1060bb1e-73e5-4611-a637-2f2aceef56d1","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.865681Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:8d108f724859a748ae715872b1c66f206ae7e56a4008abfc9ec889b96191ea58","observation_id":"457af5e1-b481-43ce-89ec-6851188d1565","resolution":{"observed_at":"2026-08-06T22:18:06.981353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.837434Z","title":"Tvm: An automated end-to-end optimizing compiler for deep learning,","venue":null,"work_id":"d40adbb1-729b-4f32-a276-8d3043598865","year":2018},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.918888Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:eeff517907e76669ee8301bf5678a169ae6ffdd799bbb002836b2b1c52a6d1ad","observation_id":"7afa9ddf-2509-4e84-b5ad-b541e46d58f9","resolution":{"observed_at":"2026-08-06T22:18:06.886879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.747198Z","title":"Attention is all you need,","venue":null,"work_id":"8d003a5f-2a28-4c7a-952e-6217a7c1ec14","year":2017},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:58.968018Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:004ed123fda594ddbbb1f8044eed56c2802cfb76d15e038380ebf1b70bd8c1bb","observation_id":"5424f76d-c5aa-42d5-b1b3-97d91c422677","resolution":{"observed_at":"2026-08-06T22:18:06.779195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:59.047371Z","title":"Xgboost: A scalable tree boosting system,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.047371Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:2e712e770c909ffca557f297572602da982d0fe8e8a81e23bf331bd676eb793e","observation_id":"84e453b0-3c1d-4654-aae4-9982a97cf419","resolution":{"observed_at":"2026-08-06T22:17:59.047371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.632686Z","title":"Bolt: Bridg- ing the gap between auto-tuners and hardware-native performance,","venue":null,"work_id":"b1433134-1d08-4ed8-8b86-a3d122c72d60","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.129464Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:3c7f3592c0280917569dfd47654fa114ca98ab745d936875575b337f99c277e1","observation_id":"9e7916d3-35bf-449d-b27a-866054634b0a","resolution":{"observed_at":"2026-08-06T22:18:06.663284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.483564Z","title":"Pytorch: An imperative style, high- performance deep learning library,","venue":null,"work_id":"4e8e6420-2e70-4438-8830-fd5a2269cc16","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.215230Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:005d3c4dc480325eee808f792c85facab08234190843c704d8968b63aa430aa1","observation_id":"050e6687-95bb-44a7-9320-6e67ea74da55","resolution":{"observed_at":"2026-08-06T22:18:06.542281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.337654Z","title":"Bytetransformer: A high-performance transformer boosted for variable-length inputs,","venue":null,"work_id":"4ee0fbe9-e402-4f9e-979a-7795c675b7b2","year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.305175Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5ad3a3e677c033b1814b287aa37345d6d3163565251bca1f1d30aad08ad135cd","observation_id":"c85a5a73-1353-4154-a185-c9d99004c0dc","resolution":{"observed_at":"2026-08-06T22:18:06.399045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.169031Z","title":"Raptor-t: A fused and memory-efficient sparse transformer for long and variable-length sequences","venue":null,"work_id":"5bc491d3-b30e-4521-b67d-0e076092372d","year":2024},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.403654Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:b9f65d776c6531364bf56c99f3be6df16bf26cd54ebe17e351494781c8e6687a","observation_id":"52519be3-2c40-4494-9246-47f7201e5034","resolution":{"observed_at":"2026-08-06T22:18:06.244303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.10924","last_updated":"2021-12-17T07:05:38Z","snapshot_observed_at":"2026-08-03T20:33:06.414779Z","submitted_at":"2020-09-23T04:00:53Z","title":"FusionStitching: Boosting Memory Intensive Computations for Deep Learning Workloads","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.10924","snapshot_observed_at":"2026-08-06T22:17:59.486067Z","title":"Fusionstitching: Boosting memory intensive computations for deep learning workloads,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.486067Z"},"links":{"cited_paper":"/paper/2009.10924","citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:7575678dace60e7e8bacdf5ece6e9d08415e8dcc74d44dd7814bcf1ec0b79f35","observation_id":"a8893b13-17ce-4513-b995-54b4b8c4b4f1","resolution":{"observed_at":"2026-08-06T22:17:59.486067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:06.009837Z","title":"Flashattention: Fast and memory-efficient exact attention with io-awareness,","venue":null,"work_id":"f96b679d-c8b1-4d58-b90f-42073ed1533b","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.583398Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5c98ad61c3b07a28eb9c023d362af5b975024b6f2543b6e013687737fa6b6cb3","observation_id":"80b96ac1-79d9-4651-aad5-108bd532935a","resolution":{"observed_at":"2026-08-06T22:18:06.091515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-06T22:17:59.630141Z","title":"Huggingface’s trans- formers: State-of-the-art natural language processing,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.630141Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:63adeeda23803cb33bdcc03c126dea01c25063fc4696456e6dfaab2be9022f89","observation_id":"9101e053-b75b-409a-a3e4-5492ca3005d7","resolution":{"observed_at":"2026-08-06T22:17:59.630141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-06T22:17:59.732866Z","title":"Flashattention-2: Faster attention with better parallelism and work partitioning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.732866Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:96101d0eee03b1544ebc9bb3019f57de3cf30ad929df11dd68f47a67d6d5a325","observation_id":"d6c552ae-5e74-433f-915f-bd4584307700","resolution":{"observed_at":"2026-08-06T22:17:59.732866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.828803Z","title":"Hidet: Task-mapping programming paradigm for deep learning tensor programs,","venue":null,"work_id":"6c0b671b-f53f-46bc-8afe-7f096c39c48e","year":2023},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.806635Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:e4be6d25b4463fcf55e8b48c8032131b127496db0430e33d1a43bc4b5b07d6f1","observation_id":"7fb5eb6b-639c-4275-b1a8-fa9b663f7e1c","resolution":{"observed_at":"2026-08-06T22:18:05.913727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.645783Z","title":"Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines,","venue":null,"work_id":"6f54e1d4-5e49-422f-977f-6df0c2f281c7","year":2013},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T22:17:59.979562Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:a3c8b24ef4aa8a70914e45031e5a92dd3f23594dcdb59db088daeaebdbb41820","observation_id":"130c99b9-848a-486b-85f1-cd4af975f668","resolution":{"observed_at":"2026-08-06T22:18:05.733116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.469427Z","title":"Flextensor: An automatic schedule exploration and optimization framework for tensor computation on heterogeneous system,","venue":null,"work_id":"c286af71-9067-432c-8300-6b803bc28cb3","year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.054589Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:31e334bc49fd9bcd2e34178417bc46dfd7ac6f01842294b9777eb0d535e6038a","observation_id":"dddcb304-b24e-4fa5-9785-ddf91d1a97cb","resolution":{"observed_at":"2026-08-06T22:18:05.542898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.309856Z","title":"AMOS: enabling automatic mapping for tensor computations on spatial accelerators with hardware abstraction,","venue":null,"work_id":"9c585ed0-124f-4a64-b0bb-05d7a514ee5a","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.135867Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:b0bd764190e26601b06ad45a6f9c976efb8c1dd9a224a6502124abcca82f19d0","observation_id":"ec7a60cc-8591-444a-9d5a-12055042f1e7","resolution":{"observed_at":"2026-08-06T22:18:05.391723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:05.105664Z","title":"Atomic dataflow based graph-level workload orchestration for scalable DNN accelerators,","venue":null,"work_id":"c325cc2d-00f8-4f2c-a484-ce40b5bf0364","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.213362Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:60a7b5d379e518b85594a7dbec6ab1408f156b27e44b915a052939a5f73defe8","observation_id":"30278ef8-a73e-4540-81af-cc31728684d1","resolution":{"observed_at":"2026-08-06T22:18:05.211211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.966628Z","title":"ROLLER: fast and efficient tensor compilation for deep learning,","venue":null,"work_id":"fe48c1a3-caff-41e0-b5f4-7517427398b9","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.316360Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:dbf9c6d7a78685c7fff4303f3b1dc71ef117f729379e2a829a7df3eae6324237","observation_id":"27a2a5c7-9b64-443a-89ee-aabfae0d6714","resolution":{"observed_at":"2026-08-06T22:18:05.031888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.793119Z","title":"Triton: an intermediate language and compiler for tiled neural network computations,","venue":null,"work_id":"2edd6f88-b05e-4097-9e13-151fccbdc9b8","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.357498Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:6b5a745f1393f035389821d2a1f93e9abb30f7f543fffc1b9120695f1b393ed8","observation_id":"2fdbc928-81b9-4ac9-9368-a2d7a8301d09","resolution":{"observed_at":"2026-08-06T22:18:04.848685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.638780Z","title":"Nvidia, parallel thread execution isa","venue":null,"work_id":"242514ef-cc88-4fd9-967d-9b83e72901aa","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.444478Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5f3d85d7a0e21ed9d7aba6a5510e38a9db9dba5c1f3c6df148531954a66b83e7","observation_id":"08894df8-1172-4a27-b829-9d08d8d64032","resolution":{"observed_at":"2026-08-06T22:18:04.710568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.471163Z","title":"Tensorflow: A system for large-scale machine learning,","venue":null,"work_id":"9ddaf0b0-2289-4a8d-9a0d-6f2868e3712c","year":2016},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.502303Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:397ec8975784c3456c62da52b08e431840e5a781ee607e2aa80d01541d9785f9","observation_id":"62cbf713-64c8-4336-8933-2d8a24b8989a","resolution":{"observed_at":"2026-08-06T22:18:04.524401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.341636Z","title":"Available: https://onnx.ai/","venue":null,"work_id":"1da78750-c5d2-413d-b2a5-3f0130a2245f","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.572160Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:935fca1616925d5ab158ec7293de40a3559a491e475d15836b3b19b3e841339c","observation_id":"c63e8000-3b1c-4edf-a171-006af5dcddbb","resolution":{"observed_at":"2026-08-06T22:18:04.413135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:00.661573Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.661573Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5cd11432f4e3da601c03813a33aba439a049f16616fac30ded3e894bcde0ee7a","observation_id":"39f3acaf-587b-43bb-8c80-425fa8f42d4d","resolution":{"observed_at":"2026-08-06T22:18:00.661573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.213385Z","title":"An image is worth 16x16 words: Trans- formers for image recognition at scale,","venue":null,"work_id":"87ef3fa9-837a-4c30-93f3-ab1eb97171d7","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.750686Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5111da67c1b38b7df9373f674dcdf663c62557656ef472f55c633c45fb13114e","observation_id":"efe2bd7b-2c42-4c2c-9ac6-138960b9a649","resolution":{"observed_at":"2026-08-06T22:18:04.281331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:04.056155Z","title":"Mlp-mixer: An all-mlp architecture for vision,","venue":null,"work_id":"d9733e40-13f3-477d-8eb9-4aa35e28d466","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.840062Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:3cd1f7d860b9b12273391ceb140c45f641e42f76efa895a2ba258b8987b39897","observation_id":"79551829-ecc3-4148-b775-011159bdbf85","resolution":{"observed_at":"2026-08-06T22:18:04.147790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.08368","last_updated":"2019-08-24T23:30:04Z","snapshot_observed_at":"2026-08-07T19:44:53.345712Z","submitted_at":"2019-04-17T17:08:23Z","title":"Relay: A High-Level Compiler for Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.08368","snapshot_observed_at":"2026-08-06T22:18:00.935149Z","title":"Relay: A high-level IR for deep learning,","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:00.935149Z"},"links":{"cited_paper":"/paper/1904.08368","citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:7575ada18d964f5bc165a796d570332a8f3e65873cc33558f4257a9ac582f09e","observation_id":"7c05d49d-2121-4510-ae70-e5ae4570359f","resolution":{"observed_at":"2026-08-06T22:18:00.935149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.906595Z","title":"Intel oneapi deep neural network library","venue":null,"work_id":"b0dc6301-9096-4a67-aaf7-509f2d691c1f","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.019537Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:5cc137a87894cc8726b1229c7f4dcfb1ecdb24ecd6a209260b40f6084ab7a46e","observation_id":"0e018dfd-7f5f-40ca-bc6f-70790c7bd1ce","resolution":{"observed_at":"2026-08-06T22:18:03.968816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.733975Z","title":"Intel oneapi math kernel library","venue":null,"work_id":"23f5cfff-a9e2-425f-9279-79d4600ba4fe","year":null},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.121244Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:63391e6a8fe64c61ae117ca818555c09976781be9ff51171545b6c7aea644797","observation_id":"77abbbf7-6fe3-4324-be58-7417b2784e14","resolution":{"observed_at":"2026-08-06T22:18:03.782986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.576381Z","title":"Rammer: Enabling holistic deep learning compiler optimizations with rtasks,","venue":null,"work_id":"24dd52d9-3c4b-4d8c-94d1-d7ba4579ae0a","year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.198588Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:2ff065f3788b7750732d0a75c96f7dfbf2a06cd12b01a9445842f5094bf9376f","observation_id":"39b837f5-2f97-48a1-b8fd-e28022d2d695","resolution":{"observed_at":"2026-08-06T22:18:03.657856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.421097Z","title":"Accelerating deep learning inference with cross-layer data reuse on gpus,","venue":null,"work_id":"ab0da8b4-9c1f-41e1-b923-7cd8901aa3b7","year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.301835Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:155992732b31350ec948b944514111fddb670c7ad59d081a85f27925f11d8e41","observation_id":"972a4a4e-d287-4515-8b4d-97565b441020","resolution":{"observed_at":"2026-08-06T22:18:03.481663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.265140Z","title":"Efficient GPU spatial-temporal multitasking,","venue":null,"work_id":"9d9f5e94-08de-46e4-a750-9857804ce175","year":2015},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.414094Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:ef396edd6f40b3aa51f5b768248e1ca1bca9ed67dc404f4e61f5afedf4ee8cfa","observation_id":"27e8c3fb-6275-463b-aad3-ba5f8a7e2c85","resolution":{"observed_at":"2026-08-06T22:18:03.325638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:03.129955Z","title":"On optimizing machine learning workloads via kernel fusion,","venue":null,"work_id":"ffd7e971-ab9d-4f69-ba56-42536fe09c3e","year":2015},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.537926Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:c5d6a9cb38db350e17f0d3cb9712d55506a979c28d56f107cc2c057e2e6e56b9","observation_id":"80618246-eca4-47aa-8edc-703189e895f5","resolution":{"observed_at":"2026-08-06T22:18:03.186137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.956820Z","title":"Learning to optimize halide with tree search and random programs,","venue":null,"work_id":"08bbba99-4b02-48fc-a11c-b7e2e05e94eb","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.643595Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:aafe105585c07db43fae3888f353bb5d5e178f35981c39dcd3d407db0e972898","observation_id":"fcdd5e74-8860-4a8e-a15c-3728e6ee456e","resolution":{"observed_at":"2026-08-06T22:18:03.032273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.814669Z","title":"Nimble: Efficiently compiling dynamic neural networks for model inference,","venue":null,"work_id":"e93a9b34-8fe2-495c-bba6-30f9370d47aa","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.732170Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:aab383ebf6fbb81c45857bec78cbb4984d47e92423f14af4a4fd6a9cae7a65bf","observation_id":"3acc49c2-e698-4f4d-a533-d67a3ee08957","resolution":{"observed_at":"2026-08-06T22:18:02.874308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.681506Z","title":"DISC: A dynamic shape compiler for machine learning workloads,","venue":null,"work_id":"94a7c217-d04f-4515-88e2-3fc575facff2","year":2021},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.793959Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:022a1aa70c0280cd0df732166a9b3ee2f2d4b80037605eb81aebc58d093e91dc","observation_id":"40723419-b400-4c46-8dad-ebf01ffe234b","resolution":{"observed_at":"2026-08-06T22:18:02.743768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.549415Z","title":"Automatic generation of high-performance quantized machine learning kernels,","venue":null,"work_id":"646bb49e-c9bf-4381-a216-2a6f1c77f455","year":2020},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.864329Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:502b0755bb1ca54793be394fb5f989337a7bd9edb9463010d27cb9c0d9480009","observation_id":"f6faa016-543a-48fc-a467-ed5720274a01","resolution":{"observed_at":"2026-08-06T22:18:02.607381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.368671Z","title":"A code generator for high-performance tensor contractions on gpus,","venue":null,"work_id":"f974e408-3825-458c-b69b-0bc9741cea2c","year":2019},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:01.936505Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:ff519ae4fda691a7a26fc6214b6c13191b166003d2d18429a52b5baa47f6cbb2","observation_id":"5827d460-ad2e-4dfb-8d17-8b7fb5245746","resolution":{"observed_at":"2026-08-06T22:18:02.442784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:18:02.242498Z","title":"Neoflow: A flexible framework for enabling efficient compilation for high performance DNN training,","venue":null,"work_id":"f80afacc-c63e-40ac-a2de-f14245a4805c","year":2022},"citing_paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T22:18:02.043090Z"},"links":{"citing_paper":"/paper/2506.22169"},"observation_digest":"sha256:a4304fd3a08789e20195ee1b1af810f55efbbe0e78ebc80024bec52dfe9c39a6","observation_id":"671f0ec3-4e56-4dc6-9149-51edd5237477","resolution":{"observed_at":"2026-08-06T22:18:02.297777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22169","last_updated":"2025-06-27T12:31:24Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-06T22:07:19.919786Z","submitted_at":"2025-06-27T12:31:24Z","title":"MCFuser: High-Performance and Rapid Fusion of Memory-Bound Compute-Intensive Operators"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":49},"total_outbound_references":58},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2506.22169."}