{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OBSEGP3PWWIDPCXWZBGAEEJTBT","short_pith_number":"pith:OBSEGP3P","canonical_record":{"source":{"id":"1103.3671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-18T17:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"7893f26d0411fe39566e6c9678890766b57012319d49364f51b70d6a3566b999","abstract_canon_sha256":"766090f632bc1778d284efa40f55bbb2853ce9620b6699bbaa0d8291c688fc87"},"schema_version":"1.0"},"canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","source":{"kind":"arxiv","id":"1103.3671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3671","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3671v2","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3671","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"OBSEGP3PWWID","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBSEGP3PWWIDPCXW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBSEGP3P","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OBSEGP3PWWIDPCXWZBGAEEJTBT","target":"record","payload":{"canonical_record":{"source":{"id":"1103.3671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-18T17:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"7893f26d0411fe39566e6c9678890766b57012319d49364f51b70d6a3566b999","abstract_canon_sha256":"766090f632bc1778d284efa40f55bbb2853ce9620b6699bbaa0d8291c688fc87"},"schema_version":"1.0"},"canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:18.235089Z","signature_b64":"fmY4U/0N/bgz9/kZ8D70dmfNgsaqrH/xk+wUrRpg3j4LzagW1/1yKkUdFlFsFaorOIaRM6AJYmbRhw0nzsTPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","last_reissued_at":"2026-05-18T02:22:18.234256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:18.234256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.3671","source_version":2,"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:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZRPDFCi617LTzz9Jgu59nuFgSYt92avyuCRwFBtylCMtmZtCxCde3ybo1Pls7M+X7fVFCgL4g+sI7VVKMXZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:15.051663Z"},"content_sha256":"84e7dc50dc6867cdb021acac081df0b9f362b201ab77dfba58d88667a10d7bc3","schema_version":"1.0","event_id":"sha256:84e7dc50dc6867cdb021acac081df0b9f362b201ab77dfba58d88667a10d7bc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OBSEGP3PWWIDPCXWZBGAEEJTBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Martin Biely, Peter Robinson, Ulrich Schmid","submitted_at":"2011-03-18T17:31:41Z","abstract_excerpt":"Despite of being quite similar agreement problems, consensus and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than relatively simple bivalence arguments as in the impossibility proof for consensus (= 1-set agreement) in the presence of a single crash failure, known proofs for the impossibility of k-set agreement in systems with at least k>1 crash failures use algebraic topology or a variant of Sperner's Lemma. In this paper, we present a generic theorem for proving the impossibility of k-set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3671","kind":"arxiv","version":2},"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:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TFwFMlzasVO5ZUzipcxkLCq0A5kwsFKEwxrxCIXN7EcD4PgMBgx5BsSeMjc8ywuHt0xm6AbZCag0xPvPvTXzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:15.051990Z"},"content_sha256":"abb041b93d5fa709090519420cd83e76bfbbdb75f0bccbb489528cbb4f66ca76","schema_version":"1.0","event_id":"sha256:abb041b93d5fa709090519420cd83e76bfbbdb75f0bccbb489528cbb4f66ca76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/bundle.json","state_url":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/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-01T16:56:15Z","links":{"resolver":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT","bundle":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/bundle.json","state":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OBSEGP3PWWIDPCXWZBGAEEJTBT","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":"766090f632bc1778d284efa40f55bbb2853ce9620b6699bbaa0d8291c688fc87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-18T17:31:41Z","title_canon_sha256":"7893f26d0411fe39566e6c9678890766b57012319d49364f51b70d6a3566b999"},"schema_version":"1.0","source":{"id":"1103.3671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3671","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3671v2","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3671","created_at":"2026-05-18T02:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"OBSEGP3PWWID","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OBSEGP3PWWIDPCXW","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OBSEGP3P","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:abb041b93d5fa709090519420cd83e76bfbbdb75f0bccbb489528cbb4f66ca76","target":"graph","created_at":"2026-05-18T02:22:18Z","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":"Despite of being quite similar agreement problems, consensus and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than relatively simple bivalence arguments as in the impossibility proof for consensus (= 1-set agreement) in the presence of a single crash failure, known proofs for the impossibility of k-set agreement in systems with at least k>1 crash failures use algebraic topology or a variant of Sperner's Lemma. In this paper, we present a generic theorem for proving the impossibility of k-set ","authors_text":"Martin Biely, Peter Robinson, Ulrich Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-18T17:31:41Z","title":"Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3671","kind":"arxiv","version":2},"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:84e7dc50dc6867cdb021acac081df0b9f362b201ab77dfba58d88667a10d7bc3","target":"record","created_at":"2026-05-18T02:22:18Z","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":"766090f632bc1778d284efa40f55bbb2853ce9620b6699bbaa0d8291c688fc87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-18T17:31:41Z","title_canon_sha256":"7893f26d0411fe39566e6c9678890766b57012319d49364f51b70d6a3566b999"},"schema_version":"1.0","source":{"id":"1103.3671","kind":"arxiv","version":2}},"canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","first_computed_at":"2026-05-18T02:22:18.234256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:18.234256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmY4U/0N/bgz9/kZ8D70dmfNgsaqrH/xk+wUrRpg3j4LzagW1/1yKkUdFlFsFaorOIaRM6AJYmbRhw0nzsTPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:18.235089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84e7dc50dc6867cdb021acac081df0b9f362b201ab77dfba58d88667a10d7bc3","sha256:abb041b93d5fa709090519420cd83e76bfbbdb75f0bccbb489528cbb4f66ca76"],"state_sha256":"bf74a812d8f1b9f37775fd411a2b2dda0b402e2c5069a416a1a8ea2ab92cdfca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLrcW0oE5MTGsk7ZHntP/bdAA31iJc8DDJNlbVKtEfhrulGgqyIm6dRSLJnpdUPH0AZ4S7Wj2nFPBqA3NPhYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:56:15.053722Z","bundle_sha256":"c8eb383b8d17356e3c061e254a831145be5a6b5f4f3a35b939f538a57542bcc5"}}