{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QWIEHQGAB4W64QN4V56S52PNTL","short_pith_number":"pith:QWIEHQGA","canonical_record":{"source":{"id":"0906.0651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-06-03T06:39:38Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"3eddc350bc69ff220b4ab39177442c7c8e98cc51a9e6b7a8becb8e94b0467a2c","abstract_canon_sha256":"9acc85a438fc8aca375901fa57f69884cbf9be872da13f18973ad59f7dc05c64"},"schema_version":"1.0"},"canonical_sha256":"859043c0c00f2dee41bcaf7d2ee9ed9ae7f592e4831480720861f91479d41b46","source":{"kind":"arxiv","id":"0906.0651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0651","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0651v1","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0651","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"QWIEHQGAB4W6","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QWIEHQGAB4W64QN4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QWIEHQGA","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QWIEHQGAB4W64QN4V56S52PNTL","target":"record","payload":{"canonical_record":{"source":{"id":"0906.0651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-06-03T06:39:38Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"3eddc350bc69ff220b4ab39177442c7c8e98cc51a9e6b7a8becb8e94b0467a2c","abstract_canon_sha256":"9acc85a438fc8aca375901fa57f69884cbf9be872da13f18973ad59f7dc05c64"},"schema_version":"1.0"},"canonical_sha256":"859043c0c00f2dee41bcaf7d2ee9ed9ae7f592e4831480720861f91479d41b46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:29.448131Z","signature_b64":"K/ZgqBAEeS4qcg8C2nF3wMJyT5//H8JhZurtHn/2aDPku7Ldj+VgMnPsy/3Y/FUCux3S+9cgw0A18m664tmEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859043c0c00f2dee41bcaf7d2ee9ed9ae7f592e4831480720861f91479d41b46","last_reissued_at":"2026-05-18T02:13:29.447209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:29.447209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.0651","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-18T02:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFEpjevSt9Bw4C4YwMqkCPNcNyMqgvKmNG5JAupG5SKPp6SRp2vRfmUf7SOTP65WbjCsTJ4O4p7VgpiMDAk0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:14:40.019348Z"},"content_sha256":"7bf6a6ad8284711acb6e9bf2176204fab12f95bc00d406ede547a97d2103b08f","schema_version":"1.0","event_id":"sha256:7bf6a6ad8284711acb6e9bf2176204fab12f95bc00d406ede547a97d2103b08f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QWIEHQGAB4W64QN4V56S52PNTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.DC","authors_text":"INRIA Futurs), INRIA Rocquencourt), Maria Potop-Butucaru (LIP6, S\\'ebastien Tixeuil (LIP6, Zohir Bouzid (LIP6)","submitted_at":"2009-06-03T06:39:38Z","abstract_excerpt":"We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimensional space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0651","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-18T02:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FzJg9mO0Nd1Tv+JfJuK36F3AU72oV8rkJNek+BLQwHf32ToBw2pfeBcCdQPujiTCcV8WvG5TnSKKm7IJYv0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:14:40.019691Z"},"content_sha256":"5bd940cbc4a0a878b7e5aaeccb5f955d4c2620f6cd2c82a0339e04710253373c","schema_version":"1.0","event_id":"sha256:5bd940cbc4a0a878b7e5aaeccb5f955d4c2620f6cd2c82a0339e04710253373c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWIEHQGAB4W64QN4V56S52PNTL/bundle.json","state_url":"https://pith.science/pith/QWIEHQGAB4W64QN4V56S52PNTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWIEHQGAB4W64QN4V56S52PNTL/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-04T13:14:40Z","links":{"resolver":"https://pith.science/pith/QWIEHQGAB4W64QN4V56S52PNTL","bundle":"https://pith.science/pith/QWIEHQGAB4W64QN4V56S52PNTL/bundle.json","state":"https://pith.science/pith/QWIEHQGAB4W64QN4V56S52PNTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWIEHQGAB4W64QN4V56S52PNTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QWIEHQGAB4W64QN4V56S52PNTL","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":"9acc85a438fc8aca375901fa57f69884cbf9be872da13f18973ad59f7dc05c64","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-06-03T06:39:38Z","title_canon_sha256":"3eddc350bc69ff220b4ab39177442c7c8e98cc51a9e6b7a8becb8e94b0467a2c"},"schema_version":"1.0","source":{"id":"0906.0651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0651","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0651v1","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0651","created_at":"2026-05-18T02:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"QWIEHQGAB4W6","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QWIEHQGAB4W64QN4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QWIEHQGA","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:5bd940cbc4a0a878b7e5aaeccb5f955d4c2620f6cd2c82a0339e04710253373c","target":"graph","created_at":"2026-05-18T02:13:29Z","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":"We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimensional space.","authors_text":"INRIA Futurs), INRIA Rocquencourt), Maria Potop-Butucaru (LIP6, S\\'ebastien Tixeuil (LIP6, Zohir Bouzid (LIP6)","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-06-03T06:39:38Z","title":"Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0651","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:7bf6a6ad8284711acb6e9bf2176204fab12f95bc00d406ede547a97d2103b08f","target":"record","created_at":"2026-05-18T02:13:29Z","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":"9acc85a438fc8aca375901fa57f69884cbf9be872da13f18973ad59f7dc05c64","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2009-06-03T06:39:38Z","title_canon_sha256":"3eddc350bc69ff220b4ab39177442c7c8e98cc51a9e6b7a8becb8e94b0467a2c"},"schema_version":"1.0","source":{"id":"0906.0651","kind":"arxiv","version":1}},"canonical_sha256":"859043c0c00f2dee41bcaf7d2ee9ed9ae7f592e4831480720861f91479d41b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"859043c0c00f2dee41bcaf7d2ee9ed9ae7f592e4831480720861f91479d41b46","first_computed_at":"2026-05-18T02:13:29.447209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:29.447209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/ZgqBAEeS4qcg8C2nF3wMJyT5//H8JhZurtHn/2aDPku7Ldj+VgMnPsy/3Y/FUCux3S+9cgw0A18m664tmEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:29.448131Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.0651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bf6a6ad8284711acb6e9bf2176204fab12f95bc00d406ede547a97d2103b08f","sha256:5bd940cbc4a0a878b7e5aaeccb5f955d4c2620f6cd2c82a0339e04710253373c"],"state_sha256":"ef7efd01896123c05e30c7958f5f7033834b3aa9601548da7197ee66c2390c58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OhpNYbCPTCfFp9tfvCEZQeblz4CWrgIMnL4DYE0WcL+5sjzsPdCgfadzxo5egUeshIi3a3RO4dy38d79yw18Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:14:40.021668Z","bundle_sha256":"aac282c6a0500fc4ed99b9ab45b2bf327c3f88c913f2fdbade28ef35b48e42d8"}}