{"as_of":"2026-08-20T22:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd4d2d02fca67d47f6a2157262a32a1ccf746b2690a4a6deccf6a75dca37b82a","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T11:01:25.253136Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.07716/citation-record","integrity":"/paper/2510.07716/integrity","json":"/paper/2510.07716/citation-record.json","paper":"/paper/2510.07716"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:01:18.956988Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:18.956988Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:aabe283e0ac63361e652fd74f9d4a22cae5ddafe5c034ebdf01d4f8d332c077e","observation_id":"5e25d3dc-a11a-49fa-91a6-9b0b8406c747","resolution":{"observed_at":"2026-08-04T11:01:18.956988Z","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":"10.1016/j.dam.2008.06.033","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph spectra as a systematic tool in computational biology","venue":"Discrete Applied Mathematics","work_id":"87a42003-1260-4a66-8315-01d0cf9f51f0","year":2009},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.035390Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:d4bb9e559f1a95447b73ce4103cef194e202c5ae49324977f1956fd1ec585817","observation_id":"56101aad-c2ab-441e-8a9d-69abef6a8596","resolution":{"observed_at":"2026-08-04T11:04:51.436943Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:19.261338Z","title":"Graph-based user behavior modeling: From prediction to fraud detection","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.261338Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:f716c72ae9d51b1978ea2ea124ba75102860e0bf9aa121be5c8d9f4dbba2723d","observation_id":"02292519-45f5-4640-be2e-83b5a74a82fe","resolution":{"observed_at":"2026-08-04T11:01:19.261338Z","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-04T11:01:19.377872Z","title":"Boosting graph anomaly detection with adaptive message passing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.377872Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:f2cc4181fed15fddfe87e6fc085fe4a86cfb118dc437ed358b7a25a1efd716c8","observation_id":"00dffd93-2d58-424b-bb88-ed08c3bdcaf4","resolution":{"observed_at":"2026-08-04T11:01:19.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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:01:19.568990Z","title":"Taming graph kernels with random features","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.568990Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:7fbfc0af76aa05d7c210e4557187f2cb8d7c08969f4f6389c6f4d118c1a65e87","observation_id":"4176c953-6d2b-40b2-af8b-3818ad627597","resolution":{"observed_at":"2026-08-04T11:01:19.568990Z","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-04T11:01:19.695911Z","title":"Fast tree-field integrators: From low displacement rank to topological transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.695911Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:a47dfb49ae95cdb4ff6f6ab9d301c01f73b049ec9093902dda17175c21a19057","observation_id":"ce9977c0-bddc-4500-8cd8-27aedbfeb8c3","resolution":{"observed_at":"2026-08-04T11:01:19.695911Z","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-04T11:01:19.802120Z","title":"Optimal time complexity algorithms for computing general random walk graph kernels on sparse graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.802120Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:5009753cd8092b52835b3461993605e6945ffe038666c59721e6faec02ad0b80","observation_id":"784040e1-a62a-4008-8552-f8de54e831e8","resolution":{"observed_at":"2026-08-04T11:01:19.802120Z","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-04T11:01:19.978954Z","title":"A simple baseline algorithm for graph classification, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:19.978954Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:53edfa74f045d96e638d6192508e4e13a1ab9e51f64d7d0823b872a4e28b92ec","observation_id":"2a26b4ca-4798-4fde-8b8c-567e110fd66a","resolution":{"observed_at":"2026-08-04T11:01:19.978954Z","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-04T11:01:20.138447Z","title":"Graph convolution network based recommender systems: Learning guarantee and item mixture powered strategy","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.138447Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:42edaf4b05d68f054e8e4d801f482dae512c7c20a60110a7abbc2bcb6845f1b5","observation_id":"e7ced58a-f73f-4234-89cc-b47ef7c8d0d4","resolution":{"observed_at":"2026-08-04T11:01:20.138447Z","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-04T11:01:20.289822Z","title":"Spacegnn: Multi-space graph neural network for node anomaly detection with extremely limited labels","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.289822Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:7aea1bf77084a2dca9120cda9448f4823d3263ef7b8045e2b4ff6ff7ed1df872","observation_id":"b0c2702a-375b-46e6-913d-b9abcc9388ac","resolution":{"observed_at":"2026-08-04T11:01:20.289822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00982","last_updated":"2022-12-28T04:57:24Z","snapshot_observed_at":"2026-08-13T23:22:42.355874Z","submitted_at":"2020-03-02T15:58:46Z","title":"Benchmarking Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00982","snapshot_observed_at":"2026-08-04T11:01:20.439905Z","title":"Benchmarking graph neural networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.439905Z"},"links":{"cited_paper":"/paper/2003.00982","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:32b2727f74f790f45890fb3c72b84d70acc3cf3b29e0b79e34808bcb6c43cf74","observation_id":"9a2fae09-773c-406a-be14-9ed08029e20b","resolution":{"observed_at":"2026-08-04T11:01:20.439905Z","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-04T11:01:20.582895Z","title":"Long range graph benchmark","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.582895Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:0ee6a7d5e4d98b8684badb663038750b3c4aa4b7ac8146cbdc6ce7c3ba1a0aaf","observation_id":"143364f6-14ac-4f65-985d-30731972805e","resolution":{"observed_at":"2026-08-04T11:01:20.582895Z","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-04T11:01:20.744184Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.744184Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:d9c955bbe95cb5280f09cd3edc7483af8943be5eaf1f2bb9131d6134db5daac4","observation_id":"3a078702-8d22-4743-a693-b537477240e3","resolution":{"observed_at":"2026-08-04T11:01:20.744184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.00564","last_updated":"2021-02-28T16:57:41Z","snapshot_observed_at":"2026-08-16T18:42:23.830032Z","submitted_at":"2021-02-28T16:57:41Z","title":"An Introduction to Johnson-Lindenstrauss Transforms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.00564","snapshot_observed_at":"2026-08-04T11:01:20.880624Z","title":"An introduction to johnson-lindenstrauss transforms","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:20.880624Z"},"links":{"cited_paper":"/paper/2103.00564","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:29cd335ce0e758f90783c27a2af29325bd9a0d677321e3fb7c93913d255ffe21","observation_id":"ca84b440-f9a5-43fc-a817-f08f4610e5a5","resolution":{"observed_at":"2026-08-04T11:01:20.880624Z","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-04T11:01:21.035727Z","title":"A survey of graph neural networks for recommender systems: Challenges, methods, and directions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.035727Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:b05d3782e69157cd67de2d46aa5276dd70def3c8dad235f3cc11bb666d2f2e3d","observation_id":"de92bd7e-a0d7-4b3e-bf22-ff503e7489ad","resolution":{"observed_at":"2026-08-04T11:01:21.035727Z","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-04T11:01:21.223851Z","title":"Do logarithmic proximity measures outperform plain ones in graph clustering? In International Conference on Network Analysis, pp.\\ 87--105","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.223851Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:348bdc8c9adbc4d418dac0fac2ac4ddf098f57a2d83b2dab0ad4edf5c2ec2ed1","observation_id":"f8bebf11-f3b2-4ad5-a03a-6f8c2406c29f","resolution":{"observed_at":"2026-08-04T11:01:21.223851Z","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-04T11:01:21.335385Z","title":"Graph anomaly detection with graph neural networks: Current status and challenges","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.335385Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:c2978eab8e854e2f8a345b823078b5f19d3c9a0e30f1d0cac37237c8097c8df0","observation_id":"f02b7704-5967-4ce6-8202-7c4447a01c68","resolution":{"observed_at":"2026-08-04T11:01:21.335385Z","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-04T11:01:21.467109Z","title":"Label-based graph augmentation with metapath for graph anomaly detection","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.467109Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:1cff0fa11cd8dbb5065cb86aeba8b8d4c9c09939a05f428b4b036ce5237e4bc8","observation_id":"9ff9e045-7b98-4404-81ca-464011d1d2af","resolution":{"observed_at":"2026-08-04T11:01:21.467109Z","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-04T11:01:21.586248Z","title":"Lafferty","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.586248Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:f4b87ee64144edf4083ce9b021034b9369a61d7b08c3a32971a2a87815e262df","observation_id":"9542af88-242c-4aa4-880d-f880a5cdc1bb","resolution":{"observed_at":"2026-08-04T11:01:21.586248Z","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":"10.1007/s41109-019-0195-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kriege, Fredrik D","venue":"Applied Network Science","work_id":"26005385-6e89-4659-b5fb-59dbf2cfe3e7","year":2020},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.716438Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:5138df584995dc18b784f25ec0909cb327df03281219aef9901b7031d48d0e4c","observation_id":"ed73a462-eafa-4b83-b30d-7b090e3e9ef1","resolution":{"observed_at":"2026-08-04T11:04:51.291665Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:21.845472Z","title":"Diffgad: A diffusion-based unsupervised graph anomaly detector","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.845472Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:d6a261bef6d2dbccdc71c8572c064d8ef448d8d276c93c4e3dc62745e6d89836","observation_id":"dd18a334-07d3-4ceb-9af4-d4a5b96f8f0d","resolution":{"observed_at":"2026-08-04T11:01:21.845472Z","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-04T11:01:21.975274Z","title":"Towards self-interpretable graph-level anomaly detection","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:21.975274Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:9610e84f5e86936090ec46ff673f7f6ccfbfd253c2399c65511a124af2fbaab6","observation_id":"9975bc1a-e5bd-401e-8545-8b07795ce0e3","resolution":{"observed_at":"2026-08-04T11:01:21.975274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13265","last_updated":"2025-07-31T13:38:55Z","snapshot_observed_at":"2026-08-16T13:41:34.923620Z","submitted_at":"2024-06-19T06:53:09Z","title":"Molecule Graph Networks with Many-body Equivariant Interactions","version":3},"cited_work":{"arxiv_id":"2406.13265","doi":"10.48550/arxiv.2406.13265","metadata_source":"pith","pith_arxiv_id":"2406.13265","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Molecule Graph Networks with Many-body Equivariant Interactions","venue":"cs.LG","work_id":"90f15a05-4b56-4354-968c-dec6a9a69edd","year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.126886Z"},"links":{"cited_paper":"/paper/2406.13265","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:1229cd84467f0c02f35bca79185a89a7a84c38e51bcb600a624e6d765576ab00","observation_id":"5e390b43-3294-44d7-9074-ba422668ef7c","resolution":{"observed_at":"2026-08-04T11:04:51.127840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:22.237880Z","title":"Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.237880Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:7d8be27bf7cda8b2f7962d9db0fbbe580c1ad44c5c688a053bcb9f579fd76d52","observation_id":"6e84870e-cdef-4106-b8b7-c542a98737a7","resolution":{"observed_at":"2026-08-04T11:01:22.237880Z","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":"10.1613/jair.1.13225","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph kernels: A survey","venue":"Journal of Artificial Intelligence Research","work_id":"ce11db5c-8f7e-49fe-ba5a-e6fd7f67805d","year":2021},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.402156Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:d2cbef4de015d79383ef32231f3a4dbb9e64203790bfe50b6e03d85db9de00c8","observation_id":"453d12b1-89fb-471a-91d3-1ec868456c13","resolution":{"observed_at":"2026-08-04T11:04:50.957975Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:22.611644Z","title":"Noble and Diane J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.611644Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:77e0bfdf3fd3fa54214e79b9e0daef5398c31e8abdcb1bdc28436a9af5a0f349","observation_id":"552d5da1-643f-4f4a-a4f7-891a02223d34","resolution":{"observed_at":"2026-08-04T11:01:22.611644Z","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-04T11:01:22.784886Z","title":"Quasi-monte carlo graph random features","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.784886Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:9ffe5ca48fa1e924b1b8fa1c122c5e567882072cc65bcf843b3750cfdc33c5d1","observation_id":"b8f14419-ace2-4866-83e8-8c551f8f07e1","resolution":{"observed_at":"2026-08-04T11:01:22.784886Z","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-04T11:01:22.953790Z","title":"Repelling random walks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:22.953790Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:fa9760f7a71ef5304808f9892fbebcd44dfe1cb3d35cfe791db7460256bad983","observation_id":"eb86eaef-b2b2-429c-b641-b607956fc153","resolution":{"observed_at":"2026-08-04T11:01:22.953790Z","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-04T11:01:23.119605Z","title":"General graph random features","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.119605Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:bbdc30f6f90c2c9a4631a2b661ae456f24e771a9cb7d9d5280637e695632b740","observation_id":"1d4dfdeb-613e-44a8-8079-1191ff3259d5","resolution":{"observed_at":"2026-08-04T11:01:23.119605Z","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-04T11:01:23.302731Z","title":"Whitney, Amr Ahmed, Joshua Ainslie, Alex Bewley, Mithun George Jacob, Aranyak Mehta, David Rendleman, Connor Schenck, Richard E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.302731Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:ad27db04e2621b737a73525e8ea3395b1bf27aea1c9f435a3113136242dd2fd7","observation_id":"561f62d0-a30e-471c-a713-485d7f9fc52a","resolution":{"observed_at":"2026-08-04T11:01:23.302731Z","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-04T11:01:23.463640Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.463640Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:8b33e0b3ea6e5e55e8c9dcfb1296ce6e9d3f40af5e1fe26f01059f20f10f02fa","observation_id":"c776bf51-ee8a-4800-a502-ab704778398b","resolution":{"observed_at":"2026-08-04T11:01:23.463640Z","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":"10.1007/978-3-540-45167-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T11:04:50.663014Z","title":"Smola and Risi Kondor","venue":null,"work_id":"1b2bae2a-22c0-47ac-a9b2-ca9ce389fb5f","year":2003},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.624815Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:90160f5e7f1e126fba6e096ff21447f7736042f6808ce14ff104dd23b898db73","observation_id":"84dd89a0-861d-4326-be78-a583a3eb80e8","resolution":{"observed_at":"2026-08-04T11:04:50.815925Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:23.760995Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.760995Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:fef2245105d773a087d1c967ef6b696875839952d2f6e5cb4a84897209b8db30","observation_id":"c0817d0d-9fe6-4f65-8454-6547f7723932","resolution":{"observed_at":"2026-08-04T11:01:23.760995Z","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-04T11:01:23.918212Z","title":"Aggarwal","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:23.918212Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:93d0a748be7bf50afe85923aa1bf837a352e0763395a5f1e52df991400621567","observation_id":"3f75d9dc-3870-4326-a634-3c814c092713","resolution":{"observed_at":"2026-08-04T11:01:23.918212Z","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-04T11:01:24.073086Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.073086Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:fc5b2ebc412fae6f60bbd7eba229980fc32b26169457d4034cca5b904cf5c355","observation_id":"c54cba5b-e8c1-4b7d-b912-6c45e44b341a","resolution":{"observed_at":"2026-08-04T11:01:24.073086Z","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-04T11:01:24.228353Z","title":"An empirical study towards prompt-tuning for graph contrastive pre-training in recommendations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.228353Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:72cad628c3be3217bd55f706c46e6008adb4e28084817add398cf919e2071e3b","observation_id":"eda574b7-6e18-4457-8c1f-c839d8fbeb13","resolution":{"observed_at":"2026-08-04T11:01:24.228353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15693","last_updated":"2024-12-30T10:50:51Z","snapshot_observed_at":"2026-08-16T01:19:02.710174Z","submitted_at":"2024-12-30T10:50:51Z","title":"Hgformer: Hyperbolic Graph Transformer for Recommendation","version":1},"cited_work":{"arxiv_id":"2502.15693","doi":"10.48550/arxiv.2502.15693","metadata_source":"pith","pith_arxiv_id":"2502.15693","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Hgformer: Hyperbolic Graph Transformer for Recommendation","venue":"cs.IR","work_id":"759567f7-2422-4c5d-af3f-5c3ff318f29c","year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.380190Z"},"links":{"cited_paper":"/paper/2502.15693","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:525b8c6ff53c2587f01d0609cd3e94db035cc7af2b2e23b2341725006c8b49d2","observation_id":"2700f96e-71c8-4192-9c6a-86254a5168e8","resolution":{"observed_at":"2026-08-04T11:04:50.658389Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-04T11:01:24.565023Z","title":"geometric\\_shapes : Representation of geometric shapes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.565023Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:5182da7c3b451f4bf2236cc36565b0df4a0a7989e49f8b51db3da165e63d9a98","observation_id":"9ddce80e-d4ff-46bf-bacf-a1683aea4075","resolution":{"observed_at":"2026-08-04T11:01:24.565023Z","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-04T11:01:24.693946Z","title":"Equipocket: an e(3)-equivariant geometric graph neural network for ligand binding site prediction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.693946Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:b48045ebd2594f6117d67eed9a037fde4237c42cb1016e26b0111555bc6ecae0","observation_id":"3023f28e-b78c-4813-8f3f-df7c949233d0","resolution":{"observed_at":"2026-08-04T11:01:24.693946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1605.04797","last_updated":"2016-07-02T03:15:10Z","snapshot_observed_at":"2026-08-18T04:23:41.102973Z","submitted_at":"2016-05-16T15:09:19Z","title":"Thingi10K: A Dataset of 10,000 3D-Printing Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.04797","snapshot_observed_at":"2026-08-04T11:01:24.885936Z","title":"Thingi10k: A dataset of 10,000 3d-printing models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:24.885936Z"},"links":{"cited_paper":"/paper/1605.04797","citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:54eed11195a52befbcaa34062312733ddd114734295ee77f56e80f7434e38431","observation_id":"dd8834f3-d2cf-4669-92d6-9ee6844e662c","resolution":{"observed_at":"2026-08-04T11:01:24.885936Z","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-04T11:01:25.001338Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:25.001338Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:36f580520b7f6832161ce61aaa64d70577d8309996bc79fb90fe44148d0d9569","observation_id":"68f8ff0f-00be-4971-b41a-564a815a8684","resolution":{"observed_at":"2026-08-04T11:01:25.001338Z","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-04T11:01:25.125393Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:25.125393Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:25f638471c45c6aaadce6afc8444f5bf141c4e5c136d8daa1da3670cb8387f19","observation_id":"e4c35ce2-184f-4aa0-ab14-119bcff3048d","resolution":{"observed_at":"2026-08-04T11:01:25.125393Z","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-04T11:01:25.253136Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T11:01:25.253136Z"},"links":{"citing_paper":"/paper/2510.07716"},"observation_digest":"sha256:43e7a496c84ce64b29756015129ccc8bf01b84ae1fba4909a89c9f6fe1f1f660","observation_id":"936dab06-8a21-4320-82dd-9a5578a9d676","resolution":{"observed_at":"2026-08-04T11:01:25.253136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.07716","last_updated":"2026-06-24T21:14:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T12:34:45.126988Z","submitted_at":"2025-10-09T02:53:26Z","title":"Computationally-efficient Graph Modeling with Refined Graph Random Features"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":43},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2510.07716."}