{"as_of":"2026-08-15T23:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfb8694ed9cffa401912d449b66b8481d506e22764e27e0df2851bb717d34b0d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:31:25.532038Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T02:41:17.515692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.5118","snapshot_observed_at":"2026-08-15T21:31:25.532038Z","title":"Link prediction 11 in social networks: the state-of-the-art,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-15T21:24:21.459613Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.532038Z"},"links":{"cited_paper":"/paper/1411.5118","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:7af337b236510f1973b8e9804abd92f83c907b756a384f33778df8817c3a1dc5","observation_id":"062cb704-ec06-4ab2-9db3-109d318451e2","resolution":{"observed_at":"2026-08-15T21:31:25.532038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.5118","snapshot_observed_at":"2026-08-06T16:23:03.522108Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T16:23:03.522108Z"},"links":{"cited_paper":"/paper/1411.5118","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:df5ccbebfddfc0e5ea81b2b1bc7eb99ec2e6590726bfc73057fcc89e9f2f5ba8","observation_id":"1eea8c26-1468-4d92-b1cb-2f2ded68ce95","resolution":{"observed_at":"2026-08-06T16:23:03.522108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art","version":2},"cited_work":{"arxiv_id":"1411.5118","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1411.5118","snapshot_observed_at":"2026-07-04T19:15:02.676764Z","title":"CoRR , volume =","venue":null,"work_id":"c1f2e458-a82e-4a36-b8b6-a3bc07cd2f6e","year":2014},"citing_paper":{"arxiv_id":"2605.09408","last_updated":"2026-05-10T08:19:20Z","snapshot_observed_at":"2026-08-12T20:45:25.980428Z","submitted_at":"2026-05-10T08:19:20Z","title":"GravityGraphSAGE: Link Prediction in Directed Attributed Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T02:39:10.485819Z"},"links":{"cited_paper":"/paper/1411.5118","citing_paper":"/paper/2605.09408"},"observation_digest":"sha256:d478c2e7ac1de9beaea6a7d0df16bbd684c1236a32f8cac51107ea0219c9055c","observation_id":"2c29fd62-9203-4447-96f2-47937a463331","resolution":{"observed_at":"2026-07-04T19:15:02.676764Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1411.5118/citation-record","integrity":"/paper/1411.5118/integrity","json":"/paper/1411.5118/citation-record.json","paper":"/paper/1411.5118"},"outbound":[],"paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1411.5118."}