{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IFPINHB667KWA6WTPL5J4YYDOT","short_pith_number":"pith:IFPINHB6","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"},"canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","source":{"kind":"arxiv","id":"1102.4423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4423","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4423v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4423","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"IFPINHB667KW","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IFPINHB667KWA6WT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IFPINHB6","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IFPINHB667KWA6WTPL5J4YYDOT","target":"record","payload":{"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"},"canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","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"},"source_kind":"arxiv","source_id":"1102.4423","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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwx/UhrqJDFlztJsSrg5XuvpcRY3AHaUNiaaovXUwiqjocMaZ1zHSX91+53R7hTy4H0CJFcy9TjeuWujWFkpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:10.429891Z"},"content_sha256":"59a27c1dd11d0d17a3fb0fe6a1a9f2f775141ec847662589e8d74119bc9829d9","schema_version":"1.0","event_id":"sha256:59a27c1dd11d0d17a3fb0fe6a1a9f2f775141ec847662589e8d74119bc9829d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IFPINHB667KWA6WTPL5J4YYDOT","target":"graph","payload":{"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"},"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOviBatcPH/TwUTyc0D0kH9rwSMd2BkVFCG2/bfXi8idklVtUYos4K64zDRhNvPrE4f75zliZOyMpE9pE3elAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:10.430238Z"},"content_sha256":"a4ec154fbb58d221ac0f79d4ac92d989ad4b54d9a131197be4abffdb92376131","schema_version":"1.0","event_id":"sha256:a4ec154fbb58d221ac0f79d4ac92d989ad4b54d9a131197be4abffdb92376131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/bundle.json","state_url":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFPINHB667KWA6WTPL5J4YYDOT/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-02T05:03:10Z","links":{"resolver":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT","bundle":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/bundle.json","state":"https://pith.science/pith/IFPINHB667KWA6WTPL5J4YYDOT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFPINHB667KWA6WTPL5J4YYDOT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IFPINHB667KWA6WTPL5J4YYDOT","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":"ba3b819936eaf70298b9343eaab0b6a2dda05959fc8066ddcad6ee48d1e3f586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-22T07:41:38Z","title_canon_sha256":"0cae858f4d9d0bbb70a1fb6139f87ce2fbed8acc5909cb3aa849e98882b80307"},"schema_version":"1.0","source":{"id":"1102.4423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4423","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4423v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4423","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"IFPINHB667KW","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IFPINHB667KWA6WT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IFPINHB6","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:a4ec154fbb58d221ac0f79d4ac92d989ad4b54d9a131197be4abffdb92376131","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"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)","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-02-22T07:41:38Z","title":"Solving k-Set Agreement with Stable Skeleton Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4423","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:59a27c1dd11d0d17a3fb0fe6a1a9f2f775141ec847662589e8d74119bc9829d9","target":"record","created_at":"2026-05-18T00:57:57Z","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":"ba3b819936eaf70298b9343eaab0b6a2dda05959fc8066ddcad6ee48d1e3f586","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-22T07:41:38Z","title_canon_sha256":"0cae858f4d9d0bbb70a1fb6139f87ce2fbed8acc5909cb3aa849e98882b80307"},"schema_version":"1.0","source":{"id":"1102.4423","kind":"arxiv","version":1}},"canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"415e869c3ef7d5607ad37afa9e630374d11e05f508a4e7245b00d9c5e786df62","first_computed_at":"2026-05-18T00:57:57.449512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.449512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8h//ExkSou79UiW9e+88t7NPyfIhPDmQpTIRJFllskGfYSoogGyf8kCOM3gyJx/HxpKpVThOjipjqiF0I/3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.449955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59a27c1dd11d0d17a3fb0fe6a1a9f2f775141ec847662589e8d74119bc9829d9","sha256:a4ec154fbb58d221ac0f79d4ac92d989ad4b54d9a131197be4abffdb92376131"],"state_sha256":"a2e86641750bf7928012d312f68c54150fe950c7be95d8efdcdb820909bfa3c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ksP5ith3Ipt6httPvn/HyEhu+cdhwbomqKlljgtXPcyE6o23BGnbnYSWYxTL5piwanaCgNQb7B+b3QUFtZhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:03:10.432192Z","bundle_sha256":"114261632a7ecef0d362ccc9fee232028cb81f3d6c1f42b43de88ec6087c9ca8"}}