{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VV4RMKV37YOQV7VIVRZ2NZ2K4U","short_pith_number":"pith:VV4RMKV3","canonical_record":{"source":{"id":"1506.00215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-31T11:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"bc552cee834721672b5c7c4f7c79bdfe2c750c7f228c8fcb107bbf74a25c38b8","abstract_canon_sha256":"08d3e9fdba98b2a21c842d298a36493440cd4d67a7200f60d27b29d58a60697f"},"schema_version":"1.0"},"canonical_sha256":"ad79162abbfe1d0afea8ac73a6e74ae51c7e7a05aa25b4c699d457b9e54ea3bf","source":{"kind":"arxiv","id":"1506.00215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00215","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00215v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00215","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"VV4RMKV37YOQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VV4RMKV37YOQV7VI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VV4RMKV3","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VV4RMKV37YOQV7VIVRZ2NZ2K4U","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-31T11:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"bc552cee834721672b5c7c4f7c79bdfe2c750c7f228c8fcb107bbf74a25c38b8","abstract_canon_sha256":"08d3e9fdba98b2a21c842d298a36493440cd4d67a7200f60d27b29d58a60697f"},"schema_version":"1.0"},"canonical_sha256":"ad79162abbfe1d0afea8ac73a6e74ae51c7e7a05aa25b4c699d457b9e54ea3bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.176004Z","signature_b64":"XvXJkqHSRAC28qoN5AZbTBHgXiGJSCGul6QmlkZeQVeW7yG2Ky/it0/VKDfzzlN1PCrq4sjat0j8bU/e2VxOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad79162abbfe1d0afea8ac73a6e74ae51c7e7a05aa25b4c699d457b9e54ea3bf","last_reissued_at":"2026-05-18T01:59:55.175542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.175542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00215","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1CF1P/9EMqSyc/csYGi3VGoIzX9nJ/30wDq4GM/XZvmA8QV6+3LnKZI+E2ImveoeR2byu95vlJb4IB1jUUBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:35.038470Z"},"content_sha256":"9b0212b535b9e55dda76346a6e27d1d5941e66f5f1102fd38066cf2f749a00f5","schema_version":"1.0","event_id":"sha256:9b0212b535b9e55dda76346a6e27d1d5941e66f5f1102fd38066cf2f749a00f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VV4RMKV37YOQV7VIVRZ2NZ2K4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the distance between linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mariusz Kwiatkowski, Mark Pankov","submitted_at":"2015-05-31T11:00:33Z","abstract_excerpt":"Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\\Gamma(n,k)_{q}$ the restriction of $\\Gamma_{k}(V)$ to the set of all non-degenerate linear $[n,k]_{q}$ codes. We show that for any two codes the distance in $\\Gamma(n,k)_{q}$ coincides with the distance in $\\Gamma_{k}(V)$ only in the case when $n<(q+1)^2+k-2$, i.e. if $n$ is sufficiently large then for some pairs of codes the distances in the graphs $\\Gamma_{k}(V)$ and $\\Gamma(n,k)_{q}$ are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00215","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vYMWGakPwFe2UqYrB4UaaPoPTXF2yqRRligJk/3RtsfoLNyGlO2WsdGU21FSCeYI/nD1u/OJbgfh8AL+BLeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:05:35.038857Z"},"content_sha256":"6c982d54f56e4e2860c347f852ad50137d32bc65124812e2765e6333c91026f0","schema_version":"1.0","event_id":"sha256:6c982d54f56e4e2860c347f852ad50137d32bc65124812e2765e6333c91026f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/bundle.json","state_url":"https://pith.science/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/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-05-30T11:05:35Z","links":{"resolver":"https://pith.science/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U","bundle":"https://pith.science/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/bundle.json","state":"https://pith.science/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VV4RMKV37YOQV7VIVRZ2NZ2K4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VV4RMKV37YOQV7VIVRZ2NZ2K4U","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":"08d3e9fdba98b2a21c842d298a36493440cd4d67a7200f60d27b29d58a60697f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-31T11:00:33Z","title_canon_sha256":"bc552cee834721672b5c7c4f7c79bdfe2c750c7f228c8fcb107bbf74a25c38b8"},"schema_version":"1.0","source":{"id":"1506.00215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00215","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00215v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00215","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"VV4RMKV37YOQ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VV4RMKV37YOQV7VI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VV4RMKV3","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:6c982d54f56e4e2860c347f852ad50137d32bc65124812e2765e6333c91026f0","target":"graph","created_at":"2026-05-18T01:59:55Z","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":"Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\\Gamma(n,k)_{q}$ the restriction of $\\Gamma_{k}(V)$ to the set of all non-degenerate linear $[n,k]_{q}$ codes. We show that for any two codes the distance in $\\Gamma(n,k)_{q}$ coincides with the distance in $\\Gamma_{k}(V)$ only in the case when $n<(q+1)^2+k-2$, i.e. if $n$ is sufficiently large then for some pairs of codes the distances in the graphs $\\Gamma_{k}(V)$ and $\\Gamma(n,k)_{q}$ are ","authors_text":"Mariusz Kwiatkowski, Mark Pankov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-31T11:00:33Z","title":"On the distance between linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00215","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:9b0212b535b9e55dda76346a6e27d1d5941e66f5f1102fd38066cf2f749a00f5","target":"record","created_at":"2026-05-18T01:59:55Z","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":"08d3e9fdba98b2a21c842d298a36493440cd4d67a7200f60d27b29d58a60697f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-31T11:00:33Z","title_canon_sha256":"bc552cee834721672b5c7c4f7c79bdfe2c750c7f228c8fcb107bbf74a25c38b8"},"schema_version":"1.0","source":{"id":"1506.00215","kind":"arxiv","version":1}},"canonical_sha256":"ad79162abbfe1d0afea8ac73a6e74ae51c7e7a05aa25b4c699d457b9e54ea3bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad79162abbfe1d0afea8ac73a6e74ae51c7e7a05aa25b4c699d457b9e54ea3bf","first_computed_at":"2026-05-18T01:59:55.175542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.175542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XvXJkqHSRAC28qoN5AZbTBHgXiGJSCGul6QmlkZeQVeW7yG2Ky/it0/VKDfzzlN1PCrq4sjat0j8bU/e2VxOBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.176004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b0212b535b9e55dda76346a6e27d1d5941e66f5f1102fd38066cf2f749a00f5","sha256:6c982d54f56e4e2860c347f852ad50137d32bc65124812e2765e6333c91026f0"],"state_sha256":"ca6cd7914124a86a902f2ced818b7037e63c6541c68bd2d61eb3ea119e5c2e2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XV33rT+1/0SlRjo+i2V+t/5MNwBRP7vHvjfhibj52XdeOqgxrdaAYPHUQygdnR/I5dHRM2waMb2dA+GV+1qBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:05:35.041098Z","bundle_sha256":"6395366e546ddfd936c015b607e2b74d2d879f6d1de24ef38316b2ba5cfdd802"}}