{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TTXXADZEHPYAJQU7HD3APOGAZF","short_pith_number":"pith:TTXXADZE","schema_version":"1.0","canonical_sha256":"9cef700f243bf004c29f38f607b8c0c95740e3292e242e0bc1c943f03c87e5fe","source":{"kind":"arxiv","id":"2403.18509","version":2},"attestation_state":"computed","paper":{"title":"Distributed Maximum Consensus over Noisy Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.DC","authors_text":"Ehsan Lari, Naveen K. D. Venkategowda, Reza Arablouei, Stefan Werner","submitted_at":"2024-03-27T12:39:16Z","abstract_excerpt":"We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC), for estimating the maximum value within a multi-agent network in the presence of noisy communication links. Our approach entails redefining the maximum consensus problem as a distributed optimization problem, allowing a solution using the alternating direction method of multipliers. Unlike existing algorithms that rely on multiple sets of noise-corrupted estimates, RD-MC employs a single set, enhancing both robustness and efficiency. To further mitigate the effects of link noise and improve robustn"},"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":"2403.18509","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-03-27T12:39:16Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"fe855825d6c27cd6720f197c7c5578f0af21704a66b08e35cd58aecb59bc10be","abstract_canon_sha256":"b348cb75c3017c27ec421b083d799a6ed72bdb78446459695876a5cf665c0803"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:38.994841Z","signature_b64":"6DsyvJ54wNYxIhmydkepYUWgMo5CYBWmhJM453MDxKHx9yjk7XNi439PqL2ksjJmIsFXGoJj9Zo0uR546SetAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cef700f243bf004c29f38f607b8c0c95740e3292e242e0bc1c943f03c87e5fe","last_reissued_at":"2026-07-05T08:32:38.994381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:38.994381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Maximum Consensus over Noisy Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.DC","authors_text":"Ehsan Lari, Naveen K. D. Venkategowda, Reza Arablouei, Stefan Werner","submitted_at":"2024-03-27T12:39:16Z","abstract_excerpt":"We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC), for estimating the maximum value within a multi-agent network in the presence of noisy communication links. Our approach entails redefining the maximum consensus problem as a distributed optimization problem, allowing a solution using the alternating direction method of multipliers. Unlike existing algorithms that rely on multiple sets of noise-corrupted estimates, RD-MC employs a single set, enhancing both robustness and efficiency. To further mitigate the effects of link noise and improve robustn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.18509","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/2403.18509/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":"2403.18509","created_at":"2026-07-05T08:32:38.994440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.18509v2","created_at":"2026-07-05T08:32:38.994440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.18509","created_at":"2026-07-05T08:32:38.994440+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTXXADZEHPYA","created_at":"2026-07-05T08:32:38.994440+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTXXADZEHPYAJQU7","created_at":"2026-07-05T08:32:38.994440+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTXXADZE","created_at":"2026-07-05T08:32:38.994440+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/TTXXADZEHPYAJQU7HD3APOGAZF","json":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF.json","graph_json":"https://pith.science/api/pith-number/TTXXADZEHPYAJQU7HD3APOGAZF/graph.json","events_json":"https://pith.science/api/pith-number/TTXXADZEHPYAJQU7HD3APOGAZF/events.json","paper":"https://pith.science/paper/TTXXADZE"},"agent_actions":{"view_html":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF","download_json":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF.json","view_paper":"https://pith.science/paper/TTXXADZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.18509&json=true","fetch_graph":"https://pith.science/api/pith-number/TTXXADZEHPYAJQU7HD3APOGAZF/graph.json","fetch_events":"https://pith.science/api/pith-number/TTXXADZEHPYAJQU7HD3APOGAZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF/action/storage_attestation","attest_author":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF/action/author_attestation","sign_citation":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF/action/citation_signature","submit_replication":"https://pith.science/pith/TTXXADZEHPYAJQU7HD3APOGAZF/action/replication_record"}},"created_at":"2026-07-05T08:32:38.994440+00:00","updated_at":"2026-07-05T08:32:38.994440+00:00"}