{"as_of":"2026-08-16T17:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c43c60013ebdedbdecc0df9ecd0afc3381c1f1d154cbd71039d990c60fa11070","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-16T06:30:59.297886+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-14T12:36:42.902555Z","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-05-18T06:54:31.391282Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.01118","last_updated":"2018-11-02T22:59:31Z","snapshot_observed_at":"2026-08-14T18:04:54.138733Z","submitted_at":"2018-11-02T22:59:31Z","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.01118","snapshot_observed_at":"2026-08-14T12:36:42.902555Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06917","last_updated":"2019-08-19T16:31:29Z","snapshot_observed_at":"2026-08-15T22:12:48.536853Z","submitted_at":"2019-08-19T16:31:29Z","title":"Message Passing for Complex Question Answering over Knowledge Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:42.902555Z"},"links":{"cited_paper":"/paper/1811.01118","citing_paper":"/paper/1908.06917"},"observation_digest":"sha256:94d45ea48a745b768a2b7244103b808c530d1df4255d9c2b860fb85b28a7657e","observation_id":"491c1524-0aad-41f5-b7a9-4e52268b6142","resolution":{"observed_at":"2026-08-14T12:36:42.902555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.01118","last_updated":"2018-11-02T22:59:31Z","snapshot_observed_at":"2026-08-14T18:04:54.138733Z","submitted_at":"2018-11-02T22:59:31Z","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","version":1},"cited_work":{"arxiv_id":"1811.01118","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.01118","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs","venue":"cs.LG","work_id":"0b99c7d0-c986-49a4-8ba7-3e0bc05bb2b3","year":2018},"citing_paper":{"arxiv_id":"2305.15717","last_updated":"2023-05-25T05:00:12Z","snapshot_observed_at":"2026-08-12T18:39:37.539896Z","submitted_at":"2023-05-25T05:00:12Z","title":"The False Promise of Imitating Proprietary LLMs","version":1},"reference_index":278,"source":"arxiv_source","source_observed_at":"2026-05-18T06:54:31.175090Z"},"links":{"cited_paper":"/paper/1811.01118","citing_paper":"/paper/2305.15717"},"observation_digest":"sha256:5713586ad070f999ec9950369f2de56f45fe1ad7c1c74412ce8ad806449419a3","observation_id":"58dfff7d-24fd-45aa-a900-79e04114a998","resolution":{"observed_at":"2026-05-18T06:54:31.392937Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1811.01118/citation-record","integrity":"/paper/1811.01118/integrity","json":"/paper/1811.01118/citation-record.json","paper":"/paper/1811.01118"},"outbound":[],"paper":{"arxiv_id":"1811.01118","last_updated":"2018-11-02T22:59:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T18:04:54.138733Z","submitted_at":"2018-11-02T22:59:31Z","title":"Learning to Rank Query Graphs for Complex Question Answering over 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1811.01118."}