{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YTWKLJRICWCF4MAW6FXSUBX27D","short_pith_number":"pith:YTWKLJRI","schema_version":"1.0","canonical_sha256":"c4eca5a62815845e3016f16f2a06faf8df5658cb8fa1b845310bf8013cbbd3bd","source":{"kind":"arxiv","id":"1808.00481","version":1},"attestation_state":"computed","paper":{"title":"Space Complexity of Implementing Large Shared Registers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Yuanhao Wei","submitted_at":"2018-08-01T18:00:50Z","abstract_excerpt":"We prove two new space lower bounds for the problem of implementing a large shared register using smaller physical shared registers. We focus on the case where both the implemented and physical registers are single-writer, which means they can be accessed concurrently by multiple readers but only by a single writer. To strengthen our lower bounds, we let the physical registers be atomic and we only require the implemented register to be regular. Furthermore, the lower bounds hold for obstruction-free implementations, which means they also hold for lock-free and wait-free implementations.\n  If "},"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":"1808.00481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-01T18:00:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c592c1b8bd2315429140765c9973c0e405e2ce452bf13e9c0d292ef16b60058c","abstract_canon_sha256":"d4532d1654d8d0de25111a0cf8662a209e964e61db2506d859530d3a46eade77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.200049Z","signature_b64":"fxqa81euh/4d7/jA3AbbXXql+/pNnlnqo7AuIqcsSO5ELhfvKFzGcI/4ghVJ9ZuARndzpgw6C3u7WWJMvtslBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4eca5a62815845e3016f16f2a06faf8df5658cb8fa1b845310bf8013cbbd3bd","last_reissued_at":"2026-05-18T00:09:05.199457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.199457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space Complexity of Implementing Large Shared Registers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Yuanhao Wei","submitted_at":"2018-08-01T18:00:50Z","abstract_excerpt":"We prove two new space lower bounds for the problem of implementing a large shared register using smaller physical shared registers. We focus on the case where both the implemented and physical registers are single-writer, which means they can be accessed concurrently by multiple readers but only by a single writer. To strengthen our lower bounds, we let the physical registers be atomic and we only require the implemented register to be regular. Furthermore, the lower bounds hold for obstruction-free implementations, which means they also hold for lock-free and wait-free implementations.\n  If "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00481","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":"1808.00481","created_at":"2026-05-18T00:09:05.199568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00481v1","created_at":"2026-05-18T00:09:05.199568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00481","created_at":"2026-05-18T00:09:05.199568+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTWKLJRICWCF","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTWKLJRICWCF4MAW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTWKLJRI","created_at":"2026-05-18T12:33:04.347982+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/YTWKLJRICWCF4MAW6FXSUBX27D","json":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D.json","graph_json":"https://pith.science/api/pith-number/YTWKLJRICWCF4MAW6FXSUBX27D/graph.json","events_json":"https://pith.science/api/pith-number/YTWKLJRICWCF4MAW6FXSUBX27D/events.json","paper":"https://pith.science/paper/YTWKLJRI"},"agent_actions":{"view_html":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D","download_json":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D.json","view_paper":"https://pith.science/paper/YTWKLJRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00481&json=true","fetch_graph":"https://pith.science/api/pith-number/YTWKLJRICWCF4MAW6FXSUBX27D/graph.json","fetch_events":"https://pith.science/api/pith-number/YTWKLJRICWCF4MAW6FXSUBX27D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D/action/storage_attestation","attest_author":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D/action/author_attestation","sign_citation":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D/action/citation_signature","submit_replication":"https://pith.science/pith/YTWKLJRICWCF4MAW6FXSUBX27D/action/replication_record"}},"created_at":"2026-05-18T00:09:05.199568+00:00","updated_at":"2026-05-18T00:09:05.199568+00:00"}