{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z74ZDPRLOEJLLN3RHVIZA7IQ75","short_pith_number":"pith:Z74ZDPRL","schema_version":"1.0","canonical_sha256":"cff991be2b7112b5b7713d51907d10ff46fed83fbe8509d24b246947ea1fbe8f","source":{"kind":"arxiv","id":"2311.04686","version":2},"attestation_state":"computed","paper":{"title":"Robust and Communication-Efficient Federated Domain Adaptation via Random Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fan Yang, Jie Li, Jiong Lou, Robert. C. Qiu, Tiebin Mi, Yuanjie Wang, Zhanbo Feng, Zhenyu Liao","submitted_at":"2023-11-08T13:46:58Z","abstract_excerpt":"Modern machine learning (ML) models have grown to a scale where training them on a single machine becomes impractical. As a result, there is a growing trend to leverage federated learning (FL) techniques to train large ML models in a distributed and collaborative manner. These models, however, when deployed on new devices, might struggle to generalize well due to domain shifts. In this context, federated domain adaptation (FDA) emerges as a powerful approach to address this challenge.\n  Most existing FDA approaches typically focus on aligning the distributions between source and target domains"},"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":"2311.04686","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-08T13:46:58Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"de69ac33517e587e2c5617b64b2ba22ddffd8f8ea801ea175cfc2e8ef7a17ba3","abstract_canon_sha256":"7bc111afde449236bacdcb863706768597417cbd37f631d6c7adc2e8f53e4d42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:29.477240Z","signature_b64":"WSAiyAh1xhfyRQrSYKm+V0ZyW0fC4LEW6GC0e0BXD2Rh+eznaOkQw3vkr67bjqp/bMqVUvz4dkdAxx0XknZ8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cff991be2b7112b5b7713d51907d10ff46fed83fbe8509d24b246947ea1fbe8f","last_reissued_at":"2026-07-05T09:51:29.476796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:29.476796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Communication-Efficient Federated Domain Adaptation via Random Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fan Yang, Jie Li, Jiong Lou, Robert. C. Qiu, Tiebin Mi, Yuanjie Wang, Zhanbo Feng, Zhenyu Liao","submitted_at":"2023-11-08T13:46:58Z","abstract_excerpt":"Modern machine learning (ML) models have grown to a scale where training them on a single machine becomes impractical. As a result, there is a growing trend to leverage federated learning (FL) techniques to train large ML models in a distributed and collaborative manner. These models, however, when deployed on new devices, might struggle to generalize well due to domain shifts. In this context, federated domain adaptation (FDA) emerges as a powerful approach to address this challenge.\n  Most existing FDA approaches typically focus on aligning the distributions between source and target domains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04686","kind":"arxiv","version":2},"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/2311.04686/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":"2311.04686","created_at":"2026-07-05T09:51:29.476861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.04686v2","created_at":"2026-07-05T09:51:29.476861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04686","created_at":"2026-07-05T09:51:29.476861+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z74ZDPRLOEJL","created_at":"2026-07-05T09:51:29.476861+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z74ZDPRLOEJLLN3R","created_at":"2026-07-05T09:51:29.476861+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z74ZDPRL","created_at":"2026-07-05T09:51:29.476861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10840","citing_title":"Generalizable Federated Learning using Client Adaptive Focal Modulation","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75","json":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75.json","graph_json":"https://pith.science/api/pith-number/Z74ZDPRLOEJLLN3RHVIZA7IQ75/graph.json","events_json":"https://pith.science/api/pith-number/Z74ZDPRLOEJLLN3RHVIZA7IQ75/events.json","paper":"https://pith.science/paper/Z74ZDPRL"},"agent_actions":{"view_html":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75","download_json":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75.json","view_paper":"https://pith.science/paper/Z74ZDPRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.04686&json=true","fetch_graph":"https://pith.science/api/pith-number/Z74ZDPRLOEJLLN3RHVIZA7IQ75/graph.json","fetch_events":"https://pith.science/api/pith-number/Z74ZDPRLOEJLLN3RHVIZA7IQ75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75/action/storage_attestation","attest_author":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75/action/author_attestation","sign_citation":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75/action/citation_signature","submit_replication":"https://pith.science/pith/Z74ZDPRLOEJLLN3RHVIZA7IQ75/action/replication_record"}},"created_at":"2026-07-05T09:51:29.476861+00:00","updated_at":"2026-07-05T09:51:29.476861+00:00"}