{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SEYKATDI6HKECLSPC24ZVRZUTA","short_pith_number":"pith:SEYKATDI","canonical_record":{"source":{"id":"1304.0501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-01T23:42:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc2f403b363358a4b97c47810f8b037c252675e7eb481eba2d93f3f4451f73cd","abstract_canon_sha256":"cb18a74003ab76ff2e0d13dc2a220a43bdb0a102a7c2dec1e8e78286e0230cb8"},"schema_version":"1.0"},"canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","source":{"kind":"arxiv","id":"1304.0501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0501","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0501v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0501","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"SEYKATDI6HKE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SEYKATDI6HKECLSP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SEYKATDI","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SEYKATDI6HKECLSPC24ZVRZUTA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-01T23:42:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dc2f403b363358a4b97c47810f8b037c252675e7eb481eba2d93f3f4451f73cd","abstract_canon_sha256":"cb18a74003ab76ff2e0d13dc2a220a43bdb0a102a7c2dec1e8e78286e0230cb8"},"schema_version":"1.0"},"canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.215656Z","signature_b64":"s+o+j7itxQjX+U3uX6wq9X3QLbCsYFZdbIAZ/Z0PiDcGiU1We4SjA1zXTrSBPAQDrrxCuKDaxYIHwol6hNeeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","last_reissued_at":"2026-05-18T03:29:15.214829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.214829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0501","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwqEkP4t2NQzF9vhhNPFtLGnd8xKsdIknUceK5Zzsp6utgcHqg3xCmgaK/ts3kDXBjKx1z46TzAYGiJ1PBLNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:05.487050Z"},"content_sha256":"a5c47b444d16ebfd2dae1994bafd8cbdc926542d7ea0bb529e62be161c3f2f11","schema_version":"1.0","event_id":"sha256:a5c47b444d16ebfd2dae1994bafd8cbdc926542d7ea0bb529e62be161c3f2f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SEYKATDI6HKECLSPC24ZVRZUTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalence for Rank-metric and Matrix Codes and Automorphism Groups of Gabidulin Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Katherine Morrison","submitted_at":"2013-04-01T23:42:08Z","abstract_excerpt":"For a growing number of applications such as cellular, peer-to-peer, and sensor networks, efficient error-free transmission of data through a network is essential. Toward this end, K\\\"{o}tter and Kschischang propose the use of subspace codes to provide error correction in the network coding context. The primary construction for subspace codes is the lifting of rank-metric or matrix codes, a process that preserves the structural and distance properties of the underlying code. Thus, to characterize the structure and error-correcting capability of these subspace codes, it is valuable to perform s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0501","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-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Und38h25gsyqnPfwXgGRmpW5fRh5XPgHLKSvXYQLw0iMIAuAJIDnrZdBpunafR0U/zWoUVFumB3SDC7q44pDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:46:05.487781Z"},"content_sha256":"ec012b15199f520b1bc0cdc8e445f2ca9f8500e21792e235bb97334251b7b8b3","schema_version":"1.0","event_id":"sha256:ec012b15199f520b1bc0cdc8e445f2ca9f8500e21792e235bb97334251b7b8b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/bundle.json","state_url":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEYKATDI6HKECLSPC24ZVRZUTA/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-10T02:46:05Z","links":{"resolver":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA","bundle":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/bundle.json","state":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEYKATDI6HKECLSPC24ZVRZUTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SEYKATDI6HKECLSPC24ZVRZUTA","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":"cb18a74003ab76ff2e0d13dc2a220a43bdb0a102a7c2dec1e8e78286e0230cb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-01T23:42:08Z","title_canon_sha256":"dc2f403b363358a4b97c47810f8b037c252675e7eb481eba2d93f3f4451f73cd"},"schema_version":"1.0","source":{"id":"1304.0501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0501","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0501v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0501","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"SEYKATDI6HKE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SEYKATDI6HKECLSP","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SEYKATDI","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:ec012b15199f520b1bc0cdc8e445f2ca9f8500e21792e235bb97334251b7b8b3","target":"graph","created_at":"2026-05-18T03:29:15Z","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":"For a growing number of applications such as cellular, peer-to-peer, and sensor networks, efficient error-free transmission of data through a network is essential. Toward this end, K\\\"{o}tter and Kschischang propose the use of subspace codes to provide error correction in the network coding context. The primary construction for subspace codes is the lifting of rank-metric or matrix codes, a process that preserves the structural and distance properties of the underlying code. Thus, to characterize the structure and error-correcting capability of these subspace codes, it is valuable to perform s","authors_text":"Katherine Morrison","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-01T23:42:08Z","title":"Equivalence for Rank-metric and Matrix Codes and Automorphism Groups of Gabidulin Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0501","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:a5c47b444d16ebfd2dae1994bafd8cbdc926542d7ea0bb529e62be161c3f2f11","target":"record","created_at":"2026-05-18T03:29:15Z","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":"cb18a74003ab76ff2e0d13dc2a220a43bdb0a102a7c2dec1e8e78286e0230cb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-01T23:42:08Z","title_canon_sha256":"dc2f403b363358a4b97c47810f8b037c252675e7eb481eba2d93f3f4451f73cd"},"schema_version":"1.0","source":{"id":"1304.0501","kind":"arxiv","version":1}},"canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","first_computed_at":"2026-05-18T03:29:15.214829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.214829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+o+j7itxQjX+U3uX6wq9X3QLbCsYFZdbIAZ/Z0PiDcGiU1We4SjA1zXTrSBPAQDrrxCuKDaxYIHwol6hNeeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.215656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5c47b444d16ebfd2dae1994bafd8cbdc926542d7ea0bb529e62be161c3f2f11","sha256:ec012b15199f520b1bc0cdc8e445f2ca9f8500e21792e235bb97334251b7b8b3"],"state_sha256":"45cde687102efe6c565e6582fd45673d02871e31ca3d460b8c525f4049ebb73e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qn2n/NApKnisT5j5ojaw58bGPZkz3FDikTSqUdICkXpLpi6fpblrmFKL1DrVxSKS/y4xhl2jPP9d8/aL/yrEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:46:05.491966Z","bundle_sha256":"feca1ca6d83f46411cc80310cff388c77f0fbdd430df2a266ccb8dbb686ec83c"}}