{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C3QCVGMKT6BO5B4CAHBYE2X2G5","short_pith_number":"pith:C3QCVGMK","canonical_record":{"source":{"id":"1810.10086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T15:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"d38d3a8b57e5467c77776e03b0e9d1af2a3a493c0e657e7b56a85e94d77595d0","abstract_canon_sha256":"08a93452a71078a615db2fb77d67144d0fc3b2945a938190801cbb89adf974a3"},"schema_version":"1.0"},"canonical_sha256":"16e02a998a9f82ee878201c3826afa3772ffb804929632fe0574abd0e4666a8f","source":{"kind":"arxiv","id":"1810.10086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10086","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10086v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10086","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"C3QCVGMKT6BO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C3QCVGMKT6BO5B4C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C3QCVGMK","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C3QCVGMKT6BO5B4CAHBYE2X2G5","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T15:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"d38d3a8b57e5467c77776e03b0e9d1af2a3a493c0e657e7b56a85e94d77595d0","abstract_canon_sha256":"08a93452a71078a615db2fb77d67144d0fc3b2945a938190801cbb89adf974a3"},"schema_version":"1.0"},"canonical_sha256":"16e02a998a9f82ee878201c3826afa3772ffb804929632fe0574abd0e4666a8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.297521Z","signature_b64":"XuhCArm7Zcofy3f3aBcP8P6CFZH1NreBTC8IZujJO2Nv6fJEOYVT8Uwb7dOpesx01yQBd9BgVIngBD3ClGK4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16e02a998a9f82ee878201c3826afa3772ffb804929632fe0574abd0e4666a8f","last_reissued_at":"2026-05-18T00:02:24.296179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.296179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10086","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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtXyA1kcPykTqLa60ZtP9kejtQLaocNXQDpoyZXjBwXglguNx4LrN9HMYpQRSZjAbN0hXIw9W/MncKFvqBqTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:32:27.387875Z"},"content_sha256":"35963efb26000af07d3119ed16c7484da6dbcbd67d1436da476c5374ca78f03a","schema_version":"1.0","event_id":"sha256:35963efb26000af07d3119ed16c7484da6dbcbd67d1436da476c5374ca78f03a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C3QCVGMKT6BO5B4CAHBYE2X2G5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Lili Su, Shahin Shahrampour","submitted_at":"2018-10-16T15:47:47Z","abstract_excerpt":"This work considers resilient, cooperative state estimation in unreliable multi-agent networks. A network of agents aims to collaboratively estimate the value of an unknown vector parameter, while an {\\em unknown} subset of agents suffer Byzantine faults. Faulty agents malfunction arbitrarily and may send out {\\em highly unstructured} messages to other agents in the network. As opposed to fault-free networks, reaching agreement in the presence of Byzantine faults is far from trivial. In this paper, we propose a computationally-efficient algorithm that is provably robust to Byzantine faults. At"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10086","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-18T00:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SizZgjFw1Q20T8/PXYROWITY2H8qesgjMsLEQTezllUiBwnles/7extzv8d4PH/gsnNqQ3tsbBHIqc/S+r1qBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:32:27.388298Z"},"content_sha256":"7ed6d88f655200addcb0bcbd237a7db2d95c5cc89a28190fd0907639d56bff9b","schema_version":"1.0","event_id":"sha256:7ed6d88f655200addcb0bcbd237a7db2d95c5cc89a28190fd0907639d56bff9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/bundle.json","state_url":"https://pith.science/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/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-05-28T16:32:27Z","links":{"resolver":"https://pith.science/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5","bundle":"https://pith.science/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/bundle.json","state":"https://pith.science/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3QCVGMKT6BO5B4CAHBYE2X2G5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C3QCVGMKT6BO5B4CAHBYE2X2G5","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":"08a93452a71078a615db2fb77d67144d0fc3b2945a938190801cbb89adf974a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T15:47:47Z","title_canon_sha256":"d38d3a8b57e5467c77776e03b0e9d1af2a3a493c0e657e7b56a85e94d77595d0"},"schema_version":"1.0","source":{"id":"1810.10086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10086","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10086v1","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10086","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"C3QCVGMKT6BO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C3QCVGMKT6BO5B4C","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C3QCVGMK","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7ed6d88f655200addcb0bcbd237a7db2d95c5cc89a28190fd0907639d56bff9b","target":"graph","created_at":"2026-05-18T00:02:24Z","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 considers resilient, cooperative state estimation in unreliable multi-agent networks. A network of agents aims to collaboratively estimate the value of an unknown vector parameter, while an {\\em unknown} subset of agents suffer Byzantine faults. Faulty agents malfunction arbitrarily and may send out {\\em highly unstructured} messages to other agents in the network. As opposed to fault-free networks, reaching agreement in the presence of Byzantine faults is far from trivial. In this paper, we propose a computationally-efficient algorithm that is provably robust to Byzantine faults. At","authors_text":"Lili Su, Shahin Shahrampour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T15:47:47Z","title":"Finite-time Guarantees for Byzantine-Resilient Distributed State Estimation with Noisy Measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10086","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:35963efb26000af07d3119ed16c7484da6dbcbd67d1436da476c5374ca78f03a","target":"record","created_at":"2026-05-18T00:02:24Z","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":"08a93452a71078a615db2fb77d67144d0fc3b2945a938190801cbb89adf974a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-10-16T15:47:47Z","title_canon_sha256":"d38d3a8b57e5467c77776e03b0e9d1af2a3a493c0e657e7b56a85e94d77595d0"},"schema_version":"1.0","source":{"id":"1810.10086","kind":"arxiv","version":1}},"canonical_sha256":"16e02a998a9f82ee878201c3826afa3772ffb804929632fe0574abd0e4666a8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16e02a998a9f82ee878201c3826afa3772ffb804929632fe0574abd0e4666a8f","first_computed_at":"2026-05-18T00:02:24.296179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.296179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XuhCArm7Zcofy3f3aBcP8P6CFZH1NreBTC8IZujJO2Nv6fJEOYVT8Uwb7dOpesx01yQBd9BgVIngBD3ClGK4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.297521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35963efb26000af07d3119ed16c7484da6dbcbd67d1436da476c5374ca78f03a","sha256:7ed6d88f655200addcb0bcbd237a7db2d95c5cc89a28190fd0907639d56bff9b"],"state_sha256":"b8bde6a7c29ab3c2c556c9c6da0968b4fdefe3caee22fe6eecb16723293dfa20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjnD8Y3MShmdoOrbOWu6nqvoPnWKB5EY+0l+X9Wl9+YeBvh/bqztAJ9OGIoniXu09M9Udo1FlbMDOku5H8JcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:32:27.390832Z","bundle_sha256":"bcabe0086067e4efc3be48b9980f24fb660e86458eb8d10b12490c261e6048aa"}}