{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OWY2UH3P56N24TZMPIP7FYTTGY","short_pith_number":"pith:OWY2UH3P","schema_version":"1.0","canonical_sha256":"75b1aa1f6fef9bae4f2c7a1ff2e2733602774d7f142a17f5216d9c68072e21f9","source":{"kind":"arxiv","id":"1507.00474","version":1},"attestation_state":"computed","paper":{"title":"Anonymous Obstruction-free $(n,k)$-Set Agreement with $n-k+1$ Atomic Read/Write Registers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Michel Raynal (ASAP), Pierre Sutra, Zohir Bouzid (NPA)","submitted_at":"2015-07-02T08:49:51Z","abstract_excerpt":"The $k$-set agreement problem is a generalization of the consensus problem. Namely, assuming  each process proposes a value, each non-faulty process has to decide a value such that each decided value was proposed,  and no more than $k$ different values are decided.  This is a hard problem in the sense that it cannot be solved in asynchronous systems as soon as $k$ or more processes  may crash. One way to circumvent this impossibility consists in weakening its termination property, requiring that a process terminates (decides) only if it executes alone during a long enough period. This is the w"},"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":"1507.00474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-02T08:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"70828ae27221f05ecb8f2eb3435ef332c97107c3eb436184b145497febfbebcf","abstract_canon_sha256":"583d79f25abd4448e237390a9e069d19eb354f39b6b45834779cf073573cea06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.600199Z","signature_b64":"FnxqxMR2mBtXkuevXzMTUzALDo8QYgPZQEaXTHJOPqBD34Jp0OHl4IgyGwZqzh46jnyViXFmoMtsE1fVKNZtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b1aa1f6fef9bae4f2c7a1ff2e2733602774d7f142a17f5216d9c68072e21f9","last_reissued_at":"2026-05-18T01:37:24.599490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.599490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Obstruction-free $(n,k)$-Set Agreement with $n-k+1$ Atomic Read/Write Registers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Michel Raynal (ASAP), Pierre Sutra, Zohir Bouzid (NPA)","submitted_at":"2015-07-02T08:49:51Z","abstract_excerpt":"The $k$-set agreement problem is a generalization of the consensus problem. Namely, assuming  each process proposes a value, each non-faulty process has to decide a value such that each decided value was proposed,  and no more than $k$ different values are decided.  This is a hard problem in the sense that it cannot be solved in asynchronous systems as soon as $k$ or more processes  may crash. One way to circumvent this impossibility consists in weakening its termination property, requiring that a process terminates (decides) only if it executes alone during a long enough period. This is the w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00474","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":"1507.00474","created_at":"2026-05-18T01:37:24.599595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00474v1","created_at":"2026-05-18T01:37:24.599595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00474","created_at":"2026-05-18T01:37:24.599595+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWY2UH3P56N2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWY2UH3P56N24TZM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWY2UH3P","created_at":"2026-05-18T12:29:34.919912+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/OWY2UH3P56N24TZMPIP7FYTTGY","json":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY.json","graph_json":"https://pith.science/api/pith-number/OWY2UH3P56N24TZMPIP7FYTTGY/graph.json","events_json":"https://pith.science/api/pith-number/OWY2UH3P56N24TZMPIP7FYTTGY/events.json","paper":"https://pith.science/paper/OWY2UH3P"},"agent_actions":{"view_html":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY","download_json":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY.json","view_paper":"https://pith.science/paper/OWY2UH3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00474&json=true","fetch_graph":"https://pith.science/api/pith-number/OWY2UH3P56N24TZMPIP7FYTTGY/graph.json","fetch_events":"https://pith.science/api/pith-number/OWY2UH3P56N24TZMPIP7FYTTGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY/action/storage_attestation","attest_author":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY/action/author_attestation","sign_citation":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY/action/citation_signature","submit_replication":"https://pith.science/pith/OWY2UH3P56N24TZMPIP7FYTTGY/action/replication_record"}},"created_at":"2026-05-18T01:37:24.599595+00:00","updated_at":"2026-05-18T01:37:24.599595+00:00"}