{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QW4YTPJVXNWWRGXBCL5ZLKDOOB","short_pith_number":"pith:QW4YTPJV","schema_version":"1.0","canonical_sha256":"85b989bd35bb6d689ae112fb95a86e704d3459c47d747bd334f62c1a8317732f","source":{"kind":"arxiv","id":"1103.5794","version":2},"attestation_state":"computed","paper":{"title":"The Space Complexity of Long-lived and One-Shot Timestamp Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eduardo Pacheco, Lisa Higham, Maryam Helmi, Philipp Woelfel","submitted_at":"2011-03-29T23:43:21Z","abstract_excerpt":"This paper is concerned with the problem of implementing an unbounded timestamp object from multi-writer atomic registers, in an asynchronous distributed system of n processors with distinct identifiers where timestamps are taken from an arbitrary universe. Ellen, Fatourou and Ruppert (2008) showed that sqrt{n}/2-O(1) registers are required for any obstruction-free implementation of long-lived timestamp systems from atomic registers (meaning processors can repeatedly get timestamps). We improve this existing lower bound in two ways. First we establish a lower bound of n/6 - O(1) registers for "},"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":"1103.5794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-29T23:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"45d50bbd2d37959b4e31c18faf953a70a24ad1f876a3621f72df39c0dbbbf040","abstract_canon_sha256":"75f5b77f23e98f5cfe3aba570093fe64ac2bf3fabfa5852a219ebcbd36cb4f17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:57.750207Z","signature_b64":"xE2Gsp08135XErYaIHc0zjfroj1QIdLUyAzLXi6+KiDwkrt3Iaqjask2q/k/h6NsybfK45JabqqttcLere+LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b989bd35bb6d689ae112fb95a86e704d3459c47d747bd334f62c1a8317732f","last_reissued_at":"2026-05-18T04:05:57.749542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:57.749542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Space Complexity of Long-lived and One-Shot Timestamp Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eduardo Pacheco, Lisa Higham, Maryam Helmi, Philipp Woelfel","submitted_at":"2011-03-29T23:43:21Z","abstract_excerpt":"This paper is concerned with the problem of implementing an unbounded timestamp object from multi-writer atomic registers, in an asynchronous distributed system of n processors with distinct identifiers where timestamps are taken from an arbitrary universe. Ellen, Fatourou and Ruppert (2008) showed that sqrt{n}/2-O(1) registers are required for any obstruction-free implementation of long-lived timestamp systems from atomic registers (meaning processors can repeatedly get timestamps). We improve this existing lower bound in two ways. First we establish a lower bound of n/6 - O(1) registers for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5794","kind":"arxiv","version":2},"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":"1103.5794","created_at":"2026-05-18T04:05:57.749624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5794v2","created_at":"2026-05-18T04:05:57.749624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5794","created_at":"2026-05-18T04:05:57.749624+00:00"},{"alias_kind":"pith_short_12","alias_value":"QW4YTPJVXNWW","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QW4YTPJVXNWWRGXB","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QW4YTPJV","created_at":"2026-05-18T12:26:39.201973+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/QW4YTPJVXNWWRGXBCL5ZLKDOOB","json":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB.json","graph_json":"https://pith.science/api/pith-number/QW4YTPJVXNWWRGXBCL5ZLKDOOB/graph.json","events_json":"https://pith.science/api/pith-number/QW4YTPJVXNWWRGXBCL5ZLKDOOB/events.json","paper":"https://pith.science/paper/QW4YTPJV"},"agent_actions":{"view_html":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB","download_json":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB.json","view_paper":"https://pith.science/paper/QW4YTPJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5794&json=true","fetch_graph":"https://pith.science/api/pith-number/QW4YTPJVXNWWRGXBCL5ZLKDOOB/graph.json","fetch_events":"https://pith.science/api/pith-number/QW4YTPJVXNWWRGXBCL5ZLKDOOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB/action/storage_attestation","attest_author":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB/action/author_attestation","sign_citation":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB/action/citation_signature","submit_replication":"https://pith.science/pith/QW4YTPJVXNWWRGXBCL5ZLKDOOB/action/replication_record"}},"created_at":"2026-05-18T04:05:57.749624+00:00","updated_at":"2026-05-18T04:05:57.749624+00:00"}