{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35ACLCSTIA32H5BNNN4YAM4BFI","short_pith_number":"pith:35ACLCST","schema_version":"1.0","canonical_sha256":"df40258a534037a3f42d6b798033812a10f9f467185922abaed8a075554e0776","source":{"kind":"arxiv","id":"1602.01995","version":1},"attestation_state":"computed","paper":{"title":"Efficient distribution and improved security for reliable cloud storage system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aneta Velkoska, Natasa Paunkoska, Ninoslav Marina","submitted_at":"2016-02-05T11:51:00Z","abstract_excerpt":"The distributed data storage systems are constructed by large number of nodes which are interconnected over a network. Each node in such peer-to-peer network is vulnerable and at a potential risk for attack. The attackers can eavesdrop the nodes and possibly modify their data. Hence distributed storage systems should be secure apart from satisfying the reconstruction and repair requirements. We constructed a distributed storage system, Twin MDS code framework which is more efficient than the regenerating codes based storage systems. We prove that this Twin MDS code framework gives better perfo"},"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":"1602.01995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T11:51:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"18ae38bc18758fb1b45c3a1a616f68535d8461a6bee3adbe818e80cda31af345","abstract_canon_sha256":"98192e90918452f49e560241708ed1de731ae6f6bae5c1bd83d3e11acb192fb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.837867Z","signature_b64":"v3mqHerNfLu3oPmWiizx43fX/lzwHFXRB5Fr3MePSJ6V+JgJySD3LzOL0/dHgREegFcPuvwLQdg6oqY0xUPMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df40258a534037a3f42d6b798033812a10f9f467185922abaed8a075554e0776","last_reissued_at":"2026-05-18T01:21:14.837182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.837182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient distribution and improved security for reliable cloud storage system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aneta Velkoska, Natasa Paunkoska, Ninoslav Marina","submitted_at":"2016-02-05T11:51:00Z","abstract_excerpt":"The distributed data storage systems are constructed by large number of nodes which are interconnected over a network. Each node in such peer-to-peer network is vulnerable and at a potential risk for attack. The attackers can eavesdrop the nodes and possibly modify their data. Hence distributed storage systems should be secure apart from satisfying the reconstruction and repair requirements. We constructed a distributed storage system, Twin MDS code framework which is more efficient than the regenerating codes based storage systems. We prove that this Twin MDS code framework gives better perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01995","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":"1602.01995","created_at":"2026-05-18T01:21:14.837295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01995v1","created_at":"2026-05-18T01:21:14.837295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01995","created_at":"2026-05-18T01:21:14.837295+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ACLCSTIA32","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ACLCSTIA32H5BN","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ACLCST","created_at":"2026-05-18T12:29:55.572404+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/35ACLCSTIA32H5BNNN4YAM4BFI","json":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI.json","graph_json":"https://pith.science/api/pith-number/35ACLCSTIA32H5BNNN4YAM4BFI/graph.json","events_json":"https://pith.science/api/pith-number/35ACLCSTIA32H5BNNN4YAM4BFI/events.json","paper":"https://pith.science/paper/35ACLCST"},"agent_actions":{"view_html":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI","download_json":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI.json","view_paper":"https://pith.science/paper/35ACLCST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01995&json=true","fetch_graph":"https://pith.science/api/pith-number/35ACLCSTIA32H5BNNN4YAM4BFI/graph.json","fetch_events":"https://pith.science/api/pith-number/35ACLCSTIA32H5BNNN4YAM4BFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI/action/storage_attestation","attest_author":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI/action/author_attestation","sign_citation":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI/action/citation_signature","submit_replication":"https://pith.science/pith/35ACLCSTIA32H5BNNN4YAM4BFI/action/replication_record"}},"created_at":"2026-05-18T01:21:14.837295+00:00","updated_at":"2026-05-18T01:21:14.837295+00:00"}