{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JQZVWAAWXQ2XWPFHBKSIRACKDX","short_pith_number":"pith:JQZVWAAW","canonical_record":{"source":{"id":"1505.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T21:01:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"f737799dc3c93915d425675d4958eb0b23c90cef63e0e4eeacd70cf529a50912","abstract_canon_sha256":"fb859e45f9f2f62ff8bcb5fb89e71c142ed39b7cc730590a2176e16a16589db0"},"schema_version":"1.0"},"canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","source":{"kind":"arxiv","id":"1505.02186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02186","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02186v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02186","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"JQZVWAAWXQ2X","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JQZVWAAWXQ2XWPFH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JQZVWAAW","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JQZVWAAWXQ2XWPFHBKSIRACKDX","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T21:01:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"f737799dc3c93915d425675d4958eb0b23c90cef63e0e4eeacd70cf529a50912","abstract_canon_sha256":"fb859e45f9f2f62ff8bcb5fb89e71c142ed39b7cc730590a2176e16a16589db0"},"schema_version":"1.0"},"canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.644841Z","signature_b64":"b1PE8F5eP4M38fQu6iXtowCk7nNvFuIQuw01ztmTbmD3rJMtOIm0ZTX6Hq8pp4FFcvjYXYaVOIR7YT2aAakrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","last_reissued_at":"2026-05-18T02:16:19.644187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.644187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02186","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEwrACaY5ieRfaTSoJxGX16/K8OVqmXz1VisiCimVHtMVHH9ijnEQ1ooJ1nWoGA8gyaKCfO6mTvJJsHEuQC/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:04:46.591514Z"},"content_sha256":"6bee18ebfd2391b60ffb0c6f84f8b4ead00250f4159bd0cf8ad50e5ec4aa8216","schema_version":"1.0","event_id":"sha256:6bee18ebfd2391b60ffb0c6f84f8b4ead00250f4159bd0cf8ad50e5ec4aa8216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JQZVWAAWXQ2XWPFHBKSIRACKDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of Subspace Codes through Linkage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Carolyn Troha, Heide Gluesing-Luerssen","submitted_at":"2015-05-08T21:01:40Z","abstract_excerpt":"A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, for a special case of linkage, a decoding algorithm is presented which amounts to decoding with respect to the smaller constituent codes and which can be parallelized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02186","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-18T02:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENcv54zvze88Srh4zAWJcXX/pbxny829XvcbM02YqWhhmfWRAD4LhC1P0Fs604F9+zCNjDScw/H1qaVpJidcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:04:46.591864Z"},"content_sha256":"7ec58e11b62e32bc3f3377e0edd1b9523827dc8a254a52f73dcf5c5426a649ac","schema_version":"1.0","event_id":"sha256:7ec58e11b62e32bc3f3377e0edd1b9523827dc8a254a52f73dcf5c5426a649ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/bundle.json","state_url":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/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-24T20:04:46Z","links":{"resolver":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX","bundle":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/bundle.json","state":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JQZVWAAWXQ2XWPFHBKSIRACKDX","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":"fb859e45f9f2f62ff8bcb5fb89e71c142ed39b7cc730590a2176e16a16589db0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T21:01:40Z","title_canon_sha256":"f737799dc3c93915d425675d4958eb0b23c90cef63e0e4eeacd70cf529a50912"},"schema_version":"1.0","source":{"id":"1505.02186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02186","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02186v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02186","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"JQZVWAAWXQ2X","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JQZVWAAWXQ2XWPFH","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JQZVWAAW","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:7ec58e11b62e32bc3f3377e0edd1b9523827dc8a254a52f73dcf5c5426a649ac","target":"graph","created_at":"2026-05-18T02:16:19Z","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":"A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, for a special case of linkage, a decoding algorithm is presented which amounts to decoding with respect to the smaller constituent codes and which can be parallelized.","authors_text":"Carolyn Troha, Heide Gluesing-Luerssen","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T21:01:40Z","title":"Construction of Subspace Codes through Linkage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02186","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:6bee18ebfd2391b60ffb0c6f84f8b4ead00250f4159bd0cf8ad50e5ec4aa8216","target":"record","created_at":"2026-05-18T02:16:19Z","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":"fb859e45f9f2f62ff8bcb5fb89e71c142ed39b7cc730590a2176e16a16589db0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-08T21:01:40Z","title_canon_sha256":"f737799dc3c93915d425675d4958eb0b23c90cef63e0e4eeacd70cf529a50912"},"schema_version":"1.0","source":{"id":"1505.02186","kind":"arxiv","version":1}},"canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","first_computed_at":"2026-05-18T02:16:19.644187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.644187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b1PE8F5eP4M38fQu6iXtowCk7nNvFuIQuw01ztmTbmD3rJMtOIm0ZTX6Hq8pp4FFcvjYXYaVOIR7YT2aAakrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.644841Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bee18ebfd2391b60ffb0c6f84f8b4ead00250f4159bd0cf8ad50e5ec4aa8216","sha256:7ec58e11b62e32bc3f3377e0edd1b9523827dc8a254a52f73dcf5c5426a649ac"],"state_sha256":"66a1d0720cab4c0274e4a5720f901c0c367654ddc10666a28442d78bf9aad2d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey3osX+r43v4wB0ZGb3sIX132Vr7Y6yl0A45w61kmszXubR3eqGojsna4zFFUTBn6Twpciwc2Tsi2zl7m2jqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:04:46.593857Z","bundle_sha256":"6b650a3a396ac99ddec6c538e091f00099fc0e869b168f0660cbda6c4b3ca61a"}}