{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BDFZPKYGZDO6TDI2QW5QEWI2QE","short_pith_number":"pith:BDFZPKYG","canonical_record":{"source":{"id":"1007.2738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-16T10:53:17Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0209e6d845d87edab6396e407156b61ed3bfc291499477e4830515ea71230327","abstract_canon_sha256":"7f2caa676f8239282d82df8296bd56f2ea78df88cb7426ba0e957d64e6720ea7"},"schema_version":"1.0"},"canonical_sha256":"08cb97ab06c8dde98d1a85bb02591a81380da1eb74480351aead4ae2a69ff1bc","source":{"kind":"arxiv","id":"1007.2738","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2738","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2738v4","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2738","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"BDFZPKYGZDO6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BDFZPKYGZDO6TDI2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BDFZPKYG","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BDFZPKYGZDO6TDI2QW5QEWI2QE","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-16T10:53:17Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0209e6d845d87edab6396e407156b61ed3bfc291499477e4830515ea71230327","abstract_canon_sha256":"7f2caa676f8239282d82df8296bd56f2ea78df88cb7426ba0e957d64e6720ea7"},"schema_version":"1.0"},"canonical_sha256":"08cb97ab06c8dde98d1a85bb02591a81380da1eb74480351aead4ae2a69ff1bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.239956Z","signature_b64":"XvFjil3+pJ84MOqizRIBGVHRw8HaLHe8T/jy4oD6/J8NGy0x+m5vdI3hbQsyel8pnhFvw7KIpxkUF6EEE9wLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08cb97ab06c8dde98d1a85bb02591a81380da1eb74480351aead4ae2a69ff1bc","last_reissued_at":"2026-05-18T04:24:06.239521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.239521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2738","source_version":4,"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:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVNM2xa1gFF+dfnV9NiiJ990ZxQPInkPU9pig8w9spTrlyCY+grwXYmAhNMn81IVHvUQc+DVv3QWbBj470dnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:51.356214Z"},"content_sha256":"777c05ed678d6696f153980557b337173187f5155a72daf3079b504811a3aa7d","schema_version":"1.0","event_id":"sha256:777c05ed678d6696f153980557b337173187f5155a72daf3079b504811a3aa7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BDFZPKYGZDO6TDI2QW5QEWI2QE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus Computation in Unreliable Networks: A System Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Antonio Bicchi, Fabio Pasqualetti, Francesco Bullo","submitted_at":"2010-07-16T10:53:17Z","abstract_excerpt":"This work addresses the problem of ensuring trustworthy computation in a linear consensus network. A solution to this problem is relevant for several tasks in multi-agent systems including motion coordination, clock synchronization, and cooperative estimation. In a linear consensus network, we allow for the presence of misbehaving agents, whose behavior deviate from the nominal consensus evolution. We model misbehaviors as unknown and unmeasurable inputs affecting the network, and we cast the misbehavior detection and identification problem into an unknown-input system theoretic framework. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2738","kind":"arxiv","version":4},"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:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODrGmeFw39k5KKBmA99D5A6rlScwxtUOMf37LitCl7w1Xwpx3XQzZS1r99f+YAsWw76PDGVVLvs4V5GwTxSjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:51.356861Z"},"content_sha256":"e1d8cac83cabe97631d0b946fa86b236d2a8f0a22937b2b68bfc191ed50f7f59","schema_version":"1.0","event_id":"sha256:e1d8cac83cabe97631d0b946fa86b236d2a8f0a22937b2b68bfc191ed50f7f59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/bundle.json","state_url":"https://pith.science/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/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-06T16:34:51Z","links":{"resolver":"https://pith.science/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE","bundle":"https://pith.science/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/bundle.json","state":"https://pith.science/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDFZPKYGZDO6TDI2QW5QEWI2QE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BDFZPKYGZDO6TDI2QW5QEWI2QE","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":"7f2caa676f8239282d82df8296bd56f2ea78df88cb7426ba0e957d64e6720ea7","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-16T10:53:17Z","title_canon_sha256":"0209e6d845d87edab6396e407156b61ed3bfc291499477e4830515ea71230327"},"schema_version":"1.0","source":{"id":"1007.2738","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2738","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2738v4","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2738","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"BDFZPKYGZDO6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BDFZPKYGZDO6TDI2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BDFZPKYG","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:e1d8cac83cabe97631d0b946fa86b236d2a8f0a22937b2b68bfc191ed50f7f59","target":"graph","created_at":"2026-05-18T04:24:06Z","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 work addresses the problem of ensuring trustworthy computation in a linear consensus network. A solution to this problem is relevant for several tasks in multi-agent systems including motion coordination, clock synchronization, and cooperative estimation. In a linear consensus network, we allow for the presence of misbehaving agents, whose behavior deviate from the nominal consensus evolution. We model misbehaviors as unknown and unmeasurable inputs affecting the network, and we cast the misbehavior detection and identification problem into an unknown-input system theoretic framework. We ","authors_text":"Antonio Bicchi, Fabio Pasqualetti, Francesco Bullo","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-16T10:53:17Z","title":"Consensus Computation in Unreliable Networks: A System Theoretic Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2738","kind":"arxiv","version":4},"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:777c05ed678d6696f153980557b337173187f5155a72daf3079b504811a3aa7d","target":"record","created_at":"2026-05-18T04:24:06Z","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":"7f2caa676f8239282d82df8296bd56f2ea78df88cb7426ba0e957d64e6720ea7","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-16T10:53:17Z","title_canon_sha256":"0209e6d845d87edab6396e407156b61ed3bfc291499477e4830515ea71230327"},"schema_version":"1.0","source":{"id":"1007.2738","kind":"arxiv","version":4}},"canonical_sha256":"08cb97ab06c8dde98d1a85bb02591a81380da1eb74480351aead4ae2a69ff1bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08cb97ab06c8dde98d1a85bb02591a81380da1eb74480351aead4ae2a69ff1bc","first_computed_at":"2026-05-18T04:24:06.239521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:06.239521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XvFjil3+pJ84MOqizRIBGVHRw8HaLHe8T/jy4oD6/J8NGy0x+m5vdI3hbQsyel8pnhFvw7KIpxkUF6EEE9wLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:06.239956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2738","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:777c05ed678d6696f153980557b337173187f5155a72daf3079b504811a3aa7d","sha256:e1d8cac83cabe97631d0b946fa86b236d2a8f0a22937b2b68bfc191ed50f7f59"],"state_sha256":"61ab2b713eceb19db73607d1f2379ac6434a119ff581615668187acdad994892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOvUrkyiDEAeduD9b0AjauAdUoBGW9ry7ZL7QoZJm4Xv9E6Je0iUv2rDsl6+WK7XSg5Vhp0yrLsAN8Shu+fwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:34:51.359697Z","bundle_sha256":"a207c21839d0a89e16956050b73fe36249b9a91e37d1fc655c38f38d92294179"}}