{"as_of":"2026-08-09T15:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5eef50c7f42f3ac95922877d7f92434711fe9d6e52a01fcc92525bd0a35a822","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:01:55.476400Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T19:57:12.657341Z","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-04T20:40:07.671073Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"cited_work":{"arxiv_id":"2602.16707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.16707","snapshot_observed_at":"2026-08-04T02:40:09.452937Z","title":"E-graphs as a persistent compiler abstraction","venue":null,"work_id":"6293a096-b483-4ecc-9391-9269cc191122","year":2026},"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":22,"source":"pdf_text","source_observed_at":"2026-05-10T06:20:43.546684Z"},"links":{"cited_paper":"/paper/2602.16707","citing_paper":"/paper/2604.17364"},"observation_digest":"sha256:035ddf2ccd15f5c8a6a1f584a3d2a68e615b5898e1bde2047b6a0073629df49d","observation_id":"af2f08cc-9e8b-4e64-a43d-c51f39e7d8a0","resolution":{"observed_at":"2026-08-04T02:40:09.452937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"cited_work":{"arxiv_id":"2602.16707","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.16707","snapshot_observed_at":"2026-08-04T02:40:09.452937Z","title":"E-graphs as a persistent compiler abstraction","venue":null,"work_id":"6293a096-b483-4ecc-9391-9269cc191122","year":2026},"citing_paper":{"arxiv_id":"2606.25244","last_updated":"2026-06-24T00:02:38Z","snapshot_observed_at":"2026-07-06T23:59:42.289674Z","submitted_at":"2026-06-24T00:02:38Z","title":"Reading AI Model Compilation in MLIR Through the Lens of Formal Theories","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-25T19:57:12.657341Z"},"links":{"cited_paper":"/paper/2602.16707","citing_paper":"/paper/2606.25244"},"observation_digest":"sha256:753bf6d9cf5c8baf1fe81b8f4302f2e3b2bf6528c61071f6e5a2d959674f5eba","observation_id":"2db2fdfa-a8eb-45cb-8976-d20d3c31f713","resolution":{"observed_at":"2026-08-04T02:40:09.452937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.16707/citation-record","integrity":"/paper/2602.16707/integrity","json":"/paper/2602.16707/citation-record.json","paper":"/paper/2602.16707"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T06:01:55.361437Z","title":"GCC, the GNU Compiler Collection - GNU Project","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.361437Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:6c180a39ab9366992cd5e291c6b99b7c5c80e508e87d02efaf5b2b77a7bd6e6a","observation_id":"fa4dca16-dec2-4510-b1b0-f2e0e03cd455","resolution":{"observed_at":"2026-08-04T06:01:55.361437Z","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-04T06:01:55.366373Z","title":"Aho, Monica S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.366373Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:746f86ead30c40800abaca71e5bfb8efebba981eb8cb276bae3b19a733d7de46","observation_id":"1aa44d7f-6824-44bf-a760-34cefb5315ec","resolution":{"observed_at":"2026-08-04T06:01:55.366373Z","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-04T06:01:55.370215Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.370215Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:f9fbc581b4bea63b16f01abaf649615e283d5825068e54818fde9084621677fd","observation_id":"1ee9502e-a5fd-403d-8b83-24482f296ca0","resolution":{"observed_at":"2026-08-04T06:01:55.370215Z","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-04T06:01:55.374079Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.374079Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:0f33006f4e66231e64e86259196da90b2d2368869577e342433420c1e2a9ade5","observation_id":"f8555ec6-1ade-4281-8c93-5e4cd2042679","resolution":{"observed_at":"2026-08-04T06:01:55.374079Z","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-04T06:01:55.377678Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.377678Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:fc5acd9b84a232b80fafb0e6078999710166c522bb221f9b08ed75b13d11a5c8","observation_id":"e8a726b8-41d9-46ec-b2ef-0472e63352a8","resolution":{"observed_at":"2026-08-04T06:01:55.377678Z","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-04T06:01:55.385337Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.385337Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:a2c34ef9677ab0aa2fb9765750bba71d4c3b46bf50a2a8101a9a9cc0230e2330","observation_id":"38fcdd93-edb5-4df1-ad6c-434933fadd53","resolution":{"observed_at":"2026-08-04T06:01:55.385337Z","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-04T06:01:55.388720Z","title":"Constantinides, and Theo Drane","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.388720Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:1d845ee47f2a29c2e3a6aa582b3b42ebd88a721701125bb7e04466b4fdbf7f80","observation_id":"9fcd959c-9db1-4310-bc31-aa8063de1e62","resolution":{"observed_at":"2026-08-04T06:01:55.388720Z","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-04T06:01:55.392147Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.392147Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:7153ae5d5840284bf741df212ae3a713cc61338a98e8b9d181a3cfcb8fe8a9c9","observation_id":"39f49661-d3b6-4975-b3f3-558ac6669bf4","resolution":{"observed_at":"2026-08-04T06:01:55.392147Z","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-04T06:01:55.395419Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.395419Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:b2b686cbeb97279dd362857e0dea9bfcf0ab8b5260c49c4382e68df70f9fc5d8","observation_id":"82d242e5-1657-4ce1-8841-1304bae68dd2","resolution":{"observed_at":"2026-08-04T06:01:55.395419Z","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":"10.1007/978-3-540-73595-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"72496a29-5e84-4ca0-b9cc-22d3b426e3fb","year":2007},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.402578Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:8f74782c8a9559c5e970faa6e89b1d3fdeda9cd72674a70b591635a01704c9f1","observation_id":"f417f67e-a21e-4f16-9fc6-5d7484af91dc","resolution":{"observed_at":"2026-08-04T06:03:29.796790Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T06:01:55.409455Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.409455Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:1ddd797785ecdfb20b5edc15724fb63b94d447465c13147cf7e036f4c9cd2f9e","observation_id":"92d9510d-be5b-4aa6-bf02-5f902417c77f","resolution":{"observed_at":"2026-08-04T06:01:55.409455Z","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-04T06:01:55.412733Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.412733Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:9c6b683a1bd46a036b64114b513dd9da19534327b964e1d60b22b38b630383c6","observation_id":"7b3cc5e6-575d-408d-9a8a-0bdec9c2f627","resolution":{"observed_at":"2026-08-04T06:01:55.412733Z","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-04T06:01:55.416436Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.416436Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:760a40cbfc193ccc07a60e69dde8b78ae198bcad448fc2477e4ee713a0b4b2e0","observation_id":"dd4a5852-65f8-4144-8e45-647d70ea059f","resolution":{"observed_at":"2026-08-04T06:01:55.416436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.12816","last_updated":"2020-04-23T22:36:05Z","snapshot_observed_at":"2026-07-31T00:36:11.204598Z","submitted_at":"2020-04-23T22:36:05Z","title":"Zakharov-Ito equation and Generalized Heisenberg ferromagnet-type equation: equivalence and related geometric curve flows","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.12816","snapshot_observed_at":"2026-08-04T06:01:55.420420Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.420420Z"},"links":{"cited_paper":"/paper/2004.12816","citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:0d02244dcfd75ff2375a414b47ee91f5017f40b11379535029e6aff8b2458eda","observation_id":"e573a647-eff6-4985-8a89-1ea623a833f3","resolution":{"observed_at":"2026-08-04T06:01:55.420420Z","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-04T06:01:55.424394Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.424394Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:d6a257cbf95979dc6ff102e6822c0ff3baf3648ba0f7aa87ac713198ed4e34b4","observation_id":"0cdfdb33-be53-43e7-a5f9-7c2964458cdc","resolution":{"observed_at":"2026-08-04T06:01:55.424394Z","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-04T06:01:55.427888Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.427888Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:5b5fec9bdb0dd546670311a7073dbc296b848c7a0b9263e6ad1f1b80fa0890f4","observation_id":"74375599-fe2a-4ee3-aca0-d1747f1a5ab7","resolution":{"observed_at":"2026-08-04T06:01:55.427888Z","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-04T06:01:55.431348Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.431348Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:20a8823486d9c3caed1fab3ff755b5409044df35d32d77bacb83736d19200abc","observation_id":"f577c686-90c8-448d-8790-3d2202566720","resolution":{"observed_at":"2026-08-04T06:01:55.431348Z","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-04T06:01:55.434795Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.434795Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:67989fc150a54a37252594303b1c93fd9f5e1123ad784e3be8199577bf9c52f7","observation_id":"53d05a9d-6f36-44d0-858d-248a4de27a12","resolution":{"observed_at":"2026-08-04T06:01:55.434795Z","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-04T06:01:55.438220Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.438220Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:c74126df0aab5e087a0c9b407fa3b0b8b617084d365af0987472de29853538fb","observation_id":"be6e16bc-7a12-4f54-a77a-fd18a991eb7a","resolution":{"observed_at":"2026-08-04T06:01:55.438220Z","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-04T06:01:55.441445Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.441445Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:77bbb587ef56e688374cbca5b92d376000247c66231ab3e09300d05a2f97b019","observation_id":"05eecbbd-3d35-4309-9b44-24cc6aa13c48","resolution":{"observed_at":"2026-08-04T06:01:55.441445Z","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-04T06:01:55.444693Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.444693Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:095afc0c475d24ce11a0cb022555bf3e3a213fc36c7510b63afcfb3b3d690f92","observation_id":"9f8942e6-5e69-49d0-b4f4-7905342c70d2","resolution":{"observed_at":"2026-08-04T06:01:55.444693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.17042","last_updated":"2024-11-14T09:25:51Z","snapshot_observed_at":"2026-08-06T13:28:23.458075Z","submitted_at":"2024-08-30T06:47:32Z","title":"E-Graphs as Circuits, and Optimal Extraction via Treewidth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.17042","snapshot_observed_at":"2026-08-04T06:01:55.447894Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.447894Z"},"links":{"cited_paper":"/paper/2408.17042","citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:4a4c49f3183521f6d3ac9582514af1d99c16a8c6d8162e7085466ff237e1d8a1","observation_id":"855b4535-4273-47b6-af87-e0bd388af5c7","resolution":{"observed_at":"2026-08-04T06:01:55.447894Z","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-04T06:01:55.451420Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.451420Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:b3c4029bf4e0f00915d351dcfac4f5994506cfc81c25b93ca37b8192ae55b79c","observation_id":"69efbc82-df76-4926-996c-787d3109813d","resolution":{"observed_at":"2026-08-04T06:01:55.451420Z","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-04T06:01:55.454888Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.454888Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:10ebc60922515def04a03c091011a47eb21139694ce35b162212194e3bc0328f","observation_id":"9ceb06d2-0293-4ffb-b626-759cd36287eb","resolution":{"observed_at":"2026-08-04T06:01:55.454888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.03293","last_updated":"2022-02-07T15:31:59Z","snapshot_observed_at":"2026-08-04T09:08:27.390128Z","submitted_at":"2022-02-07T15:31:59Z","title":"Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.03293","snapshot_observed_at":"2026-08-04T06:01:55.458662Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.458662Z"},"links":{"cited_paper":"/paper/2202.03293","citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:f6f1a4cf58b15e78db9d993c917963be13618ec761b7ad9eb7b5bc482897ec8a","observation_id":"e4acfa3a-7fe1-454e-88a7-3ab30f5d667c","resolution":{"observed_at":"2026-08-04T06:01:55.458662Z","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-04T06:01:55.462310Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.462310Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:6b10c57a81811e5237a21c57f98a91cea021a22c948706e0025e356f898395b7","observation_id":"0f9f7508-cedc-484e-b2c4-f7ab8633df80","resolution":{"observed_at":"2026-08-04T06:01:55.462310Z","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-04T06:01:55.465919Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.465919Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:a32f500b1eeca03c4d290c5732e2fff3be2d4521fc4fb86369fcb6cbc8d2d2ff","observation_id":"b33c833d-02da-4ccc-bfb5-c26203863d43","resolution":{"observed_at":"2026-08-04T06:01:55.465919Z","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":"10.1145/3696443","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"2514a265-ded7-4a2f-8a60-e9c73a50eb14","year":2025},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.469343Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:bb002bffc6335937f6ab1ad8f3c7aa6682e00981181e8ff84db227dacdb24997","observation_id":"21c008ed-09ef-448d-8af7-4338fade1228","resolution":{"observed_at":"2026-08-04T06:03:29.298518Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T06:01:55.472995Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.472995Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:757072833249ba9b0e456b4b5f8e7a349deb4f24103319419def1b0d0378c198","observation_id":"5556d7a2-e1c1-4f3f-8148-65b92292d3ac","resolution":{"observed_at":"2026-08-04T06:01:55.472995Z","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-04T06:01:55.476400Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.476400Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:6f57a89fdcabdac2d073d2ef57a9141caf486c81d24e1935bd13b038aadcc4c1","observation_id":"7e7c4ad6-4647-414e-a033-b1043df79947","resolution":{"observed_at":"2026-08-04T06:01:55.476400Z","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":"10.1007/978-3-319-54292-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In Numerical Software Verification, Vol","venue":"Lecture notes in computer science","work_id":"670fa20c-85b9-4e1e-a8eb-0c0785a429a6","year":null},"citing_paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T06:01:55.398928Z"},"links":{"citing_paper":"/paper/2602.16707"},"observation_digest":"sha256:f82c2fa696833e53321d678b900d466ea0619e0b5f33f7773910c7591c50e1d5","observation_id":"082eb1ca-9ed0-45f1-bc28-95fab9c8a840","resolution":{"observed_at":"2026-08-04T06:03:30.058492Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.16707","last_updated":"2026-08-03T10:05:07Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-08T03:03:56.242631Z","submitted_at":"2026-02-18T18:56:52Z","title":"E-Graphs as a Persistent Compiler Abstraction"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 2 inbound Pith citation observations for arXiv:2602.16707."}