{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OBSEGP3PWWIDPCXWZBGAEEJTBT","short_pith_number":"pith:OBSEGP3P","schema_version":"1.0","canonical_sha256":"7064433f6fb590378af6c84c0211330cfe97fa0168b63fd907c4ffb64997d8df","source":{"kind":"arxiv","id":"1103.3671","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.3671","created_at":"2026-05-18T02:22:18.234380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3671v2","created_at":"2026-05-18T02:22:18.234380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3671","created_at":"2026-05-18T02:22:18.234380+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBSEGP3PWWID","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBSEGP3PWWIDPCXW","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBSEGP3P","created_at":"2026-05-18T12:26:37.096874+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/OBSEGP3PWWIDPCXWZBGAEEJTBT","json":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT.json","graph_json":"https://pith.science/api/pith-number/OBSEGP3PWWIDPCXWZBGAEEJTBT/graph.json","events_json":"https://pith.science/api/pith-number/OBSEGP3PWWIDPCXWZBGAEEJTBT/events.json","paper":"https://pith.science/paper/OBSEGP3P"},"agent_actions":{"view_html":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT","download_json":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT.json","view_paper":"https://pith.science/paper/OBSEGP3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3671&json=true","fetch_graph":"https://pith.science/api/pith-number/OBSEGP3PWWIDPCXWZBGAEEJTBT/graph.json","fetch_events":"https://pith.science/api/pith-number/OBSEGP3PWWIDPCXWZBGAEEJTBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/action/storage_attestation","attest_author":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/action/author_attestation","sign_citation":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/action/citation_signature","submit_replication":"https://pith.science/pith/OBSEGP3PWWIDPCXWZBGAEEJTBT/action/replication_record"}},"created_at":"2026-05-18T02:22:18.234380+00:00","updated_at":"2026-05-18T02:22:18.234380+00:00"}