{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3HMZ6A3GGF7QH6YLCABV2NSMIH","short_pith_number":"pith:3HMZ6A3G","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"},"canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","source":{"kind":"arxiv","id":"1610.08026","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08026","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08026v3","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08026","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"3HMZ6A3GGF7Q","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HMZ6A3GGF7QH6YL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HMZ6A3G","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3HMZ6A3GGF7QH6YLCABV2NSMIH","target":"record","payload":{"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"},"canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","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"},"source_kind":"arxiv","source_id":"1610.08026","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-18T00:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96CRJ30tV5LqkTbBfG8zsLpwQvOcXVYU6THFSWdKnYJtgh1Ix5pTZ3slnSln5+c5U8tH/7iO/yLIs82LZgcaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:14.088723Z"},"content_sha256":"340551183fdac4c6167a5cdfb26391e82c000cb03a548cf289a3f1a8bc1690ae","schema_version":"1.0","event_id":"sha256:340551183fdac4c6167a5cdfb26391e82c000cb03a548cf289a3f1a8bc1690ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3HMZ6A3GGF7QH6YLCABV2NSMIH","target":"graph","payload":{"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"},"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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNemKCTtqD4zAmDeuCkO2Vbp1+rZe895ZRq6Gz7RLPcibj3LVbcS5/w5k/nPKS1m6GPmkLE0eycRFezB1/bPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:14.089070Z"},"content_sha256":"239ba17889fb8433956215e5699c9a43a2ff88a720c593350207d59ffb40bf32","schema_version":"1.0","event_id":"sha256:239ba17889fb8433956215e5699c9a43a2ff88a720c593350207d59ffb40bf32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/bundle.json","state_url":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/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-30T08:49:14Z","links":{"resolver":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH","bundle":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/bundle.json","state":"https://pith.science/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HMZ6A3GGF7QH6YLCABV2NSMIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3HMZ6A3GGF7QH6YLCABV2NSMIH","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":"aaf6faa9e5365ba379b958f109f190579cb5185b4ffa4e84ea27c6d363f0bdf9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T19:16:16Z","title_canon_sha256":"9d1202c7a3490f5b95715c1ce0c5c29f59e456e415c453af9c68946500d4f40b"},"schema_version":"1.0","source":{"id":"1610.08026","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08026","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08026v3","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08026","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"3HMZ6A3GGF7Q","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HMZ6A3GGF7QH6YL","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HMZ6A3G","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:239ba17889fb8433956215e5699c9a43a2ff88a720c593350207d59ffb40bf32","target":"graph","created_at":"2026-05-18T00:11:28Z","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":"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","authors_text":"Kun Huang, Ming Xian, Udaya Parampalli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T19:16:16Z","title":"Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08026","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:340551183fdac4c6167a5cdfb26391e82c000cb03a548cf289a3f1a8bc1690ae","target":"record","created_at":"2026-05-18T00:11:28Z","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":"aaf6faa9e5365ba379b958f109f190579cb5185b4ffa4e84ea27c6d363f0bdf9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T19:16:16Z","title_canon_sha256":"9d1202c7a3490f5b95715c1ce0c5c29f59e456e415c453af9c68946500d4f40b"},"schema_version":"1.0","source":{"id":"1610.08026","kind":"arxiv","version":3}},"canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9d99f0366317f03fb0b10035d364c41dbf79b629808545947f8baaff957c193","first_computed_at":"2026-05-18T00:11:28.317883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.317883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRlXmOzFjvylLCdRW7NxkpaqM2N/2YkmYMhvy1GAes8ECgQX6GfFK1wiBetl2e0jLCAkAscXAt1yaNoLB+bYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.318233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08026","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:340551183fdac4c6167a5cdfb26391e82c000cb03a548cf289a3f1a8bc1690ae","sha256:239ba17889fb8433956215e5699c9a43a2ff88a720c593350207d59ffb40bf32"],"state_sha256":"727394746070857fe80caffda82efae2fe76f307feedab399c5c3ba8dc7820cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/N+Iflsefs4syksI1xHJ1qLA5Z1XVQHbVKq6GR9Em3fMpS4QGPAt4p7ioWbX4N0tQkdvMJSLDrpTiGAAlV8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:49:14.091079Z","bundle_sha256":"3c147a0e3861a28a06d3cd980610d8ce463adae161fd86a45f321e49d5ba8c38"}}