{"as_of":"2026-08-11T00:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c7a9dd1501ebe20d06ea208ca709914a715d9890f90d62bc956299fdad2d48d","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T04:59:25.083991Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2502.03402/citation-record","integrity":"/paper/2502.03402/integrity","json":"/paper/2502.03402/citation-record.json","paper":"/paper/2502.03402"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-10T08:13:22.935121Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-08-09T04:59:25.028499Z","title":"Pienaar and Mehdi Amini and Uday Bondhugula and River Riddle and Albert Cohen and Tatiana Sh- peisman and Andy Davis and Nicolas Vasilache and Oleksandr Zi- nenko","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.028499Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:642564a0ee83fba1574abf080a577cc9a0e8a424c246237eac2a8846606a3604","observation_id":"7616ac76-3c74-4928-8ee1-af06b496625d","resolution":{"observed_at":"2026-08-09T04:59:25.028499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.00907","last_updated":"2019-04-03T19:54:50Z","snapshot_observed_at":"2026-08-08T17:17:04.768593Z","submitted_at":"2018-05-02T17:04:53Z","title":"Glow: Graph Lowering Compiler Techniques for Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.00907","snapshot_observed_at":"2026-08-09T04:59:25.032584Z","title":"Glow: A Graph Lowering Compiler Techniques for Neural Networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.032584Z"},"links":{"cited_paper":"/paper/1805.00907","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:637042e8b7c65651c1cec71ac59d70a657cfb25ecd06f1ade6ab33803ab5fe1a","observation_id":"b6ec8a27-70c8-4ec4-aa91-7b55bb90caaa","resolution":{"observed_at":"2026-08-09T04:59:25.032584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01703","last_updated":"2019-12-03T22:06:05Z","snapshot_observed_at":"2026-07-06T08:41:49.632205Z","submitted_at":"2019-12-03T22:06:05Z","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01703","snapshot_observed_at":"2026-08-09T04:59:25.036137Z","title":"Py- Torch: An Imperative Style, High-Performance Deep Learning Library","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.036137Z"},"links":{"cited_paper":"/paper/1912.01703","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:862ea5c0b22f458edbbe7706847e65b92364292232f13d034579eac3289e4c37","observation_id":"26322d95-720d-4b03-885e-178012a55df0","resolution":{"observed_at":"2026-08-09T04:59:25.036137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04799","last_updated":"2018-10-05T18:47:38Z","snapshot_observed_at":"2026-08-07T20:53:31.333665Z","submitted_at":"2018-02-12T20:49:34Z","title":"TVM: An Automated End-to-End Optimizing Compiler for Deep Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.04799","snapshot_observed_at":"2026-08-09T04:59:25.039964Z","title":"TVM: An Automated End-to-End Optimizing Compiler for Deep Learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.039964Z"},"links":{"cited_paper":"/paper/1802.04799","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:baf18223b1e391e214d4c7f21cef317518226b707389a3e81a733b3ed2fff30f","observation_id":"9707dee8-2db1-4358-b1bb-c75ab5493850","resolution":{"observed_at":"2026-08-09T04:59:25.039964Z","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-09T04:59:25.233414Z","title":"Tutorial: Scalar Evolution - Demystified","venue":null,"work_id":"d94010e7-ec4d-4f3b-9f2a-4c1815a1a985","year":2018},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.043501Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:3b0b293ba6cc7c955650bf68f1c1a5eb21bee84c02dad457acbe8dcfdb9b1065","observation_id":"7efdf039-a5e2-4205-b559-a3780ece91a4","resolution":{"observed_at":"2026-08-09T04:59:25.236234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.223009Z","title":"Technical Talk: Tensor Evolution- An ML Graph Optimization Technique","venue":null,"work_id":"cca06574-f43d-4f8e-89eb-90a213152bf9","year":2023},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.047029Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:32476af52a36e0d1dc178f99e45e929e044fc3e0590c17c496b6b9cf8537dd0e","observation_id":"7c6476ea-ffd1-4779-966a-031586ef9706","resolution":{"observed_at":"2026-08-09T04:59:25.227036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.050656Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.050656Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:0cf2d215cc12aba94f497a1e83de8e7878a9433c7853748b359c8a9083d9b86f","observation_id":"664d8afe-343e-4096-b5f3-24e6a080a512","resolution":{"observed_at":"2026-08-09T04:59:25.050656Z","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-09T04:59:25.212871Z","title":"Gomez and Lukasz Kaiser and Illia Polo- sukhin","venue":null,"work_id":"ce28db28-747d-40f9-87c3-1fa73cc8af48","year":2017},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.053857Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:f76d6800202ba8f8145393446dfb5581032000a7a2934e65589d4c59e08cb0c0","observation_id":"b7345e53-890d-4f36-a61d-dafe837b4c1c","resolution":{"observed_at":"2026-08-09T04:59:25.217645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.202724Z","title":null,"venue":null,"work_id":"68133371-b2ea-412f-8534-5e81da92cf8a","year":1992},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.056904Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:93c7ee2cd3b0580b85427de5ac00c256277872efe49a72824ad52c59f556a9e5","observation_id":"b7b1af7c-0506-4c71-ba0b-b7f7a8e54d76","resolution":{"observed_at":"2026-08-09T04:59:25.206583Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.193122Z","title":"Computational Reduciblity, Wolfram Mathworld","venue":null,"work_id":"ba07abb7-0a59-4ed2-9e68-227bf9584d96","year":null},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.060072Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:f0d7e68daa7b7e7ee35a0634778e42892d1b06f8e38fe294b397dcc122a90867","observation_id":"addceb4f-2585-466b-8941-3aab779818f8","resolution":{"observed_at":"2026-08-09T04:59:25.196445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.184157Z","title":"On Computational Properties of Chains of Recurrences","venue":null,"work_id":"a6b021b6-092a-4f29-a5a2-f5945592c039","year":2001},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.066410Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:85fd4efdda5db5805920d5f52c6e09f1582d82314222c841c1072a2d79141e81","observation_id":"245eb14f-42a4-4ef7-83a5-d328119493b0","resolution":{"observed_at":"2026-08-09T04:59:25.187535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.073231Z","title":"Ragan-Kelley, C","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.073231Z"},"links":{"cited_paper":"/paper/1802.04730","citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:f7a1fc9572945f6ef3dfb1009b8c440c77bef41b3d360f4e9d5fddeb33f1f1f9","observation_id":"32c00aa9-48ca-435b-97e0-0baccd8a30d4","resolution":{"observed_at":"2026-08-09T04:59:25.073231Z","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-09T04:59:25.174554Z","title":null,"venue":null,"work_id":"0f9b0eb4-17ee-45a1-924b-4eb92ebec717","year":null},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.076716Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:1d6e3019654dc90a5f9ee0b7dd293b88db6e4d5cb36cd4558b18fe61a0e0c017","observation_id":"97e4c737-3080-4e9e-803b-4d6aef97914d","resolution":{"observed_at":"2026-08-09T04:59:25.177624Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.163638Z","title":"Chains of Recurrences - a method to expedite the evaluation of closed-form functions","venue":null,"work_id":"2a823e6e-8681-4632-9e0b-04be19fc33d2","year":1994},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.080230Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:319f40274ed3225319afb0262273496c437a08b0c59c3fb3706324481217d0d4","observation_id":"dfe011fb-2f86-4e5d-871c-81707585ba40","resolution":{"observed_at":"2026-08-09T04:59:25.167533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T04:59:25.151432Z","title":"Lethin and Allen Leung and Beno ˆ ıt Meister and P´ eter Szil´ agyi and Nicholas Vasilache and David Wohlford","venue":null,"work_id":"c0a7d2ed-6797-4e82-945d-10d6c98e327d","year":2008},"citing_paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T04:59:25.083991Z"},"links":{"citing_paper":"/paper/2502.03402"},"observation_digest":"sha256:5aae227b3a2c07f8c4b5dae3bd94b09110d33f2d0596f582d6816250fd3134ef","observation_id":"c3c73bca-7616-4540-982e-9a8f21825c73","resolution":{"observed_at":"2026-08-09T04:59:25.156737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.03402","last_updated":"2025-02-07T16:07:14Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-10T07:46:57.856888Z","submitted_at":"2025-02-05T17:43:17Z","title":"Tensor Evolution: A Framework for Fast Evaluation of Tensor Computations using Recurrences"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2502.03402."}