{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QQ3PSL3LLRQBO7E5ONYYGKF3EL","short_pith_number":"pith:QQ3PSL3L","schema_version":"1.0","canonical_sha256":"8436f92f6b5c60177c9d73718328bb22fd323f6152a45faf7e39bbebc3e088a5","source":{"kind":"arxiv","id":"2008.07665","version":1},"attestation_state":"computed","paper":{"title":"Inverse Distance Aggregation for Federated Learning with Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Azade Farshad, Nassir Navab, Shadi Albarqouni, Yousef Yeganeh","submitted_at":"2020-08-17T23:20:01Z","abstract_excerpt":"Federated learning (FL) has been a promising approach in the field of medical imaging in recent years. A critical problem in FL, specifically in medical scenarios is to have a more accurate shared model which is robust to noisy and out-of distribution clients. In this work, we tackle the problem of statistical heterogeneity in data for FL which is highly plausible in medical data where for example the data comes from different sites with different scanner settings. We propose IDA (Inverse Distance Aggregation), a novel adaptive weighting approach for clients based on meta-information which han"},"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":"2008.07665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-17T23:20:01Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"8d52d61db6882cc90012b9005be54ca486756fa1ce2911104000a97df8493542","abstract_canon_sha256":"403800c75ed6e249bace1a3aa9ca9237e5c129b36efbd62125aa03f62888e3df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:53.865480Z","signature_b64":"7RfMhY1/1joitcZ2DnIrzVUH4Hiq1ZsY5Cc4llTV/MvGCWG5o3gx2Sb+J5gJqey6M5BDqiUytaS6BqSCwjV8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8436f92f6b5c60177c9d73718328bb22fd323f6152a45faf7e39bbebc3e088a5","last_reissued_at":"2026-07-05T01:27:53.865133Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:53.865133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Distance Aggregation for Federated Learning with Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Azade Farshad, Nassir Navab, Shadi Albarqouni, Yousef Yeganeh","submitted_at":"2020-08-17T23:20:01Z","abstract_excerpt":"Federated learning (FL) has been a promising approach in the field of medical imaging in recent years. A critical problem in FL, specifically in medical scenarios is to have a more accurate shared model which is robust to noisy and out-of distribution clients. In this work, we tackle the problem of statistical heterogeneity in data for FL which is highly plausible in medical data where for example the data comes from different sites with different scanner settings. We propose IDA (Inverse Distance Aggregation), a novel adaptive weighting approach for clients based on meta-information which han"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07665","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/2008.07665/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":"2008.07665","created_at":"2026-07-05T01:27:53.865191+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.07665v1","created_at":"2026-07-05T01:27:53.865191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07665","created_at":"2026-07-05T01:27:53.865191+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ3PSL3LLRQB","created_at":"2026-07-05T01:27:53.865191+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ3PSL3LLRQBO7E5","created_at":"2026-07-05T01:27:53.865191+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ3PSL3L","created_at":"2026-07-05T01:27:53.865191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22580","citing_title":"FedCLAM: Client Adaptive Momentum with Foreground Intensity Matching for Federated Medical Image Segmentation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL","json":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL.json","graph_json":"https://pith.science/api/pith-number/QQ3PSL3LLRQBO7E5ONYYGKF3EL/graph.json","events_json":"https://pith.science/api/pith-number/QQ3PSL3LLRQBO7E5ONYYGKF3EL/events.json","paper":"https://pith.science/paper/QQ3PSL3L"},"agent_actions":{"view_html":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL","download_json":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL.json","view_paper":"https://pith.science/paper/QQ3PSL3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.07665&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ3PSL3LLRQBO7E5ONYYGKF3EL/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ3PSL3LLRQBO7E5ONYYGKF3EL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL/action/storage_attestation","attest_author":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL/action/author_attestation","sign_citation":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL/action/citation_signature","submit_replication":"https://pith.science/pith/QQ3PSL3LLRQBO7E5ONYYGKF3EL/action/replication_record"}},"created_at":"2026-07-05T01:27:53.865191+00:00","updated_at":"2026-07-05T01:27:53.865191+00:00"}