{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KWJFFGA6JI3EFRVK7Y55PCFALG","short_pith_number":"pith:KWJFFGA6","schema_version":"1.0","canonical_sha256":"559252981e4a3642c6aafe3bd788a059a1e7fd40d559325dd823c9b12c83906d","source":{"kind":"arxiv","id":"1208.2787","version":2},"attestation_state":"computed","paper":{"title":"Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth W. Shum, Patrick P. C. Lee, Yuchong Hu","submitted_at":"2012-08-14T05:18:43Z","abstract_excerpt":"Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a failed storage node. Existing regenerating codes mainly require surviving storage nodes encode data during repair. In this paper, we study functional minimum storage regenerating (FMSR) codes, which enable uncoded repair without the encoding requirement in surviving nodes, while preserving the minimum repair bandwidth guarantees and also minimizing disk reads. U"},"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":"1208.2787","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-14T05:18:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5f981701a740a47892b777c7431ae6696c3b0b4d53d14bab0b239ceaeea13fcf","abstract_canon_sha256":"3ef40889d7ef22dc1b288d739cd5752708df8c93796563a638fdf16017551dd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:53.951088Z","signature_b64":"/0J2dyOwKPpx1KRyFitPrAuvkNO+sSpni41Ps/KRcEyki5yLRpddCWA6AZQYRVa04klNx/bgRolHdHqw9oZ+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"559252981e4a3642c6aafe3bd788a059a1e7fd40d559325dd823c9b12c83906d","last_reissued_at":"2026-05-18T03:35:53.950558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:53.950558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth W. Shum, Patrick P. C. Lee, Yuchong Hu","submitted_at":"2012-08-14T05:18:43Z","abstract_excerpt":"Modern distributed storage systems apply redundancy coding techniques to stored data. One form of redundancy is based on regenerating codes, which can minimize the repair bandwidth, i.e., the amount of data transferred when repairing a failed storage node. Existing regenerating codes mainly require surviving storage nodes encode data during repair. In this paper, we study functional minimum storage regenerating (FMSR) codes, which enable uncoded repair without the encoding requirement in surviving nodes, while preserving the minimum repair bandwidth guarantees and also minimizing disk reads. U"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2787","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":"1208.2787","created_at":"2026-05-18T03:35:53.950618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2787v2","created_at":"2026-05-18T03:35:53.950618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2787","created_at":"2026-05-18T03:35:53.950618+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWJFFGA6JI3E","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWJFFGA6JI3EFRVK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWJFFGA6","created_at":"2026-05-18T12:27:11.947152+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/KWJFFGA6JI3EFRVK7Y55PCFALG","json":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG.json","graph_json":"https://pith.science/api/pith-number/KWJFFGA6JI3EFRVK7Y55PCFALG/graph.json","events_json":"https://pith.science/api/pith-number/KWJFFGA6JI3EFRVK7Y55PCFALG/events.json","paper":"https://pith.science/paper/KWJFFGA6"},"agent_actions":{"view_html":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG","download_json":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG.json","view_paper":"https://pith.science/paper/KWJFFGA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2787&json=true","fetch_graph":"https://pith.science/api/pith-number/KWJFFGA6JI3EFRVK7Y55PCFALG/graph.json","fetch_events":"https://pith.science/api/pith-number/KWJFFGA6JI3EFRVK7Y55PCFALG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG/action/storage_attestation","attest_author":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG/action/author_attestation","sign_citation":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG/action/citation_signature","submit_replication":"https://pith.science/pith/KWJFFGA6JI3EFRVK7Y55PCFALG/action/replication_record"}},"created_at":"2026-05-18T03:35:53.950618+00:00","updated_at":"2026-05-18T03:35:53.950618+00:00"}