{"as_of":"2026-08-04T21:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30499c13182ebba1d6add98b1b0c9d1d1a21066efd6748f48f7cfecc710a7f07","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T01:47:40.772146Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T07:51:39.542688Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.18795","last_updated":"2025-03-10T00:01:21Z","snapshot_observed_at":"2026-07-06T18:21:48.356478Z","submitted_at":"2024-05-29T06:26:52Z","title":"Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost","version":2},"cited_work":{"arxiv_id":"2405.18795","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.18795","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Federated Q-learning with reference-advantage decomposition: Almost optimal regret and logarithmic communication cost","venue":null,"work_id":"e6590fad-fba6-47db-a6a3-f9e11c9a6387","year":2024},"citing_paper":{"arxiv_id":"2605.08378","last_updated":"2026-05-08T18:36:25Z","snapshot_observed_at":"2026-08-02T18:04:56.183678Z","submitted_at":"2026-05-08T18:36:25Z","title":"Reinforcement Learning for Scalable and Trustworthy Intelligent Systems","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-12T01:47:40.772146Z"},"links":{"cited_paper":"/paper/2405.18795","citing_paper":"/paper/2605.08378"},"observation_digest":"sha256:97404c778120374e7f823fa8da55d75d9f86ad1ca5e9616a78ca90db2c397fde","observation_id":"39873fed-7507-4cca-ab0d-011f73e453fe","resolution":{"observed_at":"2026-05-12T07:51:39.545699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.18795/citation-record","integrity":"/paper/2405.18795/integrity","json":"/paper/2405.18795/citation-record.json","paper":"/paper/2405.18795"},"outbound":[],"paper":{"arxiv_id":"2405.18795","last_updated":"2025-03-10T00:01:21Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T18:21:48.356478Z","submitted_at":"2024-05-29T06:26:52Z","title":"Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.18795."}