{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4N7HPTKZPMTYM4BVCVIBUPQX2C","short_pith_number":"pith:4N7HPTKZ","schema_version":"1.0","canonical_sha256":"e37e77cd597b2786703515501a3e17d0a36b484565af53da1064d219c0eb1719","source":{"kind":"arxiv","id":"2008.09944","version":1},"attestation_state":"computed","paper":{"title":"Parameter-controlled inserting constructions of constant dimension subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen, Huimin Lao, Jian Weng, Xiaoqing Tan","submitted_at":"2020-08-23T02:43:58Z","abstract_excerpt":"A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\\bf F}_q^n$ such that the subspace distance satisfies $\\operatorname{dis}(U,V)=2k-2\\dim(U \\cap V) \\geq d$ for any two different $k$-dimensional subspaces $U$ and $V$ in this set. In this paper we propose new parameter-controlled inserting constructions of constant dimension subspace codes. These inserting constructions are flexible because they are controlled by parameters. Several new better lower bounds which are better than all previou"},"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":"2008.09944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-08-23T02:43:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08ca7b3b216e71d9909c267dcf634dd57b8d2997d146dba5e4e64be6751d2863","abstract_canon_sha256":"8d6c8701072620a8450bc80aaa13867fa94f4e5b8543d3297b4ab4f999ba3d10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:18.981600Z","signature_b64":"MJH7UCeT16fk9yrXML8zzoN01+5Zy1BnZyh3pndNWIW/0DT4rP2318JAWT8vaBGnIEQFWUmDLB9q3+U2E2/CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37e77cd597b2786703515501a3e17d0a36b484565af53da1064d219c0eb1719","last_reissued_at":"2026-07-05T01:29:18.981153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:18.981153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter-controlled inserting constructions of constant dimension subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen, Huimin Lao, Jian Weng, Xiaoqing Tan","submitted_at":"2020-08-23T02:43:58Z","abstract_excerpt":"A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\\bf F}_q^n$ such that the subspace distance satisfies $\\operatorname{dis}(U,V)=2k-2\\dim(U \\cap V) \\geq d$ for any two different $k$-dimensional subspaces $U$ and $V$ in this set. In this paper we propose new parameter-controlled inserting constructions of constant dimension subspace codes. These inserting constructions are flexible because they are controlled by parameters. Several new better lower bounds which are better than all previou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09944","kind":"arxiv","version":1},"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/2008.09944/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":"2008.09944","created_at":"2026-07-05T01:29:18.981211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.09944v1","created_at":"2026-07-05T01:29:18.981211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09944","created_at":"2026-07-05T01:29:18.981211+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N7HPTKZPMTY","created_at":"2026-07-05T01:29:18.981211+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N7HPTKZPMTYM4BV","created_at":"2026-07-05T01:29:18.981211+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N7HPTKZ","created_at":"2026-07-05T01:29:18.981211+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/4N7HPTKZPMTYM4BVCVIBUPQX2C","json":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C.json","graph_json":"https://pith.science/api/pith-number/4N7HPTKZPMTYM4BVCVIBUPQX2C/graph.json","events_json":"https://pith.science/api/pith-number/4N7HPTKZPMTYM4BVCVIBUPQX2C/events.json","paper":"https://pith.science/paper/4N7HPTKZ"},"agent_actions":{"view_html":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C","download_json":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C.json","view_paper":"https://pith.science/paper/4N7HPTKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.09944&json=true","fetch_graph":"https://pith.science/api/pith-number/4N7HPTKZPMTYM4BVCVIBUPQX2C/graph.json","fetch_events":"https://pith.science/api/pith-number/4N7HPTKZPMTYM4BVCVIBUPQX2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C/action/storage_attestation","attest_author":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C/action/author_attestation","sign_citation":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C/action/citation_signature","submit_replication":"https://pith.science/pith/4N7HPTKZPMTYM4BVCVIBUPQX2C/action/replication_record"}},"created_at":"2026-07-05T01:29:18.981211+00:00","updated_at":"2026-07-05T01:29:18.981211+00:00"}