{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","short_pith_number":"pith:DN7UZJGS","schema_version":"1.0","canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","source":{"kind":"arxiv","id":"1601.02864","version":3},"attestation_state":"computed","paper":{"title":"Tables of subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz","submitted_at":"2016-01-12T13:59:06Z","abstract_excerpt":"One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K\\subseteq\\{0,1,\\dots,n\\}$. In the special case of $K=\\{k\\}$ one speaks of constant dimension codes. Since this (still) emerging field is very prosperous on the one hand side and there are a lot of connections to classical objects from Galois geometry it is a bit difficult to keep or to obtain an overview about the current state of knowledge. To this en"},"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":"1601.02864","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5","abstract_canon_sha256":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:40.875832Z","signature_b64":"zuw68K7fN+QXHqwqG3fMUitYArfgKB/rw5zyPNZrJkc61hiLFYOX6l06N0JY9HbhWItGowEzhqsCGUtdzQyWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","last_reissued_at":"2026-07-05T00:27:40.875447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:40.875447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tables of subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz","submitted_at":"2016-01-12T13:59:06Z","abstract_excerpt":"One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained in $K\\subseteq\\{0,1,\\dots,n\\}$. In the special case of $K=\\{k\\}$ one speaks of constant dimension codes. Since this (still) emerging field is very prosperous on the one hand side and there are a lot of connections to classical objects from Galois geometry it is a bit difficult to keep or to obtain an overview about the current state of knowledge. To this en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02864","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/1601.02864/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":"1601.02864","created_at":"2026-07-05T00:27:40.875497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02864v3","created_at":"2026-07-05T00:27:40.875497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02864","created_at":"2026-07-05T00:27:40.875497+00:00"},{"alias_kind":"pith_short_12","alias_value":"DN7UZJGS5XNY","created_at":"2026-07-05T00:27:40.875497+00:00"},{"alias_kind":"pith_short_16","alias_value":"DN7UZJGS5XNY3HOJ","created_at":"2026-07-05T00:27:40.875497+00:00"},{"alias_kind":"pith_short_8","alias_value":"DN7UZJGS","created_at":"2026-07-05T00:27:40.875497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07479","citing_title":"Combinatorial constructions of Schubert subspace codes","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07479","citing_title":"Combinatorial constructions of Schubert subspace codes","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ","json":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ.json","graph_json":"https://pith.science/api/pith-number/DN7UZJGS5XNY3HOJOOYD2IUTSQ/graph.json","events_json":"https://pith.science/api/pith-number/DN7UZJGS5XNY3HOJOOYD2IUTSQ/events.json","paper":"https://pith.science/paper/DN7UZJGS"},"agent_actions":{"view_html":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ","download_json":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ.json","view_paper":"https://pith.science/paper/DN7UZJGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02864&json=true","fetch_graph":"https://pith.science/api/pith-number/DN7UZJGS5XNY3HOJOOYD2IUTSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DN7UZJGS5XNY3HOJOOYD2IUTSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/action/storage_attestation","attest_author":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/action/author_attestation","sign_citation":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/action/citation_signature","submit_replication":"https://pith.science/pith/DN7UZJGS5XNY3HOJOOYD2IUTSQ/action/replication_record"}},"created_at":"2026-07-05T00:27:40.875497+00:00","updated_at":"2026-07-05T00:27:40.875497+00:00"}