{"as_of":"2026-08-04T19:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad93e9e7cda240b7ee813a8a252ef2f571e66a820f3c9a4102ba0413286d699a","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:35:34.114963Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T15:17:07.579594Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2511.15000","last_updated":"2026-06-03T22:03:16Z","snapshot_observed_at":"2026-08-03T21:35:21.503237Z","submitted_at":"2025-11-19T00:50:20Z","title":"Bonsai: Compiling Queries to Pruned Tree Traversals","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-05-17T21:27:18.988469Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2511.15000"},"observation_digest":"sha256:df7a47fee9855e87722b32046c25eaec42ebbaf920c4f83bc2010a045faee746","observation_id":"05363a80-a215-4884-94fb-5cc85d6fe5fc","resolution":{"observed_at":"2026-05-17T21:30:18.403434Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-08-03T21:35:34.114963Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.15000","last_updated":"2026-06-03T22:03:16Z","snapshot_observed_at":"2026-08-03T21:35:21.503237Z","submitted_at":"2025-11-19T00:50:20Z","title":"Bonsai: Compiling Queries to Pruned Tree Traversals","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-03T21:35:34.114963Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2511.15000"},"observation_digest":"sha256:60e71f2a70f188385efea4c90d6f50e8ba6c9197dafaaf64dc2c0da06670f37d","observation_id":"c9b9af05-9ce0-4626-a628-ba521db078fe","resolution":{"observed_at":"2026-08-03T21:35:34.114963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2511.20782","last_updated":"2026-04-16T05:47:05Z","snapshot_observed_at":"2026-08-03T09:58:43.399286Z","submitted_at":"2025-11-25T19:19:31Z","title":"Optimism in Equality Saturation","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-17T04:31:39.927726Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2511.20782"},"observation_digest":"sha256:0ebe30cea3ff666906a497c48548d853ca156bd3fae91cfeeea1e6c2d6c861fb","observation_id":"4e749671-8d6b-4352-87a6-506f7977b3b2","resolution":{"observed_at":"2026-05-17T04:34:02.148411Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"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":46,"source":"pdf_text","source_observed_at":"2026-05-10T10:21:05.219519Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2604.14825"},"observation_digest":"sha256:e9867419d11cf77ba360e8b8a34e3cf828718f500ffcc60722893285d9a1cd5f","observation_id":"c818d529-e2aa-4b30-b9db-6adc91032321","resolution":{"observed_at":"2026-05-10T10:24:21.536700Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2604.17364","last_updated":"2026-04-19T10:21:26Z","snapshot_observed_at":"2026-08-03T23:12:29.429576Z","submitted_at":"2026-04-19T10:21:26Z","title":"LLM-Guided Strategy Synthesis for Scalable Equality Saturation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-10T06:20:43.546684Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2604.17364"},"observation_digest":"sha256:70f16ca870ab7890372b0a79f633e18a6c89dc4a49c80918ee823d5a807974fc","observation_id":"9e47ed48-c40d-4dc0-b9fe-361fed7759e9","resolution":{"observed_at":"2026-05-10T06:21:26.841115Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2605.19005","last_updated":"2026-05-22T01:08:52Z","snapshot_observed_at":"2026-07-06T23:29:47.081347Z","submitted_at":"2026-05-18T18:27:33Z","title":"Rewrite System Showdown: Stochastic Search vs. EqSat","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-20T08:21:37.465059Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2605.19005"},"observation_digest":"sha256:448137dae66fc5c8cc5add79cb507463b5bfbaaf6f5938f3fad3c9503112864e","observation_id":"cfe7a172-99af-4ec2-b9ae-716d5c88f60b","resolution":{"observed_at":"2026-05-20T08:23:08.686397Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2605.19005","last_updated":"2026-05-22T01:08:52Z","snapshot_observed_at":"2026-07-06T23:29:47.081347Z","submitted_at":"2026-05-18T18:27:33Z","title":"Rewrite System Showdown: Stochastic Search vs. EqSat","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T05:59:39.785230Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2605.19005"},"observation_digest":"sha256:aee95e896e439c9cf8b6c4b7ceadbc7754190e398f3d5bd38920255f3413c2d4","observation_id":"b8c6a86d-2315-4ae5-93ea-40dd73a14e58","resolution":{"observed_at":"2026-05-25T06:00:23.245070Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization","version":2},"cited_work":{"arxiv_id":"2101.01332","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.01332","snapshot_observed_at":"2026-07-02T15:17:07.579594Z","title":"InProceedings of Machine Learning and Systems","venue":null,"work_id":"ec1c64df-f3d6-4c16-8c87-a519484ceccc","year":2021},"citing_paper":{"arxiv_id":"2606.06747","last_updated":"2026-06-18T01:49:06Z","snapshot_observed_at":"2026-07-06T23:46:28.942186Z","submitted_at":"2026-06-04T22:01:30Z","title":"Tensor Algebraic Property Skeletons: Amplifying Property-Based Testing for AI Compilers","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T00:00:07.129336Z"},"links":{"cited_paper":"/paper/2101.01332","citing_paper":"/paper/2606.06747"},"observation_digest":"sha256:500d3f3e380d9b17b6f3f068c1eed90ed0979c7d3e740146b4b0dd2b3df8d16b","observation_id":"d6540d63-4d38-4494-b4a5-a550bd058fbf","resolution":{"observed_at":"2026-07-02T15:17:07.581156Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.01332/citation-record","integrity":"/paper/2101.01332/integrity","json":"/paper/2101.01332/citation-record.json","paper":"/paper/2101.01332"},"outbound":[],"paper":{"arxiv_id":"2101.01332","last_updated":"2021-03-17T15:05:06Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T10:30:01.663667Z","submitted_at":"2021-01-05T03:30:35Z","title":"Equality Saturation for Tensor Graph Superoptimization"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2101.01332."}