{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IV5ER3MUXQXQPCDKE2TDR57GIN","short_pith_number":"pith:IV5ER3MU","canonical_record":{"source":{"id":"1707.04342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T22:16:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f457e3328446439a2c9abf1947162340825a7bb16e99a0fa0f6ccd3b1f90257","abstract_canon_sha256":"3835a16be178f572a1004e86a5917735c42022fd73ab3c5e22b8e4c67b58f05d"},"schema_version":"1.0"},"canonical_sha256":"457a48ed94bc2f07886a26a638f7e6434a49afc313cf0928ad1e0b116695f050","source":{"kind":"arxiv","id":"1707.04342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04342","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04342v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04342","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"IV5ER3MUXQXQ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IV5ER3MUXQXQPCDK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IV5ER3MU","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IV5ER3MUXQXQPCDKE2TDR57GIN","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T22:16:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f457e3328446439a2c9abf1947162340825a7bb16e99a0fa0f6ccd3b1f90257","abstract_canon_sha256":"3835a16be178f572a1004e86a5917735c42022fd73ab3c5e22b8e4c67b58f05d"},"schema_version":"1.0"},"canonical_sha256":"457a48ed94bc2f07886a26a638f7e6434a49afc313cf0928ad1e0b116695f050","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.572584Z","signature_b64":"gXa3olhNB+K0TJB+u57Nk1HKrLAo5/FGOsGFMI8yunEXPAA4wW9TgJHxYuFniiABUvirrd41P2GDkIVmRbHKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"457a48ed94bc2f07886a26a638f7e6434a49afc313cf0928ad1e0b116695f050","last_reissued_at":"2026-05-18T00:40:18.571798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.571798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04342","source_version":1,"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-05-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dO83LeNbTfqIVvMj+sYhQlbd8nWwshq4lUQzUNk+pDttwItju9SRriTb43CA3jUhi1xmEjdsDNn4C5OQ8tLgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:56:28.242120Z"},"content_sha256":"bae0397bb6fb307eeb4eab86b259be701e8fa3d935e5d037e9e59bed9a28a57c","schema_version":"1.0","event_id":"sha256:bae0397bb6fb307eeb4eab86b259be701e8fa3d935e5d037e9e59bed9a28a57c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IV5ER3MUXQXQPCDKE2TDR57GIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of cyclic constant dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bocong Chen, Hongwei Liu","submitted_at":"2017-07-13T22:16:14Z","abstract_excerpt":"Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code sizes and the minimum distances are as large as possible. In this paper, we explore the ideas of constructing cyclic constant dimension codes proposed in \\big([2], IEEE Trans. Inf. Theory, 2016\\big) and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04342","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":""},"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-05-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxAyAUNW3qtt7z8PqWvubu2BMAUc7UfJlbjVnjUVBx7IqJhHKc6+LEDBLyBFHvTOFZYPDQi3UN9hBvLBKiFABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:56:28.242486Z"},"content_sha256":"5833f4030beec90844f25b1ee55844a23b20a85d863b78e8be47531bb747446d","schema_version":"1.0","event_id":"sha256:5833f4030beec90844f25b1ee55844a23b20a85d863b78e8be47531bb747446d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/bundle.json","state_url":"https://pith.science/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/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-06-03T22:56:28Z","links":{"resolver":"https://pith.science/pith/IV5ER3MUXQXQPCDKE2TDR57GIN","bundle":"https://pith.science/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/bundle.json","state":"https://pith.science/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV5ER3MUXQXQPCDKE2TDR57GIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IV5ER3MUXQXQPCDKE2TDR57GIN","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":"3835a16be178f572a1004e86a5917735c42022fd73ab3c5e22b8e4c67b58f05d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T22:16:14Z","title_canon_sha256":"7f457e3328446439a2c9abf1947162340825a7bb16e99a0fa0f6ccd3b1f90257"},"schema_version":"1.0","source":{"id":"1707.04342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04342","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04342v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04342","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"IV5ER3MUXQXQ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IV5ER3MUXQXQPCDK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IV5ER3MU","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:5833f4030beec90844f25b1ee55844a23b20a85d863b78e8be47531bb747446d","target":"graph","created_at":"2026-05-18T00:40:18Z","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"},"paper":{"abstract_excerpt":"Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code sizes and the minimum distances are as large as possible. In this paper, we explore the ideas of constructing cyclic constant dimension codes proposed in \\big([2], IEEE Trans. Inf. Theory, 2016\\big) and ","authors_text":"Bocong Chen, Hongwei Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T22:16:14Z","title":"Constructions of cyclic constant dimension codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04342","kind":"arxiv","version":1},"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:bae0397bb6fb307eeb4eab86b259be701e8fa3d935e5d037e9e59bed9a28a57c","target":"record","created_at":"2026-05-18T00:40:18Z","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":"3835a16be178f572a1004e86a5917735c42022fd73ab3c5e22b8e4c67b58f05d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T22:16:14Z","title_canon_sha256":"7f457e3328446439a2c9abf1947162340825a7bb16e99a0fa0f6ccd3b1f90257"},"schema_version":"1.0","source":{"id":"1707.04342","kind":"arxiv","version":1}},"canonical_sha256":"457a48ed94bc2f07886a26a638f7e6434a49afc313cf0928ad1e0b116695f050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"457a48ed94bc2f07886a26a638f7e6434a49afc313cf0928ad1e0b116695f050","first_computed_at":"2026-05-18T00:40:18.571798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.571798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXa3olhNB+K0TJB+u57Nk1HKrLAo5/FGOsGFMI8yunEXPAA4wW9TgJHxYuFniiABUvirrd41P2GDkIVmRbHKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.572584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bae0397bb6fb307eeb4eab86b259be701e8fa3d935e5d037e9e59bed9a28a57c","sha256:5833f4030beec90844f25b1ee55844a23b20a85d863b78e8be47531bb747446d"],"state_sha256":"6cb7a33c14c997dc6b5cf5705ac02ea44d65a8ffff7d6223bd500a9ad57267ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtnmzK6g57N/uQPIVmQh5wPknQoyWeGVeaA/Sq3/61OYP9xG9YLyeOweUkby9ZdMTQqVaGC1iudkoGRq+tW3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:56:28.244455Z","bundle_sha256":"159f5c8a9585b70079f6e588321ad192f678b118b289354328b6fafdd80de07c"}}