{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6U2PXOJUB45AODR4EVYS7ABWHE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a3e14a2eb73966dfe8ffe235ce947e9216f696a571cac8f14179886a893fb13","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-08T17:11:50Z","title_canon_sha256":"595fa539d809b0b187539ca5396aebcdfcdcc85a92f5dd899b68bd4f6d81e6ef"},"schema_version":"1.0","source":{"id":"1911.03387","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.03387","created_at":"2026-07-05T03:33:17Z"},{"alias_kind":"arxiv_version","alias_value":"1911.03387v3","created_at":"2026-07-05T03:33:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03387","created_at":"2026-07-05T03:33:17Z"},{"alias_kind":"pith_short_12","alias_value":"6U2PXOJUB45A","created_at":"2026-07-05T03:33:17Z"},{"alias_kind":"pith_short_16","alias_value":"6U2PXOJUB45AODR4","created_at":"2026-07-05T03:33:17Z"},{"alias_kind":"pith_short_8","alias_value":"6U2PXOJU","created_at":"2026-07-05T03:33:17Z"}],"graph_snapshots":[{"event_id":"sha256:d399916927dd2d287b91ffabab68ac68e10f00a00a56f6f0cd341b19f7d743d6","target":"graph","created_at":"2026-07-05T03:33:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.03387/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)$.","authors_text":"Antonio Cossidente, Francesco Pavese, Giuseppe Marino, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-08T17:11:50Z","title":"Combining subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03387","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b94fb0a699ff0dcf0f7c0feee5b4445c3206b9b6cbae6aa31367d179265aa961","target":"record","created_at":"2026-07-05T03:33:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a3e14a2eb73966dfe8ffe235ce947e9216f696a571cac8f14179886a893fb13","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-08T17:11:50Z","title_canon_sha256":"595fa539d809b0b187539ca5396aebcdfcdcc85a92f5dd899b68bd4f6d81e6ef"},"schema_version":"1.0","source":{"id":"1911.03387","kind":"arxiv","version":3}},"canonical_sha256":"f534fbb9340f3a070e3c25712f8036391f1cb25c3bf730f78e91701d66f484e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f534fbb9340f3a070e3c25712f8036391f1cb25c3bf730f78e91701d66f484e7","first_computed_at":"2026-07-05T03:33:17.842923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:33:17.842923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WUrpdKBYMa8eySttf1ZKp5D5eSch7L4nJ85I6/C5jFrBwK1/d851PYik6aDYQ5BXJq931z2sqeHNjPjISHwfAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:33:17.843413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.03387","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b94fb0a699ff0dcf0f7c0feee5b4445c3206b9b6cbae6aa31367d179265aa961","sha256:d399916927dd2d287b91ffabab68ac68e10f00a00a56f6f0cd341b19f7d743d6"],"state_sha256":"fd5d2f5597c12a981d156f4e3019ea99803efa04a7d7b73fa88cf579eb76290c"}