{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5TR4YK5RJ4EQNIKJHRNQALGBK","short_pith_number":"pith:C5TR4YK5","canonical_record":{"source":{"id":"1601.06993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T12:32:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"328c957b9e2151d4145596ac7a3536e03244f431634dd35260959f92c9cca904","abstract_canon_sha256":"688bf05bbd1a761714501334d6957392439ba106bfcf695f9ad148115c0b6f07"},"schema_version":"1.0"},"canonical_sha256":"17671e615d8a7848350a49e2d801660a9152d8803e5eee0ce4fb225a359d2db2","source":{"kind":"arxiv","id":"1601.06993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06993","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06993v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06993","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"C5TR4YK5RJ4E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5TR4YK5RJ4EQNIK","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5TR4YK5","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5TR4YK5RJ4EQNIKJHRNQALGBK","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T12:32:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"328c957b9e2151d4145596ac7a3536e03244f431634dd35260959f92c9cca904","abstract_canon_sha256":"688bf05bbd1a761714501334d6957392439ba106bfcf695f9ad148115c0b6f07"},"schema_version":"1.0"},"canonical_sha256":"17671e615d8a7848350a49e2d801660a9152d8803e5eee0ce4fb225a359d2db2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:59.371853Z","signature_b64":"+AGmkbeFmCQYcJG4H0tqoAzPcAJ6R+/Jd+gh12eU7HOmSrhkYTDx6IUm1RLvJz07OD+9yGy6VDHzPUY4UEOtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17671e615d8a7848350a49e2d801660a9152d8803e5eee0ce4fb225a359d2db2","last_reissued_at":"2026-05-18T01:21:59.371456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:59.371456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06993","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-18T01:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ETT5vKHtYJn6+pfLerB7ga+wOQMYm6JaXM82cKRaLwFeMBnN6pYPTe41v8TBHAdDI4VeU9uJo6ylIEkSnciDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:09:39.407868Z"},"content_sha256":"98a7f3775d9c06c37307a606dc338c079e9a7b67cca5c22a688238a62bbe375b","schema_version":"1.0","event_id":"sha256:98a7f3775d9c06c37307a606dc338c079e9a7b67cca5c22a688238a62bbe375b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5TR4YK5RJ4EQNIKJHRNQALGBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank equivalent and rank degenerate skew cyclic codes","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":"2016-01-26T12:32:55Z","abstract_excerpt":"Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing links from the source when applying the code on a network. We study rank equivalences between skew cyclic codes of different lengths and, with the aim of finding the skew cyclic code of smallest length that is rank equivalent to a given one, we define different types of length for a given skew cyclic code, relate them and compute them in most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06993","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-18T01:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7HpIA5Mm5hNh2AVrUoXzmi6hOmHlPcDo3/0+P6CZgf+Y0jXzrfKJ2FxdaoIoZQmqOAnkNHqzF5c1bGc1sVXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:09:39.408215Z"},"content_sha256":"019195ba8a3da93a347228e8dc4e6794b9b8ef3d5ca4555268049a2d69b930df","schema_version":"1.0","event_id":"sha256:019195ba8a3da93a347228e8dc4e6794b9b8ef3d5ca4555268049a2d69b930df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/bundle.json","state_url":"https://pith.science/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/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-25T04:09:39Z","links":{"resolver":"https://pith.science/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK","bundle":"https://pith.science/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/bundle.json","state":"https://pith.science/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5TR4YK5RJ4EQNIKJHRNQALGBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5TR4YK5RJ4EQNIKJHRNQALGBK","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":"688bf05bbd1a761714501334d6957392439ba106bfcf695f9ad148115c0b6f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T12:32:55Z","title_canon_sha256":"328c957b9e2151d4145596ac7a3536e03244f431634dd35260959f92c9cca904"},"schema_version":"1.0","source":{"id":"1601.06993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06993","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06993v1","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06993","created_at":"2026-05-18T01:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"C5TR4YK5RJ4E","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5TR4YK5RJ4EQNIK","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5TR4YK5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:019195ba8a3da93a347228e8dc4e6794b9b8ef3d5ca4555268049a2d69b930df","target":"graph","created_at":"2026-05-18T01:21:59Z","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":"Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing links from the source when applying the code on a network. We study rank equivalences between skew cyclic codes of different lengths and, with the aim of finding the skew cyclic code of smallest length that is rank equivalent to a given one, we define different types of length for a given skew cyclic code, relate them and compute them in most ","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":"2016-01-26T12:32:55Z","title":"Rank equivalent and rank degenerate skew cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06993","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:98a7f3775d9c06c37307a606dc338c079e9a7b67cca5c22a688238a62bbe375b","target":"record","created_at":"2026-05-18T01:21:59Z","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":"688bf05bbd1a761714501334d6957392439ba106bfcf695f9ad148115c0b6f07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-26T12:32:55Z","title_canon_sha256":"328c957b9e2151d4145596ac7a3536e03244f431634dd35260959f92c9cca904"},"schema_version":"1.0","source":{"id":"1601.06993","kind":"arxiv","version":1}},"canonical_sha256":"17671e615d8a7848350a49e2d801660a9152d8803e5eee0ce4fb225a359d2db2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17671e615d8a7848350a49e2d801660a9152d8803e5eee0ce4fb225a359d2db2","first_computed_at":"2026-05-18T01:21:59.371456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:59.371456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+AGmkbeFmCQYcJG4H0tqoAzPcAJ6R+/Jd+gh12eU7HOmSrhkYTDx6IUm1RLvJz07OD+9yGy6VDHzPUY4UEOtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:59.371853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a7f3775d9c06c37307a606dc338c079e9a7b67cca5c22a688238a62bbe375b","sha256:019195ba8a3da93a347228e8dc4e6794b9b8ef3d5ca4555268049a2d69b930df"],"state_sha256":"bcd0a10b985de78d73b533f9a923266a06c12fda29fb1a9162ebe2a206432b88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WO2YTcEijNDJTX8Ji97Qyr2F/l+Z7N53qnEOp1opRs3J7Hw9Hm39nsKW7OcFu53Fp7shSCOajnSRXgne6WHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:09:39.410171Z","bundle_sha256":"6209d24a508eecfbc7eaafe33b4f93e6d7134d082e88837f56c6367b7332fe74"}}