{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EONBJLC5TLYRQCDDY4UWAD2JLD","short_pith_number":"pith:EONBJLC5","schema_version":"1.0","canonical_sha256":"239a14ac5d9af1180863c729600f4958d9be8fe2c13b8413fde281dbbdab27b6","source":{"kind":"arxiv","id":"2109.07128","version":2},"attestation_state":"computed","paper":{"title":"The interplay of different metrics for the construction of constant dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz","submitted_at":"2021-09-15T07:19:42Z","abstract_excerpt":"A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies $d_S(U,W):=2k-2\\dim(U\\cap W)\\ge d$ for all pairs of different codewords $U$, $W$. Constant dimension codes have applications in e.g.\\ random linear network coding, cryptography, and distributed storage. Bounds for $A_q(n,d;k)$ are the topic of many recent research papers. Providing a general framework we survey many of the latest constructions and show up the potential for furth"},"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":"2109.07128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-09-15T07:19:42Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"0f89330147253e0ae722984d0fb757c6ff598fd24d714973f3535ac562669253","abstract_canon_sha256":"5f2b52ecc9dc4fe902c6b54ce2dcd46159871471e90e86dd464042171a24f72e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:16.337180Z","signature_b64":"6T+Jh76XVEbLv4dTVUk3b5z5ltFQkVpGL9QHcZypKyg4So20qiv87wwZgjTsjbW2Xp+PQeK0PG3dZqL5CK9RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"239a14ac5d9af1180863c729600f4958d9be8fe2c13b8413fde281dbbdab27b6","last_reissued_at":"2026-07-05T05:27:16.336596Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:16.336596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The interplay of different metrics for the construction of constant dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Sascha Kurz","submitted_at":"2021-09-15T07:19:42Z","abstract_excerpt":"A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies $d_S(U,W):=2k-2\\dim(U\\cap W)\\ge d$ for all pairs of different codewords $U$, $W$. Constant dimension codes have applications in e.g.\\ random linear network coding, cryptography, and distributed storage. Bounds for $A_q(n,d;k)$ are the topic of many recent research papers. Providing a general framework we survey many of the latest constructions and show up the potential for furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07128","kind":"arxiv","version":2},"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/2109.07128/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":"2109.07128","created_at":"2026-07-05T05:27:16.336673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.07128v2","created_at":"2026-07-05T05:27:16.336673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07128","created_at":"2026-07-05T05:27:16.336673+00:00"},{"alias_kind":"pith_short_12","alias_value":"EONBJLC5TLYR","created_at":"2026-07-05T05:27:16.336673+00:00"},{"alias_kind":"pith_short_16","alias_value":"EONBJLC5TLYRQCDD","created_at":"2026-07-05T05:27:16.336673+00:00"},{"alias_kind":"pith_short_8","alias_value":"EONBJLC5","created_at":"2026-07-05T05:27:16.336673+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/EONBJLC5TLYRQCDDY4UWAD2JLD","json":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD.json","graph_json":"https://pith.science/api/pith-number/EONBJLC5TLYRQCDDY4UWAD2JLD/graph.json","events_json":"https://pith.science/api/pith-number/EONBJLC5TLYRQCDDY4UWAD2JLD/events.json","paper":"https://pith.science/paper/EONBJLC5"},"agent_actions":{"view_html":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD","download_json":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD.json","view_paper":"https://pith.science/paper/EONBJLC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.07128&json=true","fetch_graph":"https://pith.science/api/pith-number/EONBJLC5TLYRQCDDY4UWAD2JLD/graph.json","fetch_events":"https://pith.science/api/pith-number/EONBJLC5TLYRQCDDY4UWAD2JLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD/action/storage_attestation","attest_author":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD/action/author_attestation","sign_citation":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD/action/citation_signature","submit_replication":"https://pith.science/pith/EONBJLC5TLYRQCDDY4UWAD2JLD/action/replication_record"}},"created_at":"2026-07-05T05:27:16.336673+00:00","updated_at":"2026-07-05T05:27:16.336673+00:00"}