{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:B5UA5XUEGMWDW6IZDNPAQPHA7Y","short_pith_number":"pith:B5UA5XUE","schema_version":"1.0","canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","source":{"kind":"arxiv","id":"1109.6391","version":1},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part I: Statistical Moments Analysis Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Alejandro D. Dominguez-Garcia, Christoforos N. Hadjicostis, Nitin H. Vaidya","submitted_at":"2011-09-29T03:21:29Z","abstract_excerpt":"This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which unreliable communication links may drop packets. We consider a setup where communication links between components can be asymmetric (i.e., component j might be able to send information to component i, but not necessarily vice-versa), so that the information exchange between components in the system is in general described by a directed graph that is assumed to be strongly connected. In the absence of communication li"},"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":"1109.6391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-29T03:21:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"665e5516e541cdff3f52d28fa7697827a8dbff95fccbde861766e29433b508d1","abstract_canon_sha256":"f3a2db5482a85eb3bea4cf1547b98763844e4fb86a1ed89df79e08d13a3a4c59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:01.656320Z","signature_b64":"G2LYBfhTL/souHjxpQOem+WsFXXQ+KWMAmburXDUJ2gdMaNyw4vCAqv/diWfaGEUo17dRPt7iX5iZugooMwVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","last_reissued_at":"2026-05-18T04:12:01.655842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:01.655842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part I: Statistical Moments Analysis Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Alejandro D. Dominguez-Garcia, Christoforos N. Hadjicostis, Nitin H. Vaidya","submitted_at":"2011-09-29T03:21:29Z","abstract_excerpt":"This two-part paper discusses robustification methodologies for linear-iterative distributed algorithms for consensus and coordination problems in multicomponent systems, in which unreliable communication links may drop packets. We consider a setup where communication links between components can be asymmetric (i.e., component j might be able to send information to component i, but not necessarily vice-versa), so that the information exchange between components in the system is in general described by a directed graph that is assumed to be strongly connected. In the absence of communication li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6391","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":""},"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":"1109.6391","created_at":"2026-05-18T04:12:01.655916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6391v1","created_at":"2026-05-18T04:12:01.655916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6391","created_at":"2026-05-18T04:12:01.655916+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5UA5XUEGMWD","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5UA5XUEGMWDW6IZ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5UA5XUE","created_at":"2026-05-18T12:26:24.575870+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/B5UA5XUEGMWDW6IZDNPAQPHA7Y","json":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y.json","graph_json":"https://pith.science/api/pith-number/B5UA5XUEGMWDW6IZDNPAQPHA7Y/graph.json","events_json":"https://pith.science/api/pith-number/B5UA5XUEGMWDW6IZDNPAQPHA7Y/events.json","paper":"https://pith.science/paper/B5UA5XUE"},"agent_actions":{"view_html":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y","download_json":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y.json","view_paper":"https://pith.science/paper/B5UA5XUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6391&json=true","fetch_graph":"https://pith.science/api/pith-number/B5UA5XUEGMWDW6IZDNPAQPHA7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/B5UA5XUEGMWDW6IZDNPAQPHA7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/action/storage_attestation","attest_author":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/action/author_attestation","sign_citation":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/action/citation_signature","submit_replication":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/action/replication_record"}},"created_at":"2026-05-18T04:12:01.655916+00:00","updated_at":"2026-05-18T04:12:01.655916+00:00"}