{"as_of":"2026-08-14T19:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12221adb27abebacf95b5edd0dc7cb52e3d6907cc6b67f64f47511ffe1c55e14","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:00:34.395601Z","state":"measured"},{"denominator":52,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":52,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T00:58:31.100417Z","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-05-22T01:00:51.523686Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"cited_work":{"arxiv_id":"2412.06173","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.06173","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.06173 , year=","venue":null,"work_id":"7f45e5e0-355a-4294-9091-cdad6dc57517","year":null},"citing_paper":{"arxiv_id":"2605.18893","last_updated":"2026-05-20T06:17:21Z","snapshot_observed_at":"2026-08-13T21:37:43.264925Z","submitted_at":"2026-05-17T07:08:22Z","title":"Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-05-20T15:17:23.832754Z"},"links":{"cited_paper":"/paper/2412.06173","citing_paper":"/paper/2605.18893"},"observation_digest":"sha256:d085f2f8b59deb7d343094b6c72fe65a2aadb708f8d9a402c44907da47ceba4d","observation_id":"428d2124-3d0a-43d5-b0ef-585871fee8d9","resolution":{"observed_at":"2026-05-20T15:18:25.326643Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"cited_work":{"arxiv_id":"2412.06173","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.06173","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2412.06173 , year=","venue":null,"work_id":"7f45e5e0-355a-4294-9091-cdad6dc57517","year":null},"citing_paper":{"arxiv_id":"2605.18893","last_updated":"2026-05-20T06:17:21Z","snapshot_observed_at":"2026-08-13T21:37:43.264925Z","submitted_at":"2026-05-17T07:08:22Z","title":"Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-05-22T00:58:31.100417Z"},"links":{"cited_paper":"/paper/2412.06173","citing_paper":"/paper/2605.18893"},"observation_digest":"sha256:ab58c9997b1c0041a18ae4c32c399ab0061920027b017ab011d67a1a7d0e8272","observation_id":"b6e429be-f7f6-4ff7-af27-29041629732c","resolution":{"observed_at":"2026-05-22T01:00:51.526727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.06173/citation-record","integrity":"/paper/2412.06173/integrity","json":"/paper/2412.06173/citation-record.json","paper":"/paper/2412.06173"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:00:34.254511Z","title":"On the bottleneck of graph neural networks and its practical implications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.254511Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:690852539e48390364f03b1b25834fe7a80463f533c47dec15a16a76fcdad9e8","observation_id":"22a11b61-75ed-4c99-ac9a-b56091fe4bf2","resolution":{"observed_at":"2026-08-11T20:00:34.254511Z","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-11T20:00:34.911224Z","title":"Diffwire: Inductive graph rewiring via the lovasz bound","venue":null,"work_id":"6911fb16-a196-4615-a488-33f7ac1ab121","year":2022},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.257456Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:d5d58fb0657607eefb33ad0b404057c8f43fe871c316f246993540abdbbb7940","observation_id":"1c8ce0d8-c254-49fb-a137-00034e7ce6ff","resolution":{"observed_at":"2026-08-11T20:00:34.915495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.901707Z","title":"Graph neural networks use graphs when they shouldn't, 2024","venue":null,"work_id":"a8955ced-e81e-4a10-a78f-336bf8021cee","year":2024},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.260080Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:3b588ed51ee098fa1c1e39e7d4f1fccc80af1111aa8f0732a08f6d935fdf3b00","observation_id":"a91c6f5a-d957-4a2f-bb02-694d7a3a9c37","resolution":{"observed_at":"2026-08-11T20:00:34.905121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.892274Z","title":"Understanding oversquashing in gnns through the lens of effective resistance","venue":null,"work_id":"93bce53f-c9f5-46f0-b9ac-003fb9093002","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.263070Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:44ab2f20fb4e035b8497f0c2d8f432f925e5cda56d24f3596a26d6510ba5c10d","observation_id":"6affe739-ccd3-4747-946e-7a1180544703","resolution":{"observed_at":"2026-08-11T20:00:34.895609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03212","last_updated":"2021-06-14T12:00:33Z","snapshot_observed_at":"2026-08-13T20:04:03.891959Z","submitted_at":"2021-03-04T18:35:24Z","title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03212","snapshot_observed_at":"2026-08-11T20:00:34.265717Z","title":"Bronstein","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.265717Z"},"links":{"cited_paper":"/paper/2103.03212","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:7cc89580a0c1d9b78bd1fa16fbc986f3b45f06aa29884714c01e5119fb84af22","observation_id":"b921d7c0-574e-4182-b5be-c29803e918e4","resolution":{"observed_at":"2026-08-11T20:00:34.265717Z","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-11T20:00:34.883021Z","title":"Bronstein, Joan Bruna, Y","venue":null,"work_id":"607169de-9a55-4a64-a30f-4f1bc3790c2f","year":2017},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.268855Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:c56cc1fbed67e53d317a253ae160d6babf9dfc9d55227f64758c7574233c737c","observation_id":"c8f481c2-b2ce-491e-8722-a6dc30734ef2","resolution":{"observed_at":"2026-08-11T20:00:34.885756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.874984Z","title":"Hyperbolic graph convolutional neural networks","venue":null,"work_id":"c3e2de36-4f54-472b-9009-30c87dea961a","year":2019},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.271710Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:f6230ff3b61bebfea04794e8c47b7dc28cf560a3369c77c55b2f92c453051d3c","observation_id":"b4228aa7-b75e-430e-9029-161f6e4a7d57","resolution":{"observed_at":"2026-08-11T20:00:34.877666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14686","last_updated":"2022-03-16T02:23:49Z","snapshot_observed_at":"2026-08-13T19:13:36.462690Z","submitted_at":"2021-05-31T03:36:49Z","title":"Fully Hyperbolic Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14686","snapshot_observed_at":"2026-08-11T20:00:34.274020Z","title":"Fully hyperbolic neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.274020Z"},"links":{"cited_paper":"/paper/2105.14686","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:6bdfb8ffbdcbae15de6d4af3d979cb9f4154f389e28c63c8b83db6413901daf0","observation_id":"a1c3a042-cced-48e8-bee2-e4525bbc1fea","resolution":{"observed_at":"2026-08-11T20:00:34.274020Z","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-11T20:00:34.866867Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":"986aff9d-e440-4890-9cea-8f158aefd84f","year":2016},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.277380Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:afcd9b1ec99d48699f58876c76ceac0c569ecc6446ad6e064bb6307ba7dcd1ce","observation_id":"cb711827-c919-44e8-bad2-9abd9f53798e","resolution":{"observed_at":"2026-08-11T20:00:34.869699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.857053Z","title":"Bronstein","venue":null,"work_id":"38c847f1-e632-49cb-a94f-c0dc10b108ea","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.280243Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:05a943cd39400ea79dafe6c95c5ce832f79c75aa68d25e552297fe5b2249d9c7","observation_id":"42e82e29-1c38-46df-b61f-c93c0517d5c7","resolution":{"observed_at":"2026-08-11T20:00:34.860493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.847744Z","title":"Hyperbolic neural networks","venue":null,"work_id":"2589eb0f-4db0-4d8b-a73c-a459be31b591","year":2018},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.283253Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:e7df2d518b64bce4cd972f2fa6681c745fc5188b81ebbd90917dfb85ede26379","observation_id":"1052fd9d-50e6-4e88-925f-c17d4d36b9d8","resolution":{"observed_at":"2026-08-11T20:00:34.850791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.838805Z","title":"Diffusion improves graph learning","venue":null,"work_id":"2f34fc1d-d846-4830-94b4-5f27212cd409","year":2019},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.286101Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:d6e71ebda54825d77fc9f3ba038c2ae4b91628190e2b0f9581f33a6152d41fbc","observation_id":"22043c32-0f1c-4fea-82d9-4cc2c2223756","resolution":{"observed_at":"2026-08-11T20:00:34.842031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.829772Z","title":"Hamilton, Zhitao Ying, and Jure Leskovec","venue":null,"work_id":"7207f243-39c5-4399-bdef-81408e0bb9cf","year":2017},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.289147Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:31a3a71f48e7a884a346652d740764acbe4160e10fe5f9f61adac797d10c8212","observation_id":"2ca3eaed-cb21-4ab4-ba6d-acf86d45b12e","resolution":{"observed_at":"2026-08-11T20:00:34.832881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.820939Z","title":"Harris, K","venue":null,"work_id":"16330b59-69c2-438e-a78b-ed9be351f08a","year":2020},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.291877Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:9c8360f19a4a35bcf0d741ec12f238876ac963c7839680b2df02bdab2e58976c","observation_id":"b44914ae-2f9a-4878-a9f7-536ef69f7f0d","resolution":{"observed_at":"2026-08-11T20:00:34.823989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16788","last_updated":"2023-12-28T02:30:13Z","snapshot_observed_at":"2026-08-13T04:53:08.760781Z","submitted_at":"2023-12-28T02:30:13Z","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16788","snapshot_observed_at":"2026-08-11T20:00:34.294777Z","title":"Mitigating degree biases in message passing mechanism by utilizing community structures","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.294777Z"},"links":{"cited_paper":"/paper/2312.16788","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:bdd4916eb4fc75e5b99d4e575a1523b04944e59ff4ddceb8d636a8cfcb858323","observation_id":"00b1bb22-49b0-45c2-af3e-04654e723a20","resolution":{"observed_at":"2026-08-11T20:00:34.294777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-14T00:38:29.685908Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-11T20:00:34.298186Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.298186Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:7d6f34ed0577d6384bbf784404e5b097dd04bfea0d955f36c22556113fa50e81","observation_id":"ee54581c-8003-4128-864b-11d3242f6c4e","resolution":{"observed_at":"2026-08-11T20:00:34.298186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.13993","last_updated":"2020-11-02T19:42:34Z","snapshot_observed_at":"2026-08-13T09:50:17.403129Z","submitted_at":"2020-10-27T02:10:52Z","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.13993","snapshot_observed_at":"2026-08-11T20:00:34.301665Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.301665Z"},"links":{"cited_paper":"/paper/2010.13993","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:acacd9ebb5dcf3ccd50ff2e846bb7ec4e40abfdbba0ba0fa8df56820c4647466","observation_id":"5a04ce65-9eda-4281-999b-5569a4d5b1a2","resolution":{"observed_at":"2026-08-11T20:00:34.301665Z","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-11T20:00:34.811882Z","title":"Stevenson, and Lizhen Lin","venue":null,"work_id":"e2561558-0be4-4a86-9a8d-7ac71669cb04","year":2020},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.305023Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:ce87f4770276748b285143950f34df55b98a51a700f7d3bbdf0c84c2989fd5d7","observation_id":"bbde50c4-b664-4f94-8b61-aa6fdfefde13","resolution":{"observed_at":"2026-08-11T20:00:34.815139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.308020Z","title":"Banerjee, and Guido Montufar","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.308020Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:fd31e2620e71e511afa2ce8265e67efc28bc836709bca4f78fec882cc8cc1316","observation_id":"221673f8-d877-40bf-a221-5fb4153188c7","resolution":{"observed_at":"2026-08-11T20:00:34.308020Z","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-11T20:00:34.796895Z","title":"Shedding light on problems with hyperbolic graph learning","venue":null,"work_id":"4b7f1858-1133-4d0e-92cf-c612b2b16225","year":2024},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.311188Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:9a968cdf019b37f8bf7a064f96d0a45da3820109b8e343f62c2e19bea310f410","observation_id":"16ea4704-145e-4da5-bcc1-f6a171e2f412","resolution":{"observed_at":"2026-08-11T20:00:34.800124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-11T20:00:34.313818Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.313818Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:c8b95aa99c3ac2f3f5ba8a532ed8d378cb516cd767cfc204a1c9b74dd61e09af","observation_id":"23c7c7a3-898e-4dfe-a51d-a215c4d9869c","resolution":{"observed_at":"2026-08-11T20:00:34.313818Z","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-11T20:00:34.788010Z","title":"Kleinberg","venue":null,"work_id":"43ea57a7-b3e4-475c-a24e-1146d09df9d3","year":2000},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.316948Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:56add9ac4ff4df4945d6e5d3a161d0577b629f9e7cacf7b7c8b58a0aa6af2b81","observation_id":"1ce9958b-f130-4330-b699-7aca85a3b7e6","resolution":{"observed_at":"2026-08-11T20:00:34.791123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.778557Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"65921130-99a6-49b3-b662-30da16df2932","year":2018},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.320046Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:8de2bd6a52e001ad7135eac2a6ee72526d8975786c79329a87a68daadaab1ee9","observation_id":"ef74f5a8-4b7f-4338-aae8-7a2cf030f8ad","resolution":{"observed_at":"2026-08-11T20:00:34.781942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.769221Z","title":"Towards deeper graph neural networks","venue":null,"work_id":"2a7a1625-f2ab-4712-9d55-7cc3a59d70e9","year":2020},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.322834Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:8856368781825d4daa87b1c924858e098103e431c3386de0569b7fa4063434ad","observation_id":"cf6effd8-d329-4b02-bba9-fa6b6c6f11b3","resolution":{"observed_at":"2026-08-11T20:00:34.772434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.760264Z","title":"Differentiating through the fr\\'echet mean","venue":null,"work_id":"2b3c9f2a-119a-49e4-9b14-3e0b4d1dafec","year":2020},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.325658Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:8e5d74a5fbf2a92c1af7e3397e4db3864715a379489544f8d291ac56a2afbd77","observation_id":"bff719e0-66ff-4b7b-a4b3-0c28ab1676e3","resolution":{"observed_at":"2026-08-11T20:00:34.763358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05641","last_updated":"2021-09-12T23:57:05Z","snapshot_observed_at":"2026-08-14T06:24:51.289925Z","submitted_at":"2021-09-12T23:57:05Z","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05641","snapshot_observed_at":"2026-08-11T20:00:34.328301Z","title":"Is heterophily a real nightmare for graph neural networks to do node classification? ArXiv, abs/2109.05641, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.328301Z"},"links":{"cited_paper":"/paper/2109.05641","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:2a447f01c176d0ef472d6e4c582589a018a55c168e898a58e5d59886ca28de46","observation_id":"46d55731-2115-47d2-bcd0-63e3b30e0d6b","resolution":{"observed_at":"2026-08-11T20:00:34.328301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08541","last_updated":"2021-06-16T03:56:03Z","snapshot_observed_at":"2026-08-13T19:03:04.295458Z","submitted_at":"2021-06-16T03:56:03Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","version":1},"cited_work":{"arxiv_id":"2106.08541","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.08541","snapshot_observed_at":"2026-08-11T20:00:34.558738Z","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","venue":"cs.LG","work_id":"65e8d281-1600-4de9-8aa0-71c6ce6e2ffd","year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.331434Z"},"links":{"cited_paper":"/paper/2106.08541","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:98b9ec2f69cb5cda7ffc72e4377e82902511f3dcaf0627634945ef4d7e155c5c","observation_id":"82946a4a-ae0b-42ca-aa11-07efeab1ba73","resolution":{"observed_at":"2026-08-11T20:00:34.564193Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.751232Z","title":"Boscaini, Jonathan Masci, Emanuele Rodol \\`a , Jan Svoboda, and Michael M","venue":null,"work_id":"6186098b-8719-4aca-bbde-253be6562aa2","year":2017},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.334845Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:7480b8f5715ef07bc9b79520a64171de3ca3077f1a9739bfe69983b42a6c072e","observation_id":"23fbdfc1-8f49-438b-8498-f095da3ae1ea","resolution":{"observed_at":"2026-08-11T20:00:34.754402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.743249Z","title":"Revisiting over-smoothing and over-squashing using ollivier-ricci curvature","venue":null,"work_id":"f39bf7f2-39f4-4611-b690-acfe3e3ea11a","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.337511Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:dcb56d878b39d03b55b564895b28acdfefab92a878e40972df9e8c2a54d882d4","observation_id":"c5fedc2f-b5b3-465c-a36f-e0a05746ddad","resolution":{"observed_at":"2026-08-11T20:00:34.745945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.734884Z","title":"Poincar \\'e embeddings for learning hierarchical representations","venue":null,"work_id":"a10d0632-07e1-4302-853e-0cfcd1e0ab85","year":2017},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.339842Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:fbb1b2ea6a2317b199068621fce43960e29a8def0b23d93bb4f49584373ae2da","observation_id":"8b7e881b-cb52-49bd-86ac-be8a660ea27f","resolution":{"observed_at":"2026-08-11T20:00:34.737702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T16:26:15.183926Z","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-11T20:00:34.342079Z","title":"On asymptotic behaviors of graph cnns from dynamical systems perspective","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.342079Z"},"links":{"cited_paper":"/paper/1905.10947","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:81c413cadc7a8526c5b0c19de7c9f2f41ce869a510829ac68a8e11498c491f0f","observation_id":"3a8919c9-3c94-49b6-bc27-03145fe3ce29","resolution":{"observed_at":"2026-08-11T20:00:34.342079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.13021","last_updated":"2021-03-21T22:05:08Z","snapshot_observed_at":"2026-08-10T06:46:48.009859Z","submitted_at":"2019-09-28T04:13:33Z","title":"Multi-scale Attributed Node Embedding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.13021","snapshot_observed_at":"2026-08-11T20:00:34.344533Z","title":"Multi-scale attributed node embedding","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.344533Z"},"links":{"cited_paper":"/paper/1909.13021","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:ad9828bca888fa83d9e00b74e79be9e295cd6a308f02242af3d6c5e427fdffc4","observation_id":"a56c2dcd-b714-43e9-ae2f-fbce03b5dd8e","resolution":{"observed_at":"2026-08-11T20:00:34.344533Z","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-11T20:00:34.347509Z","title":"Konstantin Rusch, Michael M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.347509Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:17d3e8ab4bcc19fd0c4c4f47008757354533198842f8f51271a238f1e4b1a55d","observation_id":"c01acd07-7e8e-47f4-a5db-c08ffc6cfa91","resolution":{"observed_at":"2026-08-11T20:00:34.347509Z","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-11T20:00:34.720931Z","title":"Low distortion delaunay embedding of trees in hyperbolic plane","venue":null,"work_id":"0541a2fc-505d-49fa-8e66-46c462af71cd","year":2011},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.349871Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:acff9cb62ab6c3df7fb364eb8b88d1af4bf3883ab1c9a8bf3f0ce047cbe9c5c6","observation_id":"b917894b-515d-4c7d-9bd1-308588e7bdbb","resolution":{"observed_at":"2026-08-11T20:00:34.724105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.712065Z","title":"Collective classification in network data","venue":null,"work_id":"41776479-f126-4ae7-9c90-8d90c593cc14","year":2008},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.352248Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:9ecf27e3364775d3cad9fbbfc48e24f7fcdf132469ecd441fa884ce21e27aa1a","observation_id":"a918c9aa-10ad-40df-886c-59b4feb1e78e","resolution":{"observed_at":"2026-08-11T20:00:34.715338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-11T20:00:34.355102Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.355102Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:3795709d507cc815d2a2c18aef219df05108b401fee7045cbcc600eac1c8abb7","observation_id":"be80fcb1-0a58-4727-a531-b1c99bebb3ef","resolution":{"observed_at":"2026-08-11T20:00:34.355102Z","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-11T20:00:34.703322Z","title":"Venkatachalam, Danica J","venue":null,"work_id":"695f1806-da8c-439f-866f-9dfbc0382f27","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.358254Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:c33cb1bfaeb68d9e983f75433fdf31a933ce23040962d9a97afbecb5253fe40a","observation_id":"e7888761-96f3-49f7-af4d-48d3a743a3a6","resolution":{"observed_at":"2026-08-11T20:00:34.706364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.694157Z","title":"Relwire: Metric based graph rewiring","venue":null,"work_id":"cb95ce27-e89c-40fc-9a7b-23b14d3b6814","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.360961Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:e0807c72b422274e127ddf73199b209c685e8b9fc71495a381fb209929d60e4b","observation_id":"ad051392-bf4d-4ba4-8249-a26010de58cf","resolution":{"observed_at":"2026-08-11T20:00:34.697425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.684534Z","title":"Semi-supervised learning (chapelle, o","venue":null,"work_id":"d8a67d0c-2677-4251-b3f4-15d8a141e4e7","year":2006},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.363729Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:6755e69a6754df4285b03740e7eeb5a887f6a34a8b2435159c8c94399b69a910","observation_id":"a52db9d3-605d-4838-8af3-fda337dba70f","resolution":{"observed_at":"2026-08-11T20:00:34.688233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.673340Z","title":"Is rewiring actually helpful in graph neural networks?, 2023","venue":null,"work_id":"c229129a-81ea-4c3d-950b-178b40922742","year":2023},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.366598Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:65e82f15ce4c0b5b2512dba6f9b49a26777148fac6bdc62b1c641aa10e5e578a","observation_id":"729b42e2-d5f1-41d8-9121-39c92270d459","resolution":{"observed_at":"2026-08-11T20:00:34.676789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-11T20:00:34.369345Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.369345Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:0c8421d584fcabec307d675f1d62de9c17b105399ea5e4de74e453526b2e1d05","observation_id":"ede12201-1e59-4312-843c-25585b150db1","resolution":{"observed_at":"2026-08-11T20:00:34.369345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.01315","last_updated":"2020-08-25T15:46:13Z","snapshot_observed_at":"2026-07-06T08:18:46.549511Z","submitted_at":"2019-09-03T17:10:28Z","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01315","snapshot_observed_at":"2026-08-11T20:00:34.372348Z","title":"Deep graph library: A graph-centric, highly-performant package for graph neural networks","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.372348Z"},"links":{"cited_paper":"/paper/1909.01315","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:ee697ae76a370be1437ea9d2af6867ca24b59d06b9f6f717efafef8e6d2e4db3","observation_id":"307f6096-c3da-45bc-8ed3-cd39ebb27f47","resolution":{"observed_at":"2026-08-11T20:00:34.372348Z","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-11T20:00:34.663696Z","title":"Watts and Steven H","venue":null,"work_id":"5aab976b-74bb-48af-91ed-038244e3126b","year":1998},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.375255Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:cf945b5f0099bc129c6a635aaaf0ecc00d12a46fe8b2cd9ed299fbe667fb0fc0","observation_id":"7031beac-1523-4608-b59e-951b2de83f1e","resolution":{"observed_at":"2026-08-11T20:00:34.666957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07153","last_updated":"2019-06-20T17:22:43Z","snapshot_observed_at":"2026-08-14T17:14:17.365395Z","submitted_at":"2019-02-19T17:21:15Z","title":"Simplifying Graph Convolutional Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07153","snapshot_observed_at":"2026-08-11T20:00:34.377872Z","title":"de Souza, Christopher Fifty, Tao Yu, and Kilian Q","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.377872Z"},"links":{"cited_paper":"/paper/1902.07153","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:8f163f82f4e95c046fd0061511640aad3c3a16b4734e19f4ddd08a22d81824c0","observation_id":"df5c6d59-aa17-4192-9a3e-560785be102a","resolution":{"observed_at":"2026-08-11T20:00:34.377872Z","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-11T20:00:34.654184Z","title":null,"venue":null,"work_id":"fb3dc85b-87dd-44d2-92bc-8881e3acdc54","year":2019},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.380945Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:d4371c66b782c3e09660e1b28c01bf98b24a24e572a957d5d83aeef5c171adbd","observation_id":"8b87c9f9-ddfa-4bf6-b988-870e937dc379","resolution":{"observed_at":"2026-08-11T20:00:34.657352Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-11T20:00:34.383685Z","title":"How powerful are graph neural networks? ArXiv, abs/1810.00826, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.383685Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:82dc1d84e227052c2d6b4bb856e0e3d3ccc9b3ae745f24c6bfc78bb0bc26b3c7","observation_id":"75b9db1f-dea7-4a57-886f-482b6f33264e","resolution":{"observed_at":"2026-08-11T20:00:34.383685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08727","last_updated":"2022-03-23T16:28:06Z","snapshot_observed_at":"2026-08-13T17:51:51.404836Z","submitted_at":"2021-10-17T05:16:58Z","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.08727","snapshot_observed_at":"2026-08-11T20:00:34.386889Z","title":"Graph-less neural networks: Teaching old mlps new tricks via distillation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.386889Z"},"links":{"cited_paper":"/paper/2110.08727","citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:e7950357559841b44cec7feb9582e6f169317a108071a6cac0236c8fe1bc50db","observation_id":"e61487ba-1ea3-4ef4-8b03-0df70eaef3a8","resolution":{"observed_at":"2026-08-11T20:00:34.386889Z","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-11T20:00:34.643758Z","title":"Hyperbolic graph attention network","venue":null,"work_id":"05354a2f-e9e3-4218-bb71-711e2405eee9","year":2019},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.389973Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:f743f7ad4c44ec1b22a2b4d70537469d780f9bd7242d81bfaa2f0c2a35defa5a","observation_id":"813daed5-a55c-4607-a0cc-cbd80cf4acfc","resolution":{"observed_at":"2026-08-11T20:00:34.647190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.633718Z","title":"Lorentzian graph convolutional networks","venue":null,"work_id":"c71aea96-a296-49f2-aba5-c6886796fffe","year":2021},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.392658Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:ed0f2e6f9bab42f7952b2f0ebd8835ac84cee73ad97a476d0e283e602e51df73","observation_id":"8f988105-61ca-4cdd-82cd-689281475ef7","resolution":{"observed_at":"2026-08-11T20:00:34.637319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T20:00:34.395601Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T20:00:34.395601Z"},"links":{"citing_paper":"/paper/2412.06173"},"observation_digest":"sha256:562fccd9c1a5d90b1dd07b8fc789c3da1a0b0ef39b121cf5112baa107ab9f0f1","observation_id":"de446992-3c78-4847-ab50-708fd087c4fe","resolution":{"observed_at":"2026-08-11T20:00:34.395601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.06173","last_updated":"2024-12-09T03:09:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T22:46:31.066269Z","submitted_at":"2024-12-09T03:09:04Z","title":"Revisiting the Necessity of Graph Learning and Common Graph Benchmarks"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":1,"verified_fuzzy":29},"total_outbound_references":50},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 2 inbound Pith citation observations for arXiv:2412.06173."}