{"as_of":"2026-08-09T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a8e3052721f62cbf385c4ed79e1437c26e42467405df2aa66208370b5edf7af","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-07T14:17:17.891403Z","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-06T10:32:33.924392Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2001.08837","last_updated":"2020-01-23T22:33:18Z","snapshot_observed_at":"2026-08-09T15:00:51.941571Z","submitted_at":"2020-01-23T22:33:18Z","title":"Graph Constrained Reinforcement Learning for Natural Language Action Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08837","snapshot_observed_at":"2026-08-07T14:17:17.891403Z","title":"ArXiv, abs/2001.08837","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.19510","last_updated":"2025-05-29T05:23:38Z","snapshot_observed_at":"2026-08-07T14:44:35.221555Z","submitted_at":"2025-05-26T04:45:12Z","title":"LLM Meets Scene Graph: Can Large Language Models Understand and Generate Scene Graphs? A Benchmark and Empirical Study","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:17:17.891403Z"},"links":{"cited_paper":"/paper/2001.08837","citing_paper":"/paper/2505.19510"},"observation_digest":"sha256:08704e4139afdc8245deb678609b870c1e17f761e3704d1a458a3a334e8ab601","observation_id":"f5669449-0e7d-4938-9fc2-3705db1041d0","resolution":{"observed_at":"2026-08-07T14:17:17.891403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08837","last_updated":"2020-01-23T22:33:18Z","snapshot_observed_at":"2026-08-09T15:00:51.941571Z","submitted_at":"2020-01-23T22:33:18Z","title":"Graph Constrained Reinforcement Learning for Natural Language Action Spaces","version":1},"cited_work":{"arxiv_id":"2001.08837","doi":null,"metadata_source":"pith","pith_arxiv_id":"2001.08837","snapshot_observed_at":"2026-08-06T10:32:33.924392Z","title":"Graph Constrained Reinforcement Learning for Natural Language Action Spaces","venue":"cs.LG","work_id":"a51fdf02-4eea-4562-b931-a5aeb5562f02","year":2020},"citing_paper":{"arxiv_id":"2507.23701","last_updated":"2025-08-13T17:45:14Z","snapshot_observed_at":"2026-08-08T20:33:26.749462Z","submitted_at":"2025-07-31T16:22:55Z","title":"TextQuests: How Good are LLMs at Text-Based Video Games?","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T10:32:33.638115Z"},"links":{"cited_paper":"/paper/2001.08837","citing_paper":"/paper/2507.23701"},"observation_digest":"sha256:a12e60e16b1a7746e05ca888347fce5fa5f39514468653356105ba2edab96b7a","observation_id":"9dc0c724-c700-4f6c-81ad-33c8d9d18991","resolution":{"observed_at":"2026-08-06T10:32:33.929689Z","resolver_source":"local_arxiv","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/2001.08837/citation-record","integrity":"/paper/2001.08837/integrity","json":"/paper/2001.08837/citation-record.json","paper":"/paper/2001.08837"},"outbound":[],"paper":{"arxiv_id":"2001.08837","last_updated":"2020-01-23T22:33:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T15:00:51.941571Z","submitted_at":"2020-01-23T22:33:18Z","title":"Graph Constrained Reinforcement Learning for Natural Language Action Spaces"},"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 2 inbound Pith citation observations for arXiv:2001.08837."}