{"as_of":"2026-08-16T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d649039b26591faab90cf557b3bcab02fcda24e398e8128d3fa6ce10d9b8af8","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:21:48.073360Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2412.01519/citation-record","integrity":"/paper/2412.01519/integrity","json":"/paper/2412.01519/citation-record.json","paper":"/paper/2412.01519"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.04910","last_updated":"2023-02-27T11:39:09Z","snapshot_observed_at":"2026-08-13T15:26:54.013551Z","submitted_at":"2022-06-10T07:23:51Z","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04910","snapshot_observed_at":"2026-08-12T04:21:47.961190Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs.arXiv preprint arXiv:2206.04910,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.961190Z"},"links":{"cited_paper":"/paper/2206.04910","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:41c64fc8497482229c7a7ac8f9c79b876966107c2b59a055e2e1427b5c18ce8e","observation_id":"b0047acf-1701-4312-9383-2f8cf5e8aefa","resolution":{"observed_at":"2026-08-12T04:21:47.961190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.16030","last_updated":"2024-03-24T06:10:56Z","snapshot_observed_at":"2026-08-14T07:42:16.887514Z","submitted_at":"2024-03-24T06:10:56Z","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.16030","snapshot_observed_at":"2026-08-12T04:21:47.980452Z","title":"Vcr-graphormer: A mini-batch graph transformer via virtual connections.arXiv preprint arXiv:2403.16030,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.980452Z"},"links":{"cited_paper":"/paper/2403.16030","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:76e91ceaa82edc08828657c3978375c6f706206ba16d66922a77fa33ccc8636d","observation_id":"6a34de14-4c57-4b2c-9c5c-b3d09d7d9f99","resolution":{"observed_at":"2026-08-12T04:21:47.980452Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-12T04:21:47.986575Z","title":"Mamba: Linear-time sequence modeling with selective state spaces.arXiv preprint arXiv:2312.00752,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.986575Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:32a16d4f75386c07f9278a9cfe4621f9c1ec9b54b15d2548b078f3bcd9f9bd55","observation_id":"d561895c-8295-4101-90e8-cde54fa19420","resolution":{"observed_at":"2026-08-12T04:21:47.986575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-14T11:29:43.154735Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-12T04:21:48.005528Z","title":"Attending to graph transformers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.005528Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:3b546660a4a2d0a114060c2c7adbf87344575bb67cdbfed55f6a8b98442cf8a9","observation_id":"eb65df2f-675b-47d7-9d44-c8ebdec77c24","resolution":{"observed_at":"2026-08-12T04:21:48.005528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-12T04:21:48.013127Z","title":"Pitfalls of graph neural network evaluation.arXiv preprint arXiv:1811.05868,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.013127Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:e392a8755ea636d7e0807ef171895c9771ba15991ecbf386f5ebad6002f1d0e3","observation_id":"ea5d3dde-c25c-46d4-88ff-946381e3cce3","resolution":{"observed_at":"2026-08-12T04:21:48.013127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00789","last_updated":"2024-02-01T17:21:53Z","snapshot_observed_at":"2026-08-16T10:25:47.064124Z","submitted_at":"2024-02-01T17:21:53Z","title":"Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00789","snapshot_observed_at":"2026-08-12T04:21:48.032777Z","title":"Graph-mamba: Towards long-range graph sequence modeling with selective state spaces.arXiv preprint arXiv:2402.00789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.032777Z"},"links":{"cited_paper":"/paper/2402.00789","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:74367b264c613d19d8eddf224b04a57f4ef96eeda5028ae26d74b41b9771830c","observation_id":"dd4ec086-0c7a-4ad5-a28f-66310396f9f9","resolution":{"observed_at":"2026-08-12T04:21:48.032777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-12T04:21:48.039230Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.039230Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:b30cf4a75c67eb60ba1ef6ac8dae00549d263d9c90c6fa97c1d915b8b4f197b2","observation_id":"67181ea5-902e-4f6d-b421-c8049722248f","resolution":{"observed_at":"2026-08-12T04:21:48.039230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.13094","last_updated":"2021-10-25T16:43:32Z","snapshot_observed_at":"2026-08-15T23:14:59.543732Z","submitted_at":"2021-10-25T16:43:32Z","title":"Gophormer: Ego-Graph Transformer for Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.13094","snapshot_observed_at":"2026-08-12T04:21:48.046388Z","title":"Gophormer: Ego-graph transformer for node classification.arXiv preprint arXiv:2110.13094,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.046388Z"},"links":{"cited_paper":"/paper/2110.13094","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:47e62a8019d76b13db7725fd645447ca858a23b2034727fd6af9156ddf2497f4","observation_id":"cee8a4f6-64e0-4fa7-a1b1-edcff9bbfdb5","resolution":{"observed_at":"2026-08-12T04:21:48.046388Z","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-12T04:21:48.577526Z","title":"Additionally, to ensure compatibility with the models, we assign random values to the graph’s edge attributes, node features, and prediction labels","venue":null,"work_id":"6ccb5a96-e467-47d7-b1f2-fda8ebcd5631","year":2008},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.073360Z"},"links":{"citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:da0bfd7c3a2a2a324b3366b09281e784e41e010ac091ce5aae133d91778cf6d3","observation_id":"6a14326b-0d65-4c40-9a4b-87b762af5cfc","resolution":{"observed_at":"2026-08-12T04:21:48.586351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-15T07:10:22.387933Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-12T04:21:47.944677Z","title":"On the bottleneck of graph neural networks and its practical implications.arXiv preprint arXiv:2006.05205,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":1986,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.944677Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:610915bdf5d2c527aff14c796c0c5cd1c13d6066d8735e9628d64261949a773c","observation_id":"c54325e8-827c-4fcc-abd2-87c44f703362","resolution":{"observed_at":"2026-08-12T04:21:47.944677Z","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-12T04:21:48.603004Z","title":"In practice, we use the python wrapper PyMetis4 which allows us to map each spoke to a single hub","venue":null,"work_id":"def7e086-0537-43ba-9a8d-362b9af9f372","year":1998},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.067146Z"},"links":{"citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:bacab67d8445c1ce7a6cdba94bfa6ba472ae5f675ada27acf080fda49d69dc15","observation_id":"a5be7944-2a6a-461d-816c-1e74303644ca","resolution":{"observed_at":"2026-08-12T04:21:48.609289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14522","last_updated":"2022-11-12T16:11:19Z","snapshot_observed_at":"2026-08-14T07:38:21.479705Z","submitted_at":"2021-11-29T13:27:56Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14522","snapshot_observed_at":"2026-08-12T04:21:48.026092Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.026092Z"},"links":{"cited_paper":"/paper/2111.14522","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:295439eb12ca0c6ea6fd7410c5ae753d1c9fe89b6564a9eed8f0e04b480ea693","observation_id":"2cd97b5b-3b93-4e16-ab0b-582c0b30be76","resolution":{"observed_at":"2026-08-12T04:21:48.026092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-12T04:21:47.997182Z","title":"Semi-supervised classification with graph convolutional networks.arXiv preprint arXiv:1609.02907,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.997182Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:f151917b45511d4f5d8f3d1eb48ba9ce7e220c9e9b898260455211fd7ad1ba2c","observation_id":"e3dbe971-bb21-4d3a-a521-d12fb73df8f2","resolution":{"observed_at":"2026-08-12T04:21:47.997182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-15T23:39:52.468529Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-12T04:21:47.991880Z","title":"semanticscholar.org/CorpusID:16050699","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.991880Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:40569bcbdbec9df38b08d425ed9642a0d1c80baf752281c6b27dd3e8cddba759","observation_id":"769d91b1-27d4-4e02-8c0f-31e594c014a2","resolution":{"observed_at":"2026-08-12T04:21:47.991880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14491","snapshot_observed_at":"2026-08-12T04:21:47.955832Z","title":"How attentive are graph attention networks?arXiv preprint arXiv:2105.14491,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.955832Z"},"links":{"cited_paper":"/paper/2105.14491","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:ab2a73d8dd28c22da8c3d43c8b73c8614bd6a07f8be9aa7a49bf43439d7fbfb6","observation_id":"17a78a87-4ddc-4b29-8eb5-5ae3be41dae8","resolution":{"observed_at":"2026-08-12T04:21:47.955832Z","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-12T04:21:48.019637Z","title":"Graph transformers: A survey.arXiv preprint arXiv:2407.09777,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.019637Z"},"links":{"citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:01990366f17a563d4c27473b01736080b972c4613f5e2b843c78715c3c2df2e3","observation_id":"9df52826-82b2-4eb8-bdcc-6a3ad09724b8","resolution":{"observed_at":"2026-08-12T04:21:48.019637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.14794","last_updated":"2022-11-19T12:45:21Z","snapshot_observed_at":"2026-08-12T04:58:34.201421Z","submitted_at":"2020-09-30T17:09:09Z","title":"Rethinking Attention with Performers","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.14794","snapshot_observed_at":"2026-08-12T04:21:47.967565Z","title":"Rethinking attention with performers","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.967565Z"},"links":{"cited_paper":"/paper/2009.14794","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:5c952c921046e33480ca0465f1df12ec045582338eb7ee95799cb26ce27bf505","observation_id":"f9b4eab2-2a1d-4486-8f04-04f0f02abb71","resolution":{"observed_at":"2026-08-12T04:21:47.967565Z","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-12T04:21:48.646353Z","title":"Table 6: Statistics of the five dataset proposed in the long-range graph benchmark","venue":null,"work_id":"c548a1ba-05a6-4eaf-9af7-6bc79b5e88b1","year":2022},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.052207Z"},"links":{"citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:41a6ccee42b27ded502b57f84befecbb6869c71bd26a0b20b30ddf1dc63cf6c6","observation_id":"a4981b9b-5db9-4cc6-8146-cc17e88f3ed9","resolution":{"observed_at":"2026-08-12T04:21:48.652439Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09699","last_updated":"2021-01-24T09:38:54Z","snapshot_observed_at":"2026-08-05T19:35:00.334774Z","submitted_at":"2020-12-17T16:11:47Z","title":"A Generalization of Transformer Networks to Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09699","snapshot_observed_at":"2026-08-12T04:21:47.973157Z","title":"A generalization of transformer networks to graphs.arXiv preprint arXiv:2012.09699,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.973157Z"},"links":{"cited_paper":"/paper/2012.09699","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:529aa67e185900bcd9d68fb240565fbc4f458f3bb677c5c37b1f29a24e700d9e","observation_id":"0b585be0-bf31-4cf5-a6d4-6491c28879db","resolution":{"observed_at":"2026-08-12T04:21:47.973157Z","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-12T04:21:48.627286Z","title":"Add edge index","venue":null,"work_id":"889e7a15-29bb-4e12-9aca-23476c6fdc3c","year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.060168Z"},"links":{"citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:da9c43da1b6a665238bb2db9e366afd9284c5f11b1495137ae3a844a1eceeae1","observation_id":"eaf7b8a7-2dbb-4afa-aa67-462715fad756","resolution":{"observed_at":"2026-08-12T04:21:48.632616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-08-14T20:11:44.023605Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-12T04:21:47.950498Z","title":"Residual gated graph convnets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:47.950498Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:ea478788951c7e9f5f357d2b7ac40d6ec3a84b956be7461d6b1a75b222b734f8","observation_id":"3cd7cccc-6c45-423e-8e52-99b1013419a4","resolution":{"observed_at":"2026-08-12T04:21:47.950498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T10:49:13.526137Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":21},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2412.01519."}