{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C7VKJN46CZSOZKUG2FV4TQN4PQ","short_pith_number":"pith:C7VKJN46","canonical_record":{"source":{"id":"1505.02690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-11T16:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"38c49a970217f2f8da8d5b8bc6a004cd18dc721e2636b465f50cfae592fd3fd8","abstract_canon_sha256":"eff1a18dddca5bf3dc9e2c8ad006d43d525317a90faa2d97b6a395be5d42a350"},"schema_version":"1.0"},"canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","source":{"kind":"arxiv","id":"1505.02690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02690","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02690v2","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02690","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"C7VKJN46CZSO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C7VKJN46CZSOZKUG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C7VKJN46","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C7VKJN46CZSOZKUG2FV4TQN4PQ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-11T16:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"38c49a970217f2f8da8d5b8bc6a004cd18dc721e2636b465f50cfae592fd3fd8","abstract_canon_sha256":"eff1a18dddca5bf3dc9e2c8ad006d43d525317a90faa2d97b6a395be5d42a350"},"schema_version":"1.0"},"canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:23.347284Z","signature_b64":"zvteL594gGieCLgLVn0EqXXhjBQR9P1II1Vg8parB/oBq4VMODDJzVTFt6Jh2y+zASGCvThG8sHH6zUV8smJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","last_reissued_at":"2026-05-18T02:05:23.346355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:23.346355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02690","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:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4RN4vwcJ6WptG63re3poOc+RQLHQLzdvexk4E2pQ5RJnIQME4CE6TIPK8ZD5H2/fi9zaVgXZqY/QILZA/ChCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:25:19.480894Z"},"content_sha256":"72baecb7a4311fd4b5dd53f5bafdc1d32b6a99387f61e6bdc7055317f45f18f5","schema_version":"1.0","event_id":"sha256:72baecb7a4311fd4b5dd53f5bafdc1d32b6a99387f61e6bdc7055317f45f18f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C7VKJN46CZSOZKUG2FV4TQN4PQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Space Complexity of Set Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Eric Ruppert, Hugues Fauconnier, Petr Kuznetsov","submitted_at":"2015-05-11T16:19:35Z","abstract_excerpt":"The $k$-set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to $k$ different input values. In a system of $n$ processes, an $m$-obstruction-free solution to the problem requires termination only in executions where the number of processes taking steps is eventually bounded by $m$. This family of progress conditions generalizes wait-freedom ($m=n$) and obstruction-freedom ($m=1$). In this paper, we prove upper and lower bounds on the number of registers required to solve $m$-obstruction-free $k$-set agreement, considering bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02690","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:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfLziEhpKgSGkVfJvTsk+k2/wTnHOfCUPySlNjqjYYgvt4P8JPg+cwZDOSEJTuaVpC8QnzYGsoIQFAQ6hYOlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:25:19.481229Z"},"content_sha256":"ce9fc53d1fc980877c8aed7a8d83f3ad6b97e6a428408e4810f81326070db5d1","schema_version":"1.0","event_id":"sha256:ce9fc53d1fc980877c8aed7a8d83f3ad6b97e6a428408e4810f81326070db5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/bundle.json","state_url":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/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-20T20:25:19Z","links":{"resolver":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ","bundle":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/bundle.json","state":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C7VKJN46CZSOZKUG2FV4TQN4PQ","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":"eff1a18dddca5bf3dc9e2c8ad006d43d525317a90faa2d97b6a395be5d42a350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-11T16:19:35Z","title_canon_sha256":"38c49a970217f2f8da8d5b8bc6a004cd18dc721e2636b465f50cfae592fd3fd8"},"schema_version":"1.0","source":{"id":"1505.02690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02690","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02690v2","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02690","created_at":"2026-05-18T02:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"C7VKJN46CZSO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C7VKJN46CZSOZKUG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C7VKJN46","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:ce9fc53d1fc980877c8aed7a8d83f3ad6b97e6a428408e4810f81326070db5d1","target":"graph","created_at":"2026-05-18T02:05:23Z","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":"The $k$-set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to $k$ different input values. In a system of $n$ processes, an $m$-obstruction-free solution to the problem requires termination only in executions where the number of processes taking steps is eventually bounded by $m$. This family of progress conditions generalizes wait-freedom ($m=n$) and obstruction-freedom ($m=1$). In this paper, we prove upper and lower bounds on the number of registers required to solve $m$-obstruction-free $k$-set agreement, considering bo","authors_text":"Carole Delporte-Gallet, Eric Ruppert, Hugues Fauconnier, Petr Kuznetsov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-11T16:19:35Z","title":"On the Space Complexity of Set Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02690","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:72baecb7a4311fd4b5dd53f5bafdc1d32b6a99387f61e6bdc7055317f45f18f5","target":"record","created_at":"2026-05-18T02:05:23Z","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":"eff1a18dddca5bf3dc9e2c8ad006d43d525317a90faa2d97b6a395be5d42a350","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-11T16:19:35Z","title_canon_sha256":"38c49a970217f2f8da8d5b8bc6a004cd18dc721e2636b465f50cfae592fd3fd8"},"schema_version":"1.0","source":{"id":"1505.02690","kind":"arxiv","version":2}},"canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","first_computed_at":"2026-05-18T02:05:23.346355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:23.346355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zvteL594gGieCLgLVn0EqXXhjBQR9P1II1Vg8parB/oBq4VMODDJzVTFt6Jh2y+zASGCvThG8sHH6zUV8smJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:23.347284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72baecb7a4311fd4b5dd53f5bafdc1d32b6a99387f61e6bdc7055317f45f18f5","sha256:ce9fc53d1fc980877c8aed7a8d83f3ad6b97e6a428408e4810f81326070db5d1"],"state_sha256":"82024ece90d255bbc2a69cbaa5108d8e53f4ffa7045fbe049f26ce46c83ec0d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SU5nxERXQb4wu7BidrrorVBhkbru9QwiVvQKrgg4L38sy2sSkIIhsrejbd9tQgHzbGG6RKs4yK0RRe9nziXCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:25:19.483122Z","bundle_sha256":"5059075ec429091f53962dd202791c985d71b447043257b52cb3c54e0e87812c"}}