{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EUS34CMHKXFBRV3RK7IWQD2OB2","short_pith_number":"pith:EUS34CMH","canonical_record":{"source":{"id":"1501.06662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d478d53715045ee6659877b10a7613d62fc22313fe0e60de6f18ec7e0e4e869","abstract_canon_sha256":"cf9bb0bac9cdd4279bc0c010e391c5a1d7b87d3feb17d99256ccf6f499c6154d"},"schema_version":"1.0"},"canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","source":{"kind":"arxiv","id":"1501.06662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06662","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06662v1","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06662","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"EUS34CMHKXFB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUS34CMHKXFBRV3R","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUS34CMH","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EUS34CMHKXFBRV3RK7IWQD2OB2","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d478d53715045ee6659877b10a7613d62fc22313fe0e60de6f18ec7e0e4e869","abstract_canon_sha256":"cf9bb0bac9cdd4279bc0c010e391c5a1d7b87d3feb17d99256ccf6f499c6154d"},"schema_version":"1.0"},"canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.424480Z","signature_b64":"CAEFVNj3y4ab/gbiVWqK93Gjt/eqZpLF3nfp6+re+4PiFFjIOrgxv3DEc1HkgiaiFdN0cJCHWuScZaCxfQdJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","last_reissued_at":"2026-05-18T02:28:39.423770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.423770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06662","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtLTk774vV/lodHCwBZMDg/CTDvUCqxri7DrryMxoQ6odrgW8Adavd3W2/sBqRLbF0E0qh9MQLzm3wfMW+05Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:51:47.116086Z"},"content_sha256":"f654825b7e00ffdfa015d673100941f9fc0964ae9e8254dc5e3973602f770efa","schema_version":"1.0","event_id":"sha256:f654825b7e00ffdfa015d673100941f9fc0964ae9e8254dc5e3973602f770efa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EUS34CMHKXFBRV3RK7IWQD2OB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A High-Rate MSR Code With Polynomial Sub-Packetization Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","submitted_at":"2015-01-27T06:02:45Z","abstract_excerpt":"We present a high-rate $(n,k,d=n-1)$-MSR code with a sub-packetization level that is polynomial in the dimension $k$ of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization level are available. But in the high-rate regime (i. e., rates greater than one-half), the known MSR code constructions required a sub-packetization level that is exponential in $k$. In the pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06662","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-18T02:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VUDghS1BMNHjB1cNz1HW0oyDzBvXdyikl6QpPOTV2bsfmCkHa+5K9GSiDdaKlBtTG4MJQOXNqQs24vLz1/VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:51:47.116572Z"},"content_sha256":"3737bcaacb02f8d7420d10083906689c2f32c43f2fffc7f9b4d2f085a86ccafa","schema_version":"1.0","event_id":"sha256:3737bcaacb02f8d7420d10083906689c2f32c43f2fffc7f9b4d2f085a86ccafa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/bundle.json","state_url":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/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-30T18:51:47Z","links":{"resolver":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2","bundle":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/bundle.json","state":"https://pith.science/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUS34CMHKXFBRV3RK7IWQD2OB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EUS34CMHKXFBRV3RK7IWQD2OB2","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":"cf9bb0bac9cdd4279bc0c010e391c5a1d7b87d3feb17d99256ccf6f499c6154d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","title_canon_sha256":"7d478d53715045ee6659877b10a7613d62fc22313fe0e60de6f18ec7e0e4e869"},"schema_version":"1.0","source":{"id":"1501.06662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06662","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06662v1","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06662","created_at":"2026-05-18T02:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"EUS34CMHKXFB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EUS34CMHKXFBRV3R","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EUS34CMH","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3737bcaacb02f8d7420d10083906689c2f32c43f2fffc7f9b4d2f085a86ccafa","target":"graph","created_at":"2026-05-18T02:28: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":"We present a high-rate $(n,k,d=n-1)$-MSR code with a sub-packetization level that is polynomial in the dimension $k$ of the code. While polynomial sub-packetization level was achieved earlier for vector MDS codes that repair systematic nodes optimally, no such MSR code construction is known. In the low-rate regime (i. e., rates less than one-half), MSR code constructions with a linear sub-packetization level are available. But in the high-rate regime (i. e., rates greater than one-half), the known MSR code constructions required a sub-packetization level that is exponential in $k$. In the pres","authors_text":"Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","title":"A High-Rate MSR Code With Polynomial Sub-Packetization Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06662","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:f654825b7e00ffdfa015d673100941f9fc0964ae9e8254dc5e3973602f770efa","target":"record","created_at":"2026-05-18T02:28: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":"cf9bb0bac9cdd4279bc0c010e391c5a1d7b87d3feb17d99256ccf6f499c6154d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-27T06:02:45Z","title_canon_sha256":"7d478d53715045ee6659877b10a7613d62fc22313fe0e60de6f18ec7e0e4e869"},"schema_version":"1.0","source":{"id":"1501.06662","kind":"arxiv","version":1}},"canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2525be098755ca18d77157d1680f4e0ebb2abf3b101f39b24e658d17ffc9e0ff","first_computed_at":"2026-05-18T02:28:39.423770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:39.423770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAEFVNj3y4ab/gbiVWqK93Gjt/eqZpLF3nfp6+re+4PiFFjIOrgxv3DEc1HkgiaiFdN0cJCHWuScZaCxfQdJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:39.424480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f654825b7e00ffdfa015d673100941f9fc0964ae9e8254dc5e3973602f770efa","sha256:3737bcaacb02f8d7420d10083906689c2f32c43f2fffc7f9b4d2f085a86ccafa"],"state_sha256":"dbe0e3550ef0e3a90a3ca3ffecf9e3da424fa9670465060c2b374414c333b188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbAKnLh1tjDUywEA1/03RzJqmspSYsYvuXxXCw2tBZibVVM7EAJkDJGoxJZHR+dWSJHQxdzuFJdcVk43XkoxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:51:47.120588Z","bundle_sha256":"5d90ede5917ab4c41a875ac08a7e01a6a2e2bba566c4ec3a33043d738be457d7"}}