{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MCD32TE2RKWSC2BQWR7CHTVP6J","short_pith_number":"pith:MCD32TE2","schema_version":"1.0","canonical_sha256":"6087bd4c9a8aad216830b47e23ceaff2588ed4dd47f0961aa0fac5a2687e87ab","source":{"kind":"arxiv","id":"1510.01008","version":1},"attestation_state":"computed","paper":{"title":"Rank distribution of Delsarte codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Ravagnani, Elisa Gorla, Hiram H. Lopez, Javier de la Cruz","submitted_at":"2015-10-05T00:50:09Z","abstract_excerpt":"In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and it"},"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":"1510.01008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-05T00:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ce4526912a8a266c14ac763f998e50ae8bd9de5210c2b4b7b8b5bf988bcdf9a","abstract_canon_sha256":"97c3738abab36f7694c7309c97454db5ad5516d9c456c1ff6ec7e8feb392cfc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:33.973357Z","signature_b64":"7+j78u9UzVZnVIKnOo7MHZuX8CmiDcwLu3fk3Dc9NAP+f9arvSOarCueRvnpys8+4vvaJN3dxq3NnlzyFrVQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6087bd4c9a8aad216830b47e23ceaff2588ed4dd47f0961aa0fac5a2687e87ab","last_reissued_at":"2026-07-05T07:41:33.972938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:33.972938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank distribution of Delsarte codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto Ravagnani, Elisa Gorla, Hiram H. Lopez, Javier de la Cruz","submitted_at":"2015-10-05T00:50:09Z","abstract_excerpt":"In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01008","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/1510.01008/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":"1510.01008","created_at":"2026-07-05T07:41:33.972993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01008v1","created_at":"2026-07-05T07:41:33.972993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01008","created_at":"2026-07-05T07:41:33.972993+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCD32TE2RKWS","created_at":"2026-07-05T07:41:33.972993+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCD32TE2RKWSC2BQ","created_at":"2026-07-05T07:41:33.972993+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCD32TE2","created_at":"2026-07-05T07:41:33.972993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03804","citing_title":"New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J","json":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J.json","graph_json":"https://pith.science/api/pith-number/MCD32TE2RKWSC2BQWR7CHTVP6J/graph.json","events_json":"https://pith.science/api/pith-number/MCD32TE2RKWSC2BQWR7CHTVP6J/events.json","paper":"https://pith.science/paper/MCD32TE2"},"agent_actions":{"view_html":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J","download_json":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J.json","view_paper":"https://pith.science/paper/MCD32TE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01008&json=true","fetch_graph":"https://pith.science/api/pith-number/MCD32TE2RKWSC2BQWR7CHTVP6J/graph.json","fetch_events":"https://pith.science/api/pith-number/MCD32TE2RKWSC2BQWR7CHTVP6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J/action/storage_attestation","attest_author":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J/action/author_attestation","sign_citation":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J/action/citation_signature","submit_replication":"https://pith.science/pith/MCD32TE2RKWSC2BQWR7CHTVP6J/action/replication_record"}},"created_at":"2026-07-05T07:41:33.972993+00:00","updated_at":"2026-07-05T07:41:33.972993+00:00"}