{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PQJBWQBCBC23AU7G4ZGCAMBZ7D","short_pith_number":"pith:PQJBWQBC","schema_version":"1.0","canonical_sha256":"7c121b402208b5b053e6e64c203039f8fd87ad12ebc7bb975dcc7699402d9aab","source":{"kind":"arxiv","id":"2505.24464","version":1},"attestation_state":"computed","paper":{"title":"Distributed gradient methods under heavy-tailed communication noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dragana Bajovic, Dusan Jakovetic, Manojlo Vukovic, Soummya Kar","submitted_at":"2025-05-30T11:07:21Z","abstract_excerpt":"We consider a standard distributed optimization problem in which networked nodes collaboratively minimize the sum of their locally known convex costs. For this setting, we address for the first time the fundamental problem of design and analysis of distributed methods to solve the above problem when inter-node communication is subject to \\emph{heavy-tailed} noise. Heavy-tailed noise is highly relevant and frequently arises in densely deployed wireless sensor and Internet of Things (IoT) networks. Specifically, we design a distributed gradient-type method that features a carefully balanced mixe"},"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":"2505.24464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-30T11:07:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"048f7bc4ffcb44886f3ea7a9e3aa97de367d168de6bc5b95dc588163c274be5a","abstract_canon_sha256":"2711e5e43450b2c1d752017b168e74e06df4fae4c2d8425ab46a916fd7199d8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:50.307367Z","signature_b64":"xeFK7qcUrXGjG5MZgRpQkE4YTiiFlNg0dGxfkBqfhyIH+NqN34vwhvvtT1xWwy+YEIM5Cs6R0mNJnnWw/8MPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c121b402208b5b053e6e64c203039f8fd87ad12ebc7bb975dcc7699402d9aab","last_reissued_at":"2026-07-05T11:12:50.306857Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:50.306857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed gradient methods under heavy-tailed communication noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dragana Bajovic, Dusan Jakovetic, Manojlo Vukovic, Soummya Kar","submitted_at":"2025-05-30T11:07:21Z","abstract_excerpt":"We consider a standard distributed optimization problem in which networked nodes collaboratively minimize the sum of their locally known convex costs. For this setting, we address for the first time the fundamental problem of design and analysis of distributed methods to solve the above problem when inter-node communication is subject to \\emph{heavy-tailed} noise. Heavy-tailed noise is highly relevant and frequently arises in densely deployed wireless sensor and Internet of Things (IoT) networks. Specifically, we design a distributed gradient-type method that features a carefully balanced mixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24464","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/2505.24464/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":"2505.24464","created_at":"2026-07-05T11:12:50.306921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24464v1","created_at":"2026-07-05T11:12:50.306921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24464","created_at":"2026-07-05T11:12:50.306921+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQJBWQBCBC23","created_at":"2026-07-05T11:12:50.306921+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQJBWQBCBC23AU7G","created_at":"2026-07-05T11:12:50.306921+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQJBWQBC","created_at":"2026-07-05T11:12:50.306921+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/PQJBWQBCBC23AU7G4ZGCAMBZ7D","json":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D.json","graph_json":"https://pith.science/api/pith-number/PQJBWQBCBC23AU7G4ZGCAMBZ7D/graph.json","events_json":"https://pith.science/api/pith-number/PQJBWQBCBC23AU7G4ZGCAMBZ7D/events.json","paper":"https://pith.science/paper/PQJBWQBC"},"agent_actions":{"view_html":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D","download_json":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D.json","view_paper":"https://pith.science/paper/PQJBWQBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24464&json=true","fetch_graph":"https://pith.science/api/pith-number/PQJBWQBCBC23AU7G4ZGCAMBZ7D/graph.json","fetch_events":"https://pith.science/api/pith-number/PQJBWQBCBC23AU7G4ZGCAMBZ7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D/action/storage_attestation","attest_author":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D/action/author_attestation","sign_citation":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D/action/citation_signature","submit_replication":"https://pith.science/pith/PQJBWQBCBC23AU7G4ZGCAMBZ7D/action/replication_record"}},"created_at":"2026-07-05T11:12:50.306921+00:00","updated_at":"2026-07-05T11:12:50.306921+00:00"}