{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VYICRFHKIODSHWJGV6YFTXCGMZ","short_pith_number":"pith:VYICRFHK","schema_version":"1.0","canonical_sha256":"ae102894ea438723d926afb059dc466655d3dac9bf1ca046e6041c0d7ec4aa97","source":{"kind":"arxiv","id":"2407.04460","version":1},"attestation_state":"computed","paper":{"title":"Smart Sampling: Helping from Friendly Neighbors for Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lin Wang, Xiaoying Tang, Yang Chen, Yongxin Guo","submitted_at":"2024-07-05T12:10:54Z","abstract_excerpt":"Federated Learning (FL) is gaining widespread interest for its ability to share knowledge while preserving privacy and reducing communication costs. Unlike Centralized FL, Decentralized FL (DFL) employs a network architecture that eliminates the need for a central server, allowing direct communication among clients and leading to significant communication resource savings. However, due to data heterogeneity, not all neighboring nodes contribute to enhancing the local client's model performance. In this work, we introduce \\textbf{\\emph{AFIND+}}, a simple yet efficient algorithm for sampling and"},"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":"2407.04460","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T12:10:54Z","cross_cats_sorted":[],"title_canon_sha256":"756f29ce13cef244cbb5860f9a5940572b5d73e9c811ed3885ee24f50aa8d62b","abstract_canon_sha256":"ba3865b966bed14db54671fd3f3e8e796ceff35753eba1a6f7861ca3a2f959a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:33.963668Z","signature_b64":"jz7RhdXiUgbuklTYckUaN7GsuRIbvwUF+alfXxvSPQhsJjGD6OGHcLOuWWRaIumY5F+K6gOeg/23G0SAyFkfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae102894ea438723d926afb059dc466655d3dac9bf1ca046e6041c0d7ec4aa97","last_reissued_at":"2026-07-05T08:40:33.963184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:33.963184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smart Sampling: Helping from Friendly Neighbors for Decentralized Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lin Wang, Xiaoying Tang, Yang Chen, Yongxin Guo","submitted_at":"2024-07-05T12:10:54Z","abstract_excerpt":"Federated Learning (FL) is gaining widespread interest for its ability to share knowledge while preserving privacy and reducing communication costs. Unlike Centralized FL, Decentralized FL (DFL) employs a network architecture that eliminates the need for a central server, allowing direct communication among clients and leading to significant communication resource savings. However, due to data heterogeneity, not all neighboring nodes contribute to enhancing the local client's model performance. In this work, we introduce \\textbf{\\emph{AFIND+}}, a simple yet efficient algorithm for sampling and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04460","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/2407.04460/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":"2407.04460","created_at":"2026-07-05T08:40:33.963241+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04460v1","created_at":"2026-07-05T08:40:33.963241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04460","created_at":"2026-07-05T08:40:33.963241+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYICRFHKIODS","created_at":"2026-07-05T08:40:33.963241+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYICRFHKIODSHWJG","created_at":"2026-07-05T08:40:33.963241+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYICRFHK","created_at":"2026-07-05T08:40:33.963241+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19279","citing_title":"S-VOTE: Similarity-based Voting for Client Selection in Decentralized Federated Learning","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ","json":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ.json","graph_json":"https://pith.science/api/pith-number/VYICRFHKIODSHWJGV6YFTXCGMZ/graph.json","events_json":"https://pith.science/api/pith-number/VYICRFHKIODSHWJGV6YFTXCGMZ/events.json","paper":"https://pith.science/paper/VYICRFHK"},"agent_actions":{"view_html":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ","download_json":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ.json","view_paper":"https://pith.science/paper/VYICRFHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04460&json=true","fetch_graph":"https://pith.science/api/pith-number/VYICRFHKIODSHWJGV6YFTXCGMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VYICRFHKIODSHWJGV6YFTXCGMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ/action/storage_attestation","attest_author":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ/action/author_attestation","sign_citation":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ/action/citation_signature","submit_replication":"https://pith.science/pith/VYICRFHKIODSHWJGV6YFTXCGMZ/action/replication_record"}},"created_at":"2026-07-05T08:40:33.963241+00:00","updated_at":"2026-07-05T08:40:33.963241+00:00"}