{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EDMU6PSW6JCI5HVZCT4BFE437U","short_pith_number":"pith:EDMU6PSW","schema_version":"1.0","canonical_sha256":"20d94f3e56f2448e9eb914f812939bfd175d825bf1939d6c0864b4f4b121f6db","source":{"kind":"arxiv","id":"1409.4991","version":4},"attestation_state":"computed","paper":{"title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Setzer, Christian Scheideler, Martina Eikel","submitted_at":"2014-09-17T13:38:30Z","abstract_excerpt":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to $\\gamma n^{1/\\log\\log n}$ crashed servers, with $\\gamma>0$ constant and $n$ denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithm"},"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":"1409.4991","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-17T13:38:30Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"fa05c113f7ed2c5eb196d6c5b6547cdce555adb2138c56e32db6efd90bd356b1","abstract_canon_sha256":"b546555257ee511d6295c1c803edd7f657e09c87801977f563973ac4abf03509"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.749021Z","signature_b64":"i9xYNZzD9Q8k8fyU1YuV6myKx8NoqcPxm9l4tOIkS2Sq9pXIqILfSo9YPCVHmABOHC1abBDqjWdTZa9Lm3x1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d94f3e56f2448e9eb914f812939bfd175d825bf1939d6c0864b4f4b121f6db","last_reissued_at":"2026-05-18T02:26:38.748571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.748571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Setzer, Christian Scheideler, Martina Eikel","submitted_at":"2014-09-17T13:38:30Z","abstract_excerpt":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to $\\gamma n^{1/\\log\\log n}$ crashed servers, with $\\gamma>0$ constant and $n$ denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4991","kind":"arxiv","version":4},"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":"1409.4991","created_at":"2026-05-18T02:26:38.748636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4991v4","created_at":"2026-05-18T02:26:38.748636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4991","created_at":"2026-05-18T02:26:38.748636+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDMU6PSW6JCI","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDMU6PSW6JCI5HVZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDMU6PSW","created_at":"2026-05-18T12:28:25.294606+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/EDMU6PSW6JCI5HVZCT4BFE437U","json":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U.json","graph_json":"https://pith.science/api/pith-number/EDMU6PSW6JCI5HVZCT4BFE437U/graph.json","events_json":"https://pith.science/api/pith-number/EDMU6PSW6JCI5HVZCT4BFE437U/events.json","paper":"https://pith.science/paper/EDMU6PSW"},"agent_actions":{"view_html":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U","download_json":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U.json","view_paper":"https://pith.science/paper/EDMU6PSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4991&json=true","fetch_graph":"https://pith.science/api/pith-number/EDMU6PSW6JCI5HVZCT4BFE437U/graph.json","fetch_events":"https://pith.science/api/pith-number/EDMU6PSW6JCI5HVZCT4BFE437U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U/action/storage_attestation","attest_author":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U/action/author_attestation","sign_citation":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U/action/citation_signature","submit_replication":"https://pith.science/pith/EDMU6PSW6JCI5HVZCT4BFE437U/action/replication_record"}},"created_at":"2026-05-18T02:26:38.748636+00:00","updated_at":"2026-05-18T02:26:38.748636+00:00"}