{"as_of":"2026-08-08T09:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d107630f40a2e1c5f6daa844c5105507b708c54defe5f0c4defc6d7ffee19113","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":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":17,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:44.411449Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":390,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"1906.08805","last_updated":"2019-06-20T18:47:06Z","snapshot_observed_at":"2026-08-02T00:48:07.511212Z","submitted_at":"2019-06-20T18:47:06Z","title":"Finding Needles in a Moving Haystack: Prioritizing Alerts with Adversarial Reinforcement Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T19:29:04.536113Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/1906.08805"},"observation_digest":"sha256:3d09ebb493329abe185fc35c595617e6b84c8b80c3b9f0c49ffd2077412292f8","observation_id":"914d3093-6234-4e4c-b78a-0566913047d4","resolution":{"observed_at":"2026-05-25T19:31:10.167230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"1907.06077","last_updated":"2019-07-13T13:37:29Z","snapshot_observed_at":"2026-08-02T07:27:22.807594Z","submitted_at":"2019-07-13T13:37:29Z","title":"Evolvability ES: Scalable and Direct Optimization of Evolvability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T21:55:34.711660Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/1907.06077"},"observation_digest":"sha256:fd32ae4350f9c2b9de9aff9f2f4286fe7a90cea3b163dd7eb012baa518eb8953","observation_id":"0f9994cc-62c2-4fa8-9c99-2e8712e41e0b","resolution":{"observed_at":"2026-05-24T21:56:24.013101Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"2010.02193","last_updated":"2022-02-12T20:01:53Z","snapshot_observed_at":"2026-08-02T12:02:13.904371Z","submitted_at":"2020-10-05T17:52:14Z","title":"Mastering Atari with Discrete World Models","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-15T01:27:31.813680Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2010.02193"},"observation_digest":"sha256:d78ef3bdd47abeb0ed2579136ac94d89ddd925cb5bdc2ecce8992fad2279b08f","observation_id":"512c2b12-42e5-42aa-8cd9-c1371f30d6cd","resolution":{"observed_at":"2026-05-15T01:27:31.915823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-07T15:29:44.411449Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.15011","last_updated":"2025-05-21T01:32:54Z","snapshot_observed_at":"2026-08-07T15:23:15.558853Z","submitted_at":"2025-05-21T01:32:54Z","title":"HAVA: Hybrid Approach to Value-Alignment through Reward Weighing for Reinforcement Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:29:44.411449Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2505.15011"},"observation_digest":"sha256:29ad3f2cd62409b2bb0f92866e8ecdb370a5817860d0e67ca3fdb34485bd0da5","observation_id":"7c782612-e9c2-4935-8399-85d73ef4f1c9","resolution":{"observed_at":"2026-08-07T15:29:44.411449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-07T15:23:15.986291Z","title":"Fortunato, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15345","last_updated":"2025-05-23T11:18:10Z","snapshot_observed_at":"2026-08-07T20:34:34.327158Z","submitted_at":"2025-05-21T10:19:49Z","title":"Hadamax Encoding: Elevating Performance in Model-Free Atari","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:15.986291Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2505.15345"},"observation_digest":"sha256:8510317fb3e8cd5239e6a187cc309bb2c1c8da2b32d5b4652463a0fe7a4ea30f","observation_id":"b6cba064-77a8-4a4a-99b6-397cee635de2","resolution":{"observed_at":"2026-08-07T15:23:15.986291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-07T04:25:27.469040Z","title":"Fortunato, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10772","last_updated":"2025-06-12T14:50:47Z","snapshot_observed_at":"2026-08-07T05:27:13.897764Z","submitted_at":"2025-06-12T14:50:47Z","title":"Skillful joint probabilistic weather forecasting from marginals","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T04:25:27.469040Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2506.10772"},"observation_digest":"sha256:7b88c95e54f74981e86b94c9647babbb5b3dcb5bff854b300824f7f4b6340623","observation_id":"3a0eaa98-384a-4d3c-aa53-1b2929cf5809","resolution":{"observed_at":"2026-08-07T04:25:27.469040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-07T00:33:24.952368Z","title":"Piot, Jacob Menick, Ian Osband, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.13690","last_updated":"2025-06-16T16:52:49Z","snapshot_observed_at":"2026-08-07T00:25:15.453757Z","submitted_at":"2025-06-16T16:52:49Z","title":"Meta-learning how to Share Credit among Macro-Actions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:33:24.952368Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2506.13690"},"observation_digest":"sha256:6a0bc8625f803f1c2a85eb2cb6620880590a675f271ea3a1433cd74373c0a796","observation_id":"da0d07e9-62a7-43c6-8d8d-cbae40b1b60c","resolution":{"observed_at":"2026-08-07T00:33:24.952368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-06T18:56:58.303846Z","title":"Noisy Net- works for Exploration","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.06901","last_updated":"2025-07-09T14:40:35Z","snapshot_observed_at":"2026-08-08T09:31:48.996517Z","submitted_at":"2025-07-09T14:40:35Z","title":"Designing Adaptive Algorithms Based on Reinforcement Learning for Dynamic Optimization of Sliding Window Size in Multi-Dimensional Data Streams","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:56:58.303846Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2507.06901"},"observation_digest":"sha256:125ba27341de13548d2b8fc0fac94f3d77e65337d67efd6052b72e62a9f34153","observation_id":"167edfe9-fac4-4a4f-b498-65f0a8f39f56","resolution":{"observed_at":"2026-08-06T18:56:58.303846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-06T14:48:46.738150Z","title":"Noisy Networks for Exploration , July 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.17668","last_updated":"2025-09-10T12:25:27Z","snapshot_observed_at":"2026-08-07T21:22:20.825272Z","submitted_at":"2025-07-23T16:31:38Z","title":"How Should We Meta-Learn Reinforcement Learning Algorithms?","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T14:48:46.738150Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2507.17668"},"observation_digest":"sha256:27f741486226bb9057b3079b90d4e30d8ac9f3c4e6d103c5c80095360304e2c0","observation_id":"23895565-0168-4277-9fd2-a917f64ddf2e","resolution":{"observed_at":"2026-08-06T14:48:46.738150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-06T14:16:40.345674Z","title":"Noisy networks for exploration,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.19629","last_updated":"2025-07-25T18:57:16Z","snapshot_observed_at":"2026-08-08T00:17:39.799905Z","submitted_at":"2025-07-25T18:57:16Z","title":"Quantum Reinforcement Learning by Adaptive Non-local Observables","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T14:16:40.345674Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2507.19629"},"observation_digest":"sha256:299dda7d96c54ea0ccf199e3d7044fea140107c7e427bde13c438be3c68b5c4d","observation_id":"deb7d5f6-07cb-48ba-9416-48da9ad0294e","resolution":{"observed_at":"2026-08-06T14:16:40.345674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T14:23:57.166990Z","title":"Fortunato, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.21488","last_updated":"2025-08-29T10:12:42Z","snapshot_observed_at":"2026-08-08T03:14:26.055701Z","submitted_at":"2025-08-29T10:12:42Z","title":"Priors Matter: Addressing Misspecification in Bayesian Deep Q-Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:23:57.166990Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2508.21488"},"observation_digest":"sha256:70110fddbebea9d36608496ee3f25b951e94e820742a2b4736cdb5dd063c9c51","observation_id":"45724b68-4f91-4a59-810f-a89d8ddfb0df","resolution":{"observed_at":"2026-08-05T14:23:57.166990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"2604.12667","last_updated":"2026-04-16T08:32:15Z","snapshot_observed_at":"2026-07-06T23:00:51.385974Z","submitted_at":"2026-04-14T12:38:21Z","title":"Safe reinforcement learning with online filtering for fatigue-predictive human-robot task planning and allocation in production","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T14:49:27.919651Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2604.12667"},"observation_digest":"sha256:1aac7ed881eeddcbfb70b4649cc31f3f152d80fda121e01a463192ae05d6c8d3","observation_id":"d31ce17f-ef44-4cc3-bf5f-f854154fa348","resolution":{"observed_at":"2026-05-10T14:50:30.101445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"2605.11697","last_updated":"2026-05-12T07:53:28Z","snapshot_observed_at":"2026-08-07T05:04:29.706221Z","submitted_at":"2026-05-12T07:53:28Z","title":"Rainbow Deep Q-Learning with Kinematics-Aware Design for Cooperative Delta and 3-RRS Parallel Robot Insertion","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-13T06:15:01.077535Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2605.11697"},"observation_digest":"sha256:20ae752bd3bfa2a5e75b32bcad34f9ea22ae93718fa202986be0dda24678e86e","observation_id":"e4b05b95-8161-4990-b82f-c979ad9278e4","resolution":{"observed_at":"2026-05-13T06:17:22.967392Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":"1706.10295","doi":"10.48550/arxiv.1706.10295","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Noisy networks for exploration","venue":"arXiv (Cornell University)","work_id":"1ef8f051-a1aa-4e02-9530-1db30ad6e0b4","year":2017},"citing_paper":{"arxiv_id":"2606.03113","last_updated":"2026-06-02T03:59:14Z","snapshot_observed_at":"2026-08-07T11:13:28.041469Z","submitted_at":"2026-06-02T03:59:14Z","title":"Experience-Driven Dynamic Exits for LLMs with Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T10:19:02.938980Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2606.03113"},"observation_digest":"sha256:28f9a30ad377c8b973ca16cc6210f7a363604fbab8d705a7c65ae100ac115bff","observation_id":"64801931-7d82-44b1-bd69-435cedcb3e3f","resolution":{"observed_at":"2026-07-02T03:06:30.320474Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-07-13T06:21:42.026251Z","title":"Fortunato and M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08837","last_updated":"2026-07-09T18:00:24Z","snapshot_observed_at":"2026-07-30T04:04:33.410734Z","submitted_at":"2026-07-09T18:00:24Z","title":"Prompt-Driven Exploration","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-13T06:21:42.026251Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2607.08837"},"observation_digest":"sha256:aa6a87252fb2cf464aefc26ceadaaaaed8ae99237e0fb811a1bd8ba9d89aa18a","observation_id":"e34cf7ee-603d-421c-9297-b979310a4181","resolution":{"observed_at":"2026-07-13T06:21:42.026251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-08-01T21:12:14.424294Z","title":"Fortunato, M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.16183","last_updated":"2026-07-17T17:57:49Z","snapshot_observed_at":"2026-08-03T17:36:07.986054Z","submitted_at":"2026-07-17T17:57:49Z","title":"A Blueprint for Equilibrium-Based Differentiable Continuous-Variable Thermodynamic Computing","version":1},"reference_index":119,"source":"pdf_text","source_observed_at":"2026-08-01T21:12:14.424294Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2607.16183"},"observation_digest":"sha256:1638e6a8702b5f04806b50f4add5b9bbf7e30defa50cbcc5c72edc668407220e","observation_id":"b9adc844-f472-4bab-b156-990cdf41d57a","resolution":{"observed_at":"2026-08-01T21:12:14.424294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for Exploration","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.10295","snapshot_observed_at":"2026-07-30T21:35:15.711196Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23469","last_updated":"2026-07-26T05:50:46Z","snapshot_observed_at":"2026-07-31T03:34:06.988306Z","submitted_at":"2026-07-26T05:50:46Z","title":"When Every Simulation Counts: Value-Based Reinforcement Learning for Accelerated Photonics Inverse Design","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T21:35:15.711196Z"},"links":{"cited_paper":"/paper/1706.10295","citing_paper":"/paper/2607.23469"},"observation_digest":"sha256:2b2b8c6d8a2e7b9471eede2edbf170ab32213b5c9b5a5093ada4b8d496d43242","observation_id":"9c431493-d693-40e3-9e3b-25e48f07fc02","resolution":{"observed_at":"2026-07-30T21:35:15.711196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1706.10295/citation-record","integrity":"/paper/1706.10295/integrity","json":"/paper/1706.10295/citation-record.json","paper":"/paper/1706.10295"},"outbound":[],"paper":{"arxiv_id":"1706.10295","last_updated":"2019-07-09T09:57:23Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T05:49:17.299252Z","submitted_at":"2017-06-30T17:56:19Z","title":"Noisy Networks for 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 17 inbound Pith citation observations for arXiv:1706.10295."}