{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LMVOAUYFBAVOIC3TWFEO7A3PJD","short_pith_number":"pith:LMVOAUYF","schema_version":"1.0","canonical_sha256":"5b2ae05305082ae40b73b148ef836f48e806fd32c65bb6c98b87c3943f715183","source":{"kind":"arxiv","id":"1911.01878","version":1},"attestation_state":"computed","paper":{"title":"Parallel multilevel constructions for constant dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuangqing Liu, Tao Feng, Yanxun Chang","submitted_at":"2019-11-05T15:31:39Z","abstract_excerpt":"Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs), to generalize the parallel construction in [Xu and Chen, IEEE Trans. Inf. Theory, 64 (2018), 6315--6319] and the classic multilevel construction. A Singleton-like upper bound and a lower bound for GRMCs derived from Gabidulin codes are given. Via GRMCs, two effective constructions for CDCs are presented by combining the parallel construction and the multilev"},"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":"1911.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-05T15:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"45555e178bdd4617a0047465c4af48b1b923894216b37b533f1e1370ebfacd1d","abstract_canon_sha256":"54db02484cfd6a216b073ac89662ddaa2beec45f3f53cbad4526beec6e2f2191"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:22.650177Z","signature_b64":"7LkGVkQ+OEgDmW49RMk4TRimOTp9Alssi9L6GB6nuXqcpxO2OrSks2zsLV9VMvqlhhHzKWWwxrfRGrGkGdNWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2ae05305082ae40b73b148ef836f48e806fd32c65bb6c98b87c3943f715183","last_reissued_at":"2026-07-05T00:17:22.649778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:22.649778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel multilevel constructions for constant dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuangqing Liu, Tao Feng, Yanxun Chang","submitted_at":"2019-11-05T15:31:39Z","abstract_excerpt":"Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs), to generalize the parallel construction in [Xu and Chen, IEEE Trans. Inf. Theory, 64 (2018), 6315--6319] and the classic multilevel construction. A Singleton-like upper bound and a lower bound for GRMCs derived from Gabidulin codes are given. Via GRMCs, two effective constructions for CDCs are presented by combining the parallel construction and the multilev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01878","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/1911.01878/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":"1911.01878","created_at":"2026-07-05T00:17:22.649838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01878v1","created_at":"2026-07-05T00:17:22.649838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01878","created_at":"2026-07-05T00:17:22.649838+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMVOAUYFBAVO","created_at":"2026-07-05T00:17:22.649838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMVOAUYFBAVOIC3T","created_at":"2026-07-05T00:17:22.649838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMVOAUYF","created_at":"2026-07-05T00:17:22.649838+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":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD","json":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD.json","graph_json":"https://pith.science/api/pith-number/LMVOAUYFBAVOIC3TWFEO7A3PJD/graph.json","events_json":"https://pith.science/api/pith-number/LMVOAUYFBAVOIC3TWFEO7A3PJD/events.json","paper":"https://pith.science/paper/LMVOAUYF"},"agent_actions":{"view_html":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD","download_json":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD.json","view_paper":"https://pith.science/paper/LMVOAUYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01878&json=true","fetch_graph":"https://pith.science/api/pith-number/LMVOAUYFBAVOIC3TWFEO7A3PJD/graph.json","fetch_events":"https://pith.science/api/pith-number/LMVOAUYFBAVOIC3TWFEO7A3PJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD/action/storage_attestation","attest_author":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD/action/author_attestation","sign_citation":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD/action/citation_signature","submit_replication":"https://pith.science/pith/LMVOAUYFBAVOIC3TWFEO7A3PJD/action/replication_record"}},"created_at":"2026-07-05T00:17:22.649838+00:00","updated_at":"2026-07-05T00:17:22.649838+00:00"}