{"as_of":"2026-08-15T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83840022d7e011fc63e62a122730651afe975fa4e8b131ad939bb19a94c44724","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-15T06:32:42.880941+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-12T11:09:17.509057Z","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-05T22:39:51.917047Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.06187","last_updated":"2019-06-14T13:05:08Z","snapshot_observed_at":"2026-08-14T16:15:36.094892Z","submitted_at":"2019-06-14T13:05:08Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06187","snapshot_observed_at":"2026-08-12T11:09:17.509057Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.18564","last_updated":"2024-12-12T16:03:30Z","snapshot_observed_at":"2026-08-15T00:05:02.159600Z","submitted_at":"2024-11-27T18:04:05Z","title":"Dspy-based Neural-Symbolic Pipeline to Enhance Spatial Reasoning in LLMs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T11:09:17.509057Z"},"links":{"cited_paper":"/paper/1906.06187","citing_paper":"/paper/2411.18564"},"observation_digest":"sha256:0b75f92ce8d13defb3a28895777794586562b294d50d520171df67df7bdcfe7d","observation_id":"70da3f09-4dbc-4854-8ca7-480c2ff0cbd5","resolution":{"observed_at":"2026-08-12T11:09:17.509057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06187","last_updated":"2019-06-14T13:05:08Z","snapshot_observed_at":"2026-08-14T16:15:36.094892Z","submitted_at":"2019-06-14T13:05:08Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","version":1},"cited_work":{"arxiv_id":"1906.06187","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.06187","snapshot_observed_at":"2026-08-05T22:39:51.917047Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","venue":"cs.CL","work_id":"ece0b8ff-9d3f-416c-b659-4d2a98f7ded0","year":2019},"citing_paper":{"arxiv_id":"2508.06706","last_updated":"2026-08-09T13:27:51Z","snapshot_observed_at":"2026-08-13T23:26:09.290082Z","submitted_at":"2025-08-08T21:17:03Z","title":"Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T22:39:51.861314Z"},"links":{"cited_paper":"/paper/1906.06187","citing_paper":"/paper/2508.06706"},"observation_digest":"sha256:ac988b648642eac1d868dd495a828235c75f51689de39e4a4c6dcd743db40d92","observation_id":"f11b6647-a356-4501-8d0b-0632a43b9de0","resolution":{"observed_at":"2026-08-05T22:39:51.924272Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1906.06187/citation-record","integrity":"/paper/1906.06187/integrity","json":"/paper/1906.06187/citation-record.json","paper":"/paper/1906.06187"},"outbound":[],"paper":{"arxiv_id":"1906.06187","last_updated":"2019-06-14T13:05:08Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T16:15:36.094892Z","submitted_at":"2019-06-14T13:05:08Z","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language"},"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 2 inbound Pith citation observations for arXiv:1906.06187."}