{"as_of":"2026-08-12T04:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:efa482887b63dda29b4db3c23116766310c8eb93ee448cd9667fe25745ed3861","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:09:54.236710Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":96,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1812.02690","last_updated":"2019-01-26T01:54:32Z","snapshot_observed_at":"2026-08-05T14:48:12.142477Z","submitted_at":"2018-12-06T18:15:44Z","title":"Provably Efficient Maximum Entropy Exploration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.02690","snapshot_observed_at":"2026-08-11T19:09:54.236710Z","title":"M., Singh, K., and Van Soest, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07177","last_updated":"2024-12-10T04:22:11Z","snapshot_observed_at":"2026-08-11T21:47:47.069506Z","submitted_at":"2024-12-10T04:22:11Z","title":"Effective Reward Specification in Deep Reinforcement Learning","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-08-11T19:09:54.236710Z"},"links":{"cited_paper":"/paper/1812.02690","citing_paper":"/paper/2412.07177"},"observation_digest":"sha256:a3d225eb2f392e01014969af64e7292ee6df094912929cb405ca5686d7d3ffc2","observation_id":"48929738-9a06-4af6-a64d-7463dd7a67ff","resolution":{"observed_at":"2026-08-11T19:09:54.236710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02690","last_updated":"2019-01-26T01:54:32Z","snapshot_observed_at":"2026-08-05T14:48:12.142477Z","submitted_at":"2018-12-06T18:15:44Z","title":"Provably Efficient Maximum Entropy Exploration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.02690","snapshot_observed_at":"2026-08-11T00:18:20.282303Z","title":", Kakade, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.19562","last_updated":"2024-12-27T10:05:45Z","snapshot_observed_at":"2026-08-11T00:35:32.156162Z","submitted_at":"2024-12-27T10:05:45Z","title":"Hindsight Planner: A Closed-Loop Few-Shot Planner for Embodied Instruction Following","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T00:18:20.282303Z"},"links":{"cited_paper":"/paper/1812.02690","citing_paper":"/paper/2412.19562"},"observation_digest":"sha256:ea3aede8110301fea06234d578bfaa7b43fffccabb78f8a5a5538a449911eb35","observation_id":"3ac1065c-580b-4971-b349-89499b3a13c7","resolution":{"observed_at":"2026-08-11T00:18:20.282303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02690","last_updated":"2019-01-26T01:54:32Z","snapshot_observed_at":"2026-08-05T14:48:12.142477Z","submitted_at":"2018-12-06T18:15:44Z","title":"Provably Efficient Maximum Entropy Exploration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.02690","snapshot_observed_at":"2026-08-07T05:03:25.984106Z","title":"Provably efficient maximum entropy exploration","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.09026","last_updated":"2025-06-13T17:44:03Z","snapshot_observed_at":"2026-08-09T06:45:47.107738Z","submitted_at":"2025-06-10T17:52:42Z","title":"e3: Learning to Explore Enables Extrapolation of Test-Time Compute for LLMs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:03:25.984106Z"},"links":{"cited_paper":"/paper/1812.02690","citing_paper":"/paper/2506.09026"},"observation_digest":"sha256:17df822d45d87eea99de2e5637dca98783016fcc1b16a2f04024fac0e6698625","observation_id":"be508c46-43de-44ef-ad57-19332c637362","resolution":{"observed_at":"2026-08-07T05:03:25.984106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.02690","last_updated":"2019-01-26T01:54:32Z","snapshot_observed_at":"2026-08-05T14:48:12.142477Z","submitted_at":"2018-12-06T18:15:44Z","title":"Provably Efficient Maximum Entropy Exploration","version":2},"cited_work":{"arxiv_id":"1812.02690","doi":"10.48550/arxiv.1812.02690","metadata_source":"pith","pith_arxiv_id":"1812.02690","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Provably Efficient Maximum Entropy Exploration","venue":"cs.LG","work_id":"3f390561-4fb9-40d3-87c1-10be20a73958","year":2018},"citing_paper":{"arxiv_id":"2607.25271","last_updated":"2026-07-28T04:18:49Z","snapshot_observed_at":"2026-08-10T14:39:39.683275Z","submitted_at":"2026-07-28T04:18:49Z","title":"Bridging Compute- and Data-Optimal Pretraining","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T03:02:00.242174Z"},"links":{"cited_paper":"/paper/1812.02690","citing_paper":"/paper/2607.25271"},"observation_digest":"sha256:b5b82634e25d73cd109314d9ff5518f436bba1c99d632590bb2389fabe225eaf","observation_id":"4a29a3f0-32b5-45f4-bd0a-6df93d5317d1","resolution":{"observed_at":"2026-08-01T03:08:37.718299Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1812.02690/citation-record","integrity":"/paper/1812.02690/integrity","json":"/paper/1812.02690/citation-record.json","paper":"/paper/1812.02690"},"outbound":[],"paper":{"arxiv_id":"1812.02690","last_updated":"2019-01-26T01:54:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T14:48:12.142477Z","submitted_at":"2018-12-06T18:15:44Z","title":"Provably Efficient Maximum Entropy Exploration"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1812.02690."}