{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C7VKJN46CZSOZKUG2FV4TQN4PQ","short_pith_number":"pith:C7VKJN46","schema_version":"1.0","canonical_sha256":"17eaa4b79e1664ecaa86d16bc9c1bc7c01bb97d2a0cc92b18e7294da7a79b245","source":{"kind":"arxiv","id":"1505.02690","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02690","created_at":"2026-05-18T02:05:23.346493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02690v2","created_at":"2026-05-18T02:05:23.346493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02690","created_at":"2026-05-18T02:05:23.346493+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7VKJN46CZSO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7VKJN46CZSOZKUG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7VKJN46","created_at":"2026-05-18T12:29:14.074870+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/C7VKJN46CZSOZKUG2FV4TQN4PQ","json":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ.json","graph_json":"https://pith.science/api/pith-number/C7VKJN46CZSOZKUG2FV4TQN4PQ/graph.json","events_json":"https://pith.science/api/pith-number/C7VKJN46CZSOZKUG2FV4TQN4PQ/events.json","paper":"https://pith.science/paper/C7VKJN46"},"agent_actions":{"view_html":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ","download_json":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ.json","view_paper":"https://pith.science/paper/C7VKJN46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02690&json=true","fetch_graph":"https://pith.science/api/pith-number/C7VKJN46CZSOZKUG2FV4TQN4PQ/graph.json","fetch_events":"https://pith.science/api/pith-number/C7VKJN46CZSOZKUG2FV4TQN4PQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/action/storage_attestation","attest_author":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/action/author_attestation","sign_citation":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/action/citation_signature","submit_replication":"https://pith.science/pith/C7VKJN46CZSOZKUG2FV4TQN4PQ/action/replication_record"}},"created_at":"2026-05-18T02:05:23.346493+00:00","updated_at":"2026-05-18T02:05:23.346493+00:00"}