{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:P4FBWCG3HBE37DTIGMPCJGI5ZG","short_pith_number":"pith:P4FBWCG3","schema_version":"1.0","canonical_sha256":"7f0a1b08db3849bf8e68331e24991dc99619785c5e38120d8cfadc5348175a74","source":{"kind":"arxiv","id":"1210.4640","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4640","created_at":"2026-05-18T03:42:56.582050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4640v1","created_at":"2026-05-18T03:42:56.582050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4640","created_at":"2026-05-18T03:42:56.582050+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4FBWCG3HBE3","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4FBWCG3HBE37DTI","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4FBWCG3","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG","json":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG.json","graph_json":"https://pith.science/api/pith-number/P4FBWCG3HBE37DTIGMPCJGI5ZG/graph.json","events_json":"https://pith.science/api/pith-number/P4FBWCG3HBE37DTIGMPCJGI5ZG/events.json","paper":"https://pith.science/paper/P4FBWCG3"},"agent_actions":{"view_html":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG","download_json":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG.json","view_paper":"https://pith.science/paper/P4FBWCG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4640&json=true","fetch_graph":"https://pith.science/api/pith-number/P4FBWCG3HBE37DTIGMPCJGI5ZG/graph.json","fetch_events":"https://pith.science/api/pith-number/P4FBWCG3HBE37DTIGMPCJGI5ZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/action/storage_attestation","attest_author":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/action/author_attestation","sign_citation":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/action/citation_signature","submit_replication":"https://pith.science/pith/P4FBWCG3HBE37DTIGMPCJGI5ZG/action/replication_record"}},"created_at":"2026-05-18T03:42:56.582050+00:00","updated_at":"2026-05-18T03:42:56.582050+00:00"}