{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OWY2UH3P56N24TZMPIP7FYTTGY","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":"583d79f25abd4448e237390a9e069d19eb354f39b6b45834779cf073573cea06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-02T08:49:51Z","title_canon_sha256":"70828ae27221f05ecb8f2eb3435ef332c97107c3eb436184b145497febfbebcf"},"schema_version":"1.0","source":{"id":"1507.00474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00474","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00474v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00474","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"OWY2UH3P56N2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OWY2UH3P56N24TZM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OWY2UH3P","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:b568e813e1833d87265763683116d125d255aa1e59f652abbceb637d737b342a","target":"graph","created_at":"2026-05-18T01:37:24Z","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 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","authors_text":"Michel Raynal (ASAP), Pierre Sutra, Zohir Bouzid (NPA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-02T08:49:51Z","title":"Anonymous Obstruction-free $(n,k)$-Set Agreement with $n-k+1$ Atomic Read/Write Registers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00474","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:641314b568788746ff8d8bbcfbbf8d74da85da1739ce74af5df3e627826e316a","target":"record","created_at":"2026-05-18T01:37:24Z","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":"583d79f25abd4448e237390a9e069d19eb354f39b6b45834779cf073573cea06","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-02T08:49:51Z","title_canon_sha256":"70828ae27221f05ecb8f2eb3435ef332c97107c3eb436184b145497febfbebcf"},"schema_version":"1.0","source":{"id":"1507.00474","kind":"arxiv","version":1}},"canonical_sha256":"75b1aa1f6fef9bae4f2c7a1ff2e2733602774d7f142a17f5216d9c68072e21f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75b1aa1f6fef9bae4f2c7a1ff2e2733602774d7f142a17f5216d9c68072e21f9","first_computed_at":"2026-05-18T01:37:24.599490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.599490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FnxqxMR2mBtXkuevXzMTUzALDo8QYgPZQEaXTHJOPqBD34Jp0OHl4IgyGwZqzh46jnyViXFmoMtsE1fVKNZtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.600199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:641314b568788746ff8d8bbcfbbf8d74da85da1739ce74af5df3e627826e316a","sha256:b568e813e1833d87265763683116d125d255aa1e59f652abbceb637d737b342a"],"state_sha256":"526c852db28f671ed46a313be5874a551954f863e652075e09e3358a95309703"}