{"as_of":"2026-08-11T22:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74534b0404eabd8e56e74f50c4a56a7184babfeb00623a998ef62f61e00b4e14","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:04:02.046701Z","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-07-10T13:47:05.746965Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","snapshot_observed_at":"2026-08-11T01:57:52.861221Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.02672","snapshot_observed_at":"2026-08-10T23:04:02.046701Z","title":"Learning to communicate to solve riddles with deep distributed recurrent q-networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00165","last_updated":"2024-12-30T22:16:50Z","snapshot_observed_at":"2026-08-11T01:57:51.381842Z","submitted_at":"2024-12-30T22:16:50Z","title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T23:04:02.046701Z"},"links":{"cited_paper":"/paper/1602.02672","citing_paper":"/paper/2501.00165"},"observation_digest":"sha256:9f80568d5adc3d17c4b05168524861cf127e2b742d5b0b8c62896e74ce2727cc","observation_id":"5e4718cb-7f45-4e1f-8103-1c7b30f56219","resolution":{"observed_at":"2026-08-10T23:04:02.046701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","snapshot_observed_at":"2026-08-11T01:57:52.861221Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.02672","snapshot_observed_at":"2026-08-10T23:01:42.796855Z","title":", author Assael, Y.M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.00226","last_updated":"2025-07-16T04:59:12Z","snapshot_observed_at":"2026-08-10T22:53:46.213847Z","submitted_at":"2024-12-31T02:23:10Z","title":"Generative Emergent Communication: Large Language Model is a Collective World Model","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T23:01:42.796855Z"},"links":{"cited_paper":"/paper/1602.02672","citing_paper":"/paper/2501.00226"},"observation_digest":"sha256:3d32f6225f1a5af8b5499aeb0c72b38155386b88aed7f04b1de7ccbaaf3db2cf","observation_id":"f59dad1a-5d5f-4c46-8841-5616f2322f74","resolution":{"observed_at":"2026-08-10T23:01:42.796855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","snapshot_observed_at":"2026-08-11T01:57:52.861221Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","version":1},"cited_work":{"arxiv_id":"1602.02672","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.02672","snapshot_observed_at":"2026-07-10T13:47:05.746965Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-Networks","venue":"cs.AI","work_id":"ef42de73-f5e3-4349-9eb9-10c40f41ffaf","year":2016},"citing_paper":{"arxiv_id":"2607.08012","last_updated":"2026-07-09T00:38:42Z","snapshot_observed_at":"2026-08-09T23:47:24.866823Z","submitted_at":"2026-07-09T00:38:42Z","title":"Provably Optimal Learning Algorithms for Assistance Games","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-10T13:46:04.338440Z"},"links":{"cited_paper":"/paper/1602.02672","citing_paper":"/paper/2607.08012"},"observation_digest":"sha256:749b8d7cceeae3543df02c3a7d3ba8ef64c876ccc33d860fab975c9e37329b46","observation_id":"5bf1adff-5cc1-4763-9807-51157cea4c68","resolution":{"observed_at":"2026-07-10T13:47:05.748441Z","resolver_source":"local_arxiv","status":"verified_exact"},"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/1602.02672/citation-record","integrity":"/paper/1602.02672/integrity","json":"/paper/1602.02672/citation-record.json","paper":"/paper/1602.02672"},"outbound":[],"paper":{"arxiv_id":"1602.02672","last_updated":"2016-02-08T18:01:35Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T01:57:52.861221Z","submitted_at":"2016-02-08T18:01:35Z","title":"Learning to Communicate to Solve Riddles with Deep Distributed Recurrent Q-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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1602.02672."}