{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VHQSQYXY6SG6X6FZTIHOFLQ324","short_pith_number":"pith:VHQSQYXY","canonical_record":{"source":{"id":"1603.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-31T12:53:35Z","cross_cats_sorted":["math.GR","math.IT","math.RT"],"title_canon_sha256":"bb32d82280c02a82b7316ab52acefb8e07acb6e14ebdcc6addad775e3f41cfb5","abstract_canon_sha256":"188fbc939e3d6ec125019cdaf33d785238b1409e13ad4d421228f9a5a317fc3f"},"schema_version":"1.0"},"canonical_sha256":"a9e12862f8f48debf8b99a0ee2ae1bd7135cde4022c1b6ecde83540479282388","source":{"kind":"arxiv","id":"1603.09565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09565","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09565v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09565","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"VHQSQYXY6SG6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHQSQYXY6SG6X6FZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHQSQYXY","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VHQSQYXY6SG6X6FZTIHOFLQ324","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-31T12:53:35Z","cross_cats_sorted":["math.GR","math.IT","math.RT"],"title_canon_sha256":"bb32d82280c02a82b7316ab52acefb8e07acb6e14ebdcc6addad775e3f41cfb5","abstract_canon_sha256":"188fbc939e3d6ec125019cdaf33d785238b1409e13ad4d421228f9a5a317fc3f"},"schema_version":"1.0"},"canonical_sha256":"a9e12862f8f48debf8b99a0ee2ae1bd7135cde4022c1b6ecde83540479282388","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.253657Z","signature_b64":"V5oyEHZGe0cAkr8f4mMiYSfKl6EgnUMir9Uf4s5jtdotQE/V0LirDgD3cCfKU8MxOC65d3Q0fhZ7BdLegL9lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e12862f8f48debf8b99a0ee2ae1bd7135cde4022c1b6ecde83540479282388","last_reissued_at":"2026-05-18T01:17:58.252805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.252805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09565","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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHrOhlezigu6SWwuKduSB0k+oYYRWzcNd8+ZeJZAFWrQ+EzV6bXEUPPnpbWtFWI5N6kuwh6If4qksoY1e26aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:27:21.388194Z"},"content_sha256":"51486b6eca1c1bedc76f997fb569747e8b810d720e4e7279e2614c7e39e54314","schema_version":"1.0","event_id":"sha256:51486b6eca1c1bedc76f997fb569747e8b810d720e4e7279e2614c7e39e54314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VHQSQYXY6SG6X6FZTIHOFLQ324","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automorphism groups of Gabidulin-like codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.IT","math.RT"],"primary_cat":"cs.IT","authors_text":"Dirk Liebhold, Gabriele Nebe","submitted_at":"2016-03-31T12:53:35Z","abstract_excerpt":"Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank distance code in the space of f times m matrices over k of dimension fd. This construction unifies the ones available in the literature. We characterise the K-linear codes that are Gabidulin-like codes and determine their rank-metric automorphism group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09565","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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJjcrIOv3VNXZFLs23l3FBXSktv8eA2XewiCypdrmaAI+zrxl8lluZIy+ePQAVZHhnX3AL8Fm+tVUy5nZYylAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:27:21.388712Z"},"content_sha256":"055b7119002db2ca87506786498df3eb89e61ffac70169556fac79373494d841","schema_version":"1.0","event_id":"sha256:055b7119002db2ca87506786498df3eb89e61ffac70169556fac79373494d841"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/bundle.json","state_url":"https://pith.science/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/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-08-21T16:27:21Z","links":{"resolver":"https://pith.science/pith/VHQSQYXY6SG6X6FZTIHOFLQ324","bundle":"https://pith.science/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/bundle.json","state":"https://pith.science/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHQSQYXY6SG6X6FZTIHOFLQ324/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VHQSQYXY6SG6X6FZTIHOFLQ324","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":"188fbc939e3d6ec125019cdaf33d785238b1409e13ad4d421228f9a5a317fc3f","cross_cats_sorted":["math.GR","math.IT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-31T12:53:35Z","title_canon_sha256":"bb32d82280c02a82b7316ab52acefb8e07acb6e14ebdcc6addad775e3f41cfb5"},"schema_version":"1.0","source":{"id":"1603.09565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09565","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09565v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09565","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"VHQSQYXY6SG6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHQSQYXY6SG6X6FZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHQSQYXY","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:055b7119002db2ca87506786498df3eb89e61ffac70169556fac79373494d841","target":"graph","created_at":"2026-05-18T01:17:58Z","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":"Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank distance code in the space of f times m matrices over k of dimension fd. This construction unifies the ones available in the literature. We characterise the K-linear codes that are Gabidulin-like codes and determine their rank-metric automorphism group.","authors_text":"Dirk Liebhold, Gabriele Nebe","cross_cats":["math.GR","math.IT","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-31T12:53:35Z","title":"Automorphism groups of Gabidulin-like codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09565","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:51486b6eca1c1bedc76f997fb569747e8b810d720e4e7279e2614c7e39e54314","target":"record","created_at":"2026-05-18T01:17:58Z","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":"188fbc939e3d6ec125019cdaf33d785238b1409e13ad4d421228f9a5a317fc3f","cross_cats_sorted":["math.GR","math.IT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-31T12:53:35Z","title_canon_sha256":"bb32d82280c02a82b7316ab52acefb8e07acb6e14ebdcc6addad775e3f41cfb5"},"schema_version":"1.0","source":{"id":"1603.09565","kind":"arxiv","version":1}},"canonical_sha256":"a9e12862f8f48debf8b99a0ee2ae1bd7135cde4022c1b6ecde83540479282388","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9e12862f8f48debf8b99a0ee2ae1bd7135cde4022c1b6ecde83540479282388","first_computed_at":"2026-05-18T01:17:58.252805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:58.252805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5oyEHZGe0cAkr8f4mMiYSfKl6EgnUMir9Uf4s5jtdotQE/V0LirDgD3cCfKU8MxOC65d3Q0fhZ7BdLegL9lBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:58.253657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51486b6eca1c1bedc76f997fb569747e8b810d720e4e7279e2614c7e39e54314","sha256:055b7119002db2ca87506786498df3eb89e61ffac70169556fac79373494d841"],"state_sha256":"5ba59e3fdb723272545f642275740e032a106f163f64bb268f53f2408c8d9d67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7dtc+wwRsH5E+IjfK3yS+hFb/vK6dIk3pfpcVHlYVNeB8XBDH6ri3wAhN64Ks//86pLZv5F7uK0CslSUYZoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:27:21.392328Z","bundle_sha256":"be8a61552599a292a4e158898ee88b5c1ef97876221d4cc02b832ea6d1c31703"}}