{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JFRMST3MXEWVEBFESOAEBGQYU5","short_pith_number":"pith:JFRMST3M","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"},"canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","source":{"kind":"arxiv","id":"1512.06227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06227","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06227v1","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06227","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"JFRMST3MXEWV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JFRMST3MXEWVEBFE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JFRMST3M","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JFRMST3MXEWVEBFESOAEBGQYU5","target":"record","payload":{"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"},"canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","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"},"source_kind":"arxiv","source_id":"1512.06227","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:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45r4/vA3cxMr3Dz+fP1aEoZSuPOXguPThQwj0q+/36zP8ewqlIFzLHTmK3wx4j68AVPq7zhSnaI+8ZJYjZhECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:27:46.843627Z"},"content_sha256":"387b501c51d5c48cc9164bf4c9095666465991afcedc1e760cf899d692eefd39","schema_version":"1.0","event_id":"sha256:387b501c51d5c48cc9164bf4c9095666465991afcedc1e760cf899d692eefd39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JFRMST3MXEWVEBFESOAEBGQYU5","target":"graph","payload":{"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"},"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:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNdijGzZKsGDuHkiA3eqHKKBbFLTUkXvnX7WsxA+LxYVvNcHQEZMouv0wE7LMgZLQ0ye7OCATAFmzdddg06rAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:27:46.844302Z"},"content_sha256":"5cb94ce32073fb0d56d738a21c4f8e87c3f5aec0f9d5b3858940cd8ca5631e7b","schema_version":"1.0","event_id":"sha256:5cb94ce32073fb0d56d738a21c4f8e87c3f5aec0f9d5b3858940cd8ca5631e7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/bundle.json","state_url":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFRMST3MXEWVEBFESOAEBGQYU5/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-28T20:27:46Z","links":{"resolver":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5","bundle":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/bundle.json","state":"https://pith.science/pith/JFRMST3MXEWVEBFESOAEBGQYU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFRMST3MXEWVEBFESOAEBGQYU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JFRMST3MXEWVEBFESOAEBGQYU5","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":"01e4fe71e032c12f7a7abac76393a68a83382d2b41dd3e75b32efa880f182d22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-19T11:39:23Z","title_canon_sha256":"42fa5ab18941cd0a625610bb52f94d5b6914579833fc22905e3450778287db5d"},"schema_version":"1.0","source":{"id":"1512.06227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06227","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06227v1","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06227","created_at":"2026-05-18T01:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"JFRMST3MXEWV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JFRMST3MXEWVEBFE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JFRMST3M","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:5cb94ce32073fb0d56d738a21c4f8e87c3f5aec0f9d5b3858940cd8ca5631e7b","target":"graph","created_at":"2026-05-18T01:24:01Z","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 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.","authors_text":"Damien Imbs, Michel Raynal, Zohir Bouzid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-19T11:39:23Z","title":"A Necessary Condition for Byzantine $k$-Set Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06227","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:387b501c51d5c48cc9164bf4c9095666465991afcedc1e760cf899d692eefd39","target":"record","created_at":"2026-05-18T01:24:01Z","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":"01e4fe71e032c12f7a7abac76393a68a83382d2b41dd3e75b32efa880f182d22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-19T11:39:23Z","title_canon_sha256":"42fa5ab18941cd0a625610bb52f94d5b6914579833fc22905e3450778287db5d"},"schema_version":"1.0","source":{"id":"1512.06227","kind":"arxiv","version":1}},"canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4962c94f6cb92d5204a49380409a18a743cc7cac45fad0048c6ddcab539d711c","first_computed_at":"2026-05-18T01:24:01.113566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:01.113566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zS8MXDeKCY36BKcw2Q9R7yHRW6GGh8QwX6CNlR4XbVICWu3X6S9+N4FSEka5AFRyks/eej+RV57Kjn54PHYtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:01.114268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:387b501c51d5c48cc9164bf4c9095666465991afcedc1e760cf899d692eefd39","sha256:5cb94ce32073fb0d56d738a21c4f8e87c3f5aec0f9d5b3858940cd8ca5631e7b"],"state_sha256":"6913181e83a00ac677b118655503412b9a0bf8d8a37897859a26a5cbc2680f4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ips8E63YUk538jL+8ZtIMzWLw7HZPphusmUJbdHWeD6EIK6HQaG0O4z8BhSL4iznEw3X2/rWlQzXpB0+XAdfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:27:46.847945Z","bundle_sha256":"8f73576f133125cfc4734714c5be4a64f2dcd75a4e640f7965d6c58cca7c8119"}}