{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BBANFHPKVBYPLDF43FPDN3CIPQ","short_pith_number":"pith:BBANFHPK","schema_version":"1.0","canonical_sha256":"0840d29deaa870f58cbcd95e36ec487c0eaf67fc6d89e96ae4882675d18eb78b","source":{"kind":"arxiv","id":"1904.05227","version":1},"attestation_state":"computed","paper":{"title":"Tensor Representation of Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Ravagnani, Alessandro Neri, Eimear Byrne, John Sheekey","submitted_at":"2019-04-10T14:52:13Z","abstract_excerpt":"We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define the tensor rank of a code to be the tensor rank of its generating tensors, and propose that this quantity is a significant coding theoretic parameter. By a result on the tensor rank of Kruskal from the 1970s, the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k+d-1$. We call codes that meet this bound minimal t"},"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":"1904.05227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-10T14:52:13Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"df722660015cb72171f5049fed876780540a86ae692a8294d228d0c850f5b0f8","abstract_canon_sha256":"21a5136e27269756d578426a41a630811df105336bb395a5dfcb1a5132891445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.758378Z","signature_b64":"5KtTVvAHf3/PGifPMF4nVopVZCvRWf0abQOEKAZXk2Ot1PJxJKlz5PZBjQSskFrlm6/IbuQPB7Cwqx9lyU1VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0840d29deaa870f58cbcd95e36ec487c0eaf67fc6d89e96ae4882675d18eb78b","last_reissued_at":"2026-05-17T23:48:53.757809Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.757809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Representation of Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Ravagnani, Alessandro Neri, Eimear Byrne, John Sheekey","submitted_at":"2019-04-10T14:52:13Z","abstract_excerpt":"We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define the tensor rank of a code to be the tensor rank of its generating tensors, and propose that this quantity is a significant coding theoretic parameter. By a result on the tensor rank of Kruskal from the 1970s, the tensor rank of a rank-metric code of dimension $k$ and minimum rank distance $d$ is at least $k+d-1$. We call codes that meet this bound minimal t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05227","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":"1904.05227","created_at":"2026-05-17T23:48:53.757894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05227v1","created_at":"2026-05-17T23:48:53.757894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05227","created_at":"2026-05-17T23:48:53.757894+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBANFHPKVBYP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBANFHPKVBYPLDF4","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBANFHPK","created_at":"2026-05-18T12:33:12.712433+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/BBANFHPKVBYPLDF43FPDN3CIPQ","json":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ.json","graph_json":"https://pith.science/api/pith-number/BBANFHPKVBYPLDF43FPDN3CIPQ/graph.json","events_json":"https://pith.science/api/pith-number/BBANFHPKVBYPLDF43FPDN3CIPQ/events.json","paper":"https://pith.science/paper/BBANFHPK"},"agent_actions":{"view_html":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ","download_json":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ.json","view_paper":"https://pith.science/paper/BBANFHPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05227&json=true","fetch_graph":"https://pith.science/api/pith-number/BBANFHPKVBYPLDF43FPDN3CIPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BBANFHPKVBYPLDF43FPDN3CIPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ/action/storage_attestation","attest_author":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ/action/author_attestation","sign_citation":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ/action/citation_signature","submit_replication":"https://pith.science/pith/BBANFHPKVBYPLDF43FPDN3CIPQ/action/replication_record"}},"created_at":"2026-05-17T23:48:53.757894+00:00","updated_at":"2026-05-17T23:48:53.757894+00:00"}