{"as_of":"2026-08-14T18:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fcc5f5c41fc4f57e6300e13640e9e80447133b833e56df852a54df9c9c5e1d5e","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:58:21.979089Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":11,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.01520","last_updated":"2022-04-18T20:47:24Z","snapshot_observed_at":"2026-08-13T16:30:23.948702Z","submitted_at":"2022-03-03T05:24:09Z","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.01520","snapshot_observed_at":"2026-08-12T21:58:21.979089Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.08172","last_updated":"2024-11-12T20:32:36Z","snapshot_observed_at":"2026-08-14T12:54:40.421517Z","submitted_at":"2024-11-12T20:32:36Z","title":"Fault Localization in Deep Learning-based Software: A System-level Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T21:58:21.979089Z"},"links":{"cited_paper":"/paper/2203.01520","citing_paper":"/paper/2411.08172"},"observation_digest":"sha256:0a877328223ff36a1211f2296897d27fdab71b4b551f75ec2caf7a14e737d649","observation_id":"b6e9f80f-f5ea-4b5b-a30e-a4991fba0e58","resolution":{"observed_at":"2026-08-12T21:58:21.979089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01520","last_updated":"2022-04-18T20:47:24Z","snapshot_observed_at":"2026-08-13T16:30:23.948702Z","submitted_at":"2022-03-03T05:24:09Z","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.01520","snapshot_observed_at":"2026-08-07T13:25:16.204295Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21926","last_updated":"2025-05-28T03:21:28Z","snapshot_observed_at":"2026-08-13T18:06:40.510261Z","submitted_at":"2025-05-28T03:21:28Z","title":"Beyond Completion: A Foundation Model for General Knowledge Graph Reasoning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T13:25:16.204295Z"},"links":{"cited_paper":"/paper/2203.01520","citing_paper":"/paper/2505.21926"},"observation_digest":"sha256:f1238bc3cbffd796a6f4f4254f85fcba7b54ecb995cbd171b22ccf1fd3bba816","observation_id":"47f705c0-25ef-4eb7-ae37-2a61653f8d1f","resolution":{"observed_at":"2026-08-07T13:25:16.204295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01520","last_updated":"2022-04-18T20:47:24Z","snapshot_observed_at":"2026-08-13T16:30:23.948702Z","submitted_at":"2022-03-03T05:24:09Z","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":"2203.01520","doi":"10.48550/arxiv.2203.01520","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.01520","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An open challenge for inductive link prediction on knowledge graphs.arXiv preprint arXiv:2203.01520, 2022","venue":"arXiv (Cornell University)","work_id":"7b7d29bd-9eae-4d2d-bce1-06856d719c7c","year":2022},"citing_paper":{"arxiv_id":"2605.14907","last_updated":"2026-05-14T14:41:19Z","snapshot_observed_at":"2026-08-14T01:21:30.053161Z","submitted_at":"2026-05-14T14:41:19Z","title":"KGPFN: Unlocking the Potential of Knowledge Graph Foundation Model via In-Context Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T20:28:41.778793Z"},"links":{"cited_paper":"/paper/2203.01520","citing_paper":"/paper/2605.14907"},"observation_digest":"sha256:1822f67bc604a7a0eb42fc778ef74a4b2c52db204d8035bb76e5ebda9679e50b","observation_id":"b1802121-8143-445f-a4e0-d5d2683a17e2","resolution":{"observed_at":"2026-06-30T20:35:02.836930Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2203.01520","last_updated":"2022-04-18T20:47:24Z","snapshot_observed_at":"2026-08-13T16:30:23.948702Z","submitted_at":"2022-03-03T05:24:09Z","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs","version":2},"cited_work":{"arxiv_id":"2203.01520","doi":"10.48550/arxiv.2203.01520","metadata_source":"arxiv_reference","pith_arxiv_id":"2203.01520","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An open challenge for inductive link prediction on knowledge graphs.arXiv preprint arXiv:2203.01520, 2022","venue":"arXiv (Cornell University)","work_id":"7b7d29bd-9eae-4d2d-bce1-06856d719c7c","year":2022},"citing_paper":{"arxiv_id":"2606.18001","last_updated":"2026-06-16T14:47:35Z","snapshot_observed_at":"2026-08-13T08:35:48.126680Z","submitted_at":"2026-06-16T14:47:35Z","title":"Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T01:51:18.585359Z"},"links":{"cited_paper":"/paper/2203.01520","citing_paper":"/paper/2606.18001"},"observation_digest":"sha256:1e1e409517008c37101a6946e61e64c1f77334b29d656c93a984adbbb491eb50","observation_id":"7345b69b-e86b-4412-932e-6511d2dc38af","resolution":{"observed_at":"2026-06-27T02:00:22.175808Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2203.01520/citation-record","integrity":"/paper/2203.01520/integrity","json":"/paper/2203.01520/citation-record.json","paper":"/paper/2203.01520"},"outbound":[],"paper":{"arxiv_id":"2203.01520","last_updated":"2022-04-18T20:47:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T16:30:23.948702Z","submitted_at":"2022-03-03T05:24:09Z","title":"An Open Challenge for Inductive Link Prediction on Knowledge Graphs"},"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-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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2203.01520."}