{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SEYKATDI6HKECLSPC24ZVRZUTA","short_pith_number":"pith:SEYKATDI","schema_version":"1.0","canonical_sha256":"9130a04c68f1d4412e4f16b99ac7349811cbb3a16e4f3ef1625e886d89b14aa0","source":{"kind":"arxiv","id":"1304.0501","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.0501","created_at":"2026-05-18T03:29:15.214975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0501v1","created_at":"2026-05-18T03:29:15.214975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0501","created_at":"2026-05-18T03:29:15.214975+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEYKATDI6HKE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEYKATDI6HKECLSP","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEYKATDI","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA","json":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA.json","graph_json":"https://pith.science/api/pith-number/SEYKATDI6HKECLSPC24ZVRZUTA/graph.json","events_json":"https://pith.science/api/pith-number/SEYKATDI6HKECLSPC24ZVRZUTA/events.json","paper":"https://pith.science/paper/SEYKATDI"},"agent_actions":{"view_html":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA","download_json":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA.json","view_paper":"https://pith.science/paper/SEYKATDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0501&json=true","fetch_graph":"https://pith.science/api/pith-number/SEYKATDI6HKECLSPC24ZVRZUTA/graph.json","fetch_events":"https://pith.science/api/pith-number/SEYKATDI6HKECLSPC24ZVRZUTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/action/storage_attestation","attest_author":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/action/author_attestation","sign_citation":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/action/citation_signature","submit_replication":"https://pith.science/pith/SEYKATDI6HKECLSPC24ZVRZUTA/action/replication_record"}},"created_at":"2026-05-18T03:29:15.214975+00:00","updated_at":"2026-05-18T03:29:15.214975+00:00"}