{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M2IAX5ZMEI22OWLHMAVP5KIDST","short_pith_number":"pith:M2IAX5ZM","schema_version":"1.0","canonical_sha256":"66900bf72c2235a75967602afea90394dce9441382b7e112ccf405f15462a368","source":{"kind":"arxiv","id":"2501.04610","version":1},"attestation_state":"computed","paper":{"title":"Resilient Peer-to-peer Learning based on Adaptive Aggregation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandreyee Bhowmick, Xenofon Koutsoukos","submitted_at":"2025-01-08T16:47:45Z","abstract_excerpt":"Collaborative learning in peer-to-peer networks offers the benefits of distributed learning while mitigating the risks associated with single points of failure inherent in centralized servers. However, adversarial workers pose potential threats by attempting to inject malicious information into the network. Thus, ensuring the resilience of peer-to-peer learning emerges as a pivotal research objective. The challenge is exacerbated in the presence of non-convex loss functions and non-iid data distributions. This paper introduces a resilient aggregation technique tailored for such scenarios, aime"},"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":"2501.04610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-08T16:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"54a19a9d0e3c4905536bf5f8706cf12ac6857c7bd82f4169d39157a051e4effb","abstract_canon_sha256":"1b9246202c39b3e0dbfba81ac35ea307df29368776a2fe3a71dafd5144babf5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:38.032725Z","signature_b64":"l+HlKPoHF29iYXN2WBqAfoYWKVuZyCKDU4UwC+u2+SLDBo1ByKrlixQ9NipGlOyyLNmZPvWzUNIVmvH8XBuMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66900bf72c2235a75967602afea90394dce9441382b7e112ccf405f15462a368","last_reissued_at":"2026-07-05T09:58:38.032272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:38.032272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resilient Peer-to-peer Learning based on Adaptive Aggregation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chandreyee Bhowmick, Xenofon Koutsoukos","submitted_at":"2025-01-08T16:47:45Z","abstract_excerpt":"Collaborative learning in peer-to-peer networks offers the benefits of distributed learning while mitigating the risks associated with single points of failure inherent in centralized servers. However, adversarial workers pose potential threats by attempting to inject malicious information into the network. Thus, ensuring the resilience of peer-to-peer learning emerges as a pivotal research objective. The challenge is exacerbated in the presence of non-convex loss functions and non-iid data distributions. This paper introduces a resilient aggregation technique tailored for such scenarios, aime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04610","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/2501.04610/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":"2501.04610","created_at":"2026-07-05T09:58:38.032336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04610v1","created_at":"2026-07-05T09:58:38.032336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04610","created_at":"2026-07-05T09:58:38.032336+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2IAX5ZMEI22","created_at":"2026-07-05T09:58:38.032336+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2IAX5ZMEI22OWLH","created_at":"2026-07-05T09:58:38.032336+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2IAX5ZM","created_at":"2026-07-05T09:58:38.032336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25459","citing_title":"GS-Playground: A High-Throughput Photorealistic Simulator for Vision-Informed Robot Learning","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST","json":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST.json","graph_json":"https://pith.science/api/pith-number/M2IAX5ZMEI22OWLHMAVP5KIDST/graph.json","events_json":"https://pith.science/api/pith-number/M2IAX5ZMEI22OWLHMAVP5KIDST/events.json","paper":"https://pith.science/paper/M2IAX5ZM"},"agent_actions":{"view_html":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST","download_json":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST.json","view_paper":"https://pith.science/paper/M2IAX5ZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04610&json=true","fetch_graph":"https://pith.science/api/pith-number/M2IAX5ZMEI22OWLHMAVP5KIDST/graph.json","fetch_events":"https://pith.science/api/pith-number/M2IAX5ZMEI22OWLHMAVP5KIDST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST/action/storage_attestation","attest_author":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST/action/author_attestation","sign_citation":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST/action/citation_signature","submit_replication":"https://pith.science/pith/M2IAX5ZMEI22OWLHMAVP5KIDST/action/replication_record"}},"created_at":"2026-07-05T09:58:38.032336+00:00","updated_at":"2026-07-05T09:58:38.032336+00:00"}