{"as_of":"2026-08-10T11:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:980c24a39ea30ca90b5a329d298b2056ba2b579e41cb38ae264510c5558732d8","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T20:45:35.221060Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.08409/citation-record","integrity":"/paper/2509.08409/integrity","json":"/paper/2509.08409/citation-record.json","paper":"/paper/2509.08409"},"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-04T20:45:38.249023Z","title":"A review of recommender systems based on knowledge graph embedding,","venue":null,"work_id":"7190ff2b-4f86-4357-b4e2-27417f47cee3","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.244315Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:e441d7695e27c021fe457e53b3cb859cdea13d820b310fb0763b7e56cc801eaa","observation_id":"375f127f-2f1c-4355-be1b-75f69963f447","resolution":{"observed_at":"2026-08-04T20:45:38.253068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.238685Z","title":"Predicting social anxiety disorder based on communication logs and social network data from a massively multiplayer online game: Using a graph neural network,","venue":null,"work_id":"14235dcf-75fb-4d1f-a793-eb55d7452750","year":2025},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.362349Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:b4c65fe65419636c77a751ea11999bc551a6118a3ae1c077b1891e9f1a28a0cb","observation_id":"3e8728f7-5f69-4c01-b5d3-6ec9843558b1","resolution":{"observed_at":"2026-08-04T20:45:38.242127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.228479Z","title":"Pain-fl: Personalized privacy-preserving incentive for federated learning,","venue":null,"work_id":"ec2c8023-3550-4908-93a1-a7c226333455","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.431898Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:7485f46787af6c3d47c3eb57c14e61921cac9aee74d8d3f05310b38c2d09352c","observation_id":"9cec4b5b-36c1-4d7c-a3c1-0a92b25a9443","resolution":{"observed_at":"2026-08-04T20:45:38.231835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.216020Z","title":"Optimizing e-commerce recommender systems: A comprehen- sive review of techniques and future directions,","venue":null,"work_id":"6a9cfe35-7a37-4553-a723-c848be7eecc8","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.550027Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:27226cc532515872f43627607a93e7bc938b63394fb64cecfa8ddab43df4a96d","observation_id":"0d2dc0cb-8b92-47b2-b8f9-16400e947fbe","resolution":{"observed_at":"2026-08-04T20:45:38.220770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-04T20:45:29.617142Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.617142Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:646f81b50c5b0a2a9978141be7eef1e674e161a33b63c27f1e5842ff7db672d5","observation_id":"6816c168-a8e4-4299-b382-acf6b5d6b850","resolution":{"observed_at":"2026-08-04T20:45:29.617142Z","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-04T20:45:38.205173Z","title":"Inductive representation learn- ing on large graphs,","venue":null,"work_id":"7db95f6b-3c93-41eb-8f32-306fe13e0509","year":2017},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.716963Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:7bd13e31773d1388a2e7ed48b4c4b942909e24c6f7d1437b333dbe796f4c30bd","observation_id":"4813538b-c9aa-4761-b2e1-b4ac6f634745","resolution":{"observed_at":"2026-08-04T20:45:38.208833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.193704Z","title":"Phase space graph convolutional net- work for chaotic time series learning,","venue":null,"work_id":"8ee95040-6e12-4f07-b215-2938fa921a6c","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.784775Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:a72e26da5258216dd9ddf8b38c887842df6bc0e3053a1eba05e3d3392ac9c761","observation_id":"1e2af7ac-34e6-4e4f-adfc-341ebc59617a","resolution":{"observed_at":"2026-08-04T20:45:38.197977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.181074Z","title":"Keystrokesniffer: An off-the-shelf smartphone can eavesdrop on your privacy from anywhere,","venue":null,"work_id":"61bd5818-e1cc-405b-a4d6-6cac4132eeb2","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.860716Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:0f335cfabc9586d9171b52f5cd453695268e8e30dec6dd075ad3538e366ec092","observation_id":"29904151-6d11-4c4a-8544-d3991a7c81a9","resolution":{"observed_at":"2026-08-04T20:45:38.185209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.169641Z","title":"Adaptive local update and neural composition for accelerating federated learning in heterogeneous edge networks,","venue":null,"work_id":"1d85c5ad-ea5a-487e-9a03-f2948559cd3f","year":2025},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:29.957616Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:78903fd631a1c0a0f17631d063ef578abf87b6d51052efe88b4e2e0ecfb68435","observation_id":"96d830aa-2c84-4cda-bd0b-4a2a2109413b","resolution":{"observed_at":"2026-08-04T20:45:38.173107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.158661Z","title":"Federated graph classification over non-iid graphs,","venue":null,"work_id":"31616440-d6bf-4699-b512-351e1cc9820f","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.056334Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:66a1593f511a18b3f79ec6db43aaf11a255f249b2029f0ca27ac8779bbf0b8df","observation_id":"f2658448-11d2-4de3-bf08-9861f8dce997","resolution":{"observed_at":"2026-08-04T20:45:38.162616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.147031Z","title":"Subgraph federated learning with missing neighbor generation,","venue":null,"work_id":"528bef3d-127a-4407-b5cf-09bc948ba867","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.149770Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:67efe6549daefe96de4195a863e79c826d9f68c81a34b1a62e2b0b2219bb66d2","observation_id":"e11446aa-cecd-4917-b1d5-f62f4d288d94","resolution":{"observed_at":"2026-08-04T20:45:38.150903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.135019Z","title":"Finch: Enhancing federated learning with hierarchical neural architecture search,","venue":null,"work_id":"cbac3475-e466-45f9-81f4-ec2f2d1fd17f","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.254004Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f367dcab9cc779f14b3c19e9cdfd3d371c094b86f42bf589cc86c58980b3bbb8","observation_id":"de42cb09-2ced-4bfe-a7b7-ed980102fa65","resolution":{"observed_at":"2026-08-04T20:45:38.139186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.123083Z","title":"Enhancing semi-supervised federated learning with progressive training in heteroge- neous edge computing,","venue":null,"work_id":"77123c85-8212-42ad-b0a7-db7e34203401","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.324206Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:249e4daf08fb0390304eec4fba290ff9c4fcd6f4b6a3269e43c3eb27eed40be1","observation_id":"7e87496f-2cb6-4a89-bac8-9a2c0a54e270","resolution":{"observed_at":"2026-08-04T20:45:38.126831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.111736Z","title":"Decen- tralized federated graph neural networks,","venue":null,"work_id":"64f1ac98-7c8e-4a78-a82b-5cacb77c75c5","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.444430Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:b4c51d87124f3580e0f303dfe5d4ea679b21490c9bb6438422344460536b7d84","observation_id":"4b2cbea5-2a09-4104-b3d7-fc8f8c83333e","resolution":{"observed_at":"2026-08-04T20:45:38.115272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.099644Z","title":"Glint: Decentralized federated graph learning with traffic throttling and flow scheduling,","venue":null,"work_id":"b8b88578-5685-44ff-a1fb-9b92702849fa","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.546681Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:58c84859f52ee48319ad5ebee3387060b6f884ac57763a0942b55c754298db90","observation_id":"de1744d0-18ca-406f-864b-310b1b56d585","resolution":{"observed_at":"2026-08-04T20:45:38.103784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.088216Z","title":"Acceler- ating decentralized federated learning with probabilistic communication in heterogeneous edge computing,","venue":null,"work_id":"bc59d95d-6ed0-4792-97b4-60cefcbc2112","year":2025},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.649718Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:65d9f66af443a8d22e7862a7e00a78148543026ffd915628d502d23db49c835f","observation_id":"13eb5ca7-73e5-4b48-9ac5-9b5cfa00dc63","resolution":{"observed_at":"2026-08-04T20:45:38.091748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.077186Z","title":"S-glint: Secure federated graph learning with traffic throttling and flow scheduling,","venue":null,"work_id":"19398e5d-6e54-49fb-a08a-71e3cd60e65a","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.713279Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:224f90b20ac324272e40aa6e381cbcbd8f145922338907aeee178bff1cae252f","observation_id":"02e7581c-ee5f-4307-81b1-f180c645860a","resolution":{"observed_at":"2026-08-04T20:45:38.080700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:30.771060Z","title":"Open graph benchmark: Datasets for machine learning on graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.771060Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f2e85fa6e8c135506959240c96b1df2769e047f0cf5b4cd87cec31b8eb7d4b8e","observation_id":"ccd64539-4020-483b-be7d-8334abd89f28","resolution":{"observed_at":"2026-08-04T20:45:30.771060Z","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-04T20:45:38.058352Z","title":"Accelerating federated learning via parameter selection and pre-synchronization in mobile edge- cloud networks,","venue":null,"work_id":"d3e916bf-09e9-4955-8d13-87bb46dd9e52","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:30.873769Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:583020970101769e0ffa965f26f9c4310b73d156454e06d79b493f016554c5da","observation_id":"73cad19b-df29-429c-a542-ccc03475d834","resolution":{"observed_at":"2026-08-04T20:45:38.061687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1706.02677","last_updated":"2018-04-30T21:53:41Z","snapshot_observed_at":"2026-08-09T05:23:26.365677Z","submitted_at":"2017-06-08T16:51:53Z","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02677","snapshot_observed_at":"2026-08-04T20:45:31.007746Z","title":"Accurate, large minibatch sgd: Training imagenet in 1 hour,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.007746Z"},"links":{"cited_paper":"/paper/1706.02677","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:7869c55a823bfc4a31992bc57133ccd9632cc8a60ad173fc8f10de53c0de43a0","observation_id":"56e551a4-dff9-4113-9f20-4563cc2e19a9","resolution":{"observed_at":"2026-08-04T20:45:31.007746Z","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-04T20:45:38.047874Z","title":"Fedgraph: Federated graph learning with intelligent sampling,","venue":null,"work_id":"5e3de2df-a346-4353-9d2e-984d23c34925","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.103922Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:093bb4407e5f1a3bac85700e0d3d9f93bb7e988b3fac7acbdb52268e4a32356e","observation_id":"175777dd-8d29-479a-8fd5-48e3dafdd384","resolution":{"observed_at":"2026-08-04T20:45:38.051119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.037765Z","title":"Federated graph learning with periodic neighbour sampling,","venue":null,"work_id":"26a9afcc-0be9-4fd6-a55f-a98e45d8d3ae","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.207853Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:5b472f9babf06be2baa38bc5a5b3d1fb8ed58aa6fd9076729a1d9780de153ce8","observation_id":"141c94eb-95b8-474e-a92d-b7c2c5bd90db","resolution":{"observed_at":"2026-08-04T20:45:38.041046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.027617Z","title":"Historical embedding-guided efficient large-scale federated graph learning,","venue":null,"work_id":"b7b85077-f364-4ab6-a36b-70b91363b41e","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.277600Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:ab7f3aaf663bb5570a7aa23177fb0727911ed252f18cad42a1aa58108c87ac33","observation_id":"673c2dab-6a53-46a5-9b9b-0993ff19c72d","resolution":{"observed_at":"2026-08-04T20:45:38.030986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.016918Z","title":"Accelerating de- centralized federated learning in heterogeneous edge computing,","venue":null,"work_id":"4548b70d-3773-4d62-8855-8a260d74ea00","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.381419Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:9ca6c38f67306867faa0fa162253c6810bec15c6d2611e7f2678eac7c1db5853","observation_id":"ec1f4e64-0c14-4ecb-aeb5-c6d55c5634e0","resolution":{"observed_at":"2026-08-04T20:45:38.020513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:38.004840Z","title":"Enhancing federated learning with intelligent model migration in heterogeneous edge computing,","venue":null,"work_id":"ee81da9b-1ef8-4866-9e69-468a39e8ca73","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.513740Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:04e92f851a07b4507cd897bc36b1394a45649a6c2c3b05dabd96e7ce6b1b2aa0","observation_id":"11618e94-19e3-4d92-ae49-7c16c7d31f88","resolution":{"observed_at":"2026-08-04T20:45:38.008995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.993429Z","title":"Mobility- aware fog computing in dynamic environments: Understandings and implementation,","venue":null,"work_id":"52aacdc1-0741-4f9c-9784-f531174b545c","year":2018},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.605333Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:4d2014902bdcc037e3e00b9df0d1c0f670ebb4a0679f588e95487e8543943f81","observation_id":"0d418fec-8f3d-461f-8575-8f5da6d75956","resolution":{"observed_at":"2026-08-04T20:45:37.997318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.982720Z","title":"Matcha: Speeding up decentralized sgd via matching decomposition sampling,","venue":null,"work_id":"9d76c023-03a5-449b-832d-9990b3b0e04f","year":2019},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.698964Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:cdecfabc172143852e4006cc229103a4f191da2e691890c904e3c8b3874a3ece","observation_id":"aabe25ca-e7bf-467b-a1c3-849351c9fa59","resolution":{"observed_at":"2026-08-04T20:45:37.986376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.972391Z","title":"Mergesfl: Split federated learning with feature merging and batch size regulation,","venue":null,"work_id":"f52553d0-1d1d-413f-9072-4c62b17c6cc3","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.756077Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:5b1f86edc4ff08ec20faf5633f35b4fe31f5e53c430125b0e9917dabcd8936c4","observation_id":"1951b749-077c-46f3-91ee-69979979e7c2","resolution":{"observed_at":"2026-08-04T20:45:37.975908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.960896Z","title":"Parallelsfl: A novel split federated learning framework tackling heterogeneity issues,","venue":null,"work_id":"4b6773b9-faaa-43a8-bc32-0f0bb7bcecd2","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.848801Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:bbaa4bbffb40e114cede7ee0f3cfec19d788e0d1327a80fec6d0b5bda4c38f2f","observation_id":"f6a73ad0-85b8-48c7-a80a-b9a7af061553","resolution":{"observed_at":"2026-08-04T20:45:37.964762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2104.07145","last_updated":"2021-09-08T00:22:55Z","snapshot_observed_at":"2026-08-06T20:53:44.444031Z","submitted_at":"2021-04-14T22:11:35Z","title":"FedGraphNN: A Federated Learning System and Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.07145","snapshot_observed_at":"2026-08-04T20:45:31.938957Z","title":"Fedgraphnn: A federated learn- ing system and benchmark for graph neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:31.938957Z"},"links":{"cited_paper":"/paper/2104.07145","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:65dd667745e2aac875ab2fb0c5c19f657cc94b57cc0b8deb1f68d617e962c5ac","observation_id":"7d9f11b9-a01e-4ffb-8930-389c6624fd6c","resolution":{"observed_at":"2026-08-04T20:45:31.938957Z","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-04T20:45:37.949476Z","title":"Communication-efficient decentralized machine learning over heteroge- neous networks,","venue":null,"work_id":"ffe2cb8a-6d2c-47fe-a8e5-1d86b5c8f114","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.029491Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:05227a1ab6c8dd82facfe2decab8e4986c5133920dd217b14e2788e874b1412c","observation_id":"99e30cc8-29fd-4b2d-917e-c969de6841ac","resolution":{"observed_at":"2026-08-04T20:45:37.952974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.937542Z","title":"Decentralized machine learning through experience-driven method in edge networks,","venue":null,"work_id":"d9fd1769-2a17-4bb8-b867-cc6efc797c11","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.164193Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:6944659adf474af3067466e648af609da0686723d3af47a0f349492288af29e8","observation_id":"ed26348d-3eb6-4f09-b921-f8b42bc3c661","resolution":{"observed_at":"2026-08-04T20:45:37.941906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.926852Z","title":"Optimal online data partitioning for geo-distributed machine learning in edge of wireless networks,","venue":null,"work_id":"77110d40-9876-493b-aeaa-7d108d9eee09","year":2019},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.298364Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:1d860f7a74ba306258b37865a743f622790254bf269e61f201a0380adb3e5001","observation_id":"6f95b83b-dff2-4bba-9b99-05c84ac065a1","resolution":{"observed_at":"2026-08-04T20:45:37.930314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.914552Z","title":"Consensus control for decentralized deep learning,","venue":null,"work_id":"ca023173-47f7-419a-9463-da257cf4c6cb","year":2021},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.427793Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:5ffdbeb4740cef7df4b29edee9adc4036086979628a2704e1527bb19b6d69dd1","observation_id":"3ab883f7-1f06-4956-b095-0580e9621dc9","resolution":{"observed_at":"2026-08-04T20:45:37.918393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.903515Z","title":"Decentralized deep learning with arbitrary communication compression,","venue":null,"work_id":"b4296924-cc19-416b-833c-9ed9fe51b033","year":2019},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.520037Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:dc15c5ac94a5cb410c9888a6e4dd1ba85e70de39d3b22bcb22b8b310957e2f83","observation_id":"7447fc80-ed89-47c0-9952-bcbb59c02b91","resolution":{"observed_at":"2026-08-04T20:45:37.907093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.891942Z","title":"Adaptive configuration for heterogeneous participants in decentralized federated learning,","venue":null,"work_id":"6af4b91c-1c16-4d28-964d-56063ce13445","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.608704Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:3b030b8e9bd5ad203ebe537d9b1b91986048a934eea6be2ae20678a70f7ebeb7","observation_id":"7f1ad685-e65d-4985-b880-845e344b41c4","resolution":{"observed_at":"2026-08-04T20:45:37.896013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.880660Z","title":"The non-iid data quagmire of decentralized machine learning,","venue":null,"work_id":"59ba0795-493d-470f-87d1-dc13db82e5fb","year":2020},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.666485Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:c9a042786feb49541f8d39e4ebdd55f7f8753617630be1d17601304cbd239097","observation_id":"a2eb796b-ee5d-4ec6-a6e2-8e4c063f36e8","resolution":{"observed_at":"2026-08-04T20:45:37.884382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.868904Z","title":"The complexity of facets (and some facets of complexity),","venue":null,"work_id":"3709393d-c6fc-4455-8b4c-06447ace5f4f","year":1982},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.752248Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:bbde1d13274d54764dad87d65ef40f764b429fe8c9891403823c93776ff62214","observation_id":"07705095-10bb-4ae5-aafe-4524a35c52b3","resolution":{"observed_at":"2026-08-04T20:45:37.872699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1509.02971","last_updated":"2019-07-05T10:47:27Z","snapshot_observed_at":"2026-07-06T04:29:24.362640Z","submitted_at":"2015-09-09T23:01:36Z","title":"Continuous control with deep reinforcement learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.02971","snapshot_observed_at":"2026-08-04T20:45:32.846924Z","title":"Continuous control with deep reinforcement learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.846924Z"},"links":{"cited_paper":"/paper/1509.02971","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:335e2b8d05396831d71c942c88b3c4f5a6e9be566c77ea10fcca64bce61bef70","observation_id":"adc3b991-2668-4524-b477-5c35c6fdb579","resolution":{"observed_at":"2026-08-04T20:45:32.846924Z","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-04T20:45:37.856590Z","title":"Experience-driven networking: A deep reinforcement learning based approach,","venue":null,"work_id":"83ddc365-e71c-4aba-9161-f50a7447f2fc","year":2018},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:32.967705Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f895792ca6e3dc8fa36a375902f67b861c0d41daba64d7e86a485527ca2bd07b","observation_id":"6ce1db74-deb2-4450-a3bf-bf9ec0f5d6d9","resolution":{"observed_at":"2026-08-04T20:45:37.860430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:33.036946Z","title":"Human-level control through deep reinforcement learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.036946Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:cf6a8996ae45a2e59d4d36e64bb949cee0632c2d6496251c129594154e5bb720","observation_id":"1fec1bd3-5666-46d6-bfb5-2cabbab43dbc","resolution":{"observed_at":"2026-08-04T20:45:33.036946Z","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-04T20:45:37.838549Z","title":"Fast linear iterations for distributed averaging,","venue":null,"work_id":"fece8c76-a0c1-4950-9728-73c25d84ded5","year":2004},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.133591Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:0e8bf1e27acf0f52b7fa34c3097bd3292d0e4433e37c9a916d35e3ab97f6838d","observation_id":"8b1db9fc-d377-41b8-8919-244cbba7ffdf","resolution":{"observed_at":"2026-08-04T20:45:37.842792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.828577Z","title":"Nvidia jetson devices","venue":null,"work_id":"51497374-10bd-424b-ab8b-94d19f2e058e","year":null},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.255849Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:33d66f096d3c25fec2be7c20665883b38186a9b40db2a37b2643fdf09b6b9403","observation_id":"be8a369d-3baf-4be2-a8ba-be5ee4f587f8","resolution":{"observed_at":"2026-08-04T20:45:37.831461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:33.360281Z","title":"Docker: lightweight linux containers for consistent development and deployment,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.360281Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:1ce674f11ec873296a275de6db6b000589ee5b4a1e949e5437eb8b5a554def3a","observation_id":"33073610-1c4f-4b8e-8eb5-6e70962a32b8","resolution":{"observed_at":"2026-08-04T20:45:33.360281Z","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-04T20:45:33.463372Z","title":"Pytorch: An imperative style, high-performance deep learning library,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.463372Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:da5493e769ca4a9b6add0a1d0536f5e66186944a4047cc5175c559166c937eac","observation_id":"1c6708df-8e81-4966-8d29-73a0d990b7d7","resolution":{"observed_at":"2026-08-04T20:45:33.463372Z","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-04T20:45:37.805369Z","title":"socket library","venue":null,"work_id":"734ec107-a817-4b92-a7fc-31cd8182c2fd","year":null},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.538499Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:37971e91a2a23ba1f32798df41180a07ce60afaced8a563a4686ec6ab102ab87","observation_id":"80a64ba4-7895-40fd-abe5-3ab4b0989c2f","resolution":{"observed_at":"2026-08-04T20:45:37.808276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.794404Z","title":"Semi-supervised decentralized machine learning with device-to-device cooperation,","venue":null,"work_id":"1c54938e-141b-4cfc-a3d1-83de4c23d0d1","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.600485Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:99e0541aeea80b46f7e02ee3845e0eb774ee529358d5b20784589292d2ca2c70","observation_id":"e4450b54-b879-4004-a321-7475ad99ff18","resolution":{"observed_at":"2026-08-04T20:45:37.798210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.783706Z","title":"Yoga: Adaptive layer- wise model aggregation for decentralized federated learning,","venue":null,"work_id":"89dff7af-f1c8-4a57-9389-45d902b29995","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.703499Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:7461fae7986dd7167a6de8cc6b9b0c97a86bd7ec62f1ec4f65bc2575f18493ad","observation_id":"e5f5f035-12c8-464c-8411-efc9bd7520b8","resolution":{"observed_at":"2026-08-04T20:45:37.786924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.772333Z","title":"Topology design and graph embedding for decentralized federated learning,","venue":null,"work_id":"106a65d2-992b-4cb1-b1fe-fdd971a36b05","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.791312Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f9deb39f3badc3a1fbe5c05d74b7687d09ef68f4d3f02a5144c51d9331f36ab7","observation_id":"7045f3b3-e3b6-48d6-a9b2-ef0ecf0fc677","resolution":{"observed_at":"2026-08-04T20:45:37.775762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-04T20:45:33.873737Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.873737Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:c5e729c770ba205a09e33eea71b04afe5f61ca23dd222f5ad3c4adac8c546ba3","observation_id":"5117bdb9-cd3f-44f1-92b6-f58e5551be0d","resolution":{"observed_at":"2026-08-04T20:45:33.873737Z","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-04T20:45:33.958282Z","title":"Graph neural networks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:33.958282Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:29eaea640776e1bfe13c467b0c8d56de242c1efa06a46c24395e8d67d80a44b9","observation_id":"6f6d5107-11d6-491e-b0dc-e6263dcc8327","resolution":{"observed_at":"2026-08-04T20:45:33.958282Z","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-04T20:45:34.044818Z","title":"A survey of graph neural networks for social recommender systems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.044818Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:5aaadb8da2d9ea50e4a1d8c49973b453795db1b62e0c1381b3705e0faefd352a","observation_id":"3978a9fe-4ba5-4fe8-8ade-b427016d191e","resolution":{"observed_at":"2026-08-04T20:45:34.044818Z","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-04T20:45:34.127712Z","title":"A review of convolutional neural networks in computer vision,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.127712Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:e449c44fb1f3486c1e33a1069965d6b604aa278054d94c08056f9079cede0224","observation_id":"d4cf494d-61dd-49b5-aa0c-b00f09a8560e","resolution":{"observed_at":"2026-08-04T20:45:34.127712Z","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-04T20:45:37.739763Z","title":"Federated graph neural networks: Overview, techniques, and challenges,","venue":null,"work_id":"30cbf434-e68f-42d3-8a84-948fd9c21dcb","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.212481Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f06b6bd976ea14e83de950c1da0cc4670ac24a66b359b3a1af3ce828cc835033","observation_id":"288c9f9c-9a1a-455c-b3e8-cf544e8afd7c","resolution":{"observed_at":"2026-08-04T20:45:37.743560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2406.18937","last_updated":"2024-06-29T18:17:40Z","snapshot_observed_at":"2026-08-03T14:39:59.883995Z","submitted_at":"2024-06-27T07:08:28Z","title":"Federated Graph Semantic and Structural Learning","version":2},"cited_work":{"arxiv_id":"2406.18937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.18937","snapshot_observed_at":"2026-08-04T20:45:35.564426Z","title":"Federated Graph Semantic and Structural Learning","venue":"cs.LG","work_id":"308077f7-0d4d-4880-89f2-8937e0c918bf","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.265292Z"},"links":{"cited_paper":"/paper/2406.18937","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:ffed246e52d6a2045401e24553bf287078eb406c1c737077d20131260f2fbadb","observation_id":"5468a128-ccea-4072-8037-36bfbc6f3c98","resolution":{"observed_at":"2026-08-04T20:45:35.627197Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.729354Z","title":"Hierarchical federated learning with local model embedding,","venue":null,"work_id":"5ba638cf-02f8-4156-92a0-6249328bfb0b","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.353198Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:21076bc38df22bd977f309681f400edf7351d9b68e0f3531c0347b632f99731a","observation_id":"1fcd19a8-2187-4ae3-98c1-4e9f7a034b37","resolution":{"observed_at":"2026-08-04T20:45:37.732507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.718518Z","title":"Fedgl: Federated graph learning framework with global self-supervision,","venue":null,"work_id":"370077c1-db13-48dd-9f92-6b56664560ad","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.407539Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:21f6975263e3f5ece06c9a003c7ab28256cfd28ae38a4076eba7bee3af9427da","observation_id":"91eccc7b-1d8b-4517-97f8-15628b14496f","resolution":{"observed_at":"2026-08-04T20:45:37.721858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.667545Z","title":"Federated graph learning under domain shift with generalizable prototypes,","venue":null,"work_id":"9823d2b9-e14c-43b5-a006-3e370d73968b","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.490219Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:6d2e6e75b40099323b57aa4547fb41c40f37d59d23dd55277a09a064a142c767","observation_id":"7a143e47-6dab-44f5-af0d-88634a733d9d","resolution":{"observed_at":"2026-08-04T20:45:37.711165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:37.335376Z","title":"Federated learning over coupled graphs,","venue":null,"work_id":"cd1f8a76-c1ed-4112-91c4-7e13cbca5a39","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.575295Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:c8c11c221f68b624f8491290a8148d2d3d37721af460c829c11a7a7da1fc0ba6","observation_id":"89e1f596-8032-4015-a9ba-0352ace218e4","resolution":{"observed_at":"2026-08-04T20:45:37.439068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:36.950912Z","title":"Federated hetero- geneous contrastive distillation for molecular representation learning,","venue":null,"work_id":"6faf24b9-8963-4981-a8aa-9ec74de14082","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.657536Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:d90aeda46ff434be7cb3137aea61a6aef81fb440fc89b03a603bcd061ef0616d","observation_id":"65ba1aa6-0e67-459f-9545-d837302c37a8","resolution":{"observed_at":"2026-08-04T20:45:37.108459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:36.575569Z","title":"Decentralized federated learning: Fundamentals, state of the art, frameworks, trends, and chal- lenges,","venue":null,"work_id":"9994d0e6-bff1-46f0-bd84-12dca9501c05","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.733858Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:907955301597e35fe23cab20e1721eb5baa89ff4578eaacba753cdf85aba5a6c","observation_id":"dbf2eec4-9d25-41f1-a9dc-c86d3e369711","resolution":{"observed_at":"2026-08-04T20:45:36.745386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:36.372962Z","title":"Spreadgnn: Decentralized multi-task federated learning for graph neural networks on molecular data,","venue":null,"work_id":"5cd61e8c-042f-439f-a06e-ee0cda3ca155","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.790276Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:b030ac03e6f1f68104b156f91c5d26b6854bf031508b9b12e196c3adef06cf23","observation_id":"d73f888d-d0b0-49e8-8897-34b13a08caf7","resolution":{"observed_at":"2026-08-04T20:45:36.460844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:36.204856Z","title":"Dci-pfgl: Decentralized cross-institutional personalized federated graph learning for iot service recommendation,","venue":null,"work_id":"790bbf19-d9ba-4b5e-9b6d-57820c413147","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.854738Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:6a2427b4dcb35aa467aab640082f7bdcc0b0fc69160c95dd26c91a4e43a10e05","observation_id":"8a241cb1-2fe6-4656-9f4f-d0bfd647219c","resolution":{"observed_at":"2026-08-04T20:45:36.261557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2409.14655","last_updated":"2024-09-23T01:49:20Z","snapshot_observed_at":"2026-07-06T19:19:37.350445Z","submitted_at":"2024-09-23T01:49:20Z","title":"Federated Graph Learning with Adaptive Importance-based Sampling","version":1},"cited_work":{"arxiv_id":"2409.14655","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.14655","snapshot_observed_at":"2026-08-04T20:45:35.446853Z","title":"Federated Graph Learning with Adaptive Importance-based Sampling","venue":"cs.DC","work_id":"6b41871a-9b14-4d3d-8fa1-e2e974308334","year":2024},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:34.929231Z"},"links":{"cited_paper":"/paper/2409.14655","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:6f8bc8f0a2b71c0eac7d5620a6af9ded2d1c0f697f51480450a6edeb369840d0","observation_id":"fe07c013-0ad6-45e9-9c4f-78b8ffcf1bce","resolution":{"observed_at":"2026-08-04T20:45:35.492144Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:36.016652Z","title":"p2pgnn: A de- centralized graph neural network for node classification in peer-to-peer networks,","venue":null,"work_id":"afe5d772-0f5a-411e-a2cd-ad5b7a62337c","year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:35.003616Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:9bdecf8f3880c68d2b6d3dfcb8d26f9ee8d85888c271fc64eac2a3420d944e3e","observation_id":"c055a901-117b-4dac-bf83-ca09fe3e0311","resolution":{"observed_at":"2026-08-04T20:45:36.096770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:35.058895Z","title":"Towards personalized federated learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:35.058895Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:6877f30b3ab00d2ddf2171d6d716e591703819dcc886c8867beb8f3375681b52","observation_id":"f096f1a0-6236-4580-9e77-9d970939fc48","resolution":{"observed_at":"2026-08-04T20:45:35.058895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.11369","last_updated":"2020-11-23T12:52:18Z","snapshot_observed_at":"2026-08-08T08:27:58.064635Z","submitted_at":"2020-11-23T12:52:18Z","title":"Improving Federated Relational Data Modeling via Basis Alignment and Weight Penalty","version":1},"cited_work":{"arxiv_id":"2011.11369","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.11369","snapshot_observed_at":"2026-08-04T20:45:35.314802Z","title":"Improving Federated Relational Data Modeling via Basis Alignment and Weight Penalty","venue":"cs.LG","work_id":"cb436abe-3623-4f28-a8f7-1e68724eacb7","year":2020},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:35.113191Z"},"links":{"cited_paper":"/paper/2011.11369","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:474bae803e9d4e847241745824c717a1ee283e5448c7846c61a25399879a0431","observation_id":"34629806-40c1-490a-8744-42056e837add","resolution":{"observed_at":"2026-08-04T20:45:35.382346Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T20:45:35.761316Z","title":"An information theoretic perspective for heterogeneous subgraph federated learning,","venue":null,"work_id":"f4a0c1a8-611a-4f83-9b97-2058569189d5","year":2023},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:35.172084Z"},"links":{"citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:09bb0c025e2632c7bb0fbce04364d09257734e830a5022d9f1cae8e46b3cdcf1","observation_id":"8e460840-1353-443d-ae07-78dd419a6581","resolution":{"observed_at":"2026-08-04T20:45:35.811413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-07-06T07:05:24.565760Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-04T20:45:35.221060Z","title":"How powerful are graph neural networks?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-04T20:45:35.221060Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2509.08409"},"observation_digest":"sha256:f5b73fe982a60da6ae17a0fe6815d40c4d9276aad4c56e9185c45f7b9721b40c","observation_id":"82604c3e-ed12-4f04-9d24-bfc1a056567b","resolution":{"observed_at":"2026-08-04T20:45:35.221060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.08409","last_updated":"2025-09-10T08:55:23Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-04T20:45:27.012419Z","submitted_at":"2025-09-10T08:55:23Z","title":"Towards Communication-Efficient Decentralized Federated Graph Learning over Non-IID Data"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":3,"verified_fuzzy":52},"total_outbound_references":69},"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 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2509.08409."}