{"as_of":"2026-08-07T23:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:243b751bea54a6dd23a4dcd3d443b762b86d005d42e4503013817def1f5c2cf8","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:17:01.448114Z","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-25T07:50:28.934073Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-08-07T15:17:01.448114Z","title":"Neural common neigh- bor with completion for link prediction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:17:01.448114Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2505.15746"},"observation_digest":"sha256:ed65b6b6b9cde5b43b1a3aba381ab57dd60ad62d3ad18be7be7f902f6b9d3bd0","observation_id":"506bd060-dcea-45c7-892d-5482249226ed","resolution":{"observed_at":"2026-08-07T15:17:01.448114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-08-07T05:44:53.316924Z","title":"Neural common neighbor with completion for link prediction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07168","last_updated":"2025-06-08T14:34:29Z","snapshot_observed_at":"2026-08-07T22:51:47.659500Z","submitted_at":"2025-06-08T14:34:29Z","title":"Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:53.316924Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2506.07168"},"observation_digest":"sha256:98c3a66d9b73cc0141913b0886753e7c9ebff7ab594a2c83f3213eeed9a100c6","observation_id":"c92a220b-a027-43b1-bdb5-9aa6c180eb00","resolution":{"observed_at":"2026-08-07T05:44:53.316924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":"2302.00890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural common neighbor with comple- tion for link prediction.arXiv preprint arXiv:2302.00890","venue":null,"work_id":"e455265f-a816-4dc2-b8bb-36713bcc43b7","year":2023},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:255151ab8a484c9410a480e3adc69ddd45da6e6b8b9132da822620338fb1f638","observation_id":"9d2a6f80-0224-4326-85ab-996bb4d7e51f","resolution":{"observed_at":"2026-05-25T07:50:28.937455Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-08-04T10:00:51.572804Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:51.572804Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:2f03c36be45b4f547c2dab0632dad58c2f2423930550500740c168686e95ce25","observation_id":"69f0c888-dca1-405f-b1b8-6c6ed3f69c34","resolution":{"observed_at":"2026-08-04T10:00:51.572804Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction","version":4},"cited_work":{"arxiv_id":"2302.00890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.00890","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Neural common neighbor with comple- tion for link prediction.arXiv preprint arXiv:2302.00890","venue":null,"work_id":"e455265f-a816-4dc2-b8bb-36713bcc43b7","year":2023},"citing_paper":{"arxiv_id":"2605.16902","last_updated":"2026-05-16T09:26:08Z","snapshot_observed_at":"2026-07-06T23:27:57.805018Z","submitted_at":"2026-05-16T09:26:08Z","title":"ArtifactLinker: Linking Scientific Artifacts for Automatic State-of-the-Art Discovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T20:29:27.398862Z"},"links":{"cited_paper":"/paper/2302.00890","citing_paper":"/paper/2605.16902"},"observation_digest":"sha256:47e8f4b79136dfd671d08c13dc4580a1a933a719b6a881d558b888901959839d","observation_id":"b100d16e-4aab-46bf-997f-f8b20222f862","resolution":{"observed_at":"2026-05-19T20:32:45.501285Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.00890/citation-record","integrity":"/paper/2302.00890/integrity","json":"/paper/2302.00890/citation-record.json","paper":"/paper/2302.00890"},"outbound":[],"paper":{"arxiv_id":"2302.00890","last_updated":"2024-06-04T05:46:09Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T06:26:01.318904Z","submitted_at":"2023-02-02T05:45:09Z","title":"Neural Common Neighbor with Completion for Link Prediction"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2302.00890."}