{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:E4SP6M4OWSR6HTXRGDZEWVQTHC","short_pith_number":"pith:E4SP6M4O","schema_version":"1.0","canonical_sha256":"2724ff338eb4a3e3cef130f24b561338b72a7f94d44c14cab93fdd8375a17a8c","source":{"kind":"arxiv","id":"1305.3828","version":2},"attestation_state":"computed","paper":{"title":"Exploiting non-constant safe memory in resilient algorithms and data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Lorenzo De Stefani","submitted_at":"2013-05-16T14:50:18Z","abstract_excerpt":"We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size $S$, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. Let $\\delta$ and $\\alpha$ denote, respectively, the maximum amount of faults which can happen during the execution of an algorithm and the actual number of occurred faults, with $\\alpha \\leq \\delta$. We propose a resilient algorithm for sorting $n$ entries which requires $O\\left(n\\log n+\\alpha (\\delta/S + \\log S)\\right)$ time and uses $\\Theta(S)$ safe memory words. "},"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":"1305.3828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-16T14:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"b92fa6200f15bd011b2336691d96fb286d1d5e7a22ce1dc762a85cf02ce68f0a","abstract_canon_sha256":"cc754efd841c104f3e514d90f3a224c076246672dc0de9049169be4c5e5f270f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.950623Z","signature_b64":"mOQCNJeU95nYINQWRToain8WkJSYLVpgj9mgvq2JyGFF8GLUmowyhkfOkISve9lco7rXZo2eV/NVs+PVbjjxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2724ff338eb4a3e3cef130f24b561338b72a7f94d44c14cab93fdd8375a17a8c","last_reissued_at":"2026-05-18T02:19:43.950156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.950156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting non-constant safe memory in resilient algorithms and data structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Lorenzo De Stefani","submitted_at":"2013-05-16T14:50:18Z","abstract_excerpt":"We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size $S$, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. Let $\\delta$ and $\\alpha$ denote, respectively, the maximum amount of faults which can happen during the execution of an algorithm and the actual number of occurred faults, with $\\alpha \\leq \\delta$. We propose a resilient algorithm for sorting $n$ entries which requires $O\\left(n\\log n+\\alpha (\\delta/S + \\log S)\\right)$ time and uses $\\Theta(S)$ safe memory words. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3828","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":"1305.3828","created_at":"2026-05-18T02:19:43.950214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3828v2","created_at":"2026-05-18T02:19:43.950214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3828","created_at":"2026-05-18T02:19:43.950214+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4SP6M4OWSR6","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4SP6M4OWSR6HTXR","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4SP6M4O","created_at":"2026-05-18T12:27:43.054852+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/E4SP6M4OWSR6HTXRGDZEWVQTHC","json":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC.json","graph_json":"https://pith.science/api/pith-number/E4SP6M4OWSR6HTXRGDZEWVQTHC/graph.json","events_json":"https://pith.science/api/pith-number/E4SP6M4OWSR6HTXRGDZEWVQTHC/events.json","paper":"https://pith.science/paper/E4SP6M4O"},"agent_actions":{"view_html":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC","download_json":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC.json","view_paper":"https://pith.science/paper/E4SP6M4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3828&json=true","fetch_graph":"https://pith.science/api/pith-number/E4SP6M4OWSR6HTXRGDZEWVQTHC/graph.json","fetch_events":"https://pith.science/api/pith-number/E4SP6M4OWSR6HTXRGDZEWVQTHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC/action/storage_attestation","attest_author":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC/action/author_attestation","sign_citation":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC/action/citation_signature","submit_replication":"https://pith.science/pith/E4SP6M4OWSR6HTXRGDZEWVQTHC/action/replication_record"}},"created_at":"2026-05-18T02:19:43.950214+00:00","updated_at":"2026-05-18T02:19:43.950214+00:00"}