{"as_of":"2026-08-09T18:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c582f9be9df8fca3c2360095a1ad6338a29daeeab5a80f9bd6c620ba07e842ad","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:33:16.051595Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.06751/citation-record","integrity":"/paper/2502.06751/integrity","json":"/paper/2502.06751/citation-record.json","paper":"/paper/2502.06751"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:15.904508Z","title":"and Yahav, E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.904508Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:a478dcd9684d957b553e5ea3870e67f0fe6217256835729e49bfc978f369936c","observation_id":"399332e7-b3a9-42d1-8980-7c15a6b32323","resolution":{"observed_at":"2026-08-08T14:33:15.904508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07369","last_updated":"2022-11-30T19:11:11Z","snapshot_observed_at":"2026-08-09T02:19:27.431872Z","submitted_at":"2022-06-15T08:22:07Z","title":"DiffWire: Inductive Graph Rewiring via the Lov\\'asz Bound","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07369","snapshot_observed_at":"2026-08-08T14:33:15.907850Z","title":"Diffwire: Inductive graph rewiring via the lov\\'asz bound","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.907850Z"},"links":{"cited_paper":"/paper/2206.07369","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:fe4ab728b4aba41b2d7352a6dd2e6cc0a7b221c4128f379751b1c0f7686d157d","observation_id":"4bc32913-3967-4e49-bc17-6df3db97ffb1","resolution":{"observed_at":"2026-08-08T14:33:15.907850Z","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-08T14:33:16.410403Z","title":null,"venue":null,"work_id":"f6c7d3f7-dae4-457e-8ea8-c0b42076bcd3","year":2023},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.911173Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:f68a2c9ab78d6ea044ab9f5bbc4ca74c1be657f71454d2cdb4ead749812dfca3","observation_id":"9ac8b5b5-b1fd-49dc-97f6-850432e14429","resolution":{"observed_at":"2026-08-08T14:33:16.413198Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2406.04267","last_updated":"2024-10-24T23:12:55Z","snapshot_observed_at":"2026-08-03T12:15:52.358095Z","submitted_at":"2024-06-06T17:14:44Z","title":"Transformers need glasses! Information over-squashing in language tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04267","snapshot_observed_at":"2026-08-08T14:33:15.914184Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.914184Z"},"links":{"cited_paper":"/paper/2406.04267","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:8cd305c37ad0c4fa791f80bbaa16e362c97912581cf5d3c53444080beee98616","observation_id":"4db36c97-849e-496b-a3db-ce69159bb1f2","resolution":{"observed_at":"2026-08-08T14:33:15.914184Z","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-08T14:33:16.403056Z","title":"V., Monet, M., Pérez, J., Reutter, J., and Silva, J","venue":null,"work_id":"c1025be7-c72b-416a-b0f4-7aaebd4459dc","year":2020},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.917278Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:70094901a6b2800088e016e866d8694ae87aa2d9ce0ec832c108ca4b2ac62d5c","observation_id":"238cf614-b57b-48a4-8519-41684ab6b40a","resolution":{"observed_at":"2026-08-08T14:33:16.405754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-08T14:33:15.919869Z","title":"and Wang, Y","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.919869Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:ec09182e6179847ab25b12fe673737fedd96fc7c53efa5e1e936498b370fab60","observation_id":"09b6e296-c660-469f-afaf-c68360f07c8d","resolution":{"observed_at":"2026-08-08T14:33:15.919869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07966","last_updated":"2023-11-14T07:44:46Z","snapshot_observed_at":"2026-08-09T17:04:15.088399Z","submitted_at":"2023-11-14T07:44:46Z","title":"Higher-Order Expander Graph Propagation","version":1},"cited_work":{"arxiv_id":"2311.07966","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.07966","snapshot_observed_at":"2026-08-08T14:33:16.155090Z","title":"Higher-Order Expander Graph Propagation","venue":"cs.LG","work_id":"a4f95dc0-8a0b-4095-a274-33b1c8e66010","year":2023},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.923353Z"},"links":{"cited_paper":"/paper/2311.07966","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:100036d772a98396fe6a80c84cd1e2ee837010a0997171d8afed6e5ef0cad6f5","observation_id":"c8917387-9b64-4df0-aeb8-d42ff2b5e0b4","resolution":{"observed_at":"2026-08-08T14:33:16.158316Z","resolver_source":"local_arxiv","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-08T14:33:15.926444Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.926444Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:6dec3176258b297523ba8d1fa8ea003791b5a32a75e7cc851fd261082b2a3c54","observation_id":"0e758dda-d4a6-4591-948b-0e433b1baf52","resolution":{"observed_at":"2026-08-08T14:33:15.926444Z","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-08T14:33:16.391109Z","title":"and Grabowski,","venue":null,"work_id":"c5dfaa3d-0c2b-420e-8128-9c6b490beada","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.929030Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:e1088209fc508492965214d1078b7c330e50e7d208467d46778fa21cf6c67f2d","observation_id":"dabc7f11-5989-449f-95de-cfd80c2ee91c","resolution":{"observed_at":"2026-08-08T14:33:16.393767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.383605Z","title":"Expander graph propagation","venue":null,"work_id":"14864535-561a-4a29-b6b9-9fa79a9ec1a9","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.931617Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:d4c3b9813bfc4646fcd53956aed137682f5e72c7196c249af99b89e43a808bea","observation_id":"17d5f14f-7b5d-470f-8b59-c48f4432ba29","resolution":{"observed_at":"2026-08-08T14:33:16.386322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2206.10991","last_updated":"2023-09-06T06:58:11Z","snapshot_observed_at":"2026-07-06T13:23:29.012203Z","submitted_at":"2022-06-22T11:45:36Z","title":"Understanding convolution on graphs via energies","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.10991","snapshot_observed_at":"2026-08-08T14:33:15.934076Z","title":"P., Markovich, T., and Bronstein, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.934076Z"},"links":{"cited_paper":"/paper/2206.10991","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:7368de2474a8980baebefcf51282973c64aaedc44bfc24145cf4cfa38025631f","observation_id":"eb297e29-097c-4ec7-8e30-ffa7ffbe3757","resolution":{"observed_at":"2026-08-08T14:33:15.934076Z","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-08T14:33:16.374887Z","title":"K., Bronstein, M., Deac, A., Lackenby, M., Mishra, S., and Veli c kovi \\'c , P","venue":null,"work_id":"2bfd4f17-4e67-4344-8816-5addaa4e552b","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.937070Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:c90f8353bbe352105ff9bb557bd7b1bd2ff11ebfc9a8f3541d877aff94444fc1","observation_id":"f614cc9c-bbdc-42e0-9e8a-24e0939585d6","resolution":{"observed_at":"2026-08-08T14:33:16.378610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:15.940170Z","title":"On the evolution of random graphs","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.940170Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:51ef25b67b4837ed8d0bca60232e1f2d49a0c4f2ff453208b1546d11db3323a9","observation_id":"7cb3e4a5-ec1c-4173-975a-0efe46ff8f88","resolution":{"observed_at":"2026-08-08T14:33:15.940170Z","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-08T14:33:16.362781Z","title":"Speeding up random walk mixing by starting from a uniform vertex","venue":null,"work_id":"90c32cb1-8b85-406c-8223-9f1300840547","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.942648Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:32f4bf9b8384c3e8d3d2eb7291622211c227d76d0ad2537648958a7c43f57708","observation_id":"3e255e3d-927d-4f08-b9f7-df8060f32cc6","resolution":{"observed_at":"2026-08-08T14:33:16.366025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.355424Z","title":"and Weber, M","venue":null,"work_id":"4ec30b1a-9a54-4235-b034-ae2f527d7a23","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.944990Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:592d63744d7634408a48c42a23823ef432faec75abf0fe90c84133328c1f1298","observation_id":"2d4d74b4-0dbc-4d95-abab-e3fa7bbf9d50","resolution":{"observed_at":"2026-08-08T14:33:16.358023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:15.947748Z","title":"Diffusion improves graph learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.947748Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:1691b8a0af8b8956e632df93490e22fa4ab5cf90da86e2fa9d92074e7da7cf54","observation_id":"a6143c2a-b1e7-4895-9ff0-3692af0e7653","resolution":{"observed_at":"2026-08-08T14:33:15.947748Z","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-08T14:33:15.950462Z","title":"Theoretical limitations of self-attention in neural sequence models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.950462Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:b68d3854d705d137101467d636afe5f362e4f37efbea3edad5c54736bebd3fd3","observation_id":"bebc6444-21be-4b49-8674-c3878520baf8","resolution":{"observed_at":"2026-08-08T14:33:15.950462Z","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-08T14:33:15.953201Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.953201Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:4188f414b0007854255693b280908cf3ecc05c66f11be1bed9b3fe1c9660cc5b","observation_id":"6a4e2887-9e10-4e66-ab0f-1d75303909ac","resolution":{"observed_at":"2026-08-08T14:33:15.953201Z","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-08T14:33:16.335853Z","title":"Temporal graph benchmark for machine learning on temporal graphs","venue":null,"work_id":"522fe7f0-7a7b-4e14-aad5-fbee33ed5030","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.955586Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:c3bb70558fa24bcbf385b627e5c9864caa126ddd5148824f7b9c4ceea2e15349","observation_id":"97d699b2-0d68-4309-9e3e-7b1e7cfb0b45","resolution":{"observed_at":"2026-08-08T14:33:16.338773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.328341Z","title":"Not too little, not too much: a theoretical analysis of graph (over) smoothing","venue":null,"work_id":"50c1db3f-f038-4779-a1e3-5865d018cd7a","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.958501Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:98249e23d3ba88bb38ac03a7b75fad0aed4325b20940d8d92c4cd4d552cab137","observation_id":"e7edf931-42d1-4b16-b094-e416fe5c754b","resolution":{"observed_at":"2026-08-08T14:33:16.331117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2410.08633","last_updated":"2025-03-11T14:26:41Z","snapshot_observed_at":"2026-08-09T13:53:56.927549Z","submitted_at":"2024-10-11T08:55:17Z","title":"Transformers Provably Solve Parity Efficiently with Chain of Thought","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08633","snapshot_observed_at":"2026-08-08T14:33:15.961026Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.961026Z"},"links":{"cited_paper":"/paper/2410.08633","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:eadd220f6f8e2874bfa86de3087919f949657722b582aedb0690529dbbe54cfb","observation_id":"e50a8057-42ac-4f97-ad9d-e92a09eb5f9e","resolution":{"observed_at":"2026-08-08T14:33:15.961026Z","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-08T14:33:16.320943Z","title":"An introduction to expander graphs","venue":null,"work_id":"88ac73ba-7f67-4d19-8bf2-adf0b877d933","year":2019},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.964037Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:2907fca1008d29d1840cfa123cd50efdbc744b1b561b608e940679ec4fa5055d","observation_id":"042e7265-7813-490a-a9fa-fe6a412e401c","resolution":{"observed_at":"2026-08-08T14:33:16.323604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:15.966700Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.966700Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:0c2f285948edd795c0e7d4f072b21923a8b94268c18f02abd8037471686c4c7e","observation_id":"46654ddd-2a1f-410e-a24a-c63ce1a4cacc","resolution":{"observed_at":"2026-08-08T14:33:15.966700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05649","last_updated":"2025-03-14T23:47:53Z","snapshot_observed_at":"2026-08-05T14:59:36.173649Z","submitted_at":"2024-07-08T06:21:56Z","title":"Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention","version":5},"cited_work":{"arxiv_id":"2407.05649","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.05649","snapshot_observed_at":"2026-08-08T14:33:16.127831Z","title":"Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention","venue":"cs.LG","work_id":"f0986705-937e-47c6-be46-cca4d24f674b","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.969412Z"},"links":{"cited_paper":"/paper/2407.05649","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:11b9d9dcb980b047a51431f5260ab8516769c0cf1d6b73a6da63180ca8d428d5","observation_id":"17fd01ef-9aee-452e-b427-8579be45fe0c","resolution":{"observed_at":"2026-08-08T14:33:16.133097Z","resolver_source":"local_arxiv","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.309449Z","title":"T., Lorraine, J., and Lucas, J","venue":null,"work_id":"eb2d5e2a-4ae3-4eef-aedd-03c4dcb8fb6b","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.972343Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:059fa0182b043152281942ba27f2f9d9e412159b91c5d4bc5fbe2806c7eb4ba0","observation_id":"17e34016-3cb9-4666-b168-62f56ff36c31","resolution":{"observed_at":"2026-08-08T14:33:16.312135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.301888Z","title":"Discrete groups, expanding graphs and invariant measures, volume 125","venue":null,"work_id":"86b62353-3724-449b-a1a6-3891e901870f","year":1994},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.975062Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:182d962371499230fa19e8e606501eb3a17b4fb40683254f7257942dadb5cd4d","observation_id":"62fa8fca-33a7-4665-b25d-ef42fbb95aa8","resolution":{"observed_at":"2026-08-08T14:33:16.304770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:15.977672Z","title":"A fractional graph laplacian approach to oversmoothing","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.977672Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:35b1385ee58c6bf46a9307291e434433969afd5c33c759106b6140a2ae05cb10","observation_id":"83f4e017-9a81-4d39-8aee-45351db370cf","resolution":{"observed_at":"2026-08-08T14:33:15.977672Z","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-08T14:33:16.290028Z","title":"and Veli c kovi \\'c , P","venue":null,"work_id":"b2f1f9b6-e162-4cdd-a9b5-7f1656bd093e","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.980523Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:9284eac9e7e59bf8d88adbcd1374cae20f8dafe1d3c49fcda528adb3a1709219","observation_id":"62168025-8de8-48fe-936f-6e4a3590e63e","resolution":{"observed_at":"2026-08-08T14:33:16.292693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1905.10947","last_updated":"2021-01-06T13:32:14Z","snapshot_observed_at":"2026-07-06T07:55:41.176211Z","submitted_at":"2019-05-27T02:59:06Z","title":"Graph Neural Networks Exponentially Lose Expressive Power for Node Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10947","snapshot_observed_at":"2026-08-08T14:33:15.983158Z","title":"and Suzuki, T","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.983158Z"},"links":{"cited_paper":"/paper/1905.10947","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:111ff791fda3c58bf74661b887ca6a1f274a97cb0d6b639a2176b31d7f0cf8ae","observation_id":"98d9f9e5-e3fe-4e50-8ce7-0ac3b0a4e488","resolution":{"observed_at":"2026-08-08T14:33:15.983158Z","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-08T14:33:16.282385Z","title":"Improving language understanding by generative pre-training, 2018","venue":null,"work_id":"556f091f-7ec4-424c-a3f1-eac5e919b8ac","year":2018},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.986323Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:0849a915656dc8d34deba9ccb34e6978566aa6db625853656e133bd45aa0d760","observation_id":"d043b068-640c-46b8-9b56-09c48484bd4d","resolution":{"observed_at":"2026-08-08T14:33:16.285287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:15.988907Z","title":"P., Dupont, E., Ruiz, F","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.988907Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:63203a6ae495be95430b65c1afb64db12eb0c0e53f72f516c53a909bbe27a648","observation_id":"ea852aa9-6267-4182-99c1-51492796380b","resolution":{"observed_at":"2026-08-08T14:33:15.988907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10637","last_updated":"2020-10-09T11:39:32Z","snapshot_observed_at":"2026-08-07T10:11:23.671536Z","submitted_at":"2020-06-18T16:06:18Z","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10637","snapshot_observed_at":"2026-08-08T14:33:15.992553Z","title":"Temporal graph networks for deep learning on dynamic graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.992553Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:af644a8e76c24d57d399ab4734fb5c8b1e56ff37da1cd199424e5c2df69f43e4","observation_id":"659b227a-6156-486d-9c6b-164e9520919b","resolution":{"observed_at":"2026-08-08T14:33:15.992553Z","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-08T14:33:16.274829Z","title":"K., Chamberlain, B., Rowbottom, J., Mishra, S., and Bronstein, M","venue":null,"work_id":"8aae84a3-5afb-4a8c-a0f6-99e12a413079","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.995767Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:701b5810ff2dc3b4fe35b682fb2346dcd35b1f9b64b6abe39d094a1aa1f71b12","observation_id":"23877374-274e-404b-8bee-5b103321551c","resolution":{"observed_at":"2026-08-08T14:33:16.277552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.267363Z","title":"Some applications of modular forms, volume 99","venue":null,"work_id":"a4a516f2-6a17-4c76-9a77-aad823beff64","year":1990},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:15.999379Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:aea3cc3096e399c77bd486beab436a587929d26fae079ae4f59a6bd6126ad6e8","observation_id":"dd7c95e8-514a-4d87-b0a1-dccd48b8616a","resolution":{"observed_at":"2026-08-08T14:33:16.270169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1804.04235","last_updated":"2018-04-11T21:42:32Z","snapshot_observed_at":"2026-07-06T06:32:58.709094Z","submitted_at":"2018-04-11T21:42:32Z","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.04235","snapshot_observed_at":"2026-08-08T14:33:16.002216Z","title":"and Stern, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.002216Z"},"links":{"cited_paper":"/paper/1804.04235","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:fd7bd50689d57a997de7916f065b2133223f314edb7f7a02e6a6a79d60c04f20","observation_id":"947074ec-7eb3-4e8f-9784-475099cc3f48","resolution":{"observed_at":"2026-08-08T14:33:16.002216Z","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-08T14:33:16.005232Z","title":"J., and Sinop, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.005232Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:6b7a0e1f7be353c0fad959c91e417144e28fc10396392d1eb4afd07ddea1cf33","observation_id":"cc2919a7-eea3-4f98-8fbc-86a3c00d5a6c","resolution":{"observed_at":"2026-08-08T14:33:16.005232Z","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-08T14:33:16.255613Z","title":null,"venue":null,"work_id":"37eca733-6783-4a39-9cf2-488bc77a4060","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.007871Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:dd6012a1c06480c45aa0d9ca64a6d24cd5d66e6b462829f2070fb2c393ab1b32","observation_id":"5f358e47-dc17-4431-baf9-4b7d149ee0d1","resolution":{"observed_at":"2026-08-08T14:33:16.258380Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.247830Z","title":"Going beyond the causal mask in language modeling","venue":null,"work_id":"59aaaf03-86e6-46a1-ba14-4cadb01e3fae","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.010390Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:6a822f9996b5f49c129b7531930b0117f2ea1022e698e9453f31de9013c5aae1","observation_id":"d88e7d4d-630e-4735-9353-da5085ccd9a5","resolution":{"observed_at":"2026-08-08T14:33:16.250671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.239947Z","title":"Commute-time-optimised graphs for gnns","venue":null,"work_id":"91e4b7c7-1226-4360-b67d-eff292564228","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.012865Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:7c9542fbe684854da4f1f421439fd6fc6a4fc96f4cdbaef6b19e842a0d150f6f","observation_id":"ec083cc9-8ca4-4acc-a65a-d4e9a9b061bc","resolution":{"observed_at":"2026-08-08T14:33:16.242821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.232449Z","title":null,"venue":null,"work_id":"6792207c-aa90-46aa-9550-a09b7e57a500","year":2014},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.015684Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:981c25540e080a6a7a9f2bdf247e24323d09486a8fe372d7069e60f991fd4b56","observation_id":"5c99f2b2-4d3f-4480-aa54-0cf7db051446","resolution":{"observed_at":"2026-08-08T14:33:16.235111Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2403.08295","last_updated":"2024-04-16T12:52:47Z","snapshot_observed_at":"2026-08-03T03:29:01.959523Z","submitted_at":"2024-03-13T06:59:16Z","title":"Gemma: Open Models Based on Gemini Research and Technology","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08295","snapshot_observed_at":"2026-08-08T14:33:16.018272Z","title":"S., Love, J., et al","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.018272Z"},"links":{"cited_paper":"/paper/2403.08295","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:864c7fdc4194e6d12f89e528505a4c36a615b8a7c0a57b682550d3e4912d2e73","observation_id":"bf2e7fa5-cbbb-489a-ae01-479cbab6a0cd","resolution":{"observed_at":"2026-08-08T14:33:16.018272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00118","last_updated":"2024-10-02T15:22:49Z","snapshot_observed_at":"2026-08-02T16:20:09.773989Z","submitted_at":"2024-07-31T19:13:07Z","title":"Gemma 2: Improving Open Language Models at a Practical Size","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00118","snapshot_observed_at":"2026-08-08T14:33:16.021100Z","title":"G., Hardin, C., Bhupatiraju, S., Hussenot, L., Mesnard, T., Shahriari, B., Ramé, A., Ferret, J., Liu, P., Tafti, P., Friesen, A., Casbon, M., Ramos, S., Kumar, R., Lan, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.021100Z"},"links":{"cited_paper":"/paper/2408.00118","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:d4c39ff3abfccda6387e3c72000a2987fede9ba00ef939e6a730dee5a2779a58","observation_id":"b7a0fc2f-f96d-4788-9f24-f83b539e48d2","resolution":{"observed_at":"2026-08-08T14:33:16.021100Z","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-08T14:33:16.224955Z","title":"and Chen, J","venue":null,"work_id":"30882bad-c02a-4b1a-a055-2787710b0afb","year":2021},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.024438Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:dfd6d18456141e4a7b6dcb7c410b52305c2bb002c8d055c7d65b8fe816d3fe3d","observation_id":"15d5fb4b-6138-4d48-8e2f-9cfbbc1b6d06","resolution":{"observed_at":"2026-08-08T14:33:16.227689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T14:33:16.217390Z","title":"D., Chamberlain, B","venue":null,"work_id":"10af6bce-943e-4d4d-a050-821931bca031","year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.027124Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:1f292f4598f5fc202f3e63e0def1a7d229e2ffc0e303cb78185d40a354061785","observation_id":"fa93a986-f53c-4a13-9f4b-07c7140f794d","resolution":{"observed_at":"2026-08-08T14:33:16.220076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1609.03499","last_updated":"2016-09-19T18:04:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-09-12T17:29:40Z","title":"WaveNet: A Generative Model for Raw Audio","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.03499","snapshot_observed_at":"2026-08-08T14:33:16.029766Z","title":"Wavenet: A generative model for raw audio","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.029766Z"},"links":{"cited_paper":"/paper/1609.03499","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:af336ffaa980fe4f4db6531dc21380b9603d86574a17b33aa6d831e87d3b1592","observation_id":"49d0fd8b-9410-4c57-86bb-6b09667ed3eb","resolution":{"observed_at":"2026-08-08T14:33:16.029766Z","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-08T14:33:16.032712Z","title":"P., Budden, D., Pascanu, R., Banino, A., Dashevskiy, M., Hadsell, R., and Blundell, C","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.032712Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:4e0eb9b51c6db73eee451c4f4e25849dabb12b907b8538b7a509c707491c0e54","observation_id":"d7a54640-5ade-41b0-862a-ee5c0b5c83c7","resolution":{"observed_at":"2026-08-08T14:33:16.032712Z","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-08T14:33:16.205723Z","title":"Graph attention networks","venue":null,"work_id":"b8c9fbfe-3891-4502-acda-1a2393c7332b","year":2018},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.035320Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:b092e5bf60a7fa012b65fffea6a8a81357309e437b00aba3f9fad5204d83d135","observation_id":"c886f72e-d47e-4d3b-b5d0-abc0b35bbc7c","resolution":{"observed_at":"2026-08-08T14:33:16.208629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2410.01104","last_updated":"2025-05-30T23:46:05Z","snapshot_observed_at":"2026-08-09T17:03:53.787790Z","submitted_at":"2024-10-01T22:22:35Z","title":"Softmax is not Enough (for Sharp Size Generalisation)","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01104","snapshot_observed_at":"2026-08-08T14:33:16.037819Z","title":"softmax is not enough (for sharp out-of-distribution), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.037819Z"},"links":{"cited_paper":"/paper/2410.01104","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:7195822f288e50deb73118df8716f93ac3654abf8d31b270cb0ce83068d1b5e8","observation_id":"7fbc1b9c-f8a6-435b-a524-1143a2d9984c","resolution":{"observed_at":"2026-08-08T14:33:16.037819Z","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-08T14:33:16.198258Z","title":"Cayley graph propagation","venue":null,"work_id":"424fbf12-7610-4918-b097-13b4e0bd76b2","year":2024},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.040809Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:0641252da0b573fa00413fef796e3fa59c4237579c70b8c149fca320a51829f9","observation_id":"536b3f72-534b-4b16-b305-45df04b4754f","resolution":{"observed_at":"2026-08-08T14:33:16.200964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08T14:33:16.043161Z","title":"A., Ainslie, J., Alberti, C., Ontanon, S., Pham, P., Ravula, A., Wang, Q., Yang, L., et al","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.043161Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:84b31492558a527d401f85b02d5ce520c7bdf4b2fa111e1e4cb90bfee75ea423","observation_id":"1491c796-bb48-4b34-90a2-47b7ca82ccf7","resolution":{"observed_at":"2026-08-08T14:33:16.043161Z","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-08T14:33:16.185874Z","title":"Dirichlet energy constrained learning for deep graph neural networks","venue":null,"work_id":"d24e1414-4ea1-43b7-a667-01e901d1ec28","year":2021},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.045867Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:22c83869bcf44ecf8e066ce3251713c38afa8f17536273d6a15240b531706a95","observation_id":"b6018a2e-6e6d-4042-8898-18a89832d024","resolution":{"observed_at":"2026-08-08T14:33:16.188738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2002.04839","last_updated":"2021-06-13T21:13:02Z","snapshot_observed_at":"2026-08-06T10:04:45.542091Z","submitted_at":"2020-02-12T08:28:19Z","title":"LaProp: Separating Momentum and Adaptivity in Adam","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.04839","snapshot_observed_at":"2026-08-08T14:33:16.048372Z","title":"T., and Ueda, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.048372Z"},"links":{"cited_paper":"/paper/2002.04839","citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:6cdbdc060cdf218dd7d7aaf10ebb9a700db3b7a985360728d38c991af964b980","observation_id":"a50adffa-4252-4c55-b958-345e0d2ac4e2","resolution":{"observed_at":"2026-08-08T14:33:16.048372Z","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-08T14:33:16.051595Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T14:33:16.051595Z"},"links":{"citing_paper":"/paper/2502.06751"},"observation_digest":"sha256:8955d87b7ae30e6c1cf848aac8d2abcbd099e321db10bcd3635a592934bf8cb8","observation_id":"f633c50a-2607-44b5-b05e-f6de496aed2f","resolution":{"observed_at":"2026-08-08T14:33:16.051595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06751","last_updated":"2025-05-30T23:27:14Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T17:04:04.288558Z","submitted_at":"2025-02-10T18:26:40Z","title":"What makes a good feedforward computational graph?"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":2,"verified_fuzzy":22},"total_outbound_references":53},"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 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2502.06751."}