{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OKFUJKTDEZ5HMGYBHCVIGTBYKA","short_pith_number":"pith:OKFUJKTD","schema_version":"1.0","canonical_sha256":"728b44aa63267a761b0138aa834c38502dba7032aa5c2b1291b8e9a663ad1802","source":{"kind":"arxiv","id":"2506.10607","version":1},"attestation_state":"computed","paper":{"title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hong-Tri Nguyen, Huong Nguyen, Lauri Lov\\'en, Praveen Kumar Donta, Susanna Pirttikangas","submitted_at":"2025-06-12T11:51:32Z","abstract_excerpt":"Federated learning has emerged as a privacy-preserving technique for collaborative model training across heterogeneously distributed silos. Yet, its reliance on a single central server introduces potential bottlenecks and risks of single-point failure. Decentralizing the server, often referred to as decentralized learning, addresses this problem by distributing the server role across nodes within the network. One drawback regarding this pure decentralization is it introduces communication inefficiencies, which arise from increased message exchanges in large-scale setups. However, existing prop"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.10607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-12T11:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"1df33c26e096b8c875917fd18c544b656e7472f0dbf1cf42d2965b8d5f0c18a2","abstract_canon_sha256":"5550746be381b53091cc113752aecd65bc80a54b92f5bc3ebc8d50349951fe82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:27.169401Z","signature_b64":"7C1w8wXIi/eVVWSHHWj8VrCqMF81dbRGfQd3PfxBPp128yAxjCsI3xNVAuhBYo++1Y5cMIqtsvflDrTiLnqVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728b44aa63267a761b0138aa834c38502dba7032aa5c2b1291b8e9a663ad1802","last_reissued_at":"2026-07-05T11:20:27.168916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:27.168916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-based Gossiping for Communication Efficiency in Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hong-Tri Nguyen, Huong Nguyen, Lauri Lov\\'en, Praveen Kumar Donta, Susanna Pirttikangas","submitted_at":"2025-06-12T11:51:32Z","abstract_excerpt":"Federated learning has emerged as a privacy-preserving technique for collaborative model training across heterogeneously distributed silos. Yet, its reliance on a single central server introduces potential bottlenecks and risks of single-point failure. Decentralizing the server, often referred to as decentralized learning, addresses this problem by distributing the server role across nodes within the network. One drawback regarding this pure decentralization is it introduces communication inefficiencies, which arise from increased message exchanges in large-scale setups. However, existing prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10607","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.10607/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.10607","created_at":"2026-07-05T11:20:27.168973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10607v1","created_at":"2026-07-05T11:20:27.168973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10607","created_at":"2026-07-05T11:20:27.168973+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKFUJKTDEZ5H","created_at":"2026-07-05T11:20:27.168973+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKFUJKTDEZ5HMGYB","created_at":"2026-07-05T11:20:27.168973+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKFUJKTD","created_at":"2026-07-05T11:20:27.168973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16541","citing_title":"A Comprehensive Data-centric Overview of Federated Graph Learning","ref_index":219,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA","json":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA.json","graph_json":"https://pith.science/api/pith-number/OKFUJKTDEZ5HMGYBHCVIGTBYKA/graph.json","events_json":"https://pith.science/api/pith-number/OKFUJKTDEZ5HMGYBHCVIGTBYKA/events.json","paper":"https://pith.science/paper/OKFUJKTD"},"agent_actions":{"view_html":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA","download_json":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA.json","view_paper":"https://pith.science/paper/OKFUJKTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10607&json=true","fetch_graph":"https://pith.science/api/pith-number/OKFUJKTDEZ5HMGYBHCVIGTBYKA/graph.json","fetch_events":"https://pith.science/api/pith-number/OKFUJKTDEZ5HMGYBHCVIGTBYKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA/action/storage_attestation","attest_author":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA/action/author_attestation","sign_citation":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA/action/citation_signature","submit_replication":"https://pith.science/pith/OKFUJKTDEZ5HMGYBHCVIGTBYKA/action/replication_record"}},"created_at":"2026-07-05T11:20:27.168973+00:00","updated_at":"2026-07-05T11:20:27.168973+00:00"}