{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DN7UZJGS5XNY3HOJOOYD2IUTSQ","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":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5"},"schema_version":"1.0","source":{"id":"1601.02864","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02864v3","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02864","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"DN7UZJGS5XNY","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DN7UZJGS5XNY3HOJ","created_at":"2026-07-05T00:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DN7UZJGS","created_at":"2026-07-05T00:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6","target":"graph","created_at":"2026-07-05T00:27:40Z","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/1601.02864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title":"Tables of subspace codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02864","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:117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076","target":"record","created_at":"2026-07-05T00:27:40Z","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":"6557c75512fac2a605473d840935ac763a402f159a4690c2ccad18b110a5c974","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T13:59:06Z","title_canon_sha256":"87a593d9617ac02cc0ebbe9d86342d61d5b96703dc55c9144984feb02ec4c3c5"},"schema_version":"1.0","source":{"id":"1601.02864","kind":"arxiv","version":3}},"canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7f4ca4d2eddb8d9dc973b03d2293940ad6afba14c442dd2db8ef494421db72","first_computed_at":"2026-07-05T00:27:40.875447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:40.875447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zuw68K7fN+QXHqwqG3fMUitYArfgKB/rw5zyPNZrJkc61hiLFYOX6l06N0JY9HbhWItGowEzhqsCGUtdzQyWAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:40.875832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02864","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117b33eca9727adc935605a1d68dc41102dec28efdf9a568b232a4b91685e076","sha256:7c574cee9d7650cca259bf3859032bb67d9724510c09fbde843461ccdf55f5e6"],"state_sha256":"15cd3482e95ee45c3b4b7f297acd9d64f2de8a0a93299760ac1bc513cbd9aeed"}