{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M6WEVLT5V57ZDM7XRCCZYFV6C3","short_pith_number":"pith:M6WEVLT5","schema_version":"1.0","canonical_sha256":"67ac4aae7daf7f91b3f788859c16be16d77c3d5317ac4744de57d773081f1078","source":{"kind":"arxiv","id":"1401.5168","version":1},"attestation_state":"computed","paper":{"title":"Distributed Storage Schemes over Unidirectional Ring Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jiyong Lu, Xuan Guang","submitted_at":"2014-01-21T03:36:07Z","abstract_excerpt":"In this paper, we study distributed storage problems over unidirectional ring networks. A lower bound on the reconstructing bandwidth to recover total original data for each user is proposed, and it is achievable for arbitrary parameters. If a distributed storage scheme can achieve this lower bound with equality for each user, we say it an optimal reconstructing distributed storage scheme (ORDSS). Furthermore, the repair problem for a failed storage node in ORDSSes is under consideration and a tight lower bound on the repair bandwidth for each storage node is obtained. Particularly, we indicat"},"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":"1401.5168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-21T03:36:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c23444decba427272df977a40e877da62cca97c0e9040ff7954be3aa6ca6c6b1","abstract_canon_sha256":"b32540cd6b229acf8915634bc94aee1ce6f5959c43a0862598cdffe06966dcf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.653665Z","signature_b64":"yXjWshkC2dF3GHZ5fC3UpM1vIUg7b9nMp3EVYBCWVmxIU+pzhWWeOoxUi76L9nteZ+3k7DvMRbwQIRjKhQ3ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ac4aae7daf7f91b3f788859c16be16d77c3d5317ac4744de57d773081f1078","last_reissued_at":"2026-05-18T03:01:34.652746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.652746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Storage Schemes over Unidirectional Ring Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jiyong Lu, Xuan Guang","submitted_at":"2014-01-21T03:36:07Z","abstract_excerpt":"In this paper, we study distributed storage problems over unidirectional ring networks. A lower bound on the reconstructing bandwidth to recover total original data for each user is proposed, and it is achievable for arbitrary parameters. If a distributed storage scheme can achieve this lower bound with equality for each user, we say it an optimal reconstructing distributed storage scheme (ORDSS). Furthermore, the repair problem for a failed storage node in ORDSSes is under consideration and a tight lower bound on the repair bandwidth for each storage node is obtained. Particularly, we indicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5168","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":"1401.5168","created_at":"2026-05-18T03:01:34.652904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5168v1","created_at":"2026-05-18T03:01:34.652904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5168","created_at":"2026-05-18T03:01:34.652904+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6WEVLT5V57Z","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6WEVLT5V57ZDM7X","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6WEVLT5","created_at":"2026-05-18T12:28:38.356838+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/M6WEVLT5V57ZDM7XRCCZYFV6C3","json":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3.json","graph_json":"https://pith.science/api/pith-number/M6WEVLT5V57ZDM7XRCCZYFV6C3/graph.json","events_json":"https://pith.science/api/pith-number/M6WEVLT5V57ZDM7XRCCZYFV6C3/events.json","paper":"https://pith.science/paper/M6WEVLT5"},"agent_actions":{"view_html":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3","download_json":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3.json","view_paper":"https://pith.science/paper/M6WEVLT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5168&json=true","fetch_graph":"https://pith.science/api/pith-number/M6WEVLT5V57ZDM7XRCCZYFV6C3/graph.json","fetch_events":"https://pith.science/api/pith-number/M6WEVLT5V57ZDM7XRCCZYFV6C3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3/action/storage_attestation","attest_author":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3/action/author_attestation","sign_citation":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3/action/citation_signature","submit_replication":"https://pith.science/pith/M6WEVLT5V57ZDM7XRCCZYFV6C3/action/replication_record"}},"created_at":"2026-05-18T03:01:34.652904+00:00","updated_at":"2026-05-18T03:01:34.652904+00:00"}