{"as_of":"2026-08-07T19:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:31b7d48f08f404a000d25bccd6c1bfab111fdb981b767edfd8349162547f76e0","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-07T06:34:17.273281+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-06T19:58:52.261714Z","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:c435d9f42131cc1962a811c1d55337cf13f19be81dde35633bde5b3a1eee9e53","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-06T19:58:52.261714Z","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:940b830053208f8e5e6578f35046722627ef8451b6291c95f6352c03b00b2f36","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-06T19:58:52.261714Z","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:72e2e149698b9b02daf03f0430e15e3ef0d61d5ef35b567d4993a64056b41c17","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-06T19:58:52.261714Z","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:844adbac4d6dec25aebf0cbbc239f64e9bd2f3f6f6893ff694cb3a6f6ae43841","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-06T19:58:52.261714Z","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:1ee6d4d73e126cd23d2336841930431c58d2c19b2ab45f0e0c851734270e82b6","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-06T19:58:52.261714Z","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:de31478a2bad2e29a66e4b84df6d1aa12e3eaf47ed3fb66903251e7a7f35ddbb","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-06T19:58:52.261714Z","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:89a889da5365e30b0380ea8231dccf52206365a08111e48061a1f76534ff2177","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-06T19:58:52.261714Z","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:55ce88f039012e988a178930d9de371a853a0177aebbc7e42a74c3e553ce9d05","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-06T19:58:52.261714Z","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:1c278f3c5a785ef24f37615348da58056ca81d1184499d165ec059e87eec3ff1","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-06T19:58:52.261714Z","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:20c530afaefc437ef5011afd4f5922c5ae748afbf490d9aee0cccb733c97a1ba","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-06T19:58:52.261714Z","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:018d0aac0c867886e4fdb93aff8c438fb784a729c45b8b05a0bc974b40648104","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-06T19:58:52.261714Z","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:9868a5cdae9e538d22c86912b550a6e38f77246aca1357b58da4f47ee36be2a4","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-06T19:58:52.261714Z","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:fff15615d47290a1c3477dbd3a7fdca887cb141346a6966130f70b95fceeae99","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-06T19:58:52.261714Z","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:a2ec921e891cadd70c7f3e190cf504ab98b6988073d79765524e7cbe81b6d9ae","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-06T19:58:52.261714Z","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:20f946dfdbfbee92e218ff5bf6949afeed4dffd83c23dafac7e2a92d0cd30303","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-06T19:58:52.261714Z","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:1055d87f2bb4950aa22394a5d95e8681ce4b230fa07bcd69d265a5106c04414c","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-06T19:58:52.261714Z","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:66dc50095530e08820c4f4a816c7230858158c6b34896959b1a80797b319ec17","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-06T19:58:52.261714Z","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:ba6d02afc58a9fef8c8953145ac7f7cb24c10a62ad3c9e68cb6a35cd16cca9c2","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-06T19:58:52.261714Z","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:675d37c9006f56de14d7f75c000ca71d93730edad5e5df8c90c1b233c5637197","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-06T19:58:52.261714Z","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:b197dcc0f6106e3c4f5916182c98edaedf105f02c7d5cf435b16ddb978d39c24","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-06T19:58:52.261714Z","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:f097d71cf0db18893e692a4de6a758c9d52575b9f9754c62cd17a8a9d35ddc54","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-06T19:58:52.261714Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.21876."}