{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5RTSZ7AB23KT5365ZHL5NNFVIT","short_pith_number":"pith:5RTSZ7AB","canonical_record":{"source":{"id":"1705.03835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T15:59:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"82592ae238a9be34bffbce099255c285d2be22cf9fceb984b25977b6f8e5092f","abstract_canon_sha256":"74379f0f8a29f1c3c5c373dbb037d5809c13d646d6c83bb885119c3fa4f52270"},"schema_version":"1.0"},"canonical_sha256":"ec672cfc01d6d53eefddc9d7d6b4b544fa20c698954e235d0183935a335afd92","source":{"kind":"arxiv","id":"1705.03835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03835","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03835v1","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03835","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"5RTSZ7AB23KT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5RTSZ7AB23KT5365","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5RTSZ7AB","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5RTSZ7AB23KT5365ZHL5NNFVIT","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T15:59:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"82592ae238a9be34bffbce099255c285d2be22cf9fceb984b25977b6f8e5092f","abstract_canon_sha256":"74379f0f8a29f1c3c5c373dbb037d5809c13d646d6c83bb885119c3fa4f52270"},"schema_version":"1.0"},"canonical_sha256":"ec672cfc01d6d53eefddc9d7d6b4b544fa20c698954e235d0183935a335afd92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:55.776276Z","signature_b64":"8wd93fW+R8Sk5Y9Nr2bK+TJlr8kF4frUJF9+HpDRW6DW7e/3hOX3+eqVuSoTaH9mc94rUxxgGNPDsE7UebDaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec672cfc01d6d53eefddc9d7d6b4b544fa20c698954e235d0183935a335afd92","last_reissued_at":"2026-05-18T00:28:55.775683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:55.775683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03835","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0g6IAfiRbLmcYN02yStDEalDKzLeWkMY+QOeFo1RwdDnw3fgpws+sKWc6fivyHXggtRVMb4r+LC44ZBH+4SRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:39:00.061256Z"},"content_sha256":"230f65164f68026d7197d8b8dd77db88a1470487b696d406ca9e7c70a48ac547","schema_version":"1.0","event_id":"sha256:230f65164f68026d7197d8b8dd77db88a1470487b696d406ca9e7c70a48ac547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5RTSZ7AB23KT5365ZHL5NNFVIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniel Heinlein, Sascha Kurz","submitted_at":"2017-05-10T15:59:03Z","abstract_excerpt":"We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes with subspace distance $d=4$, dimension $k=3$ of the codewords for all field sizes $q$, and sufficiently large dimensions $v$ of the ambient space, that exceed the MRD bound, for codes containing a lift"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03835","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9VtVOds5x+ZaqYs9HL3L9R4nYTYujBs1K1+r5uW+caSYRjyKHbnwQb/LKLdgLC6LiQYyC7eRfdjVsXruMy6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:39:00.061946Z"},"content_sha256":"f995a9ea9e613cc1a89aa676654944767c5840ee19d85553d78f9b3cea991aaf","schema_version":"1.0","event_id":"sha256:f995a9ea9e613cc1a89aa676654944767c5840ee19d85553d78f9b3cea991aaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/bundle.json","state_url":"https://pith.science/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/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-05-26T10:39:00Z","links":{"resolver":"https://pith.science/pith/5RTSZ7AB23KT5365ZHL5NNFVIT","bundle":"https://pith.science/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/bundle.json","state":"https://pith.science/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RTSZ7AB23KT5365ZHL5NNFVIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5RTSZ7AB23KT5365ZHL5NNFVIT","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":"74379f0f8a29f1c3c5c373dbb037d5809c13d646d6c83bb885119c3fa4f52270","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T15:59:03Z","title_canon_sha256":"82592ae238a9be34bffbce099255c285d2be22cf9fceb984b25977b6f8e5092f"},"schema_version":"1.0","source":{"id":"1705.03835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03835","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03835v1","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03835","created_at":"2026-05-18T00:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"5RTSZ7AB23KT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5RTSZ7AB23KT5365","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5RTSZ7AB","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f995a9ea9e613cc1a89aa676654944767c5840ee19d85553d78f9b3cea991aaf","target":"graph","created_at":"2026-05-18T00:28:55Z","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":"We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes with subspace distance $d=4$, dimension $k=3$ of the codewords for all field sizes $q$, and sufficiently large dimensions $v$ of the ambient space, that exceed the MRD bound, for codes containing a lift","authors_text":"Daniel Heinlein, Sascha Kurz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T15:59:03Z","title":"Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03835","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:230f65164f68026d7197d8b8dd77db88a1470487b696d406ca9e7c70a48ac547","target":"record","created_at":"2026-05-18T00:28:55Z","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":"74379f0f8a29f1c3c5c373dbb037d5809c13d646d6c83bb885119c3fa4f52270","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-10T15:59:03Z","title_canon_sha256":"82592ae238a9be34bffbce099255c285d2be22cf9fceb984b25977b6f8e5092f"},"schema_version":"1.0","source":{"id":"1705.03835","kind":"arxiv","version":1}},"canonical_sha256":"ec672cfc01d6d53eefddc9d7d6b4b544fa20c698954e235d0183935a335afd92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec672cfc01d6d53eefddc9d7d6b4b544fa20c698954e235d0183935a335afd92","first_computed_at":"2026-05-18T00:28:55.775683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:55.775683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wd93fW+R8Sk5Y9Nr2bK+TJlr8kF4frUJF9+HpDRW6DW7e/3hOX3+eqVuSoTaH9mc94rUxxgGNPDsE7UebDaDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:55.776276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230f65164f68026d7197d8b8dd77db88a1470487b696d406ca9e7c70a48ac547","sha256:f995a9ea9e613cc1a89aa676654944767c5840ee19d85553d78f9b3cea991aaf"],"state_sha256":"3e1d2b0df2cb8dd3b10124bea69331d69d9f4052f725d7b8dc7d73576739fdab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBao6VOlsHOxzxFz19+slKZC68pXD0ihTqjVWXiPwmqaAvOl30X4f/CxvTIQPVuCb7VFGuvnQzw0l+K0jqwABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:39:00.065613Z","bundle_sha256":"2942aaa6142b0753cc9661c2938764fdd9d52b9c2911ae2001cee52b478502eb"}}