{"as_of":"2026-08-13T09:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ef902aea6a8cc4f82a9bdc7fe01e3bad0f308c3d6b0685facba8b7cc2f98e5dc","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:35:08.071970Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T05:44:24.926127Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.24018","snapshot_observed_at":"2026-08-03T05:44:24.926127Z","title":"Kreuzer, D., Beaini, D., Hamilton, W","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.01553","last_updated":"2026-07-26T09:03:31Z","snapshot_observed_at":"2026-08-08T23:32:29.441541Z","submitted_at":"2026-02-02T02:45:52Z","title":"Plain Transformers are Surprisingly Powerful Link Predictors","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T05:44:24.926127Z"},"links":{"cited_paper":"/paper/2506.24018","citing_paper":"/paper/2602.01553"},"observation_digest":"sha256:f63d591b6164d7065c332c6d60d85050f99eaefce034bf5a45180d31589f1509","observation_id":"c4e22aaa-250f-4c6c-8d36-ff7907fd075a","resolution":{"observed_at":"2026-08-03T05:44:24.926127Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.24018/citation-record","integrity":"/paper/2506.24018/integrity","json":"/paper/2506.24018/citation-record.json","paper":"/paper/2506.24018"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.01179","last_updated":"2021-06-04T14:52:04Z","snapshot_observed_at":"2026-08-09T07:21:16.437218Z","submitted_at":"2020-10-02T19:53:05Z","title":"The Surprising Power of Graph Neural Networks with Random Node Initialization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.01179","snapshot_observed_at":"2026-08-06T21:35:07.823368Z","title":"The sur- prising power of graph neural networks with random node initialization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.823368Z"},"links":{"cited_paper":"/paper/2010.01179","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:d43a9748b4a93c195f732e26a5c674ef0b9de3403b95521318ebd587cb9fc572","observation_id":"5080a19b-6f90-4734-a590-67b45fed7b1b","resolution":{"observed_at":"2026-08-06T21:35:07.823368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.982652Z","title":"Breaking the limits of message passing graph neural networks","venue":null,"work_id":"c2b65700-f8ed-4323-af30-912c43be627a","year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.828470Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:31763414c8b0ef6b102b345274b29129335e96c2d20ddde24c6a56e8e51053af","observation_id":"597f046c-2dba-41e8-b6e0-7a004bf8e202","resolution":{"observed_at":"2026-08-06T21:35:08.986676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.968075Z","title":"How symmetric are real-world graphs? a large-scale study","venue":null,"work_id":"0e6a2f05-e384-4f42-a87f-409655b59f96","year":2018},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.832908Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:f4248aa1049de6d496479aa305246f93168d19e9d0cd2ffbb0dd80934cda4c88","observation_id":"8d9be890-c5c0-4332-a72f-988dd1e37932","resolution":{"observed_at":"2026-08-06T21:35:08.973101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14546","last_updated":"2025-02-20T13:21:47Z","snapshot_observed_at":"2026-08-10T11:11:21.764466Z","submitted_at":"2025-02-20T13:21:47Z","title":"Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14546","snapshot_observed_at":"2026-08-06T21:35:07.837362Z","title":"Position: Graph learning will lose relevance due to poor benchmarks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.837362Z"},"links":{"cited_paper":"/paper/2502.14546","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:c2dfa491df53d1ea9770464e8e52c1c94e90138e6571f1dd65c9ad34f730eeb1","observation_id":"b27fbe69-a9be-4ca5-9564-d52705d6d7db","resolution":{"observed_at":"2026-08-06T21:35:07.837362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.954597Z","title":"Bronstein, and Haggai Maron","venue":null,"work_id":"f2f01f86-f3ba-4e75-8b54-671478a7c133","year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.841784Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:971f06dbeaf3a3bab23eb2f5566ad5287f2a5b16ea85cdbaf910b90e75ba2e6a","observation_id":"9b869784-0148-4538-9df0-23a10a7e1e6f","resolution":{"observed_at":"2026-08-06T21:35:08.958690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.941144Z","title":"The expressive power of pooling in graph neural networks","venue":null,"work_id":"58871b64-fd77-4764-8f21-bf956f39cd77","year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.845776Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:ee6a95d6c1b21a40d9c94707d16e3d1cd6e7e4a6b281cf06f5410f987492cc61","observation_id":"19665787-c099-4b7c-9c97-a48db0dcc54d","resolution":{"observed_at":"2026-08-06T21:35:08.945083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.850126Z","title":"Improving graph neural network expressivity via subgraph isomorphism counting","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.850126Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:38103ad1d92d36ce1fcd145ee480812bd2c760d4ce1ad14b8a0c63a107e3cb1d","observation_id":"ed7bfb17-a26f-491c-8769-36a798b7bcd0","resolution":{"observed_at":"2026-08-06T21:35:07.850126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.917361Z","title":"siamese","venue":null,"work_id":"87c955fb-9975-4a4d-baa8-425a08e55617","year":1993},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.853819Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:42b75c600356ae4168deb65340bb62f4b10d3c4c961aee212d43d5ea5d9b3fe6","observation_id":"120d4aae-9bbe-45bb-8a7f-d39182ac648f","resolution":{"observed_at":"2026-08-06T21:35:08.921165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.13318","last_updated":"2020-06-23T20:36:56Z","snapshot_observed_at":"2026-07-06T09:32:05.177891Z","submitted_at":"2020-06-23T20:36:56Z","title":"A Note on Over-Smoothing for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.13318","snapshot_observed_at":"2026-08-06T21:35:07.857578Z","title":"A note on over-smoothing for graph neural networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.857578Z"},"links":{"cited_paper":"/paper/2006.13318","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:b591a6f692a3b66d1aa42caab4483157c89feb57d08fbc517c1f926958e05bf6","observation_id":"322575a8-17f1-45a1-834a-d280c63a48e1","resolution":{"observed_at":"2026-08-06T21:35:07.857578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.903971Z","title":"An optimal lower bound on the number of variables for graph identification","venue":null,"work_id":"c5bbd14c-168d-4a81-bd24-c9282ec20cb3","year":1992},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.861764Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:361b2e7e8c8a70d116d887d7dafe02d2a9a7ae1cbc43c41226a9b404a13a2532","observation_id":"c6277852-4b55-43b4-b14e-623a53c6c67c","resolution":{"observed_at":"2026-08-06T21:35:08.908048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.890119Z","title":"Line graph neural networks for link prediction","venue":null,"work_id":"846562c8-b59a-4c99-a9ca-7ba9a35de2fa","year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.865504Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:46ea4221eaa37ff2b71c00417a23b4c853a2ace7d5fec0d037c51454f8d1444d","observation_id":"898655a2-f426-4d8e-96d2-e66627ac8c59","resolution":{"observed_at":"2026-08-06T21:35:08.894228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.877201Z","title":"Bronstein, and Max Hansmire","venue":null,"work_id":"8d0b4e48-89b4-4d98-a847-6300909d8427","year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.869439Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:fe9346fd642493528b13a75f78783c2fe08aa01fb6753e2b87d5626c8258b422","observation_id":"adf4b6f9-8094-42f7-b5cc-5bb45acd9880","resolution":{"observed_at":"2026-08-06T21:35:08.881011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.863531Z","title":"Edge classification on graphs: New directions in topological imbalance","venue":null,"work_id":"0039d107-8578-4b37-8e5f-1ace5b73ec43","year":2025},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.873201Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:88b9d9d946dfe039aab0982a7295a5173df8152e3a144e208700688c766d564c","observation_id":"3994ee7f-eb9a-468d-b232-e196c358a716","resolution":{"observed_at":"2026-08-06T21:35:08.867678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.876812Z","title":"Generalizations of k-dimensional weisfeiler–leman stabiliza- tion","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.876812Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:a1abd8e8240567db857c9e6c58cdd0eb5827d4a97a7977f81c67acd1af7284bf","observation_id":"de6aabc1-2daf-40e8-8200-30ee42013012","resolution":{"observed_at":"2026-08-06T21:35:07.876812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.839113Z","title":"The link regression problem in graph streams","venue":null,"work_id":"11a1e6bf-c04c-4fac-8251-d68e1a5fe7d3","year":2019},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.881169Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:3056a9d77beec11a9c10d8d4b8918c3c0cb52356f1fff9c609a94015abad92e9","observation_id":"af94712f-a917-4368-b078-023b0e57a4f2","resolution":{"observed_at":"2026-08-06T21:35:08.843243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.09893","last_updated":"2022-02-17T20:19:28Z","snapshot_observed_at":"2026-08-10T11:11:37.442332Z","submitted_at":"2019-12-20T15:40:50Z","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.09893","snapshot_observed_at":"2026-08-06T21:35:07.884976Z","title":"A fair comparison of graph neural networks for graph classification","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.884976Z"},"links":{"cited_paper":"/paper/1912.09893","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:3d10c7a70a505ae93cf9bfe9599b2eb9a3ed549fb8583346e9f413886635ca55","observation_id":"743a3aaa-d506-4690-8787-17d351d3fc2f","resolution":{"observed_at":"2026-08-06T21:35:07.884976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.825876Z","title":"Meta-path learning for multi-relational graph neural networks","venue":null,"work_id":"dca55c84-71a3-48e2-a59f-6f3ba69bc598","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.889142Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:9968acf88f94f6fa9a692f8026516f9f438d91f272a40b954754ecb9ffc70d2f","observation_id":"40dc075a-712c-4e98-abee-7d14adb285f0","resolution":{"observed_at":"2026-08-06T21:35:08.830464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.812549Z","title":null,"venue":null,"work_id":"ba2c0281-096f-4a7c-a8bd-e03d281203af","year":1950},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.892928Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:1fa8211cb4f8ba006dacd13c5e2356dd7fdf98374da648bbbeee73cbeb52e288","observation_id":"b0b54853-4503-4d02-a8fe-5992b936f632","resolution":{"observed_at":"2026-08-06T21:35:08.816536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.798100Z","title":"The iteration number of the weisfeiler-leman algorithm","venue":null,"work_id":"3fb280fd-8135-43b1-ab9a-ca21c5351988","year":2025},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.896617Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:ffcdaaf125c60638476e3b75a984fa8e6b64e3f702c6f104ed384f1f6ad47b37","observation_id":"f7876e88-4297-4efc-8c56-97082d49859a","resolution":{"observed_at":"2026-08-06T21:35:08.802317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.784424Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"b29c3d71-16c1-459f-91ee-47cf3ffb131f","year":2017},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.900166Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:a6ea4a4854815a0bc11c2daff85f2a21fdac949ef281a5d7865b01e613a14f91","observation_id":"11dbb2bf-fd4f-4733-94f1-8f480e14e814","resolution":{"observed_at":"2026-08-06T21:35:08.788688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.903764Z","title":"The generalization of student’s ratio","venue":null,"work_id":null,"year":1931},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.903764Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:0645d86b1be30c3071401b8b90137d668a87a95d148870ba20be67cc9d1ae449","observation_id":"e342d5a1-26e1-460d-ba99-714a00be9967","resolution":{"observed_at":"2026-08-06T21:35:07.903764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.09582","last_updated":"2019-07-22T21:16:29Z","snapshot_observed_at":"2026-08-02T17:49:44.473731Z","submitted_at":"2019-07-22T21:16:29Z","title":"The $k$-Dimensional Weisfeiler-Leman Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.09582","snapshot_observed_at":"2026-08-06T21:35:07.907945Z","title":"The k-dimensional weisfeiler-leman algorithm","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.907945Z"},"links":{"cited_paper":"/paper/1907.09582","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:c0311869c13f6146afbf24009544c8ec3ed5b82fde03b54e4f099820cc78ada7","observation_id":"f353b9b2-30db-4fed-98ec-42938e21e003","resolution":{"observed_at":"2026-08-06T21:35:07.907945Z","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-06T21:35:07.912012Z","title":"Prediction of protein–protein interaction using graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.912012Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:a151c579233b555eb35f96318bc89ccdeeffe4ebc738224a0204335c93cf974f","observation_id":"b3b55c39-dcf1-4605-a45d-7e6686d322e9","resolution":{"observed_at":"2026-08-06T21:35:07.912012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.762120Z","title":"Is expressivity essential for the predictive perfor- mance of graph neural networks? In NeurIPS 2024 Workshop on Scientific Methods for Under- standing Deep Learning, 2024","venue":null,"work_id":"9663fecb-8de7-4ab8-abcc-9d9d6b279c6c","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.916178Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:b888b577e4d853a6bce5816c2f6aeb0b52506576e7c5db3e1d8fe623430beeeb","observation_id":"9714d721-8dd1-462a-83ee-2607bb2d9023","resolution":{"observed_at":"2026-08-06T21:35:08.766506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-06T21:35:07.919929Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.919929Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:8b10e9ec60321ab7ef2dbf8dd3fc5323cb0efb8c6c10daeff17a3c0708a46c8b","observation_id":"68df4e3d-5707-4afc-b17a-081fc9867df6","resolution":{"observed_at":"2026-08-06T21:35:07.919929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-06T06:17:37.090691Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-06T21:35:07.923995Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.923995Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:5a506da45fec49e4100936599d7097064ddd5517f6629b11a17e23d1bdc2c51c","observation_id":"9734b5e1-3da6-4922-aa5a-28dc8a0db34d","resolution":{"observed_at":"2026-08-06T21:35:07.923995Z","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-06T21:35:07.928016Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.928016Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:69f21e87ef78345750ed59a1ab0cdeb211a4f8fb95970d4e518edac134ba93fe","observation_id":"4a6e292e-0e3b-42c8-95ea-477e20293e23","resolution":{"observed_at":"2026-08-06T21:35:07.928016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.739783Z","title":"A simple and expressive graph neural network based method for structural link representation","venue":null,"work_id":"dc61dcd6-ddd5-41c9-968b-9b131972cbfa","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.931837Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:80e4b4fa934cedc4b0e293f2f046debc2764f89653f7f111a43c7e1cc434ac7c","observation_id":"8d13fd6c-d811-49f8-ab74-656d5dd78ecc","resolution":{"observed_at":"2026-08-06T21:35:08.743776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.726061Z","title":"Evaluating graph neural networks for link prediction: Current pitfalls and new bench- marking","venue":null,"work_id":"e7a921d4-01eb-46ec-a9a1-ee71181b9dda","year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.935571Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:4a4258fff185eeceb842cb675d0726c37bd95cbc6598f236e63645a9d41ae339","observation_id":"b61b7a24-82d3-4d8a-87b1-953d70584bc5","resolution":{"observed_at":"2026-08-06T21:35:08.730654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.713068Z","title":"Line graph neural networks for link weight prediction","venue":null,"work_id":"17aad7c6-4714-4afa-8fed-ae4cf01c4f50","year":2025},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.939597Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:6293305fb047aede00d833008aaa68b8213efac6fee639d7c8e3b0f9edc518ee","observation_id":"a1dfd6ca-fa27-4a18-93e9-ab0ae6649fcc","resolution":{"observed_at":"2026-08-06T21:35:08.717276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.699561Z","title":"Computational complexity of the weisfeiler-leman dimension","venue":null,"work_id":"f15c17aa-b7d4-4ece-9298-b3aba08edd72","year":2025},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.943263Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:42d67c7b2ec69734ba8076d603f2eb13ccaeb50240b7e604da28df620e6876e3","observation_id":"840e0efd-590f-40a8-900f-63ea0a9c0935","resolution":{"observed_at":"2026-08-06T21:35:08.703849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.946859Z","title":"Link prediction in complex networks: A survey","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.946859Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:6eafb28b7952c44233ef80040d22c165abaad4faa672cd67c29bb762019d3650","observation_id":"a7d10618-24e1-4d4a-a93f-af7fbac35a36","resolution":{"observed_at":"2026-08-06T21:35:07.946859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.676537Z","title":"Simplifying approach to node classifica- tion in graph neural networks","venue":null,"work_id":"b9a32ef0-4cf8-4ea1-8297-147db0dda882","year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.950534Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:eeb142f0cc9dd572d6e82c934b898ad203ddbaff77c325c9e02ef930838be3cf","observation_id":"ec001593-f916-4168-aa97-fa1947dc4747","resolution":{"observed_at":"2026-08-06T21:35:08.680910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.954130Z","title":"Weisfeiler and leman go neural: Higher-order graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.954130Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:2cc93344c7869cfe67135c0ffeb18c62cea8bc3d1a255349b8dd701aad75c4a8","observation_id":"d6b8c587-8547-4046-b600-0bc8a119e229","resolution":{"observed_at":"2026-08-06T21:35:07.954130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.653631Z","title":"Position: Future directions in the theory of graph machine learning","venue":null,"work_id":"c2adf09e-2f44-4b1d-af01-890e22cec3e0","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.957852Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:aa5b4c8a942bc2e85b9b721f95e4d373588de44c1e4ed4cb487b94bf11e51b33","observation_id":"f54bbf9f-c1b2-4315-a0a2-5037744f2ac4","resolution":{"observed_at":"2026-08-06T21:35:08.657925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.640033Z","title":"Orbit-equivariant graph neural networks","venue":null,"work_id":"e37a37b3-a979-494d-9163-cccfd23319a1","year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.961778Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:72175ec3efaaa99944c6466e53c8563f30e26fd7413d2f5705f51695b28e0cfa","observation_id":"46ae318a-25f2-4356-b5ae-8bb85a92fe9e","resolution":{"observed_at":"2026-08-06T21:35:08.643868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.626696Z","title":"Relational pooling for graph representations","venue":null,"work_id":"43cf5631-7ce8-40b5-b81c-1aa477b620d1","year":2019},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.965529Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:2d804c7bf715a25123569d1d5b1b09a4e65adae728371716bf6776377007b97c","observation_id":"d8fa584f-1860-4129-8297-9cd19de80664","resolution":{"observed_at":"2026-08-06T21:35:08.631118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.613138Z","title":"A review of relational machine learning for knowledge graphs","venue":null,"work_id":"bb591481-0851-4805-84d4-a430b3efdd87","year":2015},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.969455Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:6f9da625cd328ec30d01c5c24d434c2c26415fcdd8673c322aee5b91659254e7","observation_id":"87a3408e-e6ff-43db-b770-2b42c8646435","resolution":{"observed_at":"2026-08-06T21:35:08.617195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.600156Z","title":"Knowledge graph embedding for link prediction: A comparative analysis","venue":null,"work_id":"cb9aecb2-3522-4399-ba26-aa45c3017182","year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.973402Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:5403bd973d7b7171c255c62b1c21fdb072cee16eceba573350963c2e5d78655b","observation_id":"beb2bcd0-e90f-4625-b42d-bcfe0ff73ce2","resolution":{"observed_at":"2026-08-06T21:35:08.604037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.586273Z","title":"On the equivalence between positional node embeddings and structural graph representations","venue":null,"work_id":"c2ef0308-12bf-4513-b5d6-8a0aa09a4300","year":2020},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.977300Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:47abe0a5b993903c3c4cc6623390a0d2c861d2d428b955e53618d415d6f7702f","observation_id":"25763863-d725-455e-bd45-985c2f10b1d7","resolution":{"observed_at":"2026-08-06T21:35:08.590712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.981001Z","title":"Graph attention networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.981001Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:ea8aeb5b430e36a97ccd5d6e2c571a3690503adc514f670df86cf8619c3ada66","observation_id":"120d19b1-313e-45f3-9825-a1e8348eb48c","resolution":{"observed_at":"2026-08-06T21:35:07.981001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.553290Z","title":"Neural common neighbor with completion for link prediction","venue":null,"work_id":"ee3b216e-28a9-420c-afb6-255c1d947213","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.988790Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:54b7f0d2526dcb4fe28f8406c895be42f36de6748fcc1d0e18732c0d5fe096d6","observation_id":"2e061f79-cbbd-47cb-9104-4d57cc525bee","resolution":{"observed_at":"2026-08-06T21:35:08.557917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.538836Z","title":"Apan: Asynchronous propagation attention network for real-time temporal graph embedding","venue":null,"work_id":"b649ca25-4adf-4381-b164-a27233cb54d5","year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.992753Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:e7e6e16e3895245a6359cbdf2fe15f8393d62e98f5ded6cf57690bed62bdcef0","observation_id":"d71ec778-6115-44a6-886c-276028431637","resolution":{"observed_at":"2026-08-06T21:35:08.543500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.07702","last_updated":"2024-06-01T08:37:02Z","snapshot_observed_at":"2026-08-10T11:11:24.952851Z","submitted_at":"2023-04-16T05:53:47Z","title":"An Empirical Study of Realized GNN Expressiveness","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.07702","snapshot_observed_at":"2026-08-06T21:35:07.996544Z","title":"An empirical study of realized gnn expressiveness","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.996544Z"},"links":{"cited_paper":"/paper/2304.07702","citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:4b12f10ddfa6f147665616ce2ea849136cf5a6fb31c658096d000d63c923a9a3","observation_id":"5a2c3132-6a4d-4886-8965-52b81161be80","resolution":{"observed_at":"2026-08-06T21:35:07.996544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.525120Z","title":"An empirical study of realized GNN expressiveness","venue":null,"work_id":"41feff55-1cde-4b7e-a3a6-f790a76f64a3","year":2024},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.000474Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:4639c458ec6826a44b0435da98dbe24bdd1fc5c080a4b1ec3f8b170da9527945","observation_id":"78d9a5fd-eb52-4c55-af53-eee16d8ace68","resolution":{"observed_at":"2026-08-06T21:35:08.529877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.511077Z","title":"The reduction of a graph to canonical form and the algebra which appears therein","venue":null,"work_id":"bc91a329-a771-4787-801c-e875e988eaeb","year":1968},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.004301Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:49a18d06c17bec1f02bf6206ecd64298afde296d69d5acb6c45397daf7b16ee7","observation_id":"b49e090a-4946-47b9-8488-c48a50a2443b","resolution":{"observed_at":"2026-08-06T21:35:08.515476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.496449Z","title":"Graph neural networks in node classification: survey and evaluation","venue":null,"work_id":"c85854b8-7404-49cf-9980-a0ca8fec485c","year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.008090Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:d31991d00f5b3dee755756a8479a4bc9a3361c69bc3b420b15b92b8961e9a767","observation_id":"1ccb3031-e404-46f5-b36a-3e2f05764ea7","resolution":{"observed_at":"2026-08-06T21:35:08.500728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.482840Z","title":"Active and semi-supervised graph neural networks for graph classification","venue":null,"work_id":"cdf4b25a-e0f1-41e2-a4d5-739990676e35","year":2022},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.011978Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:263db267131759ae14e809d79add5f502b4ad12674cd5f1887785f53f9271e3b","observation_id":"8f9852f1-edcf-4c71-a3ab-27f49d6cc8ab","resolution":{"observed_at":"2026-08-06T21:35:08.486833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:08.015735Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations , 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.015735Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:a7ac65460fa6a03ae30a40d9ff8115dde360140285a4feef39cb0fdf39b67e2f","observation_id":"d957cd1c-1b40-4e77-9b90-4f5b30f51994","resolution":{"observed_at":"2026-08-06T21:35:08.015735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.461042Z","title":"How powerful are graph neural networks?, 2019","venue":null,"work_id":"c8eca3f6-8fb5-42ff-9796-883e0f9d57b7","year":2019},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.019529Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:cd2c6fd6ec4f75170ed4edf9600c6adb10c116006f1cc9cd035260ad3fb2f017","observation_id":"5dd04454-47dd-4037-881f-35098dfeb7d5","resolution":{"observed_at":"2026-08-06T21:35:08.465524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:08.023177Z","title":"Graph convolutional neural networks for web-scale recommender systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.023177Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:1c7eda1ceb132d23413f601c6fb97076d3562df8fb3ebc71f8ab3920a87ef28f","observation_id":"72284625-aa62-4e1b-8661-289709bb09ec","resolution":{"observed_at":"2026-08-06T21:35:08.023177Z","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-06T21:35:08.026876Z","title":"Neo-gnns: Neighborhood overlap-aware graph neural networks for link prediction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.026876Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:139398f523da99b04c635c4a7c77a3481bed7d46780cca4f8468366ed0edeccf","observation_id":"7da91097-da29-46f8-8f80-09bca465646a","resolution":{"observed_at":"2026-08-06T21:35:08.026876Z","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-06T21:35:08.030523Z","title":"Link prediction based on graph neural networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.030523Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:b33563553b1c010a910e36a0485e69c65a1f358308433892bbb1b69418591be1","observation_id":"76626299-ec78-4a1f-99ed-ae770cbf8b6b","resolution":{"observed_at":"2026-08-06T21:35:08.030523Z","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-06T21:35:08.034101Z","title":"Labeling trick: A theory of using graph neural networks for multi-node representation learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.034101Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:8e403d9756b87b8fae94e91b845cce4da909c65068ab71d184b9425ae9c798f8","observation_id":"fa8d2473-e6e7-4e83-80b1-83c18717f4f1","resolution":{"observed_at":"2026-08-06T21:35:08.034101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.408796Z","title":"From relational pooling to subgraph gnns: A universal framework for more expressive graph neural networks","venue":null,"work_id":"b05c129f-b4c2-4f0a-a77b-4b9e1f57a80d","year":2023},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.039353Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:18ac042ca0da77edcfb4ea71dfc4ec39d436d4b2d98151964b985d5b90143f1e","observation_id":"ffb12248-a0bc-4bea-9bb9-36049cc97df3","resolution":{"observed_at":"2026-08-06T21:35:08.413226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.395155Z","title":"Progresses and challenges in link prediction","venue":null,"work_id":"a47874a4-ed5f-4bfe-bb4e-a21b9d760b95","year":2021},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.043365Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:ca56610c8d5ba0b38fccbbc886b80088a29058fd964bd48b703d5c7c9c7a134f","observation_id":"e3fa873a-8c67-4b8a-a161-a43b9cb2e8af","resolution":{"observed_at":"2026-08-06T21:35:08.399795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.381700Z","title":"If mM = 0, then, regardless of kM ϕ , M is not able to distinguish between links whose endpoints are automorphic, i.e., ∀F ∈ M, ∀(u, v), (u′, v′) s.t","venue":null,"work_id":"50f66cc2-aa46-492e-8fb0-366260513631","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.047109Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:358c46768e3aef8f27b8baa72bd707080a1863d64c5dfc3a32251b3f00cec985","observation_id":"998e1cfd-49cd-4b40-bd4c-c58aae64ab4a","resolution":{"observed_at":"2026-08-06T21:35:08.386415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.367668Z","title":"If mM1 + lM1 ≤ mM2 + lM2, then M1 ≤ M2","venue":null,"work_id":"28497306-b11b-41ae-bd08-62cbdd45d0d0","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.051212Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:73f34edc984d0f61811ad1ae4cf963ed6d6fb0372988380d91d3d19da26a83ba","observation_id":"6a5b75c0-f551-4100-9cc2-716d1bdb8410","resolution":{"observed_at":"2026-08-06T21:35:08.372169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.353216Z","title":"If kM1 ρ ≤ kM2 ρ , then M1 ≤ M2","venue":null,"work_id":"a106efd2-6f37-4eee-8c09-497f17f7e19b","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.055548Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:9e2d5f993c4ee0037561cbf7951be6642dc9ef05d6f95a4c89c479be9672d5ba","observation_id":"a567187d-4d6a-4833-8a4a-31ce342d6b53","resolution":{"observed_at":"2026-08-06T21:35:08.357281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.339965Z","title":null,"venue":null,"work_id":"8af9c0d5-2e2b-4188-9227-1dc234449d9b","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.059401Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:de5d541134163e75f2c1e9e7ee69269d2b89081cbe01ae03808618d75285d702","observation_id":"c16719cc-da16-4506-ad2b-8f458014359c","resolution":{"observed_at":"2026-08-06T21:35:08.343997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.326663Z","title":null,"venue":null,"work_id":"3911874d-9d79-4dab-abbd-efbb18fa9ae8","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.063907Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:09c0f65be6c5d1a3cbc1bb32fa224458266a339a17e81e94be394c5550d4ab70","observation_id":"f22a8dfd-5854-41d1-8acd-effa3bd0d848","resolution":{"observed_at":"2026-08-06T21:35:08.330436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.311922Z","title":"NCN uses a fixed radius mNCN = 1 (Table 1), but allows a configurable number of layers","venue":null,"work_id":"d402b542-eeb2-4818-adb9-e62c15e83b6a","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.067940Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:4bfe0026d5235c78d473ed0983c22d8c69c3223f70dab6c31be10d86ace20ecd","observation_id":"36786536-2b1c-4b89-806d-bf862a7ed87d","resolution":{"observed_at":"2026-08-06T21:35:08.316956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:35:08.297273Z","title":null,"venue":null,"work_id":"9f00eddc-1cb0-40fd-9cc9-96d2b34e4292","year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:08.071970Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:5ed4217a221cb05bf3cb96bb3e297c4f891ce1d0670031ad3f3a076189def1ad","observation_id":"4bfe08f2-084a-42da-a58f-b6d938fe6cb4","resolution":{"observed_at":"2026-08-06T21:35:08.302092Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T21:35:07.984844Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:07.984844Z"},"links":{"citing_paper":"/paper/2506.24018"},"observation_digest":"sha256:96b197dc717df082b4a6fcff1e3af47a2703772b2ff548e0d8dc9ea3912c5f5a","observation_id":"48864275-afef-4760-969a-4741aeb1f986","resolution":{"observed_at":"2026-08-06T21:35:07.984844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.24018","last_updated":"2025-06-30T16:22:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T10:27:10.133933Z","submitted_at":"2025-06-30T16:22:15Z","title":"Bridging Theory and Practice in Link Representation with Graph Neural Networks"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":0,"verified_fuzzy":38},"total_outbound_references":64},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 1 inbound Pith citation observation for arXiv:2506.24018."}