{"as_of":"2026-08-08T00:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9accf4ec7021393d71987813f0927812bdac0834000531c9b7bd5a2fc4a7a1ea","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-07T06:34:17.273281+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-07-15T23:18:12.460836Z","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:b284803574be642d25e242f6a3f908ae555f8905ff53e412214dc2ea535b17be","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-07-15T23:18:12.460836Z","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:000b959d779ac44e26959b5bd4362fa012d6fb40587f27cf4c9ac5cd4180903e","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-07-15T23:18:12.460836Z","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:5d13caa64b045a18e5f9c8bbe88140a2625142d08ae44897a8061b607119bfa7","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-07-15T23:18:12.460836Z","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:39f1e8830ac3cb38da7be3b2f641e15bb1cd3d3e4186a6dcce045ef089d8d71c","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-07-15T23:18:12.460836Z","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:2a0b4c540f72c3fb2db44a4e5fd48e926861f0bbfe33ec973eb0c28393b800bf","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-07-15T23:18:12.460836Z","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:ebabb20bcbfdfb185d80a106004917aa679c575365e99802c089d4773d5d8cb4","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-07-15T23:18:12.460836Z","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:5f9572d770271e0243b9b52c3a2c4340013aa12f33dc5462dd2c97a8d4291e88","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-07-15T23:18:12.460836Z","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:85dc33f5d74380ba28a1244be012dd3e38b2e5a87947689e2372203d1fedbeaf","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-07-15T23:18:12.460836Z","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:db1903b27e76a63cbf16a8c3d1602e8f62e19a3dd9aef13ac9324ecc94912684","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-07-15T23:18:12.460836Z","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:7ced2c19b3439fc3d36a47bde282d32f8f51a56366a21a1e89ff82949f5b7081","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-07-15T23:18:12.460836Z","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:f9cac7834560e6d508e0ab98fbe13b553dc315b1d593dcf662d3ca4f001d9384","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-07-15T23:18:12.460836Z","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:f83ec8bf71635b0e6d8287e47495501d618bc715720574ec47f0227ade36f0fc","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-07-15T23:18:12.460836Z","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:72d964fc5b7a1b6fbabcb73542f8917d8fa8feb33b36ea887f071b4600c79404","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-07-15T23:18:12.460836Z","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:9d07eff153f0746b99fffcc91823842c00afd6d38a7a45cf5859d461c64d2bfd","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+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-07T06:34:11.927384+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-07-15T23:18:12.460836Z","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:9b7e856add739abbba0b1515c74fbed42c992fac1c74c6e4d73e12d0231da9ad","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-07-15T23:18:12.460836Z","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:e96b32b6020c9b1d92ca676a140bd7f09247f563f01e223de85654ae1a6897ca","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-07-15T23:18:12.460836Z","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:0f20cec205a1e9ba67f19d988a2a3fbfafd3c44afc7ae3fc2bbde72207221849","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-07T20:11:41.584301Z","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-07-15T23:18:12.460836Z","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:56b202146c235dbe75949ab0b7d4582f354d2169df48fedd02ac6d017a753289","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-07-15T23:18:12.460836Z","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:68ea98ecbefc95074ee9ddce63b8be24403e39430c7fdbc7a4277bb825db7e51","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-07-15T23:18:12.460836Z","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:f1daee560b0d372c8a2fec2c4bba065c702984709c409f2d9f3becd107e29e22","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-07-15T23:18:12.460836Z","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:80b7d34c9ca4892f1750a994dc76497cd7b709189792ff9c98549c969347dc4b","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-07-15T23:18:12.460836Z","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:f049193e9c5a237fbddb98bb9a3df56612be04822dcc9d15c5c324af541d4c1f","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-07-15T23:18:12.460836Z","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:b35f6e05aba5fa4d13783ae04501111aef55136dad0cb42282491ae9d024e155","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-07-15T23:18:12.460836Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.09372."}