{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JFRMST3MXEWVEBFESOAEBGQYU5","short_pith_number":"pith:JFRMST3M","schema_version":"1.0","canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","source":{"kind":"arxiv","id":"1512.06227","version":1},"attestation_state":"computed","paper":{"title":"A Necessary Condition for Byzantine $k$-Set Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Michel Raynal, Zohir Bouzid","submitted_at":"2015-12-19T11:39:23Z","abstract_excerpt":"This short paper presents a necessary condition for Byzantine $k$-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer multi-reader registers. It gives a proof, which is particularly simple, that $k$-set agreement cannot be solved $t$-resiliently in an $n$-process system when $n \\leq 2t + \\frac{t}{k}$. This bound is tight for the case $k=1$ (Byzantine consensus) in synchronous message-passing systems."},"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":"1512.06227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-19T11:39:23Z","cross_cats_sorted":[],"title_canon_sha256":"42fa5ab18941cd0a625610bb52f94d5b6914579833fc22905e3450778287db5d","abstract_canon_sha256":"01e4fe71e032c12f7a7abac76393a68a83382d2b41dd3e75b32efa880f182d22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:01.114268Z","signature_b64":"zS8MXDeKCY36BKcw2Q9R7yHRW6GGh8QwX6CNlR4XbVICWu3X6S9+N4FSEka5AFRyks/eej+RV57Kjn54PHYtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","last_reissued_at":"2026-05-18T01:24:01.113566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:01.113566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Necessary Condition for Byzantine $k$-Set Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Michel Raynal, Zohir Bouzid","submitted_at":"2015-12-19T11:39:23Z","abstract_excerpt":"This short paper presents a necessary condition for Byzantine $k$-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer multi-reader registers. It gives a proof, which is particularly simple, that $k$-set agreement cannot be solved $t$-resiliently in an $n$-process system when $n \\leq 2t + \\frac{t}{k}$. This bound is tight for the case $k=1$ (Byzantine consensus) in synchronous message-passing systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06227","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":"1512.06227","created_at":"2026-05-18T01:24:01.113691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06227v1","created_at":"2026-05-18T01:24:01.113691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06227","created_at":"2026-05-18T01:24:01.113691+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFRMST3MXEWV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFRMST3MXEWVEBFE","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFRMST3M","created_at":"2026-05-18T12:29:27.538025+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/JFRMST3MXEWVEBFESOAEBGQYU5","json":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5.json","graph_json":"https://pith.science/api/pith-number/JFRMST3MXEWVEBFESOAEBGQYU5/graph.json","events_json":"https://pith.science/api/pith-number/JFRMST3MXEWVEBFESOAEBGQYU5/events.json","paper":"https://pith.science/paper/JFRMST3M"},"agent_actions":{"view_html":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5","download_json":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5.json","view_paper":"https://pith.science/paper/JFRMST3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06227&json=true","fetch_graph":"https://pith.science/api/pith-number/JFRMST3MXEWVEBFESOAEBGQYU5/graph.json","fetch_events":"https://pith.science/api/pith-number/JFRMST3MXEWVEBFESOAEBGQYU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/action/storage_attestation","attest_author":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/action/author_attestation","sign_citation":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/action/citation_signature","submit_replication":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/action/replication_record"}},"created_at":"2026-05-18T01:24:01.113691+00:00","updated_at":"2026-05-18T01:24:01.113691+00:00"}