{"as_of":"2026-08-12T07:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ffd858e53239a07c2e914c18c33bc87e2ae4cdd1a351b44cf6bf1a94aa0be61","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-12T06:34:41.77262+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-25T17:33:56.918863Z","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-25T17:36:05.715157Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1802.04697","last_updated":"2018-07-17T14:16:12Z","snapshot_observed_at":"2026-08-01T14:53:16.337579Z","submitted_at":"2018-02-13T16:10:10Z","title":"Learning to Search with MCTSnets","version":2},"cited_work":{"arxiv_id":"1802.04697","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.04697","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning to Search with MCTSnets","venue":"cs.AI","work_id":"be51c312-5ecb-4ef7-b2a1-91fbaff55451","year":2018},"citing_paper":{"arxiv_id":"1906.09624","last_updated":"2019-06-23T18:41:31Z","snapshot_observed_at":"2026-07-06T08:02:14.109100Z","submitted_at":"2019-06-23T18:41:31Z","title":"On the Feasibility of Learning, Rather than Assuming, Human Biases for Reward Inference","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-25T17:33:56.918863Z"},"links":{"cited_paper":"/paper/1802.04697","citing_paper":"/paper/1906.09624"},"observation_digest":"sha256:001eb7379c4ef4853403d88cf6dad67146f23f5b1ba7d3963604e22cc73375ed","observation_id":"693ac56f-77bf-4623-802d-636ac2ea1880","resolution":{"observed_at":"2026-05-25T17:36:05.718801Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1802.04697/citation-record","integrity":"/paper/1802.04697/integrity","json":"/paper/1802.04697/citation-record.json","paper":"/paper/1802.04697"},"outbound":[],"paper":{"arxiv_id":"1802.04697","last_updated":"2018-07-17T14:16:12Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-01T14:53:16.337579Z","submitted_at":"2018-02-13T16:10:10Z","title":"Learning to Search with MCTSnets"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1802.04697."}