{"as_of":"2026-08-11T17:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b2b2e9e7f4e53b8e07bfe65e50e1eb4055cea453a73cf466450af17a3f9f1ba5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:58:04.002891Z","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-08-08T21:19:39.503670Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.10386","last_updated":"2020-05-01T11:42:33Z","snapshot_observed_at":"2026-08-09T23:32:45.204213Z","submitted_at":"2020-04-22T03:41:06Z","title":"Hierarchically Fair Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.10386","snapshot_observed_at":"2026-08-10T18:58:04.002891Z","title":"Hierarchically fair federated learning","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.10877","last_updated":"2025-01-18T20:59:07Z","snapshot_observed_at":"2026-08-10T18:50:18.867929Z","submitted_at":"2025-01-18T20:59:07Z","title":"Distributed Quasi-Newton Method for Fair and Fast Federated Learning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T18:58:04.002891Z"},"links":{"cited_paper":"/paper/2004.10386","citing_paper":"/paper/2501.10877"},"observation_digest":"sha256:79624b7da7f08a6c5a7b75184b250b57c243147e520ea917092da4b3c8a4d90c","observation_id":"e01b39bb-ff2b-4e81-8365-c608723581f0","resolution":{"observed_at":"2026-08-10T18:58:04.002891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.10386","last_updated":"2020-05-01T11:42:33Z","snapshot_observed_at":"2026-08-09T23:32:45.204213Z","submitted_at":"2020-04-22T03:41:06Z","title":"Hierarchically Fair Federated Learning","version":2},"cited_work":{"arxiv_id":"2004.10386","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.10386","snapshot_observed_at":"2026-08-08T21:19:39.503670Z","title":"Hierarchically Fair Federated Learning","venue":"cs.LG","work_id":"b5a4f7b1-0667-4c19-8233-3eede91eeaab","year":2020},"citing_paper":{"arxiv_id":"2502.04850","last_updated":"2025-07-13T02:51:38Z","snapshot_observed_at":"2026-08-11T02:21:37.596678Z","submitted_at":"2025-02-07T11:39:27Z","title":"Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-08T21:19:39.441837Z"},"links":{"cited_paper":"/paper/2004.10386","citing_paper":"/paper/2502.04850"},"observation_digest":"sha256:aa8b546c0d16e4524975624bee999473bb4b0cef0be33638c494e5474dc3e38a","observation_id":"fa797e2c-b888-464e-8a60-6770a61949c6","resolution":{"observed_at":"2026-08-08T21:19:39.510112Z","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/2004.10386/citation-record","integrity":"/paper/2004.10386/integrity","json":"/paper/2004.10386/citation-record.json","paper":"/paper/2004.10386"},"outbound":[],"paper":{"arxiv_id":"2004.10386","last_updated":"2020-05-01T11:42:33Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T23:32:45.204213Z","submitted_at":"2020-04-22T03:41:06Z","title":"Hierarchically Fair Federated Learning"},"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 2 inbound Pith citation observations for arXiv:2004.10386."}