{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DRNVCUTBD72RJF5OLQQKOV6WM3","short_pith_number":"pith:DRNVCUTB","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"},"canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","source":{"kind":"arxiv","id":"1711.02455","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02455","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02455v5","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02455","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"DRNVCUTBD72R","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRNVCUTBD72RJF5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRNVCUTB","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DRNVCUTBD72RJF5OLQQKOV6WM3","target":"record","payload":{"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"},"canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","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"},"source_kind":"arxiv","source_id":"1711.02455","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzHDejCCp5jIU2p1DO/lR7cD1DNJvaSm8i9s0bdZFGRai8UL62vIm91Zk6Iplavrl5/bYQa2fGfql3KeUFGUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:04:31.326799Z"},"content_sha256":"bd61dbb6e4e99b8d8339f1968940c434155d07546ee2bb9c3053fdbfef61394a","schema_version":"1.0","event_id":"sha256:bd61dbb6e4e99b8d8339f1968940c434155d07546ee2bb9c3053fdbfef61394a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DRNVCUTBD72RJF5OLQQKOV6WM3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HNFfzSEZYjwuWWh0OhA9dxlNL5dQK7W76m0ZtShbuLMAzi399mlHIhkU0r3nHeOax3nj6fQ+VQyqw87sMr4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:04:31.327459Z"},"content_sha256":"825ff7ce361118598142942abe5fe4ebbc3e822c1889c19637a48aa66ebe377b","schema_version":"1.0","event_id":"sha256:825ff7ce361118598142942abe5fe4ebbc3e822c1889c19637a48aa66ebe377b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/bundle.json","state_url":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T15:04:31Z","links":{"resolver":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3","bundle":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/bundle.json","state":"https://pith.science/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRNVCUTBD72RJF5OLQQKOV6WM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DRNVCUTBD72RJF5OLQQKOV6WM3","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":"1d0f0e8277dc15d7cfa53871f316bafccc6269cf55bcb9fff9f7f3387602189d","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-07T13:34:52Z","title_canon_sha256":"f231209abd2e5674ecec4d659102bf15caba2d9cb588f29e98538702ea36fa91"},"schema_version":"1.0","source":{"id":"1711.02455","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02455","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02455v5","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02455","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"DRNVCUTBD72R","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRNVCUTBD72RJF5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRNVCUTB","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:825ff7ce361118598142942abe5fe4ebbc3e822c1889c19637a48aa66ebe377b","target":"graph","created_at":"2026-05-18T00:03:41Z","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":"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","authors_text":"Faith Ellen, Leqi Zhu, Rati Gelashvili","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-07T13:34:52Z","title":"Revisionist Simulations: A New Approach to Proving Space Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02455","kind":"arxiv","version":5},"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:bd61dbb6e4e99b8d8339f1968940c434155d07546ee2bb9c3053fdbfef61394a","target":"record","created_at":"2026-05-18T00:03:41Z","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":"1d0f0e8277dc15d7cfa53871f316bafccc6269cf55bcb9fff9f7f3387602189d","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-07T13:34:52Z","title_canon_sha256":"f231209abd2e5674ecec4d659102bf15caba2d9cb588f29e98538702ea36fa91"},"schema_version":"1.0","source":{"id":"1711.02455","kind":"arxiv","version":5}},"canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c5b5152611ff51497ae5c20a757d666c6adc5647420417ad207561b4a7bf150","first_computed_at":"2026-05-18T00:03:41.651287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:41.651287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bGIMx8cV0v5kUx/NNv9d+AH3r+fKFNQJr1kEKwcwpxVw9TCsCWK3802R91n6VyNxhwSMEFk6nr8gy59KKfWlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:41.652039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02455","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd61dbb6e4e99b8d8339f1968940c434155d07546ee2bb9c3053fdbfef61394a","sha256:825ff7ce361118598142942abe5fe4ebbc3e822c1889c19637a48aa66ebe377b"],"state_sha256":"ecf03d919bbbad72cb848628571580a711817f41ed2dbba8af97302695b6d7b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgzjxcNyn2afNLunjw2tJr1JNGsGgqK1c+JxVj6WXP2H0QZ6h/GnIl+qQ1+sMONcTk7C2ZeHjTieYniE/lXxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:04:31.331148Z","bundle_sha256":"7dd8ba821d238d44683ead5635f74d9b3b138db01d81e0656bcc7b8c9613c215"}}