{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CCEZZITJMIAENU66VCYQP6SQYR","short_pith_number":"pith:CCEZZITJ","schema_version":"1.0","canonical_sha256":"10899ca269620046d3dea8b107fa50c4619032898c8f56f9c3a99c639916a477","source":{"kind":"arxiv","id":"2503.23218","version":2},"attestation_state":"computed","paper":{"title":"Multi-Agent Reinforcement Learning for Graph Discovery in D2D-Enabled Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Anindya Bijoy Das, Christopher G. Brinton, David J. Love, Satyavrat Wagle","submitted_at":"2025-03-29T20:42:26Z","abstract_excerpt":"Augmenting federated learning (FL) with device-to-device (D2D) communications can help improve convergence speed and reduce model bias through local information exchange. However, data privacy concerns, trust constraints between devices, and unreliable wireless channels each pose challenges in finding an effective yet resource efficient D2D graph structure. In this paper, we develop a decentralized reinforcement learning (RL) method for D2D graph discovery that promotes communication of impactful datapoints over reliable links for multiple learning paradigms, while following both data and devi"},"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":"2503.23218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-03-29T20:42:26Z","cross_cats_sorted":[],"title_canon_sha256":"589fbdfe3d63a181d825d78fbf732229ce7805c2a0a89d0733bc7648dfecdf74","abstract_canon_sha256":"ef416d1ff8d76ddadd7e60e01ca3079a36d61f5146aa6a46bde36061972205c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:19.868223Z","signature_b64":"8QlfNHuXLF1SOeKu2A1uk858XdWruqjDGFVfAE9ZaYJ8eX+0iuxjLwhopjfjNHnMHE83YKDxUF6dQExMRC74Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10899ca269620046d3dea8b107fa50c4619032898c8f56f9c3a99c639916a477","last_reissued_at":"2026-07-05T10:45:19.867738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:19.867738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Reinforcement Learning for Graph Discovery in D2D-Enabled Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Anindya Bijoy Das, Christopher G. Brinton, David J. Love, Satyavrat Wagle","submitted_at":"2025-03-29T20:42:26Z","abstract_excerpt":"Augmenting federated learning (FL) with device-to-device (D2D) communications can help improve convergence speed and reduce model bias through local information exchange. However, data privacy concerns, trust constraints between devices, and unreliable wireless channels each pose challenges in finding an effective yet resource efficient D2D graph structure. In this paper, we develop a decentralized reinforcement learning (RL) method for D2D graph discovery that promotes communication of impactful datapoints over reliable links for multiple learning paradigms, while following both data and devi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23218","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/2503.23218/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":"2503.23218","created_at":"2026-07-05T10:45:19.867795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.23218v2","created_at":"2026-07-05T10:45:19.867795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23218","created_at":"2026-07-05T10:45:19.867795+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCEZZITJMIAE","created_at":"2026-07-05T10:45:19.867795+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCEZZITJMIAENU66","created_at":"2026-07-05T10:45:19.867795+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCEZZITJ","created_at":"2026-07-05T10:45:19.867795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR","json":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR.json","graph_json":"https://pith.science/api/pith-number/CCEZZITJMIAENU66VCYQP6SQYR/graph.json","events_json":"https://pith.science/api/pith-number/CCEZZITJMIAENU66VCYQP6SQYR/events.json","paper":"https://pith.science/paper/CCEZZITJ"},"agent_actions":{"view_html":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR","download_json":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR.json","view_paper":"https://pith.science/paper/CCEZZITJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.23218&json=true","fetch_graph":"https://pith.science/api/pith-number/CCEZZITJMIAENU66VCYQP6SQYR/graph.json","fetch_events":"https://pith.science/api/pith-number/CCEZZITJMIAENU66VCYQP6SQYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR/action/storage_attestation","attest_author":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR/action/author_attestation","sign_citation":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR/action/citation_signature","submit_replication":"https://pith.science/pith/CCEZZITJMIAENU66VCYQP6SQYR/action/replication_record"}},"created_at":"2026-07-05T10:45:19.867795+00:00","updated_at":"2026-07-05T10:45:19.867795+00:00"}