{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3BKXKSKBZIYHJIUNNHV3GTNBWF","short_pith_number":"pith:3BKXKSKB","schema_version":"1.0","canonical_sha256":"d855754941ca3074a28d69ebb34da1b1419ea59fa9c782e86fc65b701fcdb3ea","source":{"kind":"arxiv","id":"1404.6723","version":2},"attestation_state":"computed","paper":{"title":"Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Natalia Silberstein","submitted_at":"2014-04-27T07:59:04Z","abstract_excerpt":"This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with minimum injection distance $2$ or $k-1$, where $k$ is the constant dimension. Furthermore, we present a construction of new codes from old codes for any minimum distance. Then we construct non-constant dimension codes from these codes. The examples of codes obtained by these constructions are the largest known codes for the given parameters."},"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":"1404.6723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-27T07:59:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ea525a4d0f4579cf7ad79df41702148b74940594640edfb3dc6fdde31b80c1f5","abstract_canon_sha256":"631c18f03b57d25cb26b2f7908f1b6b16ed97f365b4370216fb5d1bdb108be8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:41.287870Z","signature_b64":"8R1B0bZQ1c3DlALCF/khF9+K0++R6ucE7P6D3mJXGKET61peXy1xOBr07sW5Y1vW32T4ABjI9F//FaPJ08ENBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d855754941ca3074a28d69ebb34da1b1419ea59fa9c782e86fc65b701fcdb3ea","last_reissued_at":"2026-05-18T02:16:41.287148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:41.287148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Natalia Silberstein","submitted_at":"2014-04-27T07:59:04Z","abstract_excerpt":"This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with minimum injection distance $2$ or $k-1$, where $k$ is the constant dimension. Furthermore, we present a construction of new codes from old codes for any minimum distance. Then we construct non-constant dimension codes from these codes. The examples of codes obtained by these constructions are the largest known codes for the given parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6723","kind":"arxiv","version":2},"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":"1404.6723","created_at":"2026-05-18T02:16:41.287262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6723v2","created_at":"2026-05-18T02:16:41.287262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6723","created_at":"2026-05-18T02:16:41.287262+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BKXKSKBZIYH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BKXKSKBZIYHJIUN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BKXKSKB","created_at":"2026-05-18T12:28:11.866339+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/3BKXKSKBZIYHJIUNNHV3GTNBWF","json":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF.json","graph_json":"https://pith.science/api/pith-number/3BKXKSKBZIYHJIUNNHV3GTNBWF/graph.json","events_json":"https://pith.science/api/pith-number/3BKXKSKBZIYHJIUNNHV3GTNBWF/events.json","paper":"https://pith.science/paper/3BKXKSKB"},"agent_actions":{"view_html":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF","download_json":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF.json","view_paper":"https://pith.science/paper/3BKXKSKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6723&json=true","fetch_graph":"https://pith.science/api/pith-number/3BKXKSKBZIYHJIUNNHV3GTNBWF/graph.json","fetch_events":"https://pith.science/api/pith-number/3BKXKSKBZIYHJIUNNHV3GTNBWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF/action/storage_attestation","attest_author":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF/action/author_attestation","sign_citation":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF/action/citation_signature","submit_replication":"https://pith.science/pith/3BKXKSKBZIYHJIUNNHV3GTNBWF/action/replication_record"}},"created_at":"2026-05-18T02:16:41.287262+00:00","updated_at":"2026-05-18T02:16:41.287262+00:00"}