{"as_of":"2026-08-09T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eda3dffc6b68e41cac90d7d18be178ea3c10399aec456ea77f649116f881f1fb","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-09T06:31:02.800959+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-07T14:21:15.676243Z","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-06-29T21:53:58.917987Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-08-07T14:21:15.676243Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19286","last_updated":"2025-05-27T06:58:53Z","snapshot_observed_at":"2026-08-08T08:03:08.658189Z","submitted_at":"2025-05-25T19:34:15Z","title":"A Graph Perspective to Probe Structural Patterns of Knowledge in Large Language Models","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T14:21:15.676243Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2505.19286"},"observation_digest":"sha256:d7d6f27a4342212af2ef04cf577ef409f65d31e1c95f8c2ca97385af10384315","observation_id":"e854e27e-6280-4456-99fc-2fb582b0f9e0","resolution":{"observed_at":"2026-08-07T14:21:15.676243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-08-05T12:53:31.287681Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.01166","last_updated":"2025-09-01T06:38:11Z","snapshot_observed_at":"2026-08-05T12:53:26.181748Z","submitted_at":"2025-09-01T06:38:11Z","title":"Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T12:53:31.287681Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2509.01166"},"observation_digest":"sha256:f4bb2ae61f48fea5fa691f93f6028088581f4855c7439a38bcd9bc4445bd329f","observation_id":"b5550692-6f8a-47b5-82c8-2d7a7346c1f2","resolution":{"observed_at":"2026-08-05T12:53:31.287681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-08-03T23:37:57.145621Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.07457","last_updated":"2026-07-20T02:41:15Z","snapshot_observed_at":"2026-08-06T01:49:16.929228Z","submitted_at":"2025-11-06T21:56:58Z","title":"GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T23:37:57.145621Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2511.07457"},"observation_digest":"sha256:d02cfa33964dd2e8168e0e67d90ed0741f4f0b09374c28dd7b9951c766a71210","observation_id":"6dfc4dff-ef1d-4c24-a6e4-8c00c57c220e","resolution":{"observed_at":"2026-08-03T23:37:57.145621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":"2009.07810","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-06-29T21:53:58.917987Z","title":"Codex: A comprehensive knowledge graph completion benchmark","venue":null,"work_id":"dd458d63-f7c6-4612-a305-752cf4ec7bed","year":2020},"citing_paper":{"arxiv_id":"2604.15385","last_updated":"2026-04-16T03:25:28Z","snapshot_observed_at":"2026-07-06T23:02:58.361418Z","submitted_at":"2026-04-16T03:25:28Z","title":"Prompt-Driven Code Summarization: A Systematic Literature Review","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T11:35:12.299549Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2604.15385"},"observation_digest":"sha256:27d89829133befcdc9de1b3b2e4ff6790cf04624adcd53be6eb503d369091862","observation_id":"f68904ca-bd80-4663-b20d-7356f2529e50","resolution":{"observed_at":"2026-05-10T11:35:18.543984Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":"2009.07810","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-06-29T21:53:58.917987Z","title":"Codex: A comprehensive knowledge graph completion benchmark","venue":null,"work_id":"dd458d63-f7c6-4612-a305-752cf4ec7bed","year":2020},"citing_paper":{"arxiv_id":"2605.25985","last_updated":"2026-06-06T12:58:20Z","snapshot_observed_at":"2026-07-06T23:35:50.787324Z","submitted_at":"2026-05-25T16:04:57Z","title":"Neural Scalable Symbolic Search Framework for Complex Logical Queries with Multiple Free Variables","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T21:53:21.277548Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2605.25985"},"observation_digest":"sha256:219f8438802bb7db80206615724c48bd16413a7013468041a81cc3bea1a6f379","observation_id":"fddb2086-e4fd-4db5-b4c3-1891f937289d","resolution":{"observed_at":"2026-06-29T21:53:58.919514Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2009.07810/citation-record","integrity":"/paper/2009.07810/integrity","json":"/paper/2009.07810/citation-record.json","paper":"/paper/2009.07810"},"outbound":[],"paper":{"arxiv_id":"2009.07810","last_updated":"2020-10-06T09:10:10Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T06:38:40.134306Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2009.07810."}