{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IUVNQ3PJ637L2BM4P3C3B3PZKK","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":"5627f28470aef192bbccdef86eed9dbe2ee77326ba95443a55fc0a8c2df3a9d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T21:00:56Z","title_canon_sha256":"ee2d69424412b40503a7600fffb2615f694859d7a7056e92daf1be9544804e1f"},"schema_version":"1.0","source":{"id":"1512.07634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07634","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07634v2","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07634","created_at":"2026-05-18T00:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"IUVNQ3PJ637L","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IUVNQ3PJ637L2BM4","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IUVNQ3PJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:046590a4f844e224508ff10803e04c69514111661ff25a94a56c6fa029e19f13","target":"graph","created_at":"2026-05-18T00:34:24Z","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"},"paper":{"abstract_excerpt":"One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\\operatorname{PG}(n,q)$, i.e., the set of subspaces of $\\mathbb{F}_q^n$, for a given minimal distance. Here we generalize a construction of Etzion and Silberstein to a wide range of parameters. This construction, named coset construction, improves or attains several of the previously best-known subspace code sizes and attains the MRD bound for an infinite family of parameters.","authors_text":"Daniel Heinlein, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T21:00:56Z","title":"Coset Construction for Subspace Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07634","kind":"arxiv","version":2},"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:f42c1d87a5c85d06b3a91a48f1faa018faea85ce7f2942eddd6c39ea0b5a3bd5","target":"record","created_at":"2026-05-18T00:34:24Z","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":"5627f28470aef192bbccdef86eed9dbe2ee77326ba95443a55fc0a8c2df3a9d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T21:00:56Z","title_canon_sha256":"ee2d69424412b40503a7600fffb2615f694859d7a7056e92daf1be9544804e1f"},"schema_version":"1.0","source":{"id":"1512.07634","kind":"arxiv","version":2}},"canonical_sha256":"452ad86de9f6febd059c7ec5b0edf952bab4e8c440a1d07dedfcd9f3695f32ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"452ad86de9f6febd059c7ec5b0edf952bab4e8c440a1d07dedfcd9f3695f32ea","first_computed_at":"2026-05-18T00:34:24.907337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:24.907337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Wd/6NIO1BwAWHxhipA4Vx7GxirgFc1N0LATVfgFqYYWSZkiYUuRkVgfg7H+lLO034uNGh8Q3fn1TMYdOAvHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:24.907829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f42c1d87a5c85d06b3a91a48f1faa018faea85ce7f2942eddd6c39ea0b5a3bd5","sha256:046590a4f844e224508ff10803e04c69514111661ff25a94a56c6fa029e19f13"],"state_sha256":"c3772c115c80b497fe527e610751f91f7dac22dad8f6e0c88d4e227c3554d74e"}