{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ULPC3S74DHW47IJRLBJ7BCIROG","short_pith_number":"pith:ULPC3S74","canonical_record":{"source":{"id":"1908.03804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-10T20:59:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee32f149c7ab7e04236d4649984306dd562d228b34688bff3e1bf7a68bd553eb","abstract_canon_sha256":"749b02c13dd602f1e1991c736082220aaffd0572cd515d2e5a6ea1f78b47d344"},"schema_version":"1.0"},"canonical_sha256":"a2de2dcbfc19edcfa1315853f08911718bce7fbadfcc0579b284c5e985ddddbf","source":{"kind":"arxiv","id":"1908.03804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03804","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03804v2","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03804","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"ULPC3S74DHW4","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_16","alias_value":"ULPC3S74DHW47IJR","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_8","alias_value":"ULPC3S74","created_at":"2026-07-05T00:29:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ULPC3S74DHW47IJRLBJ7BCIROG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-10T20:59:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee32f149c7ab7e04236d4649984306dd562d228b34688bff3e1bf7a68bd553eb","abstract_canon_sha256":"749b02c13dd602f1e1991c736082220aaffd0572cd515d2e5a6ea1f78b47d344"},"schema_version":"1.0"},"canonical_sha256":"a2de2dcbfc19edcfa1315853f08911718bce7fbadfcc0579b284c5e985ddddbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:28.739890Z","signature_b64":"XCKbrmqt/E7ssSxH2JhpTzRlGaTTERRJ9AASI8QPac8YV+Fh/AOGSGRZfXUvlj5D9CEmFCHn5TbmdgpsB878AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2de2dcbfc19edcfa1315853f08911718bce7fbadfcc0579b284c5e985ddddbf","last_reissued_at":"2026-07-05T00:29:28.739340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:28.739340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03804","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhTtU5Rs0nZiUBNP540NQIlyonaghXKDSQNmLCC+CCEUmeGHuO9zz1JqQ/6vFKsmWeplC+QLXOrCUqVxX76MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:49:58.688074Z"},"content_sha256":"acc1b1ca0ff31eb95166ad9e89aa02d677d6214a91508cc705fb3ad2a351e442","schema_version":"1.0","event_id":"sha256:acc1b1ca0ff31eb95166ad9e89aa02d677d6214a91508cc705fb3ad2a351e442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ULPC3S74DHW47IJRLBJ7BCIROG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen, Jian Weng, Liqing Xu, Xianmang He","submitted_at":"2019-08-10T20:59:50Z","abstract_excerpt":"A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different subspaces U andV in this set. We present two new constructions of constant dimension subspace codes using subsets of maximal rank-distance (MRD) codes in several blocks. This method is firstly applied to the linkage construction and secondly to arbitrary number of blocks of lifting MRD codes. In these two constructions, subsets of MRD codes with bounded ranks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03804","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/1908.03804/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:29:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApPkYz1vNraR1JFkal4I5kOxUTRuLeBzatWoCkimSZLkQHohKhT+bes+A56WxWrUREgrVQulr0q6TzYZlendDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T15:49:58.688478Z"},"content_sha256":"fd31ebdc75f33305354afb886974d5630342174339a386568e1efe0585b500eb","schema_version":"1.0","event_id":"sha256:fd31ebdc75f33305354afb886974d5630342174339a386568e1efe0585b500eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULPC3S74DHW47IJRLBJ7BCIROG/bundle.json","state_url":"https://pith.science/pith/ULPC3S74DHW47IJRLBJ7BCIROG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULPC3S74DHW47IJRLBJ7BCIROG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T15:49:58Z","links":{"resolver":"https://pith.science/pith/ULPC3S74DHW47IJRLBJ7BCIROG","bundle":"https://pith.science/pith/ULPC3S74DHW47IJRLBJ7BCIROG/bundle.json","state":"https://pith.science/pith/ULPC3S74DHW47IJRLBJ7BCIROG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULPC3S74DHW47IJRLBJ7BCIROG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ULPC3S74DHW47IJRLBJ7BCIROG","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":"749b02c13dd602f1e1991c736082220aaffd0572cd515d2e5a6ea1f78b47d344","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-10T20:59:50Z","title_canon_sha256":"ee32f149c7ab7e04236d4649984306dd562d228b34688bff3e1bf7a68bd553eb"},"schema_version":"1.0","source":{"id":"1908.03804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03804","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03804v2","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03804","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_12","alias_value":"ULPC3S74DHW4","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_16","alias_value":"ULPC3S74DHW47IJR","created_at":"2026-07-05T00:29:28Z"},{"alias_kind":"pith_short_8","alias_value":"ULPC3S74","created_at":"2026-07-05T00:29:28Z"}],"graph_snapshots":[{"event_id":"sha256:fd31ebdc75f33305354afb886974d5630342174339a386568e1efe0585b500eb","target":"graph","created_at":"2026-07-05T00:29:28Z","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/1908.03804/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different subspaces U andV in this set. We present two new constructions of constant dimension subspace codes using subsets of maximal rank-distance (MRD) codes in several blocks. This method is firstly applied to the linkage construction and secondly to arbitrary number of blocks of lifting MRD codes. In these two constructions, subsets of MRD codes with bounded ranks ","authors_text":"Hao Chen, Jian Weng, Liqing Xu, Xianmang He","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-10T20:59:50Z","title":"New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03804","kind":"arxiv","version":2},"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:acc1b1ca0ff31eb95166ad9e89aa02d677d6214a91508cc705fb3ad2a351e442","target":"record","created_at":"2026-07-05T00:29:28Z","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":"749b02c13dd602f1e1991c736082220aaffd0572cd515d2e5a6ea1f78b47d344","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-10T20:59:50Z","title_canon_sha256":"ee32f149c7ab7e04236d4649984306dd562d228b34688bff3e1bf7a68bd553eb"},"schema_version":"1.0","source":{"id":"1908.03804","kind":"arxiv","version":2}},"canonical_sha256":"a2de2dcbfc19edcfa1315853f08911718bce7fbadfcc0579b284c5e985ddddbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2de2dcbfc19edcfa1315853f08911718bce7fbadfcc0579b284c5e985ddddbf","first_computed_at":"2026-07-05T00:29:28.739340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:28.739340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCKbrmqt/E7ssSxH2JhpTzRlGaTTERRJ9AASI8QPac8YV+Fh/AOGSGRZfXUvlj5D9CEmFCHn5TbmdgpsB878AA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:28.739890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc1b1ca0ff31eb95166ad9e89aa02d677d6214a91508cc705fb3ad2a351e442","sha256:fd31ebdc75f33305354afb886974d5630342174339a386568e1efe0585b500eb"],"state_sha256":"01fa7caf9b45b2f5599f69fd9cf4e771f7babcb6022c5e22519474b7bf84dc9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmHqFKMrK3gK9Yd7s5LBjYYN3znNXjFpjd1JcG3HDuKZL2MciFuH/cL3hLrnywS56GdZCcTOMJA6zYoo3GpuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T15:49:58.692036Z","bundle_sha256":"58c8cb9d7ab8cae52b1caed75a4b03b29607704870748a799d507148ea8e4567"}}