{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BBTCNNLYQNMM72NWL6OBWWMIDU","short_pith_number":"pith:BBTCNNLY","schema_version":"1.0","canonical_sha256":"086626b5788358cfe9b65f9c1b59881d37556380bf591fb8a24a4f4ef033b443","source":{"kind":"arxiv","id":"2605.19691","version":1},"attestation_state":"computed","paper":{"title":"The geometry of rank-metric codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.RA"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Gianira N. Alfarano, Martino Borello","submitted_at":"2026-05-19T11:24:38Z","abstract_excerpt":"In this paper, we develop a geometric framework for matrix rank-metric codes based on generator tensors and their slice spaces. To every nondegenerate matrix rank-metric code, we associate two systems, which translate metric properties of the code into geometric conditions involving intersections with hyperplanes. This leads to a correspondence between equivalence classes of nondegenerate matrix rank-metric codes and equivalence classes of systems, as well as to Delsarte-type incidence identities relating the rank distribution of a code over a finite field to those of its associated systems. A"},"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":"2605.19691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T11:24:38Z","cross_cats_sorted":["cs.IT","math.IT","math.RA"],"title_canon_sha256":"db170cb9efae0274724684d105beec72be5e1fa2f288ae4a1822bd7f8a5d319d","abstract_canon_sha256":"26916ea883ffe5f84f043c5e0848446f32a89e446f25189fd0d8b11f7f2a926c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:57.905123Z","signature_b64":"/vbVqISW3uyeG5tVMKh3KPlP+ZoJSWBzVQJot3DxcK68dz1VJJrPmCHBohvNFgZCttvAuH/ksPEjfhHEV015Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"086626b5788358cfe9b65f9c1b59881d37556380bf591fb8a24a4f4ef033b443","last_reissued_at":"2026-05-20T01:05:57.904563Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:57.904563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The geometry of rank-metric codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.RA"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Gianira N. Alfarano, Martino Borello","submitted_at":"2026-05-19T11:24:38Z","abstract_excerpt":"In this paper, we develop a geometric framework for matrix rank-metric codes based on generator tensors and their slice spaces. To every nondegenerate matrix rank-metric code, we associate two systems, which translate metric properties of the code into geometric conditions involving intersections with hyperplanes. This leads to a correspondence between equivalence classes of nondegenerate matrix rank-metric codes and equivalence classes of systems, as well as to Delsarte-type incidence identities relating the rank distribution of a code over a finite field to those of its associated systems. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19691","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19691/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19691","created_at":"2026-05-20T01:05:57.904654+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19691v1","created_at":"2026-05-20T01:05:57.904654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19691","created_at":"2026-05-20T01:05:57.904654+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBTCNNLYQNMM","created_at":"2026-05-20T01:05:57.904654+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBTCNNLYQNMM72NW","created_at":"2026-05-20T01:05:57.904654+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBTCNNLY","created_at":"2026-05-20T01:05:57.904654+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/BBTCNNLYQNMM72NWL6OBWWMIDU","json":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU.json","graph_json":"https://pith.science/api/pith-number/BBTCNNLYQNMM72NWL6OBWWMIDU/graph.json","events_json":"https://pith.science/api/pith-number/BBTCNNLYQNMM72NWL6OBWWMIDU/events.json","paper":"https://pith.science/paper/BBTCNNLY"},"agent_actions":{"view_html":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU","download_json":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU.json","view_paper":"https://pith.science/paper/BBTCNNLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19691&json=true","fetch_graph":"https://pith.science/api/pith-number/BBTCNNLYQNMM72NWL6OBWWMIDU/graph.json","fetch_events":"https://pith.science/api/pith-number/BBTCNNLYQNMM72NWL6OBWWMIDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU/action/storage_attestation","attest_author":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU/action/author_attestation","sign_citation":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU/action/citation_signature","submit_replication":"https://pith.science/pith/BBTCNNLYQNMM72NWL6OBWWMIDU/action/replication_record"}},"created_at":"2026-05-20T01:05:57.904654+00:00","updated_at":"2026-05-20T01:05:57.904654+00:00"}