{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3HMZ6A3GGF7QH6YLCABV2NSMIH","short_pith_number":"pith:3HMZ6A3G","schema_version":"1.0","canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","source":{"kind":"arxiv","id":"1610.08026","version":3},"attestation_state":"computed","paper":{"title":"Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","submitted_at":"2016-10-25T19:16:16Z","abstract_excerpt":"In this paper, we revisit the problem of finding the longest systematic-length $k$ for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity $l$ and an arbitrary number of parity nodes $r$. We study the problem by following a geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that $k=r+2$ is the largest number of systematic nodes in the \\emph{scalar} scenario. Second, an $r$-based-log bound is derived, which is superior to the upper bound on log-base $2$ in t"},"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":"1610.08026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T19:16:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d1202c7a3490f5b95715c1ce0c5c29f59e456e415c453af9c68946500d4f40b","abstract_canon_sha256":"aaf6faa9e5365ba379b958f109f190579cb5185b4ffa4e84ea27c6d363f0bdf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.318233Z","signature_b64":"sRlXmOzFjvylLCdRW7NxkpaqM2N/2YkmYMhvy1GAes8ECgQX6GfFK1wiBetl2e0jLCAkAscXAt1yaNoLB+bYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","last_reissued_at":"2026-05-18T00:11:28.317883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.317883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","submitted_at":"2016-10-25T19:16:16Z","abstract_excerpt":"In this paper, we revisit the problem of finding the longest systematic-length $k$ for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity $l$ and an arbitrary number of parity nodes $r$. We study the problem by following a geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that $k=r+2$ is the largest number of systematic nodes in the \\emph{scalar} scenario. Second, an $r$-based-log bound is derived, which is superior to the upper bound on log-base $2$ in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08026","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":""},"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":"1610.08026","created_at":"2026-05-18T00:11:28.317939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08026v3","created_at":"2026-05-18T00:11:28.317939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08026","created_at":"2026-05-18T00:11:28.317939+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HMZ6A3GGF7Q","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HMZ6A3GGF7QH6YL","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HMZ6A3G","created_at":"2026-05-18T12:29:55.572404+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/3HMZ6A3GGF7QH6YLCABV2NSMIH","json":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH.json","graph_json":"https://pith.science/api/pith-number/3HMZ6A3GGF7QH6YLCABV2NSMIH/graph.json","events_json":"https://pith.science/api/pith-number/3HMZ6A3GGF7QH6YLCABV2NSMIH/events.json","paper":"https://pith.science/paper/3HMZ6A3G"},"agent_actions":{"view_html":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH","download_json":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH.json","view_paper":"https://pith.science/paper/3HMZ6A3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08026&json=true","fetch_graph":"https://pith.science/api/pith-number/3HMZ6A3GGF7QH6YLCABV2NSMIH/graph.json","fetch_events":"https://pith.science/api/pith-number/3HMZ6A3GGF7QH6YLCABV2NSMIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/action/storage_attestation","attest_author":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/action/author_attestation","sign_citation":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/action/citation_signature","submit_replication":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/action/replication_record"}},"created_at":"2026-05-18T00:11:28.317939+00:00","updated_at":"2026-05-18T00:11:28.317939+00:00"}