{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IFPINHB667KWA6WTPL5J4YYDOT","short_pith_number":"pith:IFPINHB6","schema_version":"1.0","canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","source":{"kind":"arxiv","id":"1102.4423","version":1},"attestation_state":"computed","paper":{"title":"Solving k-Set Agreement with Stable Skeleton Graphs","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-02-22T07:41:38Z","abstract_excerpt":"In this paper we consider the k-set agreement problem in distributed message-passing systems using a round-based approach: Both synchrony of communication and failures are captured just by means of the messages that arrive within a round, resulting in round-by-round communication graphs that can be characterized by simple communication predicates. We introduce the weak communication predicate PSources(k) and show that it is tight for k-set agreement, in the following sense: We (i) prove that there is no algorithm for solving (k-1)-set agreement in systems characterized by PSources(k), and (ii)"},"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":"1102.4423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-22T07:41:38Z","cross_cats_sorted":[],"title_canon_sha256":"0cae858f4d9d0bbb70a1fb6139f87ce2fbed8acc5909cb3aa849e98882b80307","abstract_canon_sha256":"ba3b819936eaf70298b9343eaab0b6a2dda05959fc8066ddcad6ee48d1e3f586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.449955Z","signature_b64":"n8h//ExkSou79UiW9e+88t7NPyfIhPDmQpTIRJFllskGfYSoogGyf8kCOM3gyJx/HxpKpVThOjipjqiF0I/3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","last_reissued_at":"2026-05-18T00:57:57.449512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.449512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving k-Set Agreement with Stable Skeleton Graphs","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-02-22T07:41:38Z","abstract_excerpt":"In this paper we consider the k-set agreement problem in distributed message-passing systems using a round-based approach: Both synchrony of communication and failures are captured just by means of the messages that arrive within a round, resulting in round-by-round communication graphs that can be characterized by simple communication predicates. We introduce the weak communication predicate PSources(k) and show that it is tight for k-set agreement, in the following sense: We (i) prove that there is no algorithm for solving (k-1)-set agreement in systems characterized by PSources(k), and (ii)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4423","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":"1102.4423","created_at":"2026-05-18T00:57:57.449572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4423v1","created_at":"2026-05-18T00:57:57.449572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4423","created_at":"2026-05-18T00:57:57.449572+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFPINHB667KW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFPINHB667KWA6WT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFPINHB6","created_at":"2026-05-18T12:26:30.835961+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/IFPINHB667KWA6WTPL5J4YYDOT","json":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT.json","graph_json":"https://pith.science/api/pith-number/IFPINHB667KWA6WTPL5J4YYDOT/graph.json","events_json":"https://pith.science/api/pith-number/IFPINHB667KWA6WTPL5J4YYDOT/events.json","paper":"https://pith.science/paper/IFPINHB6"},"agent_actions":{"view_html":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT","download_json":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT.json","view_paper":"https://pith.science/paper/IFPINHB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4423&json=true","fetch_graph":"https://pith.science/api/pith-number/IFPINHB667KWA6WTPL5J4YYDOT/graph.json","fetch_events":"https://pith.science/api/pith-number/IFPINHB667KWA6WTPL5J4YYDOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/action/storage_attestation","attest_author":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/action/author_attestation","sign_citation":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/action/citation_signature","submit_replication":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/action/replication_record"}},"created_at":"2026-05-18T00:57:57.449572+00:00","updated_at":"2026-05-18T00:57:57.449572+00:00"}