{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IZ3ONUXIIZTZWKYLASRD3UPMJC","short_pith_number":"pith:IZ3ONUXI","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"},"canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","source":{"kind":"arxiv","id":"1810.04611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04611","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04611v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04611","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"IZ3ONUXIIZTZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZ3ONUXIIZTZWKYL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZ3ONUXI","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IZ3ONUXIIZTZWKYLASRD3UPMJC","target":"record","payload":{"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"},"canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","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"},"source_kind":"arxiv","source_id":"1810.04611","source_version":1,"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-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SS7jCx7hdES/SLyA2XOVtO/sTRWFVtgW2YFAjU9MDZoWcCVY08vf20Wv+m8Hn1J6sorHoCMMYfk9DnFC182Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:57.129868Z"},"content_sha256":"ff057118507a4e2c5d8656016cfeeac1dc1a10252c3d058308ae8d8ee340a4f4","schema_version":"1.0","event_id":"sha256:ff057118507a4e2c5d8656016cfeeac1dc1a10252c3d058308ae8d8ee340a4f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IZ3ONUXIIZTZWKYLASRD3UPMJC","target":"graph","payload":{"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"},"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-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/iq4V7+OZ/lYeWn6TzP1teG620vjdBojW1av4nKVhSZvHSCJVkkBXSscGL/vc+Be196bRgyxX9Kb/NSDwc7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:57.130471Z"},"content_sha256":"57352db8afab6397562e84636a4ea1040c4f0365dec6783b7eff0a33e6708b92","schema_version":"1.0","event_id":"sha256:57352db8afab6397562e84636a4ea1040c4f0365dec6783b7eff0a33e6708b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/bundle.json","state_url":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/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-31T03:14:57Z","links":{"resolver":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC","bundle":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/bundle.json","state":"https://pith.science/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZ3ONUXIIZTZWKYLASRD3UPMJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IZ3ONUXIIZTZWKYLASRD3UPMJC","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":"d7f216a4fe2071719068db73ef3e7648ce91dfc335433b5539e4b64f4a022fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T16:13:41Z","title_canon_sha256":"2299119801826ed22150c269cb4ecc0a977804f165b15baf3f76756cd2d7a718"},"schema_version":"1.0","source":{"id":"1810.04611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04611","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04611v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04611","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"IZ3ONUXIIZTZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IZ3ONUXIIZTZWKYL","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IZ3ONUXI","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:57352db8afab6397562e84636a4ea1040c4f0365dec6783b7eff0a33e6708b92","target":"graph","created_at":"2026-05-18T00:03:39Z","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"},"paper":{"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","authors_text":"Yaqian Zhang, Zhifang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T16:13:41Z","title":"Scalar MSCR Codes via the Product Matrix Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04611","kind":"arxiv","version":1},"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:ff057118507a4e2c5d8656016cfeeac1dc1a10252c3d058308ae8d8ee340a4f4","target":"record","created_at":"2026-05-18T00:03:39Z","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":"d7f216a4fe2071719068db73ef3e7648ce91dfc335433b5539e4b64f4a022fd0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-10T16:13:41Z","title_canon_sha256":"2299119801826ed22150c269cb4ecc0a977804f165b15baf3f76756cd2d7a718"},"schema_version":"1.0","source":{"id":"1810.04611","kind":"arxiv","version":1}},"canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4676e6d2e846679b2b0b04a23dd1ec4885101bb8afb282c6cf87c720d0383a13","first_computed_at":"2026-05-18T00:03:39.589463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:39.589463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bks2esqC0rcvrtC72L2aalc6oV7+C0D+DyKHs3C/3/dh6wz4K8s8aIxL9H5Gw6UgFmLGTIjO7/XU1K9NEIQ4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:39.590047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff057118507a4e2c5d8656016cfeeac1dc1a10252c3d058308ae8d8ee340a4f4","sha256:57352db8afab6397562e84636a4ea1040c4f0365dec6783b7eff0a33e6708b92"],"state_sha256":"92b1d26c7fa54413ad2454e837bd574cb795205fa48f369f4b78ce91fc25fb02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnq6jYdZwC+7/dBiWeDOr2IB+LNsGZCnH+bU2E3i/m2BbsJ8s1r7EFnWsbPJn0XhwvzifRzG4IdsGHwfkyEkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:14:57.133825Z","bundle_sha256":"d6f597f790988e38f746c6d8ee43d8806c2a57682b3ce8e3f000a80be049c441"}}