{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2E3UHKVSCM6ZBEY6NVZOU5EP6M","short_pith_number":"pith:2E3UHKVS","schema_version":"1.0","canonical_sha256":"d13743aab2133d90931e6d72ea748ff32b4a5de0c7693601e1537e4275b13c06","source":{"kind":"arxiv","id":"1607.05635","version":2},"attestation_state":"computed","paper":{"title":"Set-Consensus Collections are Decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Eli Gafni, Hugues Fauconnier, Petr Kuznetsov","submitted_at":"2016-07-19T15:34:20Z","abstract_excerpt":"A natural way to measure the power of a distributed-computing model is to characterize the set of tasks that can be solved in it. %the model. In general, however, the question of whether a given task can be solved in a given model is undecidable, even if we only consider the wait-free shared-memory model.\n  In this paper, we address this question for restricted classes of models and tasks. We show that the question of whether a collection $C$ of \\emph{$(\\ell,j)$-set consensus} objects, for various $\\ell$ (the number of processes that can invoke the object) and $j$ (the number of distinct outpu"},"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":"1607.05635","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:34:20Z","cross_cats_sorted":[],"title_canon_sha256":"7668d2b766e2aa6c927867efb35140b1144aa0c5f097a62715a23a08717429f5","abstract_canon_sha256":"a3818c9a6e017a26230d1004ffea810d9d06500e674bf22ec7b644a8d72b8b32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:26.806045Z","signature_b64":"tvtoHiQOqka4VvyntqnFIR80wXDe82TI3Xf1RkOzNI9OZglODeehFmbol6Pc0GcofJFA8mGsy6ToIjQtP/+8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d13743aab2133d90931e6d72ea748ff32b4a5de0c7693601e1537e4275b13c06","last_reissued_at":"2026-05-18T00:57:26.805442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:26.805442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set-Consensus Collections are Decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet, Eli Gafni, Hugues Fauconnier, Petr Kuznetsov","submitted_at":"2016-07-19T15:34:20Z","abstract_excerpt":"A natural way to measure the power of a distributed-computing model is to characterize the set of tasks that can be solved in it. %the model. In general, however, the question of whether a given task can be solved in a given model is undecidable, even if we only consider the wait-free shared-memory model.\n  In this paper, we address this question for restricted classes of models and tasks. We show that the question of whether a collection $C$ of \\emph{$(\\ell,j)$-set consensus} objects, for various $\\ell$ (the number of processes that can invoke the object) and $j$ (the number of distinct outpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05635","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":"1607.05635","created_at":"2026-05-18T00:57:26.805565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05635v2","created_at":"2026-05-18T00:57:26.805565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05635","created_at":"2026-05-18T00:57:26.805565+00:00"},{"alias_kind":"pith_short_12","alias_value":"2E3UHKVSCM6Z","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2E3UHKVSCM6ZBEY6","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2E3UHKVS","created_at":"2026-05-18T12:29:55.572404+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/2E3UHKVSCM6ZBEY6NVZOU5EP6M","json":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M.json","graph_json":"https://pith.science/api/pith-number/2E3UHKVSCM6ZBEY6NVZOU5EP6M/graph.json","events_json":"https://pith.science/api/pith-number/2E3UHKVSCM6ZBEY6NVZOU5EP6M/events.json","paper":"https://pith.science/paper/2E3UHKVS"},"agent_actions":{"view_html":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M","download_json":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M.json","view_paper":"https://pith.science/paper/2E3UHKVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05635&json=true","fetch_graph":"https://pith.science/api/pith-number/2E3UHKVSCM6ZBEY6NVZOU5EP6M/graph.json","fetch_events":"https://pith.science/api/pith-number/2E3UHKVSCM6ZBEY6NVZOU5EP6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M/action/storage_attestation","attest_author":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M/action/author_attestation","sign_citation":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M/action/citation_signature","submit_replication":"https://pith.science/pith/2E3UHKVSCM6ZBEY6NVZOU5EP6M/action/replication_record"}},"created_at":"2026-05-18T00:57:26.805565+00:00","updated_at":"2026-05-18T00:57:26.805565+00:00"}