{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JQZVWAAWXQ2XWPFHBKSIRACKDX","short_pith_number":"pith:JQZVWAAW","schema_version":"1.0","canonical_sha256":"4c335b0016bc357b3ca70aa488804a1dd17890a4500820adcb123e19958867ff","source":{"kind":"arxiv","id":"1505.02186","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02186","created_at":"2026-05-18T02:16:19.644285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02186v1","created_at":"2026-05-18T02:16:19.644285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02186","created_at":"2026-05-18T02:16:19.644285+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQZVWAAWXQ2X","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQZVWAAWXQ2XWPFH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQZVWAAW","created_at":"2026-05-18T12:29:27.538025+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/JQZVWAAWXQ2XWPFHBKSIRACKDX","json":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX.json","graph_json":"https://pith.science/api/pith-number/JQZVWAAWXQ2XWPFHBKSIRACKDX/graph.json","events_json":"https://pith.science/api/pith-number/JQZVWAAWXQ2XWPFHBKSIRACKDX/events.json","paper":"https://pith.science/paper/JQZVWAAW"},"agent_actions":{"view_html":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX","download_json":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX.json","view_paper":"https://pith.science/paper/JQZVWAAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02186&json=true","fetch_graph":"https://pith.science/api/pith-number/JQZVWAAWXQ2XWPFHBKSIRACKDX/graph.json","fetch_events":"https://pith.science/api/pith-number/JQZVWAAWXQ2XWPFHBKSIRACKDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/action/storage_attestation","attest_author":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/action/author_attestation","sign_citation":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/action/citation_signature","submit_replication":"https://pith.science/pith/JQZVWAAWXQ2XWPFHBKSIRACKDX/action/replication_record"}},"created_at":"2026-05-18T02:16:19.644285+00:00","updated_at":"2026-05-18T02:16:19.644285+00:00"}