{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IYJZHUTKSS74AVDFBRYGAQXAF6","short_pith_number":"pith:IYJZHUTK","canonical_record":{"source":{"id":"1710.03109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T14:14:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a130a1d30df9dec068349babae70c9d7b1eaeb0e49953131e29dda67b742aa7","abstract_canon_sha256":"a928570ff62f51de03a38447d7cfdf2cf345695a6f2d077bd29b96f16db8129c"},"schema_version":"1.0"},"canonical_sha256":"461393d26a94bfc054650c706042e02fa37a90c6052bd53b58f7a6c85f9526e4","source":{"kind":"arxiv","id":"1710.03109","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03109","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03109v2","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03109","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"IYJZHUTKSS74","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYJZHUTKSS74AVDF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYJZHUTK","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IYJZHUTKSS74AVDFBRYGAQXAF6","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T14:14:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a130a1d30df9dec068349babae70c9d7b1eaeb0e49953131e29dda67b742aa7","abstract_canon_sha256":"a928570ff62f51de03a38447d7cfdf2cf345695a6f2d077bd29b96f16db8129c"},"schema_version":"1.0"},"canonical_sha256":"461393d26a94bfc054650c706042e02fa37a90c6052bd53b58f7a6c85f9526e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:04.043003Z","signature_b64":"G99oo6XIw65vSAWMSMYJ5vUpRT41lJsigX6l5+RYQXOL3V+s+GMr3pg/ZuSa4B2JvMwyKZ7maWpyBJYmF/sSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461393d26a94bfc054650c706042e02fa37a90c6052bd53b58f7a6c85f9526e4","last_reissued_at":"2026-05-18T00:24:04.042504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:04.042504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03109","source_version":2,"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:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1KQaUq+8qG0IyyqtmKeGa/LEF31H5Dc4/IwZ70j6YoTDT270knzrUZ+gFpRKIMojr+lM7i98qYWXxaZyHlXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:48.727208Z"},"content_sha256":"0d9644c69e9ed17da48bf07a8ba6814ab8f93ff07f3dd15322ca82e31b572ee9","schema_version":"1.0","event_id":"sha256:0d9644c69e9ed17da48bf07a8ba6814ab8f93ff07f3dd15322ca82e31b572ee9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IYJZHUTKSS74AVDFBRYGAQXAF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2017-10-09T14:14:19Z","abstract_excerpt":"Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such distance is of interest in multishot network coding or in singleshot multi-network coding. To prove our result, we introduce new metrics defined by skew polynomials, which we call skew metrics, we prove that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03109","kind":"arxiv","version":2},"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:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsYP7HPSATu5fcv4Uc0Gr2ZGzSgH7J52m4Wg50i9SIVMnj2n0JoIiy+Ba+arUjP4+v//9OERvFTRThcX3oUHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:48.727952Z"},"content_sha256":"15e67d0e35903ff2a878c523b900aadfcc3050ce96614dc60f9e0bc9bf6fd593","schema_version":"1.0","event_id":"sha256:15e67d0e35903ff2a878c523b900aadfcc3050ce96614dc60f9e0bc9bf6fd593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/bundle.json","state_url":"https://pith.science/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/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-06-09T04:23:48Z","links":{"resolver":"https://pith.science/pith/IYJZHUTKSS74AVDFBRYGAQXAF6","bundle":"https://pith.science/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/bundle.json","state":"https://pith.science/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYJZHUTKSS74AVDFBRYGAQXAF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IYJZHUTKSS74AVDFBRYGAQXAF6","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":"a928570ff62f51de03a38447d7cfdf2cf345695a6f2d077bd29b96f16db8129c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T14:14:19Z","title_canon_sha256":"7a130a1d30df9dec068349babae70c9d7b1eaeb0e49953131e29dda67b742aa7"},"schema_version":"1.0","source":{"id":"1710.03109","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03109","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03109v2","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03109","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"IYJZHUTKSS74","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IYJZHUTKSS74AVDF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IYJZHUTK","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:15e67d0e35903ff2a878c523b900aadfcc3050ce96614dc60f9e0bc9bf6fd593","target":"graph","created_at":"2026-05-18T00:24:04Z","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":"Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such distance is of interest in multishot network coding or in singleshot multi-network coding. To prove our result, we introduce new metrics defined by skew polynomials, which we call skew metrics, we prove that","authors_text":"Umberto Mart\\'inez-Pe\\~nas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T14:14:19Z","title":"Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03109","kind":"arxiv","version":2},"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:0d9644c69e9ed17da48bf07a8ba6814ab8f93ff07f3dd15322ca82e31b572ee9","target":"record","created_at":"2026-05-18T00:24:04Z","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":"a928570ff62f51de03a38447d7cfdf2cf345695a6f2d077bd29b96f16db8129c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-09T14:14:19Z","title_canon_sha256":"7a130a1d30df9dec068349babae70c9d7b1eaeb0e49953131e29dda67b742aa7"},"schema_version":"1.0","source":{"id":"1710.03109","kind":"arxiv","version":2}},"canonical_sha256":"461393d26a94bfc054650c706042e02fa37a90c6052bd53b58f7a6c85f9526e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"461393d26a94bfc054650c706042e02fa37a90c6052bd53b58f7a6c85f9526e4","first_computed_at":"2026-05-18T00:24:04.042504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:04.042504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G99oo6XIw65vSAWMSMYJ5vUpRT41lJsigX6l5+RYQXOL3V+s+GMr3pg/ZuSa4B2JvMwyKZ7maWpyBJYmF/sSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:04.043003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03109","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d9644c69e9ed17da48bf07a8ba6814ab8f93ff07f3dd15322ca82e31b572ee9","sha256:15e67d0e35903ff2a878c523b900aadfcc3050ce96614dc60f9e0bc9bf6fd593"],"state_sha256":"85d5b3981bff48ed713473106cb79c5902703e0aee776bb3e5d870146d7b81a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hev8zfFta7Kcxwmmdj02bBrnLrKLWscyU+LUwh/s0Yemp1JL1X7p0htGgDHq9c6gYn7ySwnEsv7kB3cHGlcyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:23:48.732300Z","bundle_sha256":"abe118b46d933a04ba69d020ac9d90454f0fc32837949f3ef995b59c43a4c42b"}}