{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JQSAVHQILSWHHWXSWPBPGZXEN6","short_pith_number":"pith:JQSAVHQI","schema_version":"1.0","canonical_sha256":"4c240a9e085cac73daf2b3c2f366e46fa11e4698b813f6680b265dd5b121107c","source":{"kind":"arxiv","id":"1711.03034","version":1},"attestation_state":"computed","paper":{"title":"Optimal Control of Storage Regeneration with Repair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alonso Silva, and Olfa Hassani, Francesco De Pellegrini, Rachid El Azouzi","submitted_at":"2017-11-08T16:19:33Z","abstract_excerpt":"High availability of containerized applications requires to perform robust storage of applications' state. Since basic replication techniques are extremely costly at scale, storage space requirements can be reduced by means of erasure or repairing codes. In this paper we address storage regeneration using repair codes, a robust distributed storage technique with no need to fully restore the whole state in case of failure. In fact, only the lost servers' content is replaced. To do so, new cleanslate storage units are made operational at a cost for activating new storage servers and a cost for t"},"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":"1711.03034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-08T16:19:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bf362c0df30eff47d5f34e73f5b39908eff1746f2d98b545c967bfc5f300816b","abstract_canon_sha256":"7fc2b9292e9ff009ac985f2412491f2b4ca6dda4b87706a174005a7a82414b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.988614Z","signature_b64":"3JB54jmsXV7pU1e8CPyzct1V6AdF2/YD7zFTdBTLDRWD29A+hJG9tm+qrPl54aN93SpFblqH4+ZTefPo+i2GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c240a9e085cac73daf2b3c2f366e46fa11e4698b813f6680b265dd5b121107c","last_reissued_at":"2026-05-18T00:31:00.988022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.988022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Control of Storage Regeneration with Repair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alonso Silva, and Olfa Hassani, Francesco De Pellegrini, Rachid El Azouzi","submitted_at":"2017-11-08T16:19:33Z","abstract_excerpt":"High availability of containerized applications requires to perform robust storage of applications' state. Since basic replication techniques are extremely costly at scale, storage space requirements can be reduced by means of erasure or repairing codes. In this paper we address storage regeneration using repair codes, a robust distributed storage technique with no need to fully restore the whole state in case of failure. In fact, only the lost servers' content is replaced. To do so, new cleanslate storage units are made operational at a cost for activating new storage servers and a cost for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03034","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":"1711.03034","created_at":"2026-05-18T00:31:00.988092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03034v1","created_at":"2026-05-18T00:31:00.988092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03034","created_at":"2026-05-18T00:31:00.988092+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQSAVHQILSWH","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQSAVHQILSWHHWXS","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQSAVHQI","created_at":"2026-05-18T12:31:24.725408+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/JQSAVHQILSWHHWXSWPBPGZXEN6","json":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6.json","graph_json":"https://pith.science/api/pith-number/JQSAVHQILSWHHWXSWPBPGZXEN6/graph.json","events_json":"https://pith.science/api/pith-number/JQSAVHQILSWHHWXSWPBPGZXEN6/events.json","paper":"https://pith.science/paper/JQSAVHQI"},"agent_actions":{"view_html":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6","download_json":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6.json","view_paper":"https://pith.science/paper/JQSAVHQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03034&json=true","fetch_graph":"https://pith.science/api/pith-number/JQSAVHQILSWHHWXSWPBPGZXEN6/graph.json","fetch_events":"https://pith.science/api/pith-number/JQSAVHQILSWHHWXSWPBPGZXEN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6/action/storage_attestation","attest_author":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6/action/author_attestation","sign_citation":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6/action/citation_signature","submit_replication":"https://pith.science/pith/JQSAVHQILSWHHWXSWPBPGZXEN6/action/replication_record"}},"created_at":"2026-05-18T00:31:00.988092+00:00","updated_at":"2026-05-18T00:31:00.988092+00:00"}