{"as_of":"2026-08-15T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d1c6011b4e9e23a5f1745d5dd2d1c5956dd613f757e0258e0fd406a59b3c445","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T04:15:52.478351Z","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-05-19T04:17:02.706853Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.08718","last_updated":"2022-12-16T21:29:41Z","snapshot_observed_at":"2026-08-15T04:48:19.602008Z","submitted_at":"2022-12-16T21:29:41Z","title":"Neural Story Planning","version":1},"cited_work":{"arxiv_id":"2212.08718","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.08718","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Proofs A.1 Intelligence and clue probabilities Here, we show that reader intelligence can be interpreted as a result of similar clue probability judgments among detectives","venue":null,"work_id":"39fece86-8706-4b21-8b3a-de3cdaf8c154","year":null},"citing_paper":{"arxiv_id":"2507.13841","last_updated":"2026-05-12T12:08:35Z","snapshot_observed_at":"2026-08-15T03:58:35.874662Z","submitted_at":"2025-07-18T11:55:18Z","title":"The Challenge and Reward of Fair Play in Narrative: A Computational Approach","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T04:15:52.478351Z"},"links":{"cited_paper":"/paper/2212.08718","citing_paper":"/paper/2507.13841"},"observation_digest":"sha256:2c8ebef1c39169d7e86a0950917ac064c7fe09dc33155fb3e0a5fc23f4fbafb3","observation_id":"60c3b824-baf8-4586-989b-0769b968703a","resolution":{"observed_at":"2026-05-19T04:17:02.710678Z","resolver_source":"arxiv_id","status":"verified_exact"},"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/2212.08718/citation-record","integrity":"/paper/2212.08718/integrity","json":"/paper/2212.08718/citation-record.json","paper":"/paper/2212.08718"},"outbound":[],"paper":{"arxiv_id":"2212.08718","last_updated":"2022-12-16T21:29:41Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T04:48:19.602008Z","submitted_at":"2022-12-16T21:29:41Z","title":"Neural Story Planning"},"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 1 inbound Pith citation observation for arXiv:2212.08718."}