{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P4FBWCG3HBE37DTIGMPCJGI5ZG","short_pith_number":"pith:P4FBWCG3","canonical_record":{"source":{"id":"1210.4640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-17T06:44:27Z","cross_cats_sorted":["cs.CR","cs.NI"],"title_canon_sha256":"084792ab52977bd761228faa3f7675a8d6d91440256993c69530e7a315c1d082","abstract_canon_sha256":"869db9f64c746873037e9b2b124678caa8600cea83327588e333b72936986f90"},"schema_version":"1.0"},"canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","source":{"kind":"arxiv","id":"1210.4640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4640","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4640v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4640","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"P4FBWCG3HBE3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P4FBWCG3HBE37DTI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P4FBWCG3","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P4FBWCG3HBE37DTIGMPCJGI5ZG","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-17T06:44:27Z","cross_cats_sorted":["cs.CR","cs.NI"],"title_canon_sha256":"084792ab52977bd761228faa3f7675a8d6d91440256993c69530e7a315c1d082","abstract_canon_sha256":"869db9f64c746873037e9b2b124678caa8600cea83327588e333b72936986f90"},"schema_version":"1.0"},"canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:56.582493Z","signature_b64":"HYtQbLkj6/iYHXn8lYmWEkmUBJdShRYHKA7vU4KRTKjB4zgD1cUvKG5v8PDoJV7/X2uoqp+6nJWWWmUQreJMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","last_reissued_at":"2026-05-18T03:42:56.581961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:56.581961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4640","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-18T03:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5KqRQGQcoGhhslO40PaS7n2NuocW3KepujgvAYaGxWQTUDPcZ4HbzN5QY4orj+kxK3FesXXPUiKt+D/DJJnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:58:00.677689Z"},"content_sha256":"0395821f4db84158ba5f711529809d6a07299792aecc8de4f94b17641b0b0a67","schema_version":"1.0","event_id":"sha256:0395821f4db84158ba5f711529809d6a07299792aecc8de4f94b17641b0b0a67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P4FBWCG3HBE37DTIGMPCJGI5ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Scalable Byzantine Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.NI"],"primary_cat":"cs.DC","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","submitted_at":"2012-10-17T06:44:27Z","abstract_excerpt":"Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees when the number of nodes keeps increasing unboundedly ? To be more specific, we consider the problem or reliably broadcasting information on an asynchron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4640","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-18T03:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utMp1jo+gJnmQG1QIQIrXondyQJ0VZaEX7uEtV2L9kFr9/0OUyATs17Z6B7ia/AcDN2UodHJXKcjfGo6MGdABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:58:00.678418Z"},"content_sha256":"39c86933d561de426ddb80db2f17c086fa05dedbd2f32331765eb9aa68f1170d","schema_version":"1.0","event_id":"sha256:39c86933d561de426ddb80db2f17c086fa05dedbd2f32331765eb9aa68f1170d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/bundle.json","state_url":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/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-23T09:58:00Z","links":{"resolver":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG","bundle":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/bundle.json","state":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P4FBWCG3HBE37DTIGMPCJGI5ZG","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":"869db9f64c746873037e9b2b124678caa8600cea83327588e333b72936986f90","cross_cats_sorted":["cs.CR","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-17T06:44:27Z","title_canon_sha256":"084792ab52977bd761228faa3f7675a8d6d91440256993c69530e7a315c1d082"},"schema_version":"1.0","source":{"id":"1210.4640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4640","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4640v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4640","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"P4FBWCG3HBE3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P4FBWCG3HBE37DTI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P4FBWCG3","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:39c86933d561de426ddb80db2f17c086fa05dedbd2f32331765eb9aa68f1170d","target":"graph","created_at":"2026-05-18T03:42:56Z","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":"Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees when the number of nodes keeps increasing unboundedly ? To be more specific, we consider the problem or reliably broadcasting information on an asynchron","authors_text":"Alexandre Maurer (LIP6, IUF), LINCS, LINCS), S\\'ebastien Tixeuil (LIP6","cross_cats":["cs.CR","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-17T06:44:27Z","title":"A Scalable Byzantine Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4640","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:0395821f4db84158ba5f711529809d6a07299792aecc8de4f94b17641b0b0a67","target":"record","created_at":"2026-05-18T03:42:56Z","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":"869db9f64c746873037e9b2b124678caa8600cea83327588e333b72936986f90","cross_cats_sorted":["cs.CR","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-10-17T06:44:27Z","title_canon_sha256":"084792ab52977bd761228faa3f7675a8d6d91440256993c69530e7a315c1d082"},"schema_version":"1.0","source":{"id":"1210.4640","kind":"arxiv","version":1}},"canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","first_computed_at":"2026-05-18T03:42:56.581961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:56.581961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYtQbLkj6/iYHXn8lYmWEkmUBJdShRYHKA7vU4KRTKjB4zgD1cUvKG5v8PDoJV7/X2uoqp+6nJWWWmUQreJMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:56.582493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0395821f4db84158ba5f711529809d6a07299792aecc8de4f94b17641b0b0a67","sha256:39c86933d561de426ddb80db2f17c086fa05dedbd2f32331765eb9aa68f1170d"],"state_sha256":"90c6ebef2ff67e7dee00ea10e1ee7e608e92b4a2f90b485f2d7e2e314af6ac6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3rw09DgY706WWXS8Emb8xVWSbnTHJX802rY1/cxB016xhcnxNhiVDyfTaWkAzhGuN6BKSBqBgYywcF89l+EBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T09:58:00.682350Z","bundle_sha256":"d468c9f24eb4410bc274350478a9000368c6e36be3f663ba944b06a4bdac36d5"}}