{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N2VUZL652Z5KMSNMRZN5WOF7JV","short_pith_number":"pith:N2VUZL65","schema_version":"1.0","canonical_sha256":"6eab4cafddd67aa649ac8e5bdb38bf4d7e83f6ecebf149da8d6f091450466980","source":{"kind":"arxiv","id":"1910.11195","version":3},"attestation_state":"computed","paper":{"title":"Generalized linkage construction for constant-dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Heinlein","submitted_at":"2019-10-24T14:49:33Z","abstract_excerpt":"A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction which in turn yields many improved lower bounds for the cardinalities of CDCs; a quantity not known in general."},"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":"1910.11195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-24T14:49:33Z","cross_cats_sorted":[],"title_canon_sha256":"4844e1558e0cdb7d22b8b1ef3e2c9c687d5263a9029424d81e202be4dcc949d2","abstract_canon_sha256":"c7cc54f2680e86e976c4953ee646b439641ead58cbb0a91696d76c69fade2afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:53.249937Z","signature_b64":"w0iW4mWeef/Og4L3WwXjAM/PgGrJ8Ex2C5rKMlRS09Z56yQVGflp4gHahLwILjQK/KSk3SI07hCz32vyZD8EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eab4cafddd67aa649ac8e5bdb38bf4d7e83f6ecebf149da8d6f091450466980","last_reissued_at":"2026-07-05T00:18:53.249465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:53.249465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized linkage construction for constant-dimension codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Heinlein","submitted_at":"2019-10-24T14:49:33Z","abstract_excerpt":"A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction which in turn yields many improved lower bounds for the cardinalities of CDCs; a quantity not known in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.11195","kind":"arxiv","version":3},"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/1910.11195/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.11195","created_at":"2026-07-05T00:18:53.249522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.11195v3","created_at":"2026-07-05T00:18:53.249522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.11195","created_at":"2026-07-05T00:18:53.249522+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2VUZL652Z5K","created_at":"2026-07-05T00:18:53.249522+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2VUZL652Z5KMSNM","created_at":"2026-07-05T00:18:53.249522+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2VUZL65","created_at":"2026-07-05T00:18:53.249522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03804","citing_title":"New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV","json":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV.json","graph_json":"https://pith.science/api/pith-number/N2VUZL652Z5KMSNMRZN5WOF7JV/graph.json","events_json":"https://pith.science/api/pith-number/N2VUZL652Z5KMSNMRZN5WOF7JV/events.json","paper":"https://pith.science/paper/N2VUZL65"},"agent_actions":{"view_html":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV","download_json":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV.json","view_paper":"https://pith.science/paper/N2VUZL65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.11195&json=true","fetch_graph":"https://pith.science/api/pith-number/N2VUZL652Z5KMSNMRZN5WOF7JV/graph.json","fetch_events":"https://pith.science/api/pith-number/N2VUZL652Z5KMSNMRZN5WOF7JV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV/action/storage_attestation","attest_author":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV/action/author_attestation","sign_citation":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV/action/citation_signature","submit_replication":"https://pith.science/pith/N2VUZL652Z5KMSNMRZN5WOF7JV/action/replication_record"}},"created_at":"2026-07-05T00:18:53.249522+00:00","updated_at":"2026-07-05T00:18:53.249522+00:00"}