{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H6EFM5NJSDSHXFP4Y4NN2XQJFX","short_pith_number":"pith:H6EFM5NJ","schema_version":"1.0","canonical_sha256":"3f885675a990e47b95fcc71add5e092defc3ba1fb5cbc4844f59bd1366bb39b6","source":{"kind":"arxiv","id":"1805.06265","version":2},"attestation_state":"computed","paper":{"title":"Integrated Bounds for Disintegrated Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Alon Berger, Idit Keidar","submitted_at":"2018-05-16T12:15:10Z","abstract_excerpt":"We point out a somewhat surprising similarity between non-authenticated Byzantine storage, coded storage, and certain emulations of shared registers from smaller ones. A common characteristic in all of these is the inability of reads to safely return a value obtained in a single atomic access to shared storage. We collectively refer to such systems as disintegrated storage, and show integrated space lower bounds for asynchronous regular wait-free emulations in all of them. In a nutshell, if readers are invisible, then the storage cost of such systems is inherently exponential in the size of wr"},"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":"1805.06265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-16T12:15:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dbbafa8748262b5cfb56cfe347f8ba06a847bc0af596a58b1b640692676efbb3","abstract_canon_sha256":"d05318d8cd55899cadbba5f4be34b738423c3b9ec0f8b7ab4889fd5ea74e11fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:54.184145Z","signature_b64":"e969Aumg8svv1durwy9lh6skv9B/HS7k8w7l4q3MqYTSC+qkcUFHKo7qJJstrgc1NBJ4Qk86u71HmkiIRqCvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f885675a990e47b95fcc71add5e092defc3ba1fb5cbc4844f59bd1366bb39b6","last_reissued_at":"2026-05-18T00:08:54.183554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:54.183554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integrated Bounds for Disintegrated Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Alon Berger, Idit Keidar","submitted_at":"2018-05-16T12:15:10Z","abstract_excerpt":"We point out a somewhat surprising similarity between non-authenticated Byzantine storage, coded storage, and certain emulations of shared registers from smaller ones. A common characteristic in all of these is the inability of reads to safely return a value obtained in a single atomic access to shared storage. We collectively refer to such systems as disintegrated storage, and show integrated space lower bounds for asynchronous regular wait-free emulations in all of them. In a nutshell, if readers are invisible, then the storage cost of such systems is inherently exponential in the size of wr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06265","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":"1805.06265","created_at":"2026-05-18T00:08:54.183662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06265v2","created_at":"2026-05-18T00:08:54.183662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06265","created_at":"2026-05-18T00:08:54.183662+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6EFM5NJSDSH","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6EFM5NJSDSHXFP4","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6EFM5NJ","created_at":"2026-05-18T12:32:28.185984+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/H6EFM5NJSDSHXFP4Y4NN2XQJFX","json":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX.json","graph_json":"https://pith.science/api/pith-number/H6EFM5NJSDSHXFP4Y4NN2XQJFX/graph.json","events_json":"https://pith.science/api/pith-number/H6EFM5NJSDSHXFP4Y4NN2XQJFX/events.json","paper":"https://pith.science/paper/H6EFM5NJ"},"agent_actions":{"view_html":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX","download_json":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX.json","view_paper":"https://pith.science/paper/H6EFM5NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06265&json=true","fetch_graph":"https://pith.science/api/pith-number/H6EFM5NJSDSHXFP4Y4NN2XQJFX/graph.json","fetch_events":"https://pith.science/api/pith-number/H6EFM5NJSDSHXFP4Y4NN2XQJFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX/action/storage_attestation","attest_author":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX/action/author_attestation","sign_citation":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX/action/citation_signature","submit_replication":"https://pith.science/pith/H6EFM5NJSDSHXFP4Y4NN2XQJFX/action/replication_record"}},"created_at":"2026-05-18T00:08:54.183662+00:00","updated_at":"2026-05-18T00:08:54.183662+00:00"}