{"as_of":"2026-08-09T08:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:228699b767da82eac42edb1416e72267915feac38e4727f06edaf441ca218b91","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:31:42.014659Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-08-06T15:11:16.206100Z","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-06T15:11:16.310416Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"cited_work":{"arxiv_id":"2506.10607","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10607","snapshot_observed_at":"2026-08-06T15:11:16.310416Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","venue":"cs.DC","work_id":"f4bc655b-f16b-46a9-996d-7c7e195d3a05","year":2025},"citing_paper":{"arxiv_id":"2507.16541","last_updated":"2025-07-22T12:49:24Z","snapshot_observed_at":"2026-08-07T22:03:21.200055Z","submitted_at":"2025-07-22T12:49:24Z","title":"A Comprehensive Data-centric Overview of Federated Graph Learning","version":1},"reference_index":219,"source":"pdf_text","source_observed_at":"2026-08-06T15:11:16.206100Z"},"links":{"cited_paper":"/paper/2506.10607","citing_paper":"/paper/2507.16541"},"observation_digest":"sha256:475fc5e43340d2c0ea7dd9daf6ae578650822927fbc386ed62b7e32c5a809d68","observation_id":"80b6c32d-c89a-4475-92ea-7ec7f4d74237","resolution":{"observed_at":"2026-08-06T15:11:16.315530Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10607/citation-record","integrity":"/paper/2506.10607/integrity","json":"/paper/2506.10607/citation-record.json","paper":"/paper/2506.10607"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.290871Z","title":"Decentralized directed collaboration for personalized federated learning,","venue":null,"work_id":"6168dd35-0702-4d37-91e4-acd143f5d05a","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.925088Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:f79f09a0a72ded49ecf6df38bf81ffa4840eb2378f47e3b321b5df4710a5cdf2","observation_id":"e857c8b6-78b9-4b6a-902f-9ed403d9cbbf","resolution":{"observed_at":"2026-08-07T04:31:42.293746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.282306Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":"2715ad4a-e1e8-46df-a229-911be310cc85","year":2017},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.928703Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:d64f4cb56e26291c99acc320c204b82d13c9ba15dc7a12532794d155064172ee","observation_id":"83abf68e-853d-4563-91c1-39728e3c8f2e","resolution":{"observed_at":"2026-08-07T04:31:42.285167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.931818Z","title":"Federated learning: Challenges, methods, and future directions,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.931818Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:156fb05ac8cf42525881cbeac2814132770cc6d68cd75710ff86dc7f8e714c96","observation_id":"7b6571df-3c3d-421c-86e4-d6ef00ece3a2","resolution":{"observed_at":"2026-08-07T04:31:41.931818Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.267999Z","title":"Fedstellar: A platform for decentralized federated learning,","venue":null,"work_id":"5c5d3b9d-6ede-4302-88ec-0ac61c94799b","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.934871Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:ca017b13248192bceab47c17270e674136631ffa8be21ebe28f5af530c1f6269","observation_id":"c2e6f45e-f209-499f-9177-007c99173047","resolution":{"observed_at":"2026-08-07T04:31:42.271258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.938497Z","title":"Advances and open problems in federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.938497Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:d543181af5fa4fd02511ec0a988f2e74692db1bc90128d31d27576373f264a2a","observation_id":"68847556-4c87-4ba7-8c58-43472657ac04","resolution":{"observed_at":"2026-08-07T04:31:41.938497Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.254242Z","title":"Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,","venue":null,"work_id":"5c232a6a-63ee-482e-8b3a-80199052adc1","year":2017},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.941657Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:5177526ade916e2a34b486aa65125a9962f8a069af6931725f31757763bac973","observation_id":"9092e18c-5b75-4490-afdc-bb35e8d13bed","resolution":{"observed_at":"2026-08-07T04:31:42.257155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.945132Z","title":"When federated learning meets blockchain: A new distributed learning paradigm,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.945132Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:7aeecec4bedfb96efeae6a7e743c324a431b0a56bd959c5abc5f814bb58e10f8","observation_id":"4335492b-3589-450d-a131-0f6b3ea046eb","resolution":{"observed_at":"2026-08-07T04:31:41.945132Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.240047Z","title":"Blockchain- empowered decentralized horizontal federated learning for 5g-enabled uavs,","venue":null,"work_id":"14773d15-a24e-4576-80f1-a4a5bab85319","year":2021},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.947896Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:4a7178bc574734d104840b6d2c3d94d8a4e8c6a7feca9277a1e4960325bd5f62","observation_id":"eef53039-eda8-43aa-a684-feb0221fb107","resolution":{"observed_at":"2026-08-07T04:31:42.242975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.950714Z","title":"A survey on scalable lorawan for massive iot: Recent advances, potentials, and challenges,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.950714Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:92338e358c5248af2c61a0074b9ed4985123c3793574625facabb30d5a7a7bbb","observation_id":"93a263a1-a9ba-4eec-914b-836d4c9c7826","resolution":{"observed_at":"2026-08-07T04:31:41.950714Z","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-07T04:31:41.953592Z","title":"Decentralized federated learning: Fundamentals, state of the art, frameworks, trends, and challenges,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.953592Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:e57f5b896f66a436d4d0fc3414999669b37f463a6ae75b1926ccd437c82699c9","observation_id":"335dd96b-048a-42fe-9a9b-9cf1a36cfb49","resolution":{"observed_at":"2026-08-07T04:31:41.953592Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.221026Z","title":"Decentralized opti- mization over noisy, rate-constrained networks: Achieving consensus by communicating differences,","venue":null,"work_id":"54b5f806-ecb0-4003-bb55-3389bb530ab4","year":2021},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.956229Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:e8322d174505487d92fd59dec343263d374412a3dcf1320cc31086f29110fd42","observation_id":"8a38019a-10e7-408c-88c0-a5aa17e3d838","resolution":{"observed_at":"2026-08-07T04:31:42.223844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.211260Z","title":"Quantized decentralized stochastic learning over directed graphs,","venue":null,"work_id":"7b8ba6e8-d72b-444b-9edd-de8b205258ac","year":2020},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.958729Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:0d867e50793b819651e5d35b849bcfb18199adfa69c91f0cd95b6fbd8778986b","observation_id":"527572b7-684a-4434-9b44-f50ae1ecd077","resolution":{"observed_at":"2026-08-07T04:31:42.214647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.202127Z","title":"On the benefits of multiple gossip steps in communication-constrained decentralized federated learning,","venue":null,"work_id":"901d57da-1324-4c39-a4b5-596753b1fac8","year":2021},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.961911Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:6e2a7f7ce71f573e420b3db9bf6f612abe0d73d9f422d39247b6e262800cd3b0","observation_id":"75e92ca7-ca7d-48b6-ac12-92fea3f10682","resolution":{"observed_at":"2026-08-07T04:31:42.205144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.193174Z","title":"Gossipfl: A decentralized federated learning framework with sparsified and adaptive communication,","venue":null,"work_id":"f77334f6-b738-437f-b0a2-fda267b4d0b7","year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.964481Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:ba1acb193866896124bd75497b7e5559051bf50050cfac33b06a66aa9ef37484","observation_id":"11cc3eb6-d40e-4765-a1b8-cce0b2e0de07","resolution":{"observed_at":"2026-08-07T04:31:42.196492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.184048Z","title":"Wait or not to wait: Evaluating trade-offs between speed and precision in blockchain- based federated aggregation,","venue":null,"work_id":"d86c5924-248b-4d06-a887-db2b097029e2","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.967216Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:1f50a08bc09f83b0c91df7ecdfcc0cd1681e2e3b76d37ad07fe7d893324170fa","observation_id":"d178eb22-2e21-46d6-81fb-b070dce0ab9b","resolution":{"observed_at":"2026-08-07T04:31:42.187112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.175617Z","title":"Tram-fl: Routing-based model training for decentralized federated learning,","venue":null,"work_id":"0e46a91c-047a-4465-b196-af49cda7ebd7","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.969743Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:e42a31d76ebc285d6058946683c6e9f720843e3ea61762c9a348001fac73c5ee","observation_id":"8f493e54-201d-4ecf-92b5-152b9400c9a0","resolution":{"observed_at":"2026-08-07T04:31:42.178464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.166908Z","title":"Peer-to-peer mem- bership management for gossip-based protocols,","venue":null,"work_id":"09c3c361-85ce-421f-9858-d12aba896dc8","year":2003},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.972577Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:69395aa0395354c2439dab01e753ed77ede6ee47d49e4a100e7cc16a27842eff","observation_id":"7b8f5d97-02de-4a2b-9fe1-c9e002f0e8e0","resolution":{"observed_at":"2026-08-07T04:31:42.169856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.975020Z","title":"Decentralized federated learning: Balancing communication and computing costs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.975020Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:b8c565b247d94894d6dfe18c94bb6a82ee371bd0e8c391e47cdd1173adcd9210","observation_id":"ea036dd2-533c-4b34-b009-267b25dd26ba","resolution":{"observed_at":"2026-08-07T04:31:41.975020Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.152127Z","title":"Cross-silo federated learning for multi-tier networks with vertical and horizontal data par- titioning,","venue":null,"work_id":"6a280d77-707d-42c8-a6e6-f4b12e32fc5c","year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.978417Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:4b5d4b9017f067afe133733f7d597d3170a1458e27faaa3054bbfa020d0a045b","observation_id":"f491477b-7dc6-4051-bc7c-183d3718fbb4","resolution":{"observed_at":"2026-08-07T04:31:42.155421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.142270Z","title":"Intelligent neighbor selection for efficient query routing in unstructured p2p networks using q-learning,","venue":null,"work_id":"811ef2f1-22bf-4944-adb9-2dc1719df910","year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.981130Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:b89fea5c4b06972cf3f5340aa11be74b085f7bf9c846ddc48788b52e5d95ea25","observation_id":"2493bcea-eefe-4f88-8be2-7c9d855467e4","resolution":{"observed_at":"2026-08-07T04:31:42.146273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.128788Z","title":"Deep reinforcement learning based transmission policy enforcement and multi-hop routing in qos aware lora iot networks,","venue":null,"work_id":"ec812d25-2620-4203-9654-17b84e27c576","year":2022},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.984039Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:801d4e2530bd7cbffed4f0912dc06eab2735042ded7bce3802dd467123549d7a","observation_id":"7ff010a7-dca8-4b67-8198-f072b92f6ee8","resolution":{"observed_at":"2026-08-07T04:31:42.135955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.119723Z","title":"Sparsfa: Towards robust and communication-efficient peer-to-peer fed- erated learning,","venue":null,"work_id":"981a942c-a589-420a-a190-67cfd1661036","year":2023},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.986473Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:acf757ef7ce570b1af9ac89f451c7fe55ec29797a43bac3cb6a96dd06de5151c","observation_id":"b8a63f68-17d8-4b34-bbc3-a8ca2c2375c0","resolution":{"observed_at":"2026-08-07T04:31:42.122893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.07782","last_updated":"2019-08-21T10:21:43Z","snapshot_observed_at":"2026-07-06T08:15:50.182975Z","submitted_at":"2019-08-21T10:21:43Z","title":"Decentralized Federated Learning: A Segmented Gossip Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.07782","snapshot_observed_at":"2026-08-07T04:31:41.989086Z","title":"Decentralized federated learning: A segmented gossip approach,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.989086Z"},"links":{"cited_paper":"/paper/1908.07782","citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:7fa2fbf371f491329764a678190a562ca3abe82f3ba231e017e12c0c69ba22d9","observation_id":"1c7b5847-2ef5-4dc1-b02b-59751658d22c","resolution":{"observed_at":"2026-08-07T04:31:41.989086Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.109285Z","title":"Beyond exponential graph: Communication-efficient topologies for decentralized learning via finite-time convergence,","venue":null,"work_id":"e51e9412-8ea9-48e3-b981-d611b3ba59b1","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.992564Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:e7897384121bdb9f2bdc15a6c2e276a4f1a354d9f60f42f8df782505ac38488d","observation_id":"d61313ee-3739-4c86-8e00-dd295e958985","resolution":{"observed_at":"2026-08-07T04:31:42.112398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.099230Z","title":"Reliable federated learning based on dual-reputation reverse auction mechanism in internet of things,","venue":null,"work_id":"a9c081b4-acc6-47e8-9099-80af38d26c75","year":2024},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.995085Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:4ccabc7c165efdb9dfeefb80fe3d2ca1d2e04a6d6ed482a7a45cf3cf4a80d0a9","observation_id":"9f1a5438-5450-4f09-adbd-97f725932ff0","resolution":{"observed_at":"2026-08-07T04:31:42.102805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:41.997900Z","title":"On the shortest spanning subtree of a graph and the traveling salesman problem,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:41.997900Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:ca0f2ad6575b20df16224668f653f0b4d80dadedbf43046faa4f0f7207a19443","observation_id":"bdab7e0b-a284-40e3-bfa5-3a0008be0a86","resolution":{"observed_at":"2026-08-07T04:31:41.997900Z","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-07T04:31:42.000343Z","title":"Shortest connection networks and some generalizations,","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.000343Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:a00e16b36882bc148b02c5e22e39d07749f59db7eadc1d51ff087ed60065bf70","observation_id":"6e036de0-f65e-4152-aac4-1bf42cc233c0","resolution":{"observed_at":"2026-08-07T04:31:42.000343Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.080220Z","title":"O jist ´em probl ´emu minim ´aln´ım,","venue":null,"work_id":"239f69ba-8732-4965-8319-1df725e70c91","year":1926},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.002870Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:76e88c0aba6242f26154ebf35793c52d71f8e28fd4b0a473786b950f4eea0888","observation_id":"0cec67ab-91a9-4c22-af33-52e01016a39d","resolution":{"observed_at":"2026-08-07T04:31:42.082938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.071574Z","title":"On random graphs i,","venue":null,"work_id":"8171c86d-1305-4f3d-b51b-664b316160af","year":1959},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.006001Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:ae1ee29fababadcc380128bbd1f8b5dfaf4131657dbcceaec97772b33c95d9eb","observation_id":"564cd108-7f01-4f26-a1ce-53a1098faa62","resolution":{"observed_at":"2026-08-07T04:31:42.074561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.008780Z","title":"Collective dynamics of ‘small- world’networks,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.008780Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:d889293e5181e8a1a9dc4e23c36e4896901c6129d61400caef5dc8f29cd668e4","observation_id":"a0294b01-4d40-4c78-a45e-8a09ca5b1c8d","resolution":{"observed_at":"2026-08-07T04:31:42.008780Z","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-07T04:31:42.011888Z","title":"Emergence of scaling in random net- works,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.011888Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:285bb291856b822b35514780359f0456130ab1af408fb5fb808f9636c4e113d9","observation_id":"1457f644-cfa3-4ba8-8af8-ce309eeb77d7","resolution":{"observed_at":"2026-08-07T04:31:42.011888Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:31:42.049248Z","title":"Flooding in wireless ad hoc networks,","venue":null,"work_id":"c0274ce1-22f9-48cc-8ab0-00d8b3cde166","year":2001},"citing_paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:31:42.014659Z"},"links":{"citing_paper":"/paper/2506.10607"},"observation_digest":"sha256:dda23100734f3bb8fd4c513b15646051f9eeb4bec3b5b3c9d8b7eb7eec405b1c","observation_id":"06f772ec-37d9-4b77-84a8-76b45f6a99dc","resolution":{"observed_at":"2026-08-07T04:31:42.053120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10607","last_updated":"2025-06-12T11:51:32Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T04:19:39.317139Z","submitted_at":"2025-06-12T11:51:32Z","title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":32},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 1 inbound Pith citation observation for arXiv:2506.10607."}