{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IZ3ONUXIIZTZWKYLASRD3UPMJC","short_pith_number":"pith:IZ3ONUXI","schema_version":"1.0","canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","source":{"kind":"arxiv","id":"1810.04611","version":1},"attestation_state":"computed","paper":{"title":"Scalar MSCR Codes via the Product Matrix Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yaqian Zhang, Zhifang Zhang","submitted_at":"2018-10-10T16:13:41Z","abstract_excerpt":"An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth repair for any $t~(t\\!>\\!1)$ node failures in a cooperative way. In particular, an MSCR (minimum storage cooperative regenerating) code retains the same storage overhead as an $(n,k)$ MDS code. Suppose each node stores $\\alpha$ symbols which indicates the sub-packetization level of the code. A scalar MSCR code attains the minimum sub-packetization, i.e., $\\alpha=d-k+t$. By now, all existing constructions of scalar MSCR codes restrict to very special parameters, eg. $d=k$ or $k=2$, etc. In a recent work, Ye and Barg const"},"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":"1810.04611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T16:13:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2299119801826ed22150c269cb4ecc0a977804f165b15baf3f76756cd2d7a718","abstract_canon_sha256":"d7f216a4fe2071719068db73ef3e7648ce91dfc335433b5539e4b64f4a022fd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:39.590047Z","signature_b64":"Bks2esqC0rcvrtC72L2aalc6oV7+C0D+DyKHs3C/3/dh6wz4K8s8aIxL9H5Gw6UgFmLGTIjO7/XU1K9NEIQ4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","last_reissued_at":"2026-05-18T00:03:39.589463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:39.589463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalar MSCR Codes via the Product Matrix Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yaqian Zhang, Zhifang Zhang","submitted_at":"2018-10-10T16:13:41Z","abstract_excerpt":"An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth repair for any $t~(t\\!>\\!1)$ node failures in a cooperative way. In particular, an MSCR (minimum storage cooperative regenerating) code retains the same storage overhead as an $(n,k)$ MDS code. Suppose each node stores $\\alpha$ symbols which indicates the sub-packetization level of the code. A scalar MSCR code attains the minimum sub-packetization, i.e., $\\alpha=d-k+t$. By now, all existing constructions of scalar MSCR codes restrict to very special parameters, eg. $d=k$ or $k=2$, etc. In a recent work, Ye and Barg const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04611","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":"1810.04611","created_at":"2026-05-18T00:03:39.589566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04611v1","created_at":"2026-05-18T00:03:39.589566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04611","created_at":"2026-05-18T00:03:39.589566+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ3ONUXIIZTZ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ3ONUXIIZTZWKYL","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ3ONUXI","created_at":"2026-05-18T12:32:31.084164+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/IZ3ONUXIIZTZWKYLASRD3UPMJC","json":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC.json","graph_json":"https://pith.science/api/pith-number/IZ3ONUXIIZTZWKYLASRD3UPMJC/graph.json","events_json":"https://pith.science/api/pith-number/IZ3ONUXIIZTZWKYLASRD3UPMJC/events.json","paper":"https://pith.science/paper/IZ3ONUXI"},"agent_actions":{"view_html":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC","download_json":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC.json","view_paper":"https://pith.science/paper/IZ3ONUXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04611&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ3ONUXIIZTZWKYLASRD3UPMJC/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ3ONUXIIZTZWKYLASRD3UPMJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/action/storage_attestation","attest_author":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/action/author_attestation","sign_citation":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/action/citation_signature","submit_replication":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/action/replication_record"}},"created_at":"2026-05-18T00:03:39.589566+00:00","updated_at":"2026-05-18T00:03:39.589566+00:00"}