{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DRNVCUTBD72RJF5OLQQKOV6WM3","short_pith_number":"pith:DRNVCUTB","schema_version":"1.0","canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","source":{"kind":"arxiv","id":"1711.02455","version":5},"attestation_state":"computed","paper":{"title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Faith Ellen, Leqi Zhu, Rati Gelashvili","submitted_at":"2017-11-07T13:34:52Z","abstract_excerpt":"Determining the space complexity of $x$-obstruction-free $k$-set agreement for $x\\leq k$ is an open problem. In $x$-obstruction-free protocols, processes are required to return in executions where at most $x$ processes take steps. The best known upper bound on the number of registers needed to solve this problem among $n>k$ processes is $n-k+x$ registers. No general lower bound better than $2$ was known.\n  We prove that any $x$-obstruction-free protocol solving $k$-set agreement among $n>k$ processes uses at least $\\lfloor(n-x)/(k+1-x)\\rfloor+1$ registers. Our main tool is a simulation that se"},"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":"1711.02455","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-07T13:34:52Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"f231209abd2e5674ecec4d659102bf15caba2d9cb588f29e98538702ea36fa91","abstract_canon_sha256":"1d0f0e8277dc15d7cfa53871f316bafccc6269cf55bcb9fff9f7f3387602189d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.652039Z","signature_b64":"bGIMx8cV0v5kUx/NNv9d+AH3r+fKFNQJr1kEKwcwpxVw9TCsCWK3802R91n6VyNxhwSMEFk6nr8gy59KKfWlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","last_reissued_at":"2026-05-18T00:03:41.651287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.651287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Faith Ellen, Leqi Zhu, Rati Gelashvili","submitted_at":"2017-11-07T13:34:52Z","abstract_excerpt":"Determining the space complexity of $x$-obstruction-free $k$-set agreement for $x\\leq k$ is an open problem. In $x$-obstruction-free protocols, processes are required to return in executions where at most $x$ processes take steps. The best known upper bound on the number of registers needed to solve this problem among $n>k$ processes is $n-k+x$ registers. No general lower bound better than $2$ was known.\n  We prove that any $x$-obstruction-free protocol solving $k$-set agreement among $n>k$ processes uses at least $\\lfloor(n-x)/(k+1-x)\\rfloor+1$ registers. Our main tool is a simulation that se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02455","kind":"arxiv","version":5},"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":"1711.02455","created_at":"2026-05-18T00:03:41.651367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02455v5","created_at":"2026-05-18T00:03:41.651367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02455","created_at":"2026-05-18T00:03:41.651367+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRNVCUTBD72R","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRNVCUTBD72RJF5O","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRNVCUTB","created_at":"2026-05-18T12:31:12.930513+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/DRNVCUTBD72RJF5OLQQKOV6WM3","json":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3.json","graph_json":"https://pith.science/api/pith-number/DRNVCUTBD72RJF5OLQQKOV6WM3/graph.json","events_json":"https://pith.science/api/pith-number/DRNVCUTBD72RJF5OLQQKOV6WM3/events.json","paper":"https://pith.science/paper/DRNVCUTB"},"agent_actions":{"view_html":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3","download_json":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3.json","view_paper":"https://pith.science/paper/DRNVCUTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02455&json=true","fetch_graph":"https://pith.science/api/pith-number/DRNVCUTBD72RJF5OLQQKOV6WM3/graph.json","fetch_events":"https://pith.science/api/pith-number/DRNVCUTBD72RJF5OLQQKOV6WM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/action/storage_attestation","attest_author":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/action/author_attestation","sign_citation":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/action/citation_signature","submit_replication":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/action/replication_record"}},"created_at":"2026-05-18T00:03:41.651367+00:00","updated_at":"2026-05-18T00:03:41.651367+00:00"}