{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JLPVBCBS5JNMEOWKV4KSX5FMHY","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":"ae390e82f47918b40f3277678a986932ddcd2951af5d00abd91c1ce7d814e114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T10:21:08Z","title_canon_sha256":"4c7ed98b450debc898eb59b5c4a144df3f047fce23656f9192bce0a42f71b225"},"schema_version":"1.0","source":{"id":"1111.4319","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4319","created_at":"2026-05-18T03:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4319v4","created_at":"2026-05-18T03:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4319","created_at":"2026-05-18T03:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"JLPVBCBS5JNM","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JLPVBCBS5JNMEOWK","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JLPVBCBS","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b66a3d8ef3c45bafc88dda32f0de5a525df5f149152f45da8f255cb4c62fba25","target":"graph","created_at":"2026-05-18T03:43:29Z","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":"Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\\cG_q(n,r)$ by subspaces from the Grassmann graph $\\cG_q(n,k)$, $k \\geq r$, are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, $q$-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and a recursive construction. New constructions are given for $q=2$ with $r=2$ or $r=3$. We discuss the density for some of these coverings. Tables for the best known coverings, for $q=2$ and ","authors_text":"Tuvi Etzion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T10:21:08Z","title":"Covering of Subspaces by Subspaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4319","kind":"arxiv","version":4},"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:aec98bc1aef1317bbc199e32fcbda9453120364d330790fddac9d31ce52681f1","target":"record","created_at":"2026-05-18T03:43:29Z","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":"ae390e82f47918b40f3277678a986932ddcd2951af5d00abd91c1ce7d814e114","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-18T10:21:08Z","title_canon_sha256":"4c7ed98b450debc898eb59b5c4a144df3f047fce23656f9192bce0a42f71b225"},"schema_version":"1.0","source":{"id":"1111.4319","kind":"arxiv","version":4}},"canonical_sha256":"4adf508832ea5ac23acaaf152bf4ac3e06f492cf2a44948c94750e9a2d30232a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4adf508832ea5ac23acaaf152bf4ac3e06f492cf2a44948c94750e9a2d30232a","first_computed_at":"2026-05-18T03:43:29.655843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:29.655843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvIPX93Y3vlEQ9yEVJsv0tsA9S0YpdopOR6Oe8g/tu+5h6Z4KIJz0F/W4QUXdgpc3roDZULBtAWGP591a5JjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:29.656540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4319","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec98bc1aef1317bbc199e32fcbda9453120364d330790fddac9d31ce52681f1","sha256:b66a3d8ef3c45bafc88dda32f0de5a525df5f149152f45da8f255cb4c62fba25"],"state_sha256":"5b0fffaa931ac3f65866c99ed939bc8e9335fd42dd5fff7b0025ee6583a34ec3"}