{"as_of":"2026-08-10T06:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2da9124dff687422820061915b69d16c6598ba63c88f1cf620e63786ea143b54","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:59:58.853813Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-06-27T01:51:18.585359Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2502.00190","doi":"10.48550/arxiv.2502.00190","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the effectiveness of random weights in graph neural networks","venue":"ArXiv.org","work_id":"3096b214-a827-4531-9604-04400485c200","year":2025},"citing_paper":{"arxiv_id":"2604.19162","last_updated":"2026-04-21T07:16:05Z","snapshot_observed_at":"2026-07-06T23:05:53.378585Z","submitted_at":"2026-04-21T07:16:05Z","title":"Mind the Unseen Mass: Unmasking LLM Hallucinations via Soft-Hybrid Alphabet Estimation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T02:31:45.994612Z"},"links":{"cited_paper":"/paper/2502.00190","citing_paper":"/paper/2604.19162"},"observation_digest":"sha256:150a68178144c1efd9337d574cd23dd43eb08683f27faeaeebc3126e7bcb9d24","observation_id":"ba030028-90c7-4b74-bc4f-f6723d7bc1cf","resolution":{"observed_at":"2026-05-11T13:01:03.676421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2502.00190","doi":"10.48550/arxiv.2502.00190","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00190","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the effectiveness of random weights in graph neural networks","venue":"ArXiv.org","work_id":"3096b214-a827-4531-9604-04400485c200","year":2025},"citing_paper":{"arxiv_id":"2606.18001","last_updated":"2026-06-16T14:47:35Z","snapshot_observed_at":"2026-08-04T02:19:09.681640Z","submitted_at":"2026-06-16T14:47:35Z","title":"Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T01:51:18.585359Z"},"links":{"cited_paper":"/paper/2502.00190","citing_paper":"/paper/2606.18001"},"observation_digest":"sha256:a69f41fe468cdb85d7836bb3c39f9755365fe26faca357278ed78dd56af55ba3","observation_id":"98fe3903-ca0e-4008-a250-b97f32ad9c47","resolution":{"observed_at":"2026-06-27T02:00:22.152521Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00190/citation-record","integrity":"/paper/2502.00190/integrity","json":"/paper/2502.00190/citation-record.json","paper":"/paper/2502.00190"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.311643Z","title":"The surprising power of graph neural networks with random node initialization","venue":null,"work_id":"1f8740f3-551c-4fb5-b14f-b49560204aa2","year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.696181Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:0a052332e8736e836c4e51f3bd86827b91fa22848280ef0f9fda9b169e19c052","observation_id":"7a79f183-3a81-4284-90a9-c074d8f96152","resolution":{"observed_at":"2026-08-09T19:59:59.315327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.09554","last_updated":"2019-11-26T11:15:03Z","snapshot_observed_at":"2026-08-03T11:39:17.354992Z","submitted_at":"2019-11-21T15:48:15Z","title":"Discrete and Continuous Deep Residual Learning Over Graphs","version":2},"cited_work":{"arxiv_id":"1911.09554","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.09554","snapshot_observed_at":"2026-08-09T19:59:58.992405Z","title":"Discrete and Continuous Deep Residual Learning Over Graphs","venue":"cs.LG","work_id":"1d800d86-dbbb-457e-b29d-fa126eccad72","year":2019},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.700590Z"},"links":{"cited_paper":"/paper/1911.09554","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:c25c2ca37f0a0b29b6f8242d7be874777faf3bb12ab6186ac49f0b816c3e8cde","observation_id":"86ca6083-f428-4dc1-9371-69b36a063700","resolution":{"observed_at":"2026-08-09T19:59:58.996202Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.300668Z","title":"Pyramidal reservoir graph neural network","venue":null,"work_id":"47d0382c-53c7-415b-9b43-e0290cb4198f","year":2022},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.704504Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:21e3ebf82227246363aeadee8b67606f41711cfc8586533e90dd94a789810ed7","observation_id":"af6240be-2018-4521-a9eb-1313c4d577ea","resolution":{"observed_at":"2026-08-09T19:59:59.304501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:58.708666Z","title":"Experiment tracking with weights and biases, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.708666Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:c783f3bcf9eea0217ecc9409989ba7afb4dffa2df3b5fc189f8238cf3a6874d1","observation_id":"7ba36588-6caa-4354-a8c2-f561c00e0612","resolution":{"observed_at":"2026-08-09T19:59:58.708666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13478","last_updated":"2021-05-02T16:16:03Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-27T21:09:51Z","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13478","snapshot_observed_at":"2026-08-09T19:59:58.712439Z","title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.712439Z"},"links":{"cited_paper":"/paper/2104.13478","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:992006190f3840077454870ff4a76d9e7c9ba5762c7d04ab426e9f574b576702","observation_id":"e73a6345-b279-4f9c-a546-5ed892f694cd","resolution":{"observed_at":"2026-08-09T19:59:58.712439Z","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-09T19:59:59.283477Z","title":"A unified lottery ticket hypothesis for graph neural networks","venue":null,"work_id":"64f56f34-054e-42e4-aa95-5ea5ab045fb3","year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.716491Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:a33de38f4806eefde34c30c1d5cd60d22a0d3c8c004c5c4d7d85c576cc109c6d","observation_id":"294d53e5-b74a-4d54-98a2-42ae1d3ccf5b","resolution":{"observed_at":"2026-08-09T19:59:59.287397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.273279Z","title":"Pruning randomly initialized neural networks with iterative randomization","venue":null,"work_id":"a750c9f9-eac9-43bf-932a-cf9670dd114a","year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.720440Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:5aa405fdc5f7f0606b0ee46b109a2bd2c32e4c80c0588a322f2943079c067021","observation_id":"867f44b3-a207-49ad-bb8c-f2a2df12147f","resolution":{"observed_at":"2026-08-09T19:59:59.277190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.263396Z","title":"Investigating over-parameterized randomized graph networks","venue":null,"work_id":"e1a038da-13de-41d7-a0dd-19465db9e7a4","year":2024},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.724071Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:48369175dfeb746e6f63edbf5361106cca386c228f431438f6a52dfa9ddca0c8","observation_id":"a212a9e9-5edc-44eb-afb9-cbe0115337ec","resolution":{"observed_at":"2026-08-09T19:59:59.267102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.253382Z","title":"Benchmarking graph neural networks","venue":null,"work_id":"9439f2a4-162f-4b14-87b6-7cd74dae259e","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.727668Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:63edad9c46ace22946ac685d068cbe57b72012d0b5a12a4698c0fb2797339ae8","observation_id":"57429d7e-0e4f-4f7e-95d9-3534e77c204e","resolution":{"observed_at":"2026-08-09T19:59:59.257064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.242983Z","title":"Graph positional encoding via random feature propagation","venue":null,"work_id":"61eec7c6-cbe1-42f1-a622-338869bbd035","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.731272Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:1081b5d5fc044bf235f6d4becbed9be8b31ef63d8300c13b21b978e51c0c9c45","observation_id":"28338288-f7df-49a1-aad2-6b5a27e0e8be","resolution":{"observed_at":"2026-08-09T19:59:59.246670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.232854Z","title":"Improving graph neural networks with learnable propagation operators","venue":null,"work_id":"cf1359fd-b273-4196-b8ed-96a495b7d1ce","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.734694Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:31806f2ce899b9062016411bd8054a0157385611f0def3e6f5baa8406654b6dd","observation_id":"f31fa2bf-ec4b-4908-afa6-4e44d18b84fd","resolution":{"observed_at":"2026-08-09T19:59:59.236607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.13344","last_updated":"2024-10-31T23:12:29Z","snapshot_observed_at":"2026-07-06T18:03:02.200489Z","submitted_at":"2024-04-20T10:44:13Z","title":"GRANOLA: Adaptive Normalization for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.13344","snapshot_observed_at":"2026-08-09T19:59:58.738401Z","title":"Granola: Adaptive normalization for graph neural networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.738401Z"},"links":{"cited_paper":"/paper/2404.13344","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:4487b0632dd70dde67eb4ac6142366026ffe6b39ce57e5972175b1d16027d60d","observation_id":"ed0fea6f-8e30-46bb-a594-07b525668538","resolution":{"observed_at":"2026-08-09T19:59:58.738401Z","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-09T19:59:59.222428Z","title":"Graph random neural networks for semi-supervised learning on graphs","venue":null,"work_id":"2fbed29c-a63d-4598-815d-d4e2521643e4","year":2020},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.742005Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:0b5af5891f290e5c668ed709ceab9872812a9101fa3780c250df66f758ca13d7","observation_id":"7b10a3da-905b-4549-994e-f2a38b5591d5","resolution":{"observed_at":"2026-08-09T19:59:59.226127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-09T19:59:58.745401Z","title":"Fast graph representation learning with pytorch geometric","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.745401Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:e907846fb5276ced95f4480994ac3ed1591294d86b5988146edbdb17774abbe2","observation_id":"715c207b-85c4-4bdf-95e6-1708414833e8","resolution":{"observed_at":"2026-08-09T19:59:58.745401Z","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-09T19:59:59.212171Z","title":"Graph echo state networks","venue":null,"work_id":"b6aa59ca-2b72-4adc-8991-e823c670ae5d","year":2010},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.749371Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:40e0a9a078551dfe92f912a7d817600d6c682a1d16fa12f08ab4165e471d5e0d","observation_id":"4a634b98-f0c8-450c-8a5d-e25da65bad62","resolution":{"observed_at":"2026-08-09T19:59:59.215639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.202473Z","title":"Fast and deep graph neural networks","venue":null,"work_id":"f7c89872-c2bf-4a67-8296-cbdb96c4bc4e","year":2020},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.752824Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:aeac390d0913466225de04c15b6f78adaadc559460f9bb46e86022f689c7940c","observation_id":"3d2218f5-99a7-4f74-8b7d-c32dadb8995b","resolution":{"observed_at":"2026-08-09T19:59:59.205820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.192740Z","title":"Extreme learning machine to graph convolutional networks","venue":null,"work_id":"935f7095-7719-4c0a-94ae-9c3375defc72","year":2022},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.756267Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:68908c6043ab36cce9b58dcc779cfb6c4e037c8f46b82f9cbd7dc74f698b9d0a","observation_id":"0abed0be-01cf-486c-9196-95de17f8481d","resolution":{"observed_at":"2026-08-09T19:59:59.196434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.182949Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"5a7da74c-7a93-49f3-9185-9a6bdc4ef1a7","year":2017},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.759554Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:f367bfd82e17ccb3a016aca79a67b4122a3ef40f1c7659e0c93ad53046c5c5d1","observation_id":"cb6a8170-71bd-4d5b-884b-f9c086e5d503","resolution":{"observed_at":"2026-08-09T19:59:59.186618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-09T05:17:43.055948Z","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-09T19:59:58.762819Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.762819Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:a849107036b81ca672091ac9570ee1150232a5b4852a8b13ea260dc7d36696b8","observation_id":"3e925a93-dc90-49fd-904e-0cbe667515bb","resolution":{"observed_at":"2026-08-09T19:59:58.762819Z","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-09T19:59:59.173248Z","title":"Extreme learning machine: theory and applications","venue":null,"work_id":"45d747fb-e4bb-4b82-9c92-4a42612eb32c","year":2006},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.766663Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:6e1ba5b3cc6513115d3eadb3babb05fb9baff24dc5f4bbff2f35be5a7aeff049","observation_id":"600894d1-a265-4505-b315-93dc707ad822","resolution":{"observed_at":"2026-08-09T19:59:59.176804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.10471","last_updated":"2022-11-02T10:01:17Z","snapshot_observed_at":"2026-08-07T22:54:49.830277Z","submitted_at":"2022-02-21T19:00:01Z","title":"Classical versus Quantum: comparing Tensor Network-based Quantum Circuits on LHC data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.10471","snapshot_observed_at":"2026-08-09T19:59:58.770254Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.770254Z"},"links":{"cited_paper":"/paper/2202.10471","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:e3c484ff8e8df42b3ab0eb493f2125fccd8c0dc6ab37ddc793a4073379a193b2","observation_id":"e7291b25-3df0-4da8-8c6f-8354fecd3b78","resolution":{"observed_at":"2026-08-09T19:59:58.770254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.15335","last_updated":"2024-02-04T19:08:53Z","snapshot_observed_at":"2026-08-02T06:55:37.675093Z","submitted_at":"2022-11-28T14:17:36Z","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","version":5},"cited_work":{"arxiv_id":"2211.15335","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.15335","snapshot_observed_at":"2026-08-09T19:59:58.929823Z","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","venue":"cs.LG","work_id":"463fd8b1-e261-4980-a7ea-93c9e678beb7","year":2022},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.776144Z"},"links":{"cited_paper":"/paper/2211.15335","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:575673f3bdde2945dfd33b7c79f080957f008f05ef38773d548df4aa4910f62e","observation_id":"f207c4f9-8fe5-4b30-b373-f86c64632e63","resolution":{"observed_at":"2026-08-09T19:59:58.935741Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.163611Z","title":"echo state","venue":null,"work_id":"17c37d15-24e6-4da6-a7f2-6f526f953436","year":2001},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.779790Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:bf1473b01c82a7aac0877074b704e29af66e47638e7a7e8b06e354445e36be4f","observation_id":"b0ab9728-c40e-4088-8647-77bf65857018","resolution":{"observed_at":"2026-08-09T19:59:59.166993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","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-09T19:59:58.783295Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.783295Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:bfb6ec8f17d4426ff72a2c4be2e6ac69f6de47ee76fc213e0e726897251f30f4","observation_id":"f8944d98-6d8a-4b42-8412-3c9cc3e1f241","resolution":{"observed_at":"2026-08-09T19:59:58.783295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08993","last_updated":"2024-10-28T09:03:11Z","snapshot_observed_at":"2026-08-09T14:15:43.991975Z","submitted_at":"2024-06-13T10:53:33Z","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08993","snapshot_observed_at":"2026-08-09T19:59:58.786836Z","title":"Classic gnns are strong baselines: Reassessing gnns for node classification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.786836Z"},"links":{"cited_paper":"/paper/2406.08993","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:6a45960c399d79ba84120956157e402e114cb6bcf2b056d0a67f749868dee1a7","observation_id":"cf86e3b8-a4b3-417f-8dad-2314b2638a39","resolution":{"observed_at":"2026-08-09T19:59:58.786836Z","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-09T19:59:59.153656Z","title":"Automating the construction of internet portals with machine learning","venue":null,"work_id":"b7526eda-b542-43fc-a597-61141f2ebf59","year":2000},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.790560Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:0403decfb8a59880530ccda421587dd04c08a72ea4aae372d5d35079700508b6","observation_id":"227eb5fa-1174-4bb9-8071-462cb5d5e6b3","resolution":{"observed_at":"2026-08-09T19:59:59.157261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08663","last_updated":"2020-07-16T21:46:33Z","snapshot_observed_at":"2026-08-06T13:06:20.395369Z","submitted_at":"2020-07-16T21:46:33Z","title":"TUDataset: A collection of benchmark datasets for learning with graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08663","snapshot_observed_at":"2026-08-09T19:59:58.794006Z","title":"Tudataset: A collection of benchmark datasets for learning with graphs","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.794006Z"},"links":{"cited_paper":"/paper/2007.08663","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:e2eb46d0805083689e4a9e7814fde84721ea72286bbdacbe010ca64e47c8c805","observation_id":"42102180-5e45-41e2-8913-a2640b7ba5c3","resolution":{"observed_at":"2026-08-09T19:59:58.794006Z","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-09T19:59:59.143084Z","title":"Relational pooling for graph representations","venue":null,"work_id":"7eba63a3-395d-41f7-ae29-46176145205c","year":2019},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.798884Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:81d1fc0dd5927f710ad6e21c723b851193a9be1a31c401ce58f0943dd3900e23","observation_id":"b6b01fae-973d-475b-92be-ccae1aadb7e1","resolution":{"observed_at":"2026-08-09T19:59:59.146738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.131819Z","title":"Query-driven active surveying for collective classification","venue":null,"work_id":"46072ec0-c309-445b-9095-ec19cb88784b","year":2012},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.802335Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:90acbaf28265c3526401f078accee2df95968b9d05264bf399c96fe9da80db1c","observation_id":"8daf1f1e-aab9-45b2-82ac-e91868b807dc","resolution":{"observed_at":"2026-08-09T19:59:59.135637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.121005Z","title":"An untrained neural model for fast and accurate graph classification","venue":null,"work_id":"2e66364e-0edd-46f5-bc37-31937b24d420","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.805677Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:b1a4d9bf77debb8a2668ba3b41bf09d9c8bdf456b556948ebcedb67dd33cb8b1","observation_id":"fa54ae5f-c6eb-44d4-ba88-b7591f7e74e4","resolution":{"observed_at":"2026-08-09T19:59:59.124901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.110497Z","title":"Multiresolution reservoir graph neural network","venue":null,"work_id":"0c83d8e4-e3eb-4dcb-a088-a8c7df026212","year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.809212Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:ebe4f3feaceabe24fd6846532df0a9fd5d2f2a1f4b1ee36ce8bb1f8b1fb3da36","observation_id":"bb4339bc-cbe2-4b75-8f2a-3bf7c9923f6f","resolution":{"observed_at":"2026-08-09T19:59:59.114343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.099429Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":"5c7dbc67-1737-4d4a-8333-5884604cc2c6","year":2019},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.812907Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:441728f38de2a25aa7637ee683a3dda3ed0eb7c7375a054a0aa66350e6230f05","observation_id":"4a59e5ec-6a7d-49a0-ba34-c9d481c09c2f","resolution":{"observed_at":"2026-08-09T19:59:59.103522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07846","last_updated":"2020-11-12T10:30:15Z","snapshot_observed_at":"2026-07-06T09:28:53.031338Z","submitted_at":"2020-06-14T09:01:57Z","title":"Global Attention Improves Graph Networks Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07846","snapshot_observed_at":"2026-08-09T19:59:58.816339Z","title":"Global attention improves graph networks generalization","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.816339Z"},"links":{"cited_paper":"/paper/2006.07846","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:d6dfbb34bc9efafedb439e288475a77b64e6315e63c423f030e3da6b8e9c7b74","observation_id":"5aacce06-ce6b-4c57-84c6-fb6b05cae555","resolution":{"observed_at":"2026-08-09T19:59:58.816339Z","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-09T19:59:59.088950Z","title":"What's hidden in a randomly weighted neural network? In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2020","venue":null,"work_id":"855d60c6-9b24-4605-9cbd-35c1ba5763b1","year":2020},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.820097Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:09a368f05ff7a01787ee0dd450c37ea1442f724d8e43453c976703eed8436c01","observation_id":"13de7bcb-6bee-4661-96c1-74cdf091a50d","resolution":{"observed_at":"2026-08-09T19:59:59.092566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.077975Z","title":"Rank collapse causes over-smoothing and over-correlation in graph neural networks","venue":null,"work_id":"9eb1058f-02fe-4402-b57a-3a09e7cdbdbe","year":2024},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.823565Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:884c19ff04e6c20e0134fa85e8170286a4d148146825d866f04afc2161ee6f80","observation_id":"ac6887d6-c42b-4e21-9ab8-d8d505c3d896","resolution":{"observed_at":"2026-08-09T19:59:59.081579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.067656Z","title":"Random features strengthen graph neural networks","venue":null,"work_id":"7a96aa55-7b1b-4e62-a467-a2afed5ca373","year":2021},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.827204Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:ee210c59f12b8326df7afb69a85c3f0c4abc87525d1afe7ed9f928a0174d8918","observation_id":"3d8ee766-c78b-4903-a014-094e8c1cf41b","resolution":{"observed_at":"2026-08-09T19:59:59.071329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.056983Z","title":"Collective classification in network data","venue":null,"work_id":"7458b49b-0679-4f73-afdd-89117b9b1e44","year":2008},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.830383Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:ecbd8fda5d9b949aa064cc19ddd13c4bfbb2e8255af13f02fc4c26b554c3e7c6","observation_id":"7db2e4f8-8db2-45a6-95ca-7b39c9586d9b","resolution":{"observed_at":"2026-08-09T19:59:59.060896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-09T19:59:58.833705Z","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":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.833705Z"},"links":{"cited_paper":"/paper/1909.01315","citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:b99ef011e9713833e7a89ca448dc6d38077da80e4e941135e4d1fb183dce01b7","observation_id":"a4175be1-aecd-4562-aa53-b7d760ae41ec","resolution":{"observed_at":"2026-08-09T19:59:58.833705Z","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-09T19:59:59.045980Z","title":"Searching lottery tickets in graph neural networks: A dual perspective","venue":null,"work_id":"91a3713d-5e07-4558-8442-db45609a6414","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.837206Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:4d7e4187a577e4f1bbb9942c742ed1448d46234fa12e07f88d2e7e61127243e4","observation_id":"8d463b38-f3c4-4ce6-a5c9-773c19919e8f","resolution":{"observed_at":"2026-08-09T19:59:59.049613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:58.840418Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations , 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.840418Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:268efe480e1d7bb0f14b9c3465ddae78c92dd5431b07dedd2cb508abcfb5be46","observation_id":"34234e84-b5a3-4ee1-93c3-49dbd5bbcf14","resolution":{"observed_at":"2026-08-09T19:59:58.840418Z","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-09T19:59:59.029269Z","title":"Are graph augmentations necessary? simple graph contrastive learning for recommendation","venue":null,"work_id":"cb217d58-f57e-4939-97a7-f7522febfd5e","year":2022},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.843674Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:6a2ee443dab219976300071ac46669a902e3750aa0545967891380c261679528","observation_id":"1246b6d6-bf0a-4c5d-b30f-7f4ff97ed534","resolution":{"observed_at":"2026-08-09T19:59:59.033274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.019110Z","title":"Graph convolutional extreme learning machine","venue":null,"work_id":"7189d113-b930-49cb-be8c-c0a65c9583a9","year":2020},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.846881Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:cb330b7aea8df2876098962364bf40ed31269e41194e687aa5c851bd8da8be53","observation_id":"528ed563-2f17-4057-9c52-ce6cab5c9dae","resolution":{"observed_at":"2026-08-09T19:59:59.022663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:59.009136Z","title":"Semi-supervised learning with graph convolutional extreme learning machines","venue":null,"work_id":"62d681f2-ab2d-40e7-8c68-d1f4001d02ff","year":2023},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.850184Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:25ca3b3ea42ddcad7d512d6a5f193a7d6a4f0b1be195f0b14adeca52ed7543dd","observation_id":"6aa65de3-86a9-4dce-9850-6273a2ba1866","resolution":{"observed_at":"2026-08-09T19:59:59.012770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T19:59:58.853813Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T19:59:58.853813Z"},"links":{"citing_paper":"/paper/2502.00190"},"observation_digest":"sha256:8348f2b2234f67e59df9519d63aa8ac197946eaa6f1dc1061216af3a3d72a5a9","observation_id":"0809148b-1506-4207-b415-67e4930819e9","resolution":{"observed_at":"2026-08-09T19:59:58.853813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.00190","last_updated":"2025-01-31T22:13:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T19:49:51.391778Z","submitted_at":"2025-01-31T22:13:24Z","title":"On the Effectiveness of Random Weights in Graph Neural Networks"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 2 inbound Pith citation observations for arXiv:2502.00190."}