{"as_of":"2026-08-10T13:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed8aff51a58ee7a987419e9a8afe8f349d8e79c091b33cba5479ea9ed47458cd","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T06:02:19.127231Z","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-20T22:23:47.928099Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.01273","last_updated":"2022-04-04T06:47:20Z","snapshot_observed_at":"2026-07-06T12:56:14.589413Z","submitted_at":"2022-04-04T06:47:20Z","title":"FedSynth: Gradient Compression via Synthetic Data in Federated Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.01273","snapshot_observed_at":"2026-08-09T06:02:19.127231Z","title":"Fedsynth: Gradient compression via synthetic data in federated learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.03092","last_updated":"2025-02-05T11:31:21Z","snapshot_observed_at":"2026-08-09T05:54:20.763649Z","submitted_at":"2025-02-05T11:31:21Z","title":"E-3SFC: Communication-Efficient Federated Learning with Double-way Features Synthesizing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T06:02:19.127231Z"},"links":{"cited_paper":"/paper/2204.01273","citing_paper":"/paper/2502.03092"},"observation_digest":"sha256:e01a73e5a63beb6bb8c586b258a42a10984cbeaca6b61eaa1b000fda4df57a72","observation_id":"dcd43125-ed41-4abb-b73f-03b4c0a1ee62","resolution":{"observed_at":"2026-08-09T06:02:19.127231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01273","last_updated":"2022-04-04T06:47:20Z","snapshot_observed_at":"2026-07-06T12:56:14.589413Z","submitted_at":"2022-04-04T06:47:20Z","title":"FedSynth: Gradient Compression via Synthetic Data in Federated Learning","version":1},"cited_work":{"arxiv_id":"2204.01273","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.01273","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2204.01273 [cs.LG] https://arxiv.org/abs/2204.01273","venue":null,"work_id":"6933af31-0ed0-44b9-9952-3a940a81f02c","year":null},"citing_paper":{"arxiv_id":"2605.04569","last_updated":"2026-05-28T14:50:27Z","snapshot_observed_at":"2026-07-06T23:17:18.486586Z","submitted_at":"2026-05-06T07:15:29Z","title":"LIVEditor-14B: Lightning Unified Video Editing via In-Context Sparse Attention","version":1},"reference_index":296,"source":"arxiv_source","source_observed_at":"2026-05-08T16:38:20.057250Z"},"links":{"cited_paper":"/paper/2204.01273","citing_paper":"/paper/2605.04569"},"observation_digest":"sha256:b06b585b267a9ced7fe7757d6fdd1c925b7659f09e22129eb766627f4fa1187e","observation_id":"2f1ca169-8672-4604-b30c-6ccc85f0f0c8","resolution":{"observed_at":"2026-05-11T18:06:07.374936Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01273","last_updated":"2022-04-04T06:47:20Z","snapshot_observed_at":"2026-07-06T12:56:14.589413Z","submitted_at":"2022-04-04T06:47:20Z","title":"FedSynth: Gradient Compression via Synthetic Data in Federated Learning","version":1},"cited_work":{"arxiv_id":"2204.01273","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.01273","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2204.01273 [cs.LG] https://arxiv.org/abs/2204.01273","venue":null,"work_id":"6933af31-0ed0-44b9-9952-3a940a81f02c","year":null},"citing_paper":{"arxiv_id":"2605.09855","last_updated":"2026-05-18T00:37:30Z","snapshot_observed_at":"2026-08-02T19:02:34.129624Z","submitted_at":"2026-05-11T01:17:58Z","title":"Concordia: Self-Improving Synthetic Tables for Federated LLMs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T04:26:50.410397Z"},"links":{"cited_paper":"/paper/2204.01273","citing_paper":"/paper/2605.09855"},"observation_digest":"sha256:19553bd7bf9c762cfc80b9965b07281520f745a789d3c497bfa9e64aaa0de7ee","observation_id":"a3e558fc-4683-4251-9300-a3c67b557e59","resolution":{"observed_at":"2026-05-12T06:16:27.550207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01273","last_updated":"2022-04-04T06:47:20Z","snapshot_observed_at":"2026-07-06T12:56:14.589413Z","submitted_at":"2022-04-04T06:47:20Z","title":"FedSynth: Gradient Compression via Synthetic Data in Federated Learning","version":1},"cited_work":{"arxiv_id":"2204.01273","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2204.01273","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2204.01273 [cs.LG] https://arxiv.org/abs/2204.01273","venue":null,"work_id":"6933af31-0ed0-44b9-9952-3a940a81f02c","year":null},"citing_paper":{"arxiv_id":"2605.09855","last_updated":"2026-05-18T00:37:30Z","snapshot_observed_at":"2026-08-02T19:02:34.129624Z","submitted_at":"2026-05-11T01:17:58Z","title":"Concordia: Self-Improving Synthetic Tables for Federated LLMs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T22:21:03.637418Z"},"links":{"cited_paper":"/paper/2204.01273","citing_paper":"/paper/2605.09855"},"observation_digest":"sha256:c4cb6a39a55dedd62fa551f4d20718e18c59be8f487b250059fb593b7146db43","observation_id":"4b984567-082e-4009-bc8b-0c2391ee70d9","resolution":{"observed_at":"2026-05-20T22:23:47.932238Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.01273/citation-record","integrity":"/paper/2204.01273/integrity","json":"/paper/2204.01273/citation-record.json","paper":"/paper/2204.01273"},"outbound":[],"paper":{"arxiv_id":"2204.01273","last_updated":"2022-04-04T06:47:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:56:14.589413Z","submitted_at":"2022-04-04T06:47:20Z","title":"FedSynth: Gradient Compression via Synthetic Data in 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2204.01273."}