{"as_of":"2026-08-11T01:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12d2069fdc17f488f606047be97e8ec49ea647e5af45a25534891ef67eafe175","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T03:30:09.207707Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.09372/citation-record","integrity":"/paper/2607.09372/integrity","json":"/paper/2607.09372/citation-record.json","paper":"/paper/2607.09372"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T03:30:09.207707Z","title":"Newman, Networks: An Introduction, Oxford University Press, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:f2ff5c5686ca1752b20a9152de2330bbd4b9f154869137a53973c51927ffbc3e","observation_id":"16a96dc9-da0f-484e-831a-326a009b89a2","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:9c588e62065ad3c99e6e751c23af463853bfb13e7c844d74308ae4e5aa4a2e27","observation_id":"5ef6e565-a6e6-4a3c-93a3-3b37b4d4acd3","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Sabidussi, The centrality index of a graph, Psychometrika 31 (4) (1966) 581–603","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:80b40645fe6e3e8849fac3cfec759b46d375139e7490cb428ab364fbc29beafc","observation_id":"b9e2a71e-1bb2-4308-b206-6751cdac64d7","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:6bffceb74fa1168cfb7aa416147fc789d405a90d5e59fee6c297ef9dcbe78996","observation_id":"941c99f8-92d2-478b-a425-2e2e044af2f5","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:f2354065358be60460f82726d28147d9e5968cc8b91c30b418e433969f747228","observation_id":"64494666-333a-4014-8a21-31ccbcb58dfb","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:4f53fbd942b4bff7f96dabde3f2152d1f42d2598422effe9b90e3c435ee9687d","observation_id":"bcc408d7-8faf-4e95-83b1-ed9e46f183cb","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Brandes, A faster algorithm for betweenness centrality, Journal of Mathe- matical Sociology 25 (2) (2001) 163–177","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:42656d5c59b2de52b19eb8b8f2998f3f82bcb9fa30b032efe043725b95b3124d","observation_id":"4cbea6e1-252e-4543-a8fa-647b170ec188","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:12f7dd6c9285198f41507f479e0768aadb5aeb561aec259b495f24b3aca67550","observation_id":"bed2cffc-bd27-4047-b893-61389531e3c3","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Riondato, E","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:d4c522f8ec09e3a02dbed61c9026637766614a35585e6c5a0adf5e93292b9656","observation_id":"853780b8-4259-477a-ac23-d8d20bd39acf","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Borassi, E","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:9b229e2b92e46991e6fff5399fc6369e9a00a45f632ca7c785e84791872a5269","observation_id":"f69841ec-b430-4678-b973-3e06e333f564","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01261","last_updated":"2018-10-17T17:51:36Z","snapshot_observed_at":"2026-07-06T06:42:54.610341Z","submitted_at":"2018-06-04T17:58:18Z","title":"Relational inductive biases, deep learning, and graph networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01261","snapshot_observed_at":"2026-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"cited_paper":"/paper/1806.01261","citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:b67c2b43d86cbe421b88979458023d463ab9c3c1cf27a5c88e6fc0ac133139c1","observation_id":"8b3469f4-6fc8-4dab-9406-3b17bd076cd0","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:332dee382317c00a77f02fbecd1d5bdb738bdac9d9c2292d6e00c5eee8cef212","observation_id":"d1d16064-d0c4-4212-98fd-f51b5fdc395a","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Veličković, et al., The clrs algorithmic reasoning benchmark, Proceedings of Machine Learning Research 162 (2022) 22084–22102","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:430b035d1c1a6dd46fabe1f370ad198cb31facc4411f81f0a9ad6c1ec3c1e579","observation_id":"31bab304-59a8-4084-9bfc-6535aa3b573d","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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.neucom.2022.05.010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zhang, X","venue":"Neurocomputing","work_id":"008dd2fe-a5cd-4d03-b8d5-0b6ed157d9d8","year":2022},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:7286d78a7f2790a357c142a2611bc9b99369d7514c5197cfa15165b646892b4a","observation_id":"c60ab78b-4106-47d0-ae60-0ba0978fff63","resolution":{"observed_at":"2026-07-13T03:39:17.753126Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-07-20T22:21:56.346609+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T22:21:56.346609+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04977","last_updated":"2024-03-08T01:23:12Z","snapshot_observed_at":"2026-08-05T11:19:54.377402Z","submitted_at":"2024-03-08T01:23:12Z","title":"Node Centrality Approximation For Large Networks Based On Inductive Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04977","snapshot_observed_at":"2026-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"cited_paper":"/paper/2403.04977","citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:9f9c17ba73bfaa3a5b5e32968cbae3fff5e42634c19a3875487e30e6e3ca6cfa","observation_id":"c4c41710-153a-4f1d-ac1a-4cf40fad2a42","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Dachille, A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:11dca49df8d267121d8f6e4fd11a2f6e5619d196c1613fef570023a8b6b17b75","observation_id":"1d084dcb-ab0f-45ba-b916-1339b0565992","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Yehudai, E","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:6b4a217c1ce4334c94c93e37f049f9ce7180854690337f83e7a5b895bc514ed2","observation_id":"0fb4ab1d-1269-4867-9ea7-3520334283f4","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02466","last_updated":"2024-08-16T08:25:42Z","snapshot_observed_at":"2026-08-09T10:51:09.408130Z","submitted_at":"2022-02-05T02:31:01Z","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.02466","snapshot_observed_at":"2026-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"cited_paper":"/paper/2202.02466","citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:6011232ba349c8a6d21644e3c191773a30e2e073ee208a1d8d4565c7c8301684","observation_id":"72813482-b513-4731-8eee-ed3a96f40331","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:a2cc948ac1acdd2177855fa1b16f78a44971dcd7d13277d7ac3db859607a4f1c","observation_id":"2d0582ca-51c9-4773-89f1-54e646b69f10","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:d6cd609fcfe667d7e0dff4716b5bcabd0dae84552a2c67475222c555bd4f02a2","observation_id":"fe959d80-4cbc-4027-8d39-52f9e6fbb0c0","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Erdős, A","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:20b63a81daf59a0b301cffc84a2a6c58d2b0a6dcc0f299c1153e95863eb3aa5d","observation_id":"cbbca897-22ab-475e-a309-7f1a9c3852f5","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":"Barabási, R","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:7f3e4301fdcc7b9034cb23a750f0e384efa16314b63062ee7cb6f6a8bf3bc1ac","observation_id":"42b85e92-6876-47a5-8ce1-24d69a578d74","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","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-07-13T03:30:09.207707Z","title":null,"venue":null,"work_id":null,"year":1938},"citing_paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T03:30:09.207707Z"},"links":{"citing_paper":"/paper/2607.09372"},"observation_digest":"sha256:71d8cb7df482b39acaf3575130f2c5a57ba8424fee5f1c6cdd2c7e1bec1400c4","observation_id":"289e9b5c-6be9-4646-b904-f49839c07f4f","resolution":{"observed_at":"2026-07-13T03:30:09.207707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09372","last_updated":"2026-07-10T12:53:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T00:28:17.320413Z","submitted_at":"2026-07-10T12:53:18Z","title":"Graph Neural Networks for Scalable and Transferable Node Centrality Approximation"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":23},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.09372."}