{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:B5UA5XUEGMWDW6IZDNPAQPHA7Y","short_pith_number":"pith:B5UA5XUE","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"},"canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","source":{"kind":"arxiv","id":"1109.6391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6391","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6391v1","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6391","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"B5UA5XUEGMWD","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B5UA5XUEGMWDW6IZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B5UA5XUE","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:B5UA5XUEGMWDW6IZDNPAQPHA7Y","target":"record","payload":{"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"},"canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","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"},"source_kind":"arxiv","source_id":"1109.6391","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSqjrfkCugew0K4K9BixWzVTzB4SmX6uOL9GqXwA3nJoZMoozLtd+Khsbh0gbkVjmgP7vktkk7D6NeizO7ZYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:32.191645Z"},"content_sha256":"3abe26d64a219ac29d8772bc0dd82a4048a14cdbfef0ae67e7d44fa486e34f4d","schema_version":"1.0","event_id":"sha256:3abe26d64a219ac29d8772bc0dd82a4048a14cdbfef0ae67e7d44fa486e34f4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:B5UA5XUEGMWDW6IZDNPAQPHA7Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51gBPdDVQDlNe24aOHpvNUyKS/xmkQWvZKxmENskVP89piIfWoA/7fXw0lC7Cj8lGBoB7Yx4uC+CUOQZnMc/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:32:32.191993Z"},"content_sha256":"f1ee37896d3bd2bb3d69cbb43d1a2f91a8a7f42a914b525538e5f811bb0191cd","schema_version":"1.0","event_id":"sha256:f1ee37896d3bd2bb3d69cbb43d1a2f91a8a7f42a914b525538e5f811bb0191cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/bundle.json","state_url":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T19:32:32Z","links":{"resolver":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y","bundle":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/bundle.json","state":"https://pith.science/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5UA5XUEGMWDW6IZDNPAQPHA7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:B5UA5XUEGMWDW6IZDNPAQPHA7Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f3a2db5482a85eb3bea4cf1547b98763844e4fb86a1ed89df79e08d13a3a4c59","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-29T03:21:29Z","title_canon_sha256":"665e5516e541cdff3f52d28fa7697827a8dbff95fccbde861766e29433b508d1"},"schema_version":"1.0","source":{"id":"1109.6391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6391","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6391v1","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6391","created_at":"2026-05-18T04:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"B5UA5XUEGMWD","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B5UA5XUEGMWDW6IZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B5UA5XUE","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:f1ee37896d3bd2bb3d69cbb43d1a2f91a8a7f42a914b525538e5f811bb0191cd","target":"graph","created_at":"2026-05-18T04:12:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alejandro D. Dominguez-Garcia, Christoforos N. Hadjicostis, Nitin H. Vaidya","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-29T03:21:29Z","title":"Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part I: Statistical Moments Analysis Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6391","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3abe26d64a219ac29d8772bc0dd82a4048a14cdbfef0ae67e7d44fa486e34f4d","target":"record","created_at":"2026-05-18T04:12:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f3a2db5482a85eb3bea4cf1547b98763844e4fb86a1ed89df79e08d13a3a4c59","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-09-29T03:21:29Z","title_canon_sha256":"665e5516e541cdff3f52d28fa7697827a8dbff95fccbde861766e29433b508d1"},"schema_version":"1.0","source":{"id":"1109.6391","kind":"arxiv","version":1}},"canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f680ede84332c3b79191b5e083ce0fe0d53b3f6b45b709f922f4e11e126292c","first_computed_at":"2026-05-18T04:12:01.655842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:01.655842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G2LYBfhTL/souHjxpQOem+WsFXXQ+KWMAmburXDUJ2gdMaNyw4vCAqv/diWfaGEUo17dRPt7iX5iZugooMwVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:01.656320Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3abe26d64a219ac29d8772bc0dd82a4048a14cdbfef0ae67e7d44fa486e34f4d","sha256:f1ee37896d3bd2bb3d69cbb43d1a2f91a8a7f42a914b525538e5f811bb0191cd"],"state_sha256":"b7a9b4d792a7c0a3b408a8dd4ead4989d8532235af2c4b9c00a09857014da5f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbyRq93pTsn9ILhusb7d5TBK2JEGxpASEOurDiJn3OYaThU5rgp5tLyfvH0n1qwPkFtqY+DXNAingwcU+Y6NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:32:32.194169Z","bundle_sha256":"ca761c7f3d1f0348fcc2a9119a976688a9e2075c2f1de529a26a326f2380e993"}}