{"as_of":"2026-08-10T01:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e43bd639bf1e885afaeaed185e7a84ad971e2a79b90cd795e5504657bf0d906","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:24:16.790447Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-04T21:36:45.607664Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.11002","last_updated":"2020-04-22T09:06:19Z","snapshot_observed_at":"2026-08-08T01:18:49.522113Z","submitted_at":"2020-02-25T16:23:11Z","title":"Turning 30: New Ideas in Inductive Logic Programming","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11002","snapshot_observed_at":"2026-08-05T11:24:16.790447Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.02958","last_updated":"2025-09-03T02:45:34Z","snapshot_observed_at":"2026-08-05T11:24:12.012110Z","submitted_at":"2025-09-03T02:45:34Z","title":"Lattice Annotated Temporal (LAT) Logic for Non-Markovian Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:24:16.790447Z"},"links":{"cited_paper":"/paper/2002.11002","citing_paper":"/paper/2509.02958"},"observation_digest":"sha256:02d91d3d03d1a8da0f4d729259962e26d8ed5547794b6c9642c357aaf7d64e54","observation_id":"0a1ea923-38ee-42a0-8ed4-ea823afa9b01","resolution":{"observed_at":"2026-08-05T11:24:16.790447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11002","last_updated":"2020-04-22T09:06:19Z","snapshot_observed_at":"2026-08-08T01:18:49.522113Z","submitted_at":"2020-02-25T16:23:11Z","title":"Turning 30: New Ideas in Inductive Logic Programming","version":4},"cited_work":{"arxiv_id":"2002.11002","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.11002","snapshot_observed_at":"2026-08-04T21:36:45.607664Z","title":"Turning 30: New Ideas in Inductive Logic Programming","venue":"cs.AI","work_id":"401740a0-1f11-4174-9681-e6b70aefef4e","year":2020},"citing_paper":{"arxiv_id":"2608.01763","last_updated":"2026-08-03T06:34:31Z","snapshot_observed_at":"2026-08-08T16:17:24.950364Z","submitted_at":"2026-08-03T06:34:31Z","title":"EntailLLM: Verifying LLM-Generated Vulnerability Discovery Paths with Domain Knowledge via Logic Programming","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T21:36:11.982483Z"},"links":{"cited_paper":"/paper/2002.11002","citing_paper":"/paper/2608.01763"},"observation_digest":"sha256:caf731382aebe143ec499186ba9c25b85fd41fb3510668e3f04aae1c6dfdbcea","observation_id":"4bd7e080-68e2-469b-91a0-6687a1204806","resolution":{"observed_at":"2026-08-04T21:36:45.661669Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2002.11002/citation-record","integrity":"/paper/2002.11002/integrity","json":"/paper/2002.11002/citation-record.json","paper":"/paper/2002.11002"},"outbound":[],"paper":{"arxiv_id":"2002.11002","last_updated":"2020-04-22T09:06:19Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-08T01:18:49.522113Z","submitted_at":"2020-02-25T16:23:11Z","title":"Turning 30: New Ideas in Inductive Logic Programming"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2002.11002."}