{"as_of":"2026-08-22T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e112846db9411c78f51f68a418554bbbdcd83f3f27120becc47c5977580e270","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T21:06:26.512697Z","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-23T22:35:50.938632Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","version":2},"cited_work":{"arxiv_id":"2302.10429","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.10429","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic regularized sharpness aware minimization in federated learning: Approaching global consistency and smooth landscape","venue":null,"work_id":"791b13c7-7e36-469b-819e-d0f40b225cd1","year":2023},"citing_paper":{"arxiv_id":"2408.15621","last_updated":"2026-05-13T04:49:50Z","snapshot_observed_at":"2026-08-17T20:36:17.804391Z","submitted_at":"2024-08-28T08:22:21Z","title":"Convergent Differential Privacy Analysis for General Federated Learning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T22:33:41.347488Z"},"links":{"cited_paper":"/paper/2302.10429","citing_paper":"/paper/2408.15621"},"observation_digest":"sha256:6c5f29e8cbcab6a8650c99af793e81c318579a36b4a12362c66f4cda25a73933","observation_id":"7209319c-8b32-4c22-826a-f1b96af19fa7","resolution":{"observed_at":"2026-05-23T22:35:50.945067Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","version":2},"cited_work":{"arxiv_id":"2302.10429","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.10429","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic regularized sharpness aware minimization in federated learning: Approaching global consistency and smooth landscape","venue":null,"work_id":"791b13c7-7e36-469b-819e-d0f40b225cd1","year":2023},"citing_paper":{"arxiv_id":"2409.18169","last_updated":"2026-04-23T18:48:49Z","snapshot_observed_at":"2026-08-14T15:55:00.676298Z","submitted_at":"2024-09-26T17:55:22Z","title":"Harmful Fine-tuning Attacks and Defenses for Large Language Models: A Survey","version":6},"reference_index":143,"source":"pdf_text","source_observed_at":"2026-05-23T20:58:16.237327Z"},"links":{"cited_paper":"/paper/2302.10429","citing_paper":"/paper/2409.18169"},"observation_digest":"sha256:848c779c3bede0cadb0bfb8e44fb25670af4dfbb97eaa50af9b36b6173dfc5f8","observation_id":"6b1100c1-b6c9-4e72-bcd0-e8fbf3f21ac5","resolution":{"observed_at":"2026-05-23T20:58:26.013456Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10429","snapshot_observed_at":"2026-08-04T21:06:26.512697Z","title":"Fedspeed: Larger local interval, less communication round, and higher generalization accuracy","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.08233","last_updated":"2025-09-10T02:19:56Z","snapshot_observed_at":"2026-08-14T20:31:36.327522Z","submitted_at":"2025-09-10T02:19:56Z","title":"Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization","version":1},"reference_index":203,"source":"arxiv_source","source_observed_at":"2026-08-04T21:06:26.512697Z"},"links":{"cited_paper":"/paper/2302.10429","citing_paper":"/paper/2509.08233"},"observation_digest":"sha256:37b3273caed9ff170473c13acad8361d4ea1926f43d19f94c13a29df06239178","observation_id":"7cac4194-21c2-4bac-a58a-ac872243d3fc","resolution":{"observed_at":"2026-08-04T21:06:26.512697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","version":2},"cited_work":{"arxiv_id":"2302.10429","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.10429","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic regularized sharpness aware minimization in federated learning: Approaching global consistency and smooth landscape","venue":null,"work_id":"791b13c7-7e36-469b-819e-d0f40b225cd1","year":2023},"citing_paper":{"arxiv_id":"2605.09144","last_updated":"2026-05-09T20:03:02Z","snapshot_observed_at":"2026-08-15T03:51:16.232926Z","submitted_at":"2026-05-09T20:03:02Z","title":"FedVSSAM: Mitigating Flatness Incompatibility in Sharpness-Aware Federated Learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-12T04:51:33.265354Z"},"links":{"cited_paper":"/paper/2302.10429","citing_paper":"/paper/2605.09144"},"observation_digest":"sha256:c32bf9d05d8cb0f45be7629490ca784d8629794bc4b7d99c46557201947fea0f","observation_id":"d628e2f7-3260-4759-a9ee-dc8bc887cae0","resolution":{"observed_at":"2026-05-12T05:51:26.591340Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10429","snapshot_observed_at":"2026-07-11T21:13:04.339445Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04170","last_updated":"2026-07-05T08:33:38Z","snapshot_observed_at":"2026-08-18T01:49:55.418123Z","submitted_at":"2026-07-05T08:33:38Z","title":"FedFFT: Taming Client Drift in Federated SAM via Spectral Perturbation Filtering","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T21:13:04.339445Z"},"links":{"cited_paper":"/paper/2302.10429","citing_paper":"/paper/2607.04170"},"observation_digest":"sha256:a05f3b614212f9da24e91436407ec633216def675878589650ca5995a084c03a","observation_id":"703d815c-fdc1-4e7f-b6eb-ba12c7eea736","resolution":{"observed_at":"2026-07-11T21:13:04.339445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.10429/citation-record","integrity":"/paper/2302.10429/integrity","json":"/paper/2302.10429/citation-record.json","paper":"/paper/2302.10429"},"outbound":[],"paper":{"arxiv_id":"2302.10429","last_updated":"2023-07-05T09:45:47Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:53:56.801256Z","submitted_at":"2023-02-21T03:55:29Z","title":"FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2302.10429."}