{"as_of":"2026-08-10T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e554ffb83f32ef28c68c1df0be0af860eb03a832e869345790234ac10d61430c","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-10T06:31:04.303077+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-09T11:22:28.908205Z","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-07T10:47:33.073923Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.05396","last_updated":"2020-02-15T08:29:25Z","snapshot_observed_at":"2026-08-10T11:07:44.091684Z","submitted_at":"2019-10-11T20:12:52Z","title":"Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.05396","snapshot_observed_at":"2026-08-09T11:22:28.908205Z","title":null,"venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2502.02743","last_updated":"2025-02-04T22:09:43Z","snapshot_observed_at":"2026-08-09T16:32:54.357740Z","submitted_at":"2025-02-04T22:09:43Z","title":"LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T11:22:28.908205Z"},"links":{"cited_paper":"/paper/1910.05396","citing_paper":"/paper/2502.02743"},"observation_digest":"sha256:7a15dd67668e4da87e1ed9cb5db9ad0d25eb9fae2c2bb7b61bd44092ed8f5193","observation_id":"e845115f-68b9-46d6-903c-d5b9f72ebc25","resolution":{"observed_at":"2026-08-09T11:22:28.908205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.05396","last_updated":"2020-02-15T08:29:25Z","snapshot_observed_at":"2026-08-10T11:07:44.091684Z","submitted_at":"2019-10-11T20:12:52Z","title":"Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"1910.05396","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.05396","snapshot_observed_at":"2026-08-07T10:47:33.073923Z","title":"Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning","venue":"cs.LG","work_id":"b5780aa6-4cc1-43da-87a3-196888e80827","year":2019},"citing_paper":{"arxiv_id":"2506.05418","last_updated":"2025-06-05T00:36:54Z","snapshot_observed_at":"2026-08-09T00:14:33.104955Z","submitted_at":"2025-06-05T00:36:54Z","title":"Self-Predictive Dynamics for Generalization of Vision-based Reinforcement Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:47:32.892216Z"},"links":{"cited_paper":"/paper/1910.05396","citing_paper":"/paper/2506.05418"},"observation_digest":"sha256:dfd9c2913a2f96fbaaf1950ca324779af7f12d61d0025e1a72ede6e27d660453","observation_id":"63c1f7af-b49b-4271-877c-2e8fc7ff2250","resolution":{"observed_at":"2026-08-07T10:47:33.080605Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.05396/citation-record","integrity":"/paper/1910.05396/integrity","json":"/paper/1910.05396/citation-record.json","paper":"/paper/1910.05396"},"outbound":[],"paper":{"arxiv_id":"1910.05396","last_updated":"2020-02-15T08:29:25Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T11:07:44.091684Z","submitted_at":"2019-10-11T20:12:52Z","title":"Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1910.05396."}