{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QFBMXTQ3AV4WFB6AZD2EFXUZNE","short_pith_number":"pith:QFBMXTQ3","schema_version":"1.0","canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","source":{"kind":"arxiv","id":"2601.10685","version":3},"attestation_state":"computed","paper":{"title":"Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jing Qiu, Shu-Tao Xia, Weijun Fang","submitted_at":"2026-01-15T18:46:15Z","abstract_excerpt":"Maximum distance separable (MDS) codes are widely used in distributed storage, but naively repairing a single failure in an $(n,k)$ MDS code requires downloading the full contents of $k$ surviving nodes. Minimum storage regenerating (MSR) codes, introduced by Dimakis et al., minimize repair bandwidth while preserving the MDS property by contacting $d>k$ helper nodes and downloading only a fraction of each helper. For scalar MDS codes, Guruswami and Wootters established a linear repair framework, and Tamo, Ye, and Barg subsequently gave the first explicit Reed-Solomon (RS) codes achieving the M"},"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":"2601.10685","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T18:46:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc71bc011c04725acc2ff7d5efa77bbd4b3a916bf04a32ab08b9c34575e0153c","abstract_canon_sha256":"69efbb7fda69c1e02d3d99b094d6c85d610c3cd578299b2e842372bb1fba1628"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:22.540431Z","signature_b64":"X4eg/GI/RFmtXMVk8R7j7ticP6vWR21e5t3j0tyolLco9yx+R23D/ytUzSMoYOQ6dRw907A9zxLmd6jBAE3yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","last_reissued_at":"2026-05-26T01:03:22.539433Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:22.539433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jing Qiu, Shu-Tao Xia, Weijun Fang","submitted_at":"2026-01-15T18:46:15Z","abstract_excerpt":"Maximum distance separable (MDS) codes are widely used in distributed storage, but naively repairing a single failure in an $(n,k)$ MDS code requires downloading the full contents of $k$ surviving nodes. Minimum storage regenerating (MSR) codes, introduced by Dimakis et al., minimize repair bandwidth while preserving the MDS property by contacting $d>k$ helper nodes and downloading only a fraction of each helper. For scalar MDS codes, Guruswami and Wootters established a linear repair framework, and Tamo, Ye, and Barg subsequently gave the first explicit Reed-Solomon (RS) codes achieving the M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.10685","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.10685/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.10685","created_at":"2026-05-26T01:03:22.539572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.10685v3","created_at":"2026-05-26T01:03:22.539572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.10685","created_at":"2026-05-26T01:03:22.539572+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFBMXTQ3AV4W","created_at":"2026-05-26T01:03:22.539572+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFBMXTQ3AV4WFB6A","created_at":"2026-05-26T01:03:22.539572+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFBMXTQ3","created_at":"2026-05-26T01:03:22.539572+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/QFBMXTQ3AV4WFB6AZD2EFXUZNE","json":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE.json","graph_json":"https://pith.science/api/pith-number/QFBMXTQ3AV4WFB6AZD2EFXUZNE/graph.json","events_json":"https://pith.science/api/pith-number/QFBMXTQ3AV4WFB6AZD2EFXUZNE/events.json","paper":"https://pith.science/paper/QFBMXTQ3"},"agent_actions":{"view_html":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE","download_json":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE.json","view_paper":"https://pith.science/paper/QFBMXTQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/QFBMXTQ3AV4WFB6AZD2EFXUZNE/graph.json","fetch_events":"https://pith.science/api/pith-number/QFBMXTQ3AV4WFB6AZD2EFXUZNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/action/storage_attestation","attest_author":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/action/author_attestation","sign_citation":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/action/citation_signature","submit_replication":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/action/replication_record"}},"created_at":"2026-05-26T01:03:22.539572+00:00","updated_at":"2026-05-26T01:03:22.539572+00:00"}