{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QONNRRYSXT4FZ5DCXBQXUSFNFI","short_pith_number":"pith:QONNRRYS","canonical_record":{"source":{"id":"1401.6615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"48bb1e8e31031507710086583e1a452cdc18c390518a345891844be2f576b40e","abstract_canon_sha256":"237d2eeec9bc4e7e867d5feaa777ba469dd2165b282c990162c9e273d3c1d2c3"},"schema_version":"1.0"},"canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","source":{"kind":"arxiv","id":"1401.6615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6615","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6615v1","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6615","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"QONNRRYSXT4F","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QONNRRYSXT4FZ5DC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QONNRRYS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QONNRRYSXT4FZ5DCXBQXUSFNFI","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"48bb1e8e31031507710086583e1a452cdc18c390518a345891844be2f576b40e","abstract_canon_sha256":"237d2eeec9bc4e7e867d5feaa777ba469dd2165b282c990162c9e273d3c1d2c3"},"schema_version":"1.0"},"canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:02.116385Z","signature_b64":"+Reyz7DhxM+pklEuoMOhDI2tXcxSEhObPCCb4fsQ7vY6OGnQ1ZipZ88G81+SIJfn6PODFZKrTVn5xDPpSSrhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","last_reissued_at":"2026-05-18T01:01:02.115620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:02.115620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6615","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-18T01:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMCUIZLks5UvCHLOHaMSVpEM5m9xrncyDC3Gu3juGFCaS2QiAWQ8mGtgHK3hvR4dSZcWwLdg2Yv94RCWd0DiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:50.971596Z"},"content_sha256":"acf0863ff9837eac19c06bb06753380356ca28c360cf147a033836ca18213e34","schema_version":"1.0","event_id":"sha256:acf0863ff9837eac19c06bb06753380356ca28c360cf147a033836ca18213e34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QONNRRYSXT4FZ5DCXBQXUSFNFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Approximate Consensus in the presence of Byzantine Link Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2014-01-26T05:45:02Z","abstract_excerpt":"This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free.\n  Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6615","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-18T01:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdsaG4yxDYffzNBDejhAa9u6OyuwAbNLVbqr78uXGfrIIBOyMiWZkNr/28HKE1N2q4vp0Xfjiv1uLeFK4+/qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:50.971946Z"},"content_sha256":"985aeff79a035db853ed5822dbc347d47a38dc14ded5369d14212e6b0e31dedc","schema_version":"1.0","event_id":"sha256:985aeff79a035db853ed5822dbc347d47a38dc14ded5369d14212e6b0e31dedc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/bundle.json","state_url":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/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-02T20:45:50Z","links":{"resolver":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI","bundle":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/bundle.json","state":"https://pith.science/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QONNRRYSXT4FZ5DCXBQXUSFNFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QONNRRYSXT4FZ5DCXBQXUSFNFI","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":"237d2eeec9bc4e7e867d5feaa777ba469dd2165b282c990162c9e273d3c1d2c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","title_canon_sha256":"48bb1e8e31031507710086583e1a452cdc18c390518a345891844be2f576b40e"},"schema_version":"1.0","source":{"id":"1401.6615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6615","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6615v1","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6615","created_at":"2026-05-18T01:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"QONNRRYSXT4F","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QONNRRYSXT4FZ5DC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QONNRRYS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:985aeff79a035db853ed5822dbc347d47a38dc14ded5369d14212e6b0e31dedc","target":"graph","created_at":"2026-05-18T01:01:02Z","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 paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are assumed to be fault-free.\n  Recent work has addressed the problem of reaching approximate consen- sus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain","authors_text":"Lewis Tseng, Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","title":"Iterative Approximate Consensus in the presence of Byzantine Link Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6615","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:acf0863ff9837eac19c06bb06753380356ca28c360cf147a033836ca18213e34","target":"record","created_at":"2026-05-18T01:01:02Z","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":"237d2eeec9bc4e7e867d5feaa777ba469dd2165b282c990162c9e273d3c1d2c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-01-26T05:45:02Z","title_canon_sha256":"48bb1e8e31031507710086583e1a452cdc18c390518a345891844be2f576b40e"},"schema_version":"1.0","source":{"id":"1401.6615","kind":"arxiv","version":1}},"canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"839ad8c712bcf85cf462b8617a48ad2a1d55b253695f68e4bef67eee0de2bdde","first_computed_at":"2026-05-18T01:01:02.115620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:02.115620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Reyz7DhxM+pklEuoMOhDI2tXcxSEhObPCCb4fsQ7vY6OGnQ1ZipZ88G81+SIJfn6PODFZKrTVn5xDPpSSrhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:02.116385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acf0863ff9837eac19c06bb06753380356ca28c360cf147a033836ca18213e34","sha256:985aeff79a035db853ed5822dbc347d47a38dc14ded5369d14212e6b0e31dedc"],"state_sha256":"9b7f304fe03b3cecd02780a18484c3258e7ddb7205faa6fbd81df3551ef91901"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Clc4fh8r+qJP8uo8XKZ4bFt93LeJJJXVbttukJHUipmKScRohbOb6+1EKKj2KiVUb0V2sJxjJf+HZYX8B3qfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:45:50.973966Z","bundle_sha256":"001d6743daccd38fbbd7d0ec8b48e0b5af15de366c1e332ca66e11c76a3d9379"}}