{"as_of":"2026-08-07T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f23ac69d73c69f00d509c96248bfcd3aa2bd8d1ef682b359a5b5113d5968252","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:39:46.317375Z","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-03T22:49:01.144766Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2210.15304","last_updated":"2024-07-01T10:48:40Z","snapshot_observed_at":"2026-08-02T05:43:35.323254Z","submitted_at":"2022-10-27T10:25:51Z","title":"Explaining the Explainers in Graph Neural Networks: a Comparative Study","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-05-24T11:00:19.591474Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2210.15304"},"observation_digest":"sha256:ba03ecdb8e62154ac2be618679790457b82ffe4d172469f2ca9362a3e0696d3d","observation_id":"a905d530-e73f-4cc5-aaf7-f0e28ff1c434","resolution":{"observed_at":"2026-05-24T11:04:22.271951Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-08-05T23:39:46.317375Z","title":"Recipe for a general, powerful, scalable graph transformer (graphgps)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.05070","last_updated":"2025-08-07T06:44:01Z","snapshot_observed_at":"2026-08-06T10:36:57.601907Z","submitted_at":"2025-08-07T06:44:01Z","title":"TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:46.317375Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2508.05070"},"observation_digest":"sha256:a048c08828f98bfa55afa2a84c994901744f5b7cfde42d1e37c8e76a8ab810b3","observation_id":"e7967d9c-7540-4455-b4eb-0372a664a8f7","resolution":{"observed_at":"2026-08-05T23:39:46.317375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-08-05T13:36:41.294250Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.00449","last_updated":"2025-08-30T10:44:06Z","snapshot_observed_at":"2026-08-06T11:48:28.009389Z","submitted_at":"2025-08-30T10:44:06Z","title":"GOSU: Retrieval-Augmented Generation with Global-Level Optimized Semantic Unit-Centric Framework","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T13:36:41.294250Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2509.00449"},"observation_digest":"sha256:a22f0b53415b24505e5a74b6cf4a997edbbe89c61043f8b0a3f5efc1502ae9a2","observation_id":"9b4d8adf-070c-4cfd-9a2d-b5e2bd235868","resolution":{"observed_at":"2026-08-05T13:36:41.294250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2510.06860","last_updated":"2026-04-21T10:08:33Z","snapshot_observed_at":"2026-07-06T22:32:03.314860Z","submitted_at":"2025-10-08T10:28:46Z","title":"Towards Generalization of Graph Neural Networks for AC Optimal Power Flow","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T08:49:17.172538Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2510.06860"},"observation_digest":"sha256:326633d06b52eb33432d91d6b10815df3dbb81fbb82905d649abe798d52899ec","observation_id":"e3d3586a-25d8-4370-b548-05fb84db9f25","resolution":{"observed_at":"2026-05-18T08:51:08.879177Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2605.05689","last_updated":"2026-05-07T05:29:57Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:29:57Z","title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T11:46:42.010486Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2605.05689"},"observation_digest":"sha256:58ccaa25b968ce11f2ff860ca548dec217cebf6298dee98a60c19e9ff8e88221","observation_id":"71435054-b894-4f93-8153-55e6b4d549ed","resolution":{"observed_at":"2026-05-11T19:31:08.902554Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:52cffec3ce0630a44e039b12f3e5f94820b16303393b5194c6a0b7622714e7da","observation_id":"cc66436f-a3ef-4258-bcf1-7ef5ef6fc516","resolution":{"observed_at":"2026-05-21T08:34:05.427421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2605.20618","last_updated":"2026-05-20T02:07:10Z","snapshot_observed_at":"2026-07-06T23:31:13.042581Z","submitted_at":"2026-05-20T02:07:10Z","title":"COAgents: Multi-Agent Framework to Learn and Navigate Routing Problems Search Space","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T05:25:44.647620Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2605.20618"},"observation_digest":"sha256:571fbb2da6f7135483bf141736493839327e00a38e922137ecb046b53bcfe3a7","observation_id":"90872906-c477-402a-a0ab-be8017ac96ed","resolution":{"observed_at":"2026-05-21T05:29:39.689101Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2606.27806","last_updated":"2026-07-05T07:44:24Z","snapshot_observed_at":"2026-08-07T08:14:46.019506Z","submitted_at":"2026-06-26T07:45:15Z","title":"Agent vs. Parametric World Models: Hybrid Planning for Reliable Language Agents","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-29T04:46:11.090693Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2606.27806"},"observation_digest":"sha256:c7f663e5bb047e8dc92241cee1fb444f86cf716236d753e9211739ef366d902c","observation_id":"132dc31b-ed18-4b92-94c9-17f771cd6df2","resolution":{"observed_at":"2026-06-29T19:23:54.334687Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":"2205.12454","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-03T22:49:01.144766Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":"a470c219-d096-4560-b820-68f31d87fcad","year":2022},"citing_paper":{"arxiv_id":"2606.27806","last_updated":"2026-07-05T07:44:24Z","snapshot_observed_at":"2026-08-07T08:14:46.019506Z","submitted_at":"2026-06-26T07:45:15Z","title":"Agent vs. Parametric World Models: Hybrid Planning for Reliable Language Agents","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-03T22:41:41.912274Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2606.27806"},"observation_digest":"sha256:e416e09c0fb239fece89f817dc0780ddfbc4feaed774b31bf07585fda15b4f33","observation_id":"0a446ed8-1796-4123-96e6-b84740aa46a8","resolution":{"observed_at":"2026-07-03T22:49:01.147535Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-31T19:30:13.419111Z","title":"Recipe for a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24275","last_updated":"2026-07-27T11:19:52Z","snapshot_observed_at":"2026-08-05T10:22:16.789675Z","submitted_at":"2026-07-27T11:19:52Z","title":"A Computational Ethical Framework for Financial Digital Phenotyping for Mental Health","version":1},"reference_index":138,"source":"arxiv_source","source_observed_at":"2026-07-31T19:30:13.419111Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2607.24275"},"observation_digest":"sha256:5a9b41b25a73fec54534dc21366e72f200966adc797df927f7491dba74e870c6","observation_id":"e60150f2-2da1-4eaf-8249-ff92e9fc0a4f","resolution":{"observed_at":"2026-07-31T19:30:13.419111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-08-01T07:18:40.951654Z","title":"Alvaro Sanchez-Gonzalez, Nicolas Heess, Jost Tobias Springenberg, Josh Merel, Martin Riedmiller, Raia Hadsell, and Peter Battaglia","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27479","last_updated":"2026-07-29T21:42:02Z","snapshot_observed_at":"2026-08-07T05:27:53.932242Z","submitted_at":"2026-07-29T21:42:02Z","title":"Schreier-Coset Graph Rewiring","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T07:18:40.951654Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2607.27479"},"observation_digest":"sha256:9f50d7151e04dc733b31107b09c9413034b7b11864c1793ade1a268711b597b0","observation_id":"04e3fa1c-35f0-4102-a681-4e4302d6142a","resolution":{"observed_at":"2026-08-01T07:18:40.951654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-07-31T01:45:49.847838Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28628","last_updated":"2026-07-30T17:59:56Z","snapshot_observed_at":"2026-08-06T17:51:09.468446Z","submitted_at":"2026-07-30T17:59:56Z","title":"Learning to Trace Seiberg Dualities","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T01:45:49.847838Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2607.28628"},"observation_digest":"sha256:8fbe8f90cb0da02890918490bedb5b1170c6f4d8f6823ca7161457d8e543981b","observation_id":"3d6d7a73-a994-4844-8a91-7449647dfadc","resolution":{"observed_at":"2026-07-31T01:45:49.847838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.12454","snapshot_observed_at":"2026-08-04T04:52:32.459395Z","title":"Ribeiro, A.; Tenório, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02558","last_updated":"2026-08-03T17:41:20Z","snapshot_observed_at":"2026-08-06T23:39:10.622798Z","submitted_at":"2026-08-03T17:41:20Z","title":"Benchmarking Sheaf Neural Networks for Inductive Tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T04:52:32.459395Z"},"links":{"cited_paper":"/paper/2205.12454","citing_paper":"/paper/2608.02558"},"observation_digest":"sha256:0f1c87d934ef02344486232424799b5e4c060dce59681de3ebb89d5cc7ff1f5d","observation_id":"41a7a1f5-207c-4345-b39a-83f65bb5a417","resolution":{"observed_at":"2026-08-04T04:52:32.459395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2205.12454/citation-record","integrity":"/paper/2205.12454/integrity","json":"/paper/2205.12454/citation-record.json","paper":"/paper/2205.12454"},"outbound":[],"paper":{"arxiv_id":"2205.12454","last_updated":"2023-01-15T13:04:02Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T23:59:26.562029Z","submitted_at":"2022-05-25T02:56:24Z","title":"Recipe for a General, Powerful, Scalable Graph Transformer"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2205.12454."}