{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6U2PXOJUB45AODR4EVYS7ABWHE","short_pith_number":"pith:6U2PXOJU","schema_version":"1.0","canonical_sha256":"f534fbb9340f3a070e3c25712f8036391f1cb25c3bf730f78e91701d66f484e7","source":{"kind":"arxiv","id":"1911.03387","version":3},"attestation_state":"computed","paper":{"title":"Combining subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Antonio Cossidente, Francesco Pavese, Giuseppe Marino, Sascha Kurz","submitted_at":"2019-11-08T17:11:50Z","abstract_excerpt":"In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size $A_q(n, d; k)$ of codes whose codewords are $k$-subspaces of $\\mathbb{F}_q^n$ with minimum subspace distance $d$. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant--dimension subspace codes for many parameters, including $A_q(10, 4; 5)$, $A_q(12, 4; 4)$, $A_q(12, 6, 6)$ and $A_q(16, 4; 4)$."},"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.03387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-08T17:11:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"595fa539d809b0b187539ca5396aebcdfcdcc85a92f5dd899b68bd4f6d81e6ef","abstract_canon_sha256":"4a3e14a2eb73966dfe8ffe235ce947e9216f696a571cac8f14179886a893fb13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:17.843413Z","signature_b64":"WUrpdKBYMa8eySttf1ZKp5D5eSch7L4nJ85I6/C5jFrBwK1/d851PYik6aDYQ5BXJq931z2sqeHNjPjISHwfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f534fbb9340f3a070e3c25712f8036391f1cb25c3bf730f78e91701d66f484e7","last_reissued_at":"2026-07-05T03:33:17.842923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:17.842923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Antonio Cossidente, Francesco Pavese, Giuseppe Marino, Sascha Kurz","submitted_at":"2019-11-08T17:11:50Z","abstract_excerpt":"In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size $A_q(n, d; k)$ of codes whose codewords are $k$-subspaces of $\\mathbb{F}_q^n$ with minimum subspace distance $d$. Here in order to obtain improved constructions, we investigate several approaches to combine subspace codes. This allow us to present improvements on the lower bounds for constant--dimension subspace codes for many parameters, including $A_q(10, 4; 5)$, $A_q(12, 4; 4)$, $A_q(12, 6, 6)$ and $A_q(16, 4; 4)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03387","kind":"arxiv","version":3},"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.03387/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.03387","created_at":"2026-07-05T03:33:17.842978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03387v3","created_at":"2026-07-05T03:33:17.842978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03387","created_at":"2026-07-05T03:33:17.842978+00:00"},{"alias_kind":"pith_short_12","alias_value":"6U2PXOJUB45A","created_at":"2026-07-05T03:33:17.842978+00:00"},{"alias_kind":"pith_short_16","alias_value":"6U2PXOJUB45AODR4","created_at":"2026-07-05T03:33:17.842978+00:00"},{"alias_kind":"pith_short_8","alias_value":"6U2PXOJU","created_at":"2026-07-05T03:33:17.842978+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/6U2PXOJUB45AODR4EVYS7ABWHE","json":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE.json","graph_json":"https://pith.science/api/pith-number/6U2PXOJUB45AODR4EVYS7ABWHE/graph.json","events_json":"https://pith.science/api/pith-number/6U2PXOJUB45AODR4EVYS7ABWHE/events.json","paper":"https://pith.science/paper/6U2PXOJU"},"agent_actions":{"view_html":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE","download_json":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE.json","view_paper":"https://pith.science/paper/6U2PXOJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03387&json=true","fetch_graph":"https://pith.science/api/pith-number/6U2PXOJUB45AODR4EVYS7ABWHE/graph.json","fetch_events":"https://pith.science/api/pith-number/6U2PXOJUB45AODR4EVYS7ABWHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE/action/storage_attestation","attest_author":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE/action/author_attestation","sign_citation":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE/action/citation_signature","submit_replication":"https://pith.science/pith/6U2PXOJUB45AODR4EVYS7ABWHE/action/replication_record"}},"created_at":"2026-07-05T03:33:17.842978+00:00","updated_at":"2026-07-05T03:33:17.842978+00:00"}