{"as_of":"2026-08-14T06:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77651578cb64c1e4f35e04d3d291f3cf9206cc792a760bf3f82159987ab8e189","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:19:35.797493Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2502.05724/citation-record","integrity":"/paper/2502.05724/integrity","json":"/paper/2502.05724/citation-record.json","paper":"/paper/2502.05724"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:19:35.935045Z","title":null,"venue":null,"work_id":"58b348fb-5cc4-4152-b8b6-e78018fe463f","year":2018},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.768310Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:b5e5c22c6e02fc53001fbb295637f306fe895cf1219236796b51b6864fe1b01f","observation_id":"cbe30bd8-3eb8-4a57-9305-e0c083d71173","resolution":{"observed_at":"2026-08-08T18:19:35.939790Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T18:19:35.877816Z","title":"ˆD−1/2 out 0 0 ˆD−1/2 in # 0 ˆA ˆA⊤ 0","venue":null,"work_id":"842d6400-a617-4680-aa2c-131e4438178e","year":2017},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.793506Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:bd136e63895fe792499b55fce62a55db5447602c00d34ce3856ca3626412e5dc","observation_id":"0818c43c-2f3a-45c0-864b-04a71fb70ad4","resolution":{"observed_at":"2026-08-08T18:19:35.881373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T18:19:35.866006Z","title":"Some models have exceptions","venue":null,"work_id":"d6cc8e03-56b0-41b8-954b-2097562c65a5","year":2020},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.797493Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:1502cc255fa66dce95636e4eb6b7f6b3de5b254bfd9decfb7e0a9e7134eb7725","observation_id":"aab2e780-e6ac-4772-bff3-bb5d4607792b","resolution":{"observed_at":"2026-08-08T18:19:35.870352Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-08-09T07:12:13.529182Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-08T18:19:35.762953Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.762953Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:bf0f0abd5d2bc38aab896c4ead0e57663cd51ca2cadf67a06ab8dad1315d141c","observation_id":"97535510-0e0d-495b-a54d-40c8d4c99180","resolution":{"observed_at":"2026-08-08T18:19:35.762953Z","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-08T18:19:35.911386Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":"6132c059-79fa-4d9a-bd92-97c5b9d3d983","year":2018},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.776750Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:179aad5b2031d54f90d49f762ac0144ff5308d619b2a30edf6d730cc430768d8","observation_id":"42902c3e-fdb3-44cc-8192-ba4feb0ccd8d","resolution":{"observed_at":"2026-08-08T18:19:35.915335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05631","last_updated":"2023-02-11T09:16:46Z","snapshot_observed_at":"2026-08-13T12:46:59.474789Z","submitted_at":"2023-02-11T09:16:46Z","title":"A Survey on Spectral Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05631","snapshot_observed_at":"2026-08-08T18:19:35.748151Z","title":"A survey on spectral graph neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.748151Z"},"links":{"cited_paper":"/paper/2302.05631","citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:7f546b2790cca62024651f2be7c6dece9408c8de34beac25e8a3ff45dbc4c805","observation_id":"5b722dec-0c20-4a47-bf38-69be589ae0af","resolution":{"observed_at":"2026-08-08T18:19:35.748151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13970","last_updated":"2020-04-29T06:19:10Z","snapshot_observed_at":"2026-08-13T22:52:47.376469Z","submitted_at":"2020-04-29T06:19:10Z","title":"Directed Graph Convolutional Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13970","snapshot_observed_at":"2026-08-08T18:19:35.781941Z","title":"Digraph inception convolutional networks","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.781941Z"},"links":{"cited_paper":"/paper/2004.13970","citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:4c5a54fde64e334aab0e0141a85529315f4f1b2fad8f9b0c7f355d5d4ff50fbf","observation_id":"01fd00ec-761c-48dc-b365-08cee4b39820","resolution":{"observed_at":"2026-08-08T18:19:35.781941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-08T18:19:35.753365Z","title":"and Lenssen, J","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.753365Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:d24b83d49122a324417a6cf4657385b5386f32556eef8d287a5f96d0fc0e7dc8","observation_id":"74ed9697-003b-4659-b8a6-5ccc87481365","resolution":{"observed_at":"2026-08-08T18:19:35.753365Z","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-08T18:19:35.923058Z","title":"Finding large balanced subgraphs in signed networks","venue":null,"work_id":"8f5a55c6-0c44-4d5c-913e-651f2bc116b7","year":2020},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.772369Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:e4858ae95add666b948abe0822e0736f62861816dca27fdf5d44bd94669c9982","observation_id":"9a683e51-e1e9-40c7-b48a-263e8b5801d7","resolution":{"observed_at":"2026-08-08T18:19:35.927446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T18:19:35.899597Z","title":"Disentangling degree-related biases and interest for out-of-distribution generalized directed network embedding","venue":null,"work_id":"641c2784-82e0-473e-9131-a5e3936dd690","year":2023},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.786578Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:478f2378529ac2fe5c8d33975a3223c8240d44d71b77b0a80e44008f3779f806","observation_id":"12f7fd15-9c0c-4ed8-8138-3a1db5044d48","resolution":{"observed_at":"2026-08-08T18:19:35.903971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T18:19:35.946635Z","title":"Exploring the role of node diversity in directed graph representation learning","venue":null,"work_id":"73a36ab6-652a-4f8a-b086-da334c9b1524","year":null},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.758484Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:c2ca8761437831d6f233888c7c38b2904b8d06c671247bb9a25b07e2d0a3e5a5","observation_id":"8e31b719-a2ff-45b5-850d-3efaf1b460a7","resolution":{"observed_at":"2026-08-08T18:19:35.950574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08T18:19:35.888187Z","title":"Interpreting and unifying graph neural networks with an optimization framework","venue":null,"work_id":"120b0e58-5a68-4b08-8197-22c7351d8ddc","year":2021},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.789957Z"},"links":{"citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:dd53de2ef92b9a239342ba6fde23150bd8d698502ef74316b2ef4632d46739e6","observation_id":"84f2bd87-0b37-4c2f-ba56-a61b1c9d6309","resolution":{"observed_at":"2026-08-08T18:19:35.892493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T06:22:44.453487Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":12},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2502.05724."}