{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QFBMXTQ3AV4WFB6AZD2EFXUZNE","short_pith_number":"pith:QFBMXTQ3","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"},"canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","source":{"kind":"arxiv","id":"2601.10685","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.10685","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2601.10685v3","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.10685","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"QFBMXTQ3AV4W","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"QFBMXTQ3AV4WFB6A","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"QFBMXTQ3","created_at":"2026-05-26T01:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QFBMXTQ3AV4WFB6AZD2EFXUZNE","target":"record","payload":{"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"},"canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","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"},"source_kind":"arxiv","source_id":"2601.10685","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7p+PjwNXgiIFplYRCFsGpJNE00rZvFRkBaL4jCyp9f0JDa8PmxqSbnWrEknJLwPf1kCaM5t+K5jgAnBar9YGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:55:33.058112Z"},"content_sha256":"d65f889512ad3df7ea4203f3b8acf4f15780d897488923b397f467029f7c7bf6","schema_version":"1.0","event_id":"sha256:d65f889512ad3df7ea4203f3b8acf4f15780d897488923b397f467029f7c7bf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QFBMXTQ3AV4WFB6AZD2EFXUZNE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DQFHgAi+Of+uT5yXApGpcyvP88BuLqqKJ8haZ+JDxlHlDjHiE1vT6lI1hauBDvkczlwWXn17AWCbCG3UzvBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:55:33.058811Z"},"content_sha256":"b7e57deac7a558e335fdf5f0a499c7823e0c35c5191470e69ada06e6286598f7","schema_version":"1.0","event_id":"sha256:b7e57deac7a558e335fdf5f0a499c7823e0c35c5191470e69ada06e6286598f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/bundle.json","state_url":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T21:55:33Z","links":{"resolver":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE","bundle":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/bundle.json","state":"https://pith.science/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFBMXTQ3AV4WFB6AZD2EFXUZNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QFBMXTQ3AV4WFB6AZD2EFXUZNE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"69efbb7fda69c1e02d3d99b094d6c85d610c3cd578299b2e842372bb1fba1628","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T18:46:15Z","title_canon_sha256":"dc71bc011c04725acc2ff7d5efa77bbd4b3a916bf04a32ab08b9c34575e0153c"},"schema_version":"1.0","source":{"id":"2601.10685","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.10685","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2601.10685v3","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.10685","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"QFBMXTQ3AV4W","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"QFBMXTQ3AV4WFB6A","created_at":"2026-05-26T01:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"QFBMXTQ3","created_at":"2026-05-26T01:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:b7e57deac7a558e335fdf5f0a499c7823e0c35c5191470e69ada06e6286598f7","target":"graph","created_at":"2026-05-26T01:03:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.10685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fang-Wei Fu, Jing Qiu, Shu-Tao Xia, Weijun Fang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T18:46:15Z","title":"Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.10685","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d65f889512ad3df7ea4203f3b8acf4f15780d897488923b397f467029f7c7bf6","target":"record","created_at":"2026-05-26T01:03:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"69efbb7fda69c1e02d3d99b094d6c85d610c3cd578299b2e842372bb1fba1628","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-15T18:46:15Z","title_canon_sha256":"dc71bc011c04725acc2ff7d5efa77bbd4b3a916bf04a32ab08b9c34575e0153c"},"schema_version":"1.0","source":{"id":"2601.10685","kind":"arxiv","version":3}},"canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8142cbce1b05796287c0c8f442de99690e38dd8aa218ca6bc57922d381339dda","first_computed_at":"2026-05-26T01:03:22.539433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:22.539433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X4eg/GI/RFmtXMVk8R7j7ticP6vWR21e5t3j0tyolLco9yx+R23D/ytUzSMoYOQ6dRw907A9zxLmd6jBAE3yAg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:22.540431Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.10685","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d65f889512ad3df7ea4203f3b8acf4f15780d897488923b397f467029f7c7bf6","sha256:b7e57deac7a558e335fdf5f0a499c7823e0c35c5191470e69ada06e6286598f7"],"state_sha256":"6e087afd9220528908b1bee7865c680cefa7793f598102094bdad7e6c8f4466d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvTV6TF9tMI+vR5VINNOiRr4+pa2thO/z2RI4s4IemnDjs6aMW3eAmndxxw+OO/qPamkD5xhOX12Dts6z2yNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:55:33.062567Z","bundle_sha256":"c1a157382d638996f1e94513025b893138cef667a073581ac6144743d4bc8b4d"}}