{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3FPOKECCKY3J66T5J7E3O3HJWA","short_pith_number":"pith:3FPOKECC","schema_version":"1.0","canonical_sha256":"d95ee5104256369f7a7d4fc9b76ce9b0278878488b67db6d8f757e3c903d7aee","source":{"kind":"arxiv","id":"1512.06660","version":3},"attestation_state":"computed","paper":{"title":"Constructions and Bounds for Mixed-Dimension Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Michael Kiermaier, Sascha Kurz, Thomas Honold","submitted_at":"2015-12-21T15:22:32Z","abstract_excerpt":"Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \\emph{Main Problem of Subspace Coding} is to determine the maximum size $A_q(v,d)$ of a code in $\\operatorname{PG}(v-1,\\mathbb{F}_q)$ with minimum subspace distance $d$. Here we completely resolve this problem for $d\\ge v-1$. For $d=v-2$ we present some improved bounds and determine $A_q(5,3)=2q^3+2$ (all $q$), $A_2(7,5)=34$. We also provide an exposition of the known determination of $A_q(v,2)$, and a table with exact results and b"},"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":"1512.06660","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:22:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9df482c5289d8b609d57f1abf1f249db50704e1de2893a5750016cd8f87c6c1f","abstract_canon_sha256":"9926c6286a56a8aaefc44b13690dd2fe5f92a75ffc77b6b7ec11311de7b179eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:56.762597Z","signature_b64":"2k4cNeydzV5MnisqLWvaNR/QiaGUCgzCqR1cpAPkntvigw0rb7XsSRy7PhpofcJYggfuHQXeuDNF3dG0uiq3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d95ee5104256369f7a7d4fc9b76ce9b0278878488b67db6d8f757e3c903d7aee","last_reissued_at":"2026-05-18T00:06:56.762061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:56.762061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructions and Bounds for Mixed-Dimension Subspace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Michael Kiermaier, Sascha Kurz, Thomas Honold","submitted_at":"2015-12-21T15:22:32Z","abstract_excerpt":"Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \\emph{Main Problem of Subspace Coding} is to determine the maximum size $A_q(v,d)$ of a code in $\\operatorname{PG}(v-1,\\mathbb{F}_q)$ with minimum subspace distance $d$. Here we completely resolve this problem for $d\\ge v-1$. For $d=v-2$ we present some improved bounds and determine $A_q(5,3)=2q^3+2$ (all $q$), $A_2(7,5)=34$. We also provide an exposition of the known determination of $A_q(v,2)$, and a table with exact results and b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06660","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":""},"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":"1512.06660","created_at":"2026-05-18T00:06:56.762145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06660v3","created_at":"2026-05-18T00:06:56.762145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06660","created_at":"2026-05-18T00:06:56.762145+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FPOKECCKY3J","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FPOKECCKY3J66T5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FPOKECC","created_at":"2026-05-18T12:29:02.477457+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/3FPOKECCKY3J66T5J7E3O3HJWA","json":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA.json","graph_json":"https://pith.science/api/pith-number/3FPOKECCKY3J66T5J7E3O3HJWA/graph.json","events_json":"https://pith.science/api/pith-number/3FPOKECCKY3J66T5J7E3O3HJWA/events.json","paper":"https://pith.science/paper/3FPOKECC"},"agent_actions":{"view_html":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA","download_json":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA.json","view_paper":"https://pith.science/paper/3FPOKECC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06660&json=true","fetch_graph":"https://pith.science/api/pith-number/3FPOKECCKY3J66T5J7E3O3HJWA/graph.json","fetch_events":"https://pith.science/api/pith-number/3FPOKECCKY3J66T5J7E3O3HJWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA/action/storage_attestation","attest_author":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA/action/author_attestation","sign_citation":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA/action/citation_signature","submit_replication":"https://pith.science/pith/3FPOKECCKY3J66T5J7E3O3HJWA/action/replication_record"}},"created_at":"2026-05-18T00:06:56.762145+00:00","updated_at":"2026-05-18T00:06:56.762145+00:00"}