{"as_of":"2026-08-07T18:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e53a5ae8a47a6f2fa55555a278f8cb4df07d9b5945e09c36e590fdac5a16663f","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-07T06:34:17.273281+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-13T05:08:10.500069Z","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-13T05:12:18.048509Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.10789","last_updated":"2017-11-29T11:41:41Z","snapshot_observed_at":"2026-08-06T22:34:35.079421Z","submitted_at":"2017-11-29T11:41:41Z","title":"Efficient exploration with Double Uncertain Value Networks","version":1},"cited_work":{"arxiv_id":"1711.10789","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1711.10789","snapshot_observed_at":"2026-07-04T22:22:36.253842Z","title":"Efficient exploration with double uncertain value networks","venue":null,"work_id":"9ca5dbec-c06f-4d17-aee0-0eb418c131f3","year":2017},"citing_paper":{"arxiv_id":"2605.12084","last_updated":"2026-05-12T13:07:27Z","snapshot_observed_at":"2026-08-02T15:08:52.589461Z","submitted_at":"2026-05-12T13:07:27Z","title":"Learning What Matters: Adaptive Information-Theoretic Objectives for Robot Exploration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-13T05:08:10.500069Z"},"links":{"cited_paper":"/paper/1711.10789","citing_paper":"/paper/2605.12084"},"observation_digest":"sha256:2d51afd4d22bba9ff02a0873229df1ceb31272483cb7789016ed73e0453d440c","observation_id":"52197e38-69d3-4588-912b-c65f320e655a","resolution":{"observed_at":"2026-07-04T22:22:36.253842Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1711.10789/citation-record","integrity":"/paper/1711.10789/integrity","json":"/paper/1711.10789/citation-record.json","paper":"/paper/1711.10789"},"outbound":[],"paper":{"arxiv_id":"1711.10789","last_updated":"2017-11-29T11:41:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T22:34:35.079421Z","submitted_at":"2017-11-29T11:41:41Z","title":"Efficient exploration with Double Uncertain Value Networks"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1711.10789."}