{"as_of":"2026-08-09T11:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7848f6533b7b97428f3278b104b3dd32ffe5051448482230f621f7d7a7dd92e6","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T06:37:06.562214Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.21876/citation-record","integrity":"/paper/2607.21876/integrity","json":"/paper/2607.21876/citation-record.json","paper":"/paper/2607.21876"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.223565Z","title":"Q-learning,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.223565Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:3b465c085ab1ec7e47fdc9aaf8c795cb83f7c2c19a56b9e975637850f5dcecde","observation_id":"364cb31d-e2f0-46e0-9f2a-5d6a4c24dd1b","resolution":{"observed_at":"2026-08-01T06:37:06.223565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.319740Z","title":"QD-learning: A collaborative distributed strategy for multi-agent reinforcement learning through consensus + innovations,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.319740Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:4e999e53801f674b93ff0ab3f8215df979049effb351d5fdada9e8bd584fa654","observation_id":"2b7595d7-a1e4-4d5c-adec-72010cefbc01","resolution":{"observed_at":"2026-08-01T06:37:06.319740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.389659Z","title":"Fully decen- tralized multi-agent reinforcement learning with networked agents,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.389659Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:5267db92d81057335a27b6e7ed3e9393e1e7bf85273640437d5434ef764d77cb","observation_id":"f2a38a6f-91a1-4ee0-844a-52b11e5d327d","resolution":{"observed_at":"2026-08-01T06:37:06.389659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.395768Z","title":"Distributed off-policy actor-critic reinforcement learning with policy consensus,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.395768Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:2e7944852bc478690e320c22ba69598e1c4e37652a701a77d3e12fd765055400","observation_id":"8b4937c3-33de-4aa2-8131-2022f47eeba5","resolution":{"observed_at":"2026-08-01T06:37:06.395768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.404899Z","title":"Finite-time analysis of distributed TD (0) with linear function approximation on multi- agent reinforcement learning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.404899Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:3ec43e9e56bdf814f8cdfaf39a3c4761aabdfd978b68669e9fea0601d754fed4","observation_id":"54045625-4abe-4239-8255-f0649625d93c","resolution":{"observed_at":"2026-08-01T06:37:06.404899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.414302Z","title":"Finite-sample analysis of distributed q-learning for multi-agent networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.414302Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:ba7113b502efeeeaef5159dd2b36d6057adfcd236265f6d9657e80e9cfecffad","observation_id":"121c0001-aba4-494e-ae00-244319eeabba","resolution":{"observed_at":"2026-08-01T06:37:06.414302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.433768Z","title":"A finite-time analysis of distributed Q- Learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.433768Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:057dcce24c256c2d8cf03d66b659f580bb3624bdd73c4a6ca3dc99cbe3538b7d","observation_id":"eee3fe86-1ea7-4daf-be87-9f0d77183c7b","resolution":{"observed_at":"2026-08-01T06:37:06.433768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.445062Z","title":"Finite-time convergence rates of decentralized stochastic approximation with applications in multi-agent and multi-task learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.445062Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:174734a984e7558fcfbaa3d57dfe729ec500e524bc625329c764e6c5827ebcf6","observation_id":"98745f85-674a-40f2-8387-410c49443fdb","resolution":{"observed_at":"2026-08-01T06:37:06.445062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.456743Z","title":"Federated reinforcement learning: Linear speedup under Markovian sampling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.456743Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:9bd6c851cd5a866d37e4fb981ed46dfb230e5e2c06baf574508d12e642a6b232","observation_id":"014820b0-3445-4a60-810d-bbd9173529ec","resolution":{"observed_at":"2026-08-01T06:37:06.456743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.470700Z","title":"The blessing of heterogeneity in federated Q-learning: Linear speedup and beyond,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.470700Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:e602d13a9abcb18840e965935d2b9b91fee9e11158421517089c698707b7ea92","observation_id":"65aec993-d6c6-46b8-8e1e-5299178c5323","resolution":{"observed_at":"2026-08-01T06:37:06.470700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.02212","last_updated":"2024-07-01T14:07:58Z","snapshot_observed_at":"2026-07-06T14:48:25.973457Z","submitted_at":"2023-02-04T17:53:55Z","title":"Federated Temporal Difference Learning with Linear Function Approximation under Environmental Heterogeneity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.02212","snapshot_observed_at":"2026-08-01T06:37:06.478589Z","title":"Fed- erated temporal difference learning with linear function approximation under environmental heterogeneity,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.478589Z"},"links":{"cited_paper":"/paper/2302.02212","citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:966b33d1b7e5ad998a534fd5789b5f1f9106eab25ec95e642212b8fca1c0c6bc","observation_id":"2cae0d64-3db1-4760-bb3d-635b082d4cf8","resolution":{"observed_at":"2026-08-01T06:37:06.478589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06265","last_updated":"2019-06-24T17:09:55Z","snapshot_observed_at":"2026-07-06T07:53:15.177000Z","submitted_at":"2019-05-15T16:06:30Z","title":"Stochastic approximation with cone-contractive operators: Sharp $\\ell_\\infty$-bounds for $Q$-learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.06265","snapshot_observed_at":"2026-08-01T06:37:06.486395Z","title":"Stochastic approximation with cone-contractive operators: Sharpℓ ∞-bounds forQ-learning,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.486395Z"},"links":{"cited_paper":"/paper/1905.06265","citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:817a51bae474dc26e499a2558a51c6f03d73a8b381a6cce72bc6417e06f8bb48","observation_id":"10499641-dee2-4774-8b20-cd75bd59f596","resolution":{"observed_at":"2026-08-01T06:37:06.486395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.497436Z","title":"Finite-time analysis of asynchronous stochastic approximation and Q-learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.497436Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:f76d637dc1c23ed39a29f4394e68bbd8878e5667c3ca15345a6fb528ba66f12c","observation_id":"161bdcfe-7f7c-41e3-8dcf-95f2dceaa112","resolution":{"observed_at":"2026-08-01T06:37:06.497436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.504912Z","title":"Is Q-learning minimax optimal? a tight sample complexity analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.504912Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:486bfd7b9a9fe565ea435fb3da8e908bfa28cf0fe3f7251253c0a987aa4b8832","observation_id":"0f76ec8e-0f79-4292-b471-4ab57ac69d48","resolution":{"observed_at":"2026-08-01T06:37:06.504912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.510819Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.510819Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:31e04440cbbac49aed5a83b0a076cc29acde3728ba3eddadeeea9c701aa8d991","observation_id":"1ffea82b-1250-4fda-bca2-2f3ae5fe7b4b","resolution":{"observed_at":"2026-08-01T06:37:06.510819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.528957Z","title":"Finite-sample convergence rates for Q- learning and indirect algorithms,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.528957Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:f54d512a08570ce15dd7f27f3962b850ff70a42d8b387d28d4aa14ab5233376f","observation_id":"14d470a4-ad2f-452f-a964-94841bef1a45","resolution":{"observed_at":"2026-08-01T06:37:06.528957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.535030Z","title":"Near-optimal time and sample complexities for solving Markov decision processes with a generative model,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.535030Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:ec97df8c922bc13cbe534c0ef4c3cb38c61adceea2ec26a39fb7a3825805ae54","observation_id":"e0caff71-cb76-4246-8ec9-ad4b06d5c62b","resolution":{"observed_at":"2026-08-01T06:37:06.535030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.544387Z","title":"Asynchronous stochastic approximation and Q- learning,","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.544387Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:01899bf2e033ffb36eac68a47258b32e03c678091a1efdcb5f62ac3ea2b44b7d","observation_id":"7a135b4b-075a-47e6-8a7e-4712901c3751","resolution":{"observed_at":"2026-08-01T06:37:06.544387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.550135Z","title":"Achieving geometric conver- gence for distributed optimization over time-varying graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.550135Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:98b557096b04240b458f380edaa90c62fbbd85c3c1a30deebc16c5db2b36cdfa","observation_id":"28c7f9d6-4a4c-41af-8a6c-4ae7918ea907","resolution":{"observed_at":"2026-08-01T06:37:06.550135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.19244","last_updated":"2023-10-30T03:22:54Z","snapshot_observed_at":"2026-07-06T16:40:16.152421Z","submitted_at":"2023-10-30T03:22:54Z","title":"High-Dimensional Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.19244","snapshot_observed_at":"2026-08-01T06:37:06.555728Z","title":"High-dimensional statistics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.555728Z"},"links":{"cited_paper":"/paper/2310.19244","citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:82d4093d9873dd5e6d2af0eab9a1071dc0fbd570a7bb580bf2d1f9b54754cba1","observation_id":"806a3594-2d35-4efe-a117-f7a32443d8f9","resolution":{"observed_at":"2026-08-01T06:37:06.555728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T06:37:06.562214Z","title":"Lattimore and C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T06:37:06.562214Z"},"links":{"citing_paper":"/paper/2607.21876"},"observation_digest":"sha256:d0de28730183854c397e978f51f2553514b98a0580990d94af08da012b06242d","observation_id":"75451653-c788-44ea-a154-8a5240078d81","resolution":{"observed_at":"2026-08-01T06:37:06.562214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.21876","last_updated":"2026-07-24T00:24:09Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T10:58:20.310096Z","submitted_at":"2026-07-24T00:24:09Z","title":"Variance-Reduced Q-Learning over Static and Time-Varying Networks"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.21876."}