{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:23MURMBBTSVW4X2W7ORX63S5E6","short_pith_number":"pith:23MURMBB","canonical_record":{"source":{"id":"1712.10198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-29T12:12:19Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d23f64e97ff2e6eaf46b98d4cef6522ae5733815e2732f43bbd8fa45df3f9e53","abstract_canon_sha256":"1e3e9dc446a328d589afd0fb60d3ad6669950f34257266278cdf50434fb47495"},"schema_version":"1.0"},"canonical_sha256":"d6d948b0219cab6e5f56fba37f6e5d27997dc01ba5ece83fa56b0d22c71642ad","source":{"kind":"arxiv","id":"1712.10198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10198","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10198v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10198","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"23MURMBBTSVW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"23MURMBBTSVW4X2W","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"23MURMBB","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:23MURMBBTSVW4X2W7ORX63S5E6","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-29T12:12:19Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"d23f64e97ff2e6eaf46b98d4cef6522ae5733815e2732f43bbd8fa45df3f9e53","abstract_canon_sha256":"1e3e9dc446a328d589afd0fb60d3ad6669950f34257266278cdf50434fb47495"},"schema_version":"1.0"},"canonical_sha256":"d6d948b0219cab6e5f56fba37f6e5d27997dc01ba5ece83fa56b0d22c71642ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.725805Z","signature_b64":"u7or9ckf2SEpTrnXDSsd5qdT88Yfyaj4gKIYQc7+ov8j1syEzaTA+erMN1/f4680q4a4/dcH8wUTN9Cv4BiTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6d948b0219cab6e5f56fba37f6e5d27997dc01ba5ece83fa56b0d22c71642ad","last_reissued_at":"2026-05-18T00:27:03.725356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.725356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10198","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01j0SScIvJeuc+W7gRlj7fQVrPnTjkdsFAlcMh0vxRS3PqrraTtiszgKqXigW+2mE+N12oci4+2elYJS20GwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:19:25.692990Z"},"content_sha256":"c9f9ce16e62945204275899c44277519c5a88bd14d2753516705b70ef54ede4f","schema_version":"1.0","event_id":"sha256:c9f9ce16e62945204275899c44277519c5a88bd14d2753516705b70ef54ede4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:23MURMBBTSVW4X2W7ORX63S5E6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The graphs of projective codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.CO","authors_text":"Antonio Pasini, Mariusz Kwiatkowski, Mark Pankov","submitted_at":"2017-12-29T12:12:19Z","abstract_excerpt":"Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$ codes. In the case when $q\\ge \\binom{n}{2}$, we show that the graph $\\Pi(n,k)_q$ is connected, its diameter is equal to the diameter of the Grassmann graph and the distance between any two vertices coincides with the distance between these vertices in the Grassmann graph. Also, we give some observations concerning the graphs of simplex codes. For example, binary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10198","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9rMThDaDkRus2otaukAQnHuywtJMWrMdZeIie27ffRxloCPg1Mst2ysslMKeFbFb04LSOp8CAkQRHHNmKZcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:19:25.693355Z"},"content_sha256":"1bdb3427e34933cb5d0226bee4847bd3d5df3effebb56768426a188a2d177ac8","schema_version":"1.0","event_id":"sha256:1bdb3427e34933cb5d0226bee4847bd3d5df3effebb56768426a188a2d177ac8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23MURMBBTSVW4X2W7ORX63S5E6/bundle.json","state_url":"https://pith.science/pith/23MURMBBTSVW4X2W7ORX63S5E6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23MURMBBTSVW4X2W7ORX63S5E6/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-30T13:19:25Z","links":{"resolver":"https://pith.science/pith/23MURMBBTSVW4X2W7ORX63S5E6","bundle":"https://pith.science/pith/23MURMBBTSVW4X2W7ORX63S5E6/bundle.json","state":"https://pith.science/pith/23MURMBBTSVW4X2W7ORX63S5E6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23MURMBBTSVW4X2W7ORX63S5E6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:23MURMBBTSVW4X2W7ORX63S5E6","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":"1e3e9dc446a328d589afd0fb60d3ad6669950f34257266278cdf50434fb47495","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-29T12:12:19Z","title_canon_sha256":"d23f64e97ff2e6eaf46b98d4cef6522ae5733815e2732f43bbd8fa45df3f9e53"},"schema_version":"1.0","source":{"id":"1712.10198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10198","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10198v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10198","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"23MURMBBTSVW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"23MURMBBTSVW4X2W","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"23MURMBB","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:1bdb3427e34933cb5d0226bee4847bd3d5df3effebb56768426a188a2d177ac8","target":"graph","created_at":"2026-05-18T00:27:03Z","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":"Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$ codes. In the case when $q\\ge \\binom{n}{2}$, we show that the graph $\\Pi(n,k)_q$ is connected, its diameter is equal to the diameter of the Grassmann graph and the distance between any two vertices coincides with the distance between these vertices in the Grassmann graph. Also, we give some observations concerning the graphs of simplex codes. For example, binary ","authors_text":"Antonio Pasini, Mariusz Kwiatkowski, Mark Pankov","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-29T12:12:19Z","title":"The graphs of projective codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10198","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:c9f9ce16e62945204275899c44277519c5a88bd14d2753516705b70ef54ede4f","target":"record","created_at":"2026-05-18T00:27:03Z","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":"1e3e9dc446a328d589afd0fb60d3ad6669950f34257266278cdf50434fb47495","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-29T12:12:19Z","title_canon_sha256":"d23f64e97ff2e6eaf46b98d4cef6522ae5733815e2732f43bbd8fa45df3f9e53"},"schema_version":"1.0","source":{"id":"1712.10198","kind":"arxiv","version":1}},"canonical_sha256":"d6d948b0219cab6e5f56fba37f6e5d27997dc01ba5ece83fa56b0d22c71642ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6d948b0219cab6e5f56fba37f6e5d27997dc01ba5ece83fa56b0d22c71642ad","first_computed_at":"2026-05-18T00:27:03.725356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.725356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7or9ckf2SEpTrnXDSsd5qdT88Yfyaj4gKIYQc7+ov8j1syEzaTA+erMN1/f4680q4a4/dcH8wUTN9Cv4BiTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.725805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9f9ce16e62945204275899c44277519c5a88bd14d2753516705b70ef54ede4f","sha256:1bdb3427e34933cb5d0226bee4847bd3d5df3effebb56768426a188a2d177ac8"],"state_sha256":"4ee037a5b42839a3fdc5e537d2287425483d10c6b4aa65bbf4436d3ce2cd6aaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYjpyxh8zIFSaYc9Dfau2TWpDlG33JsjbOtD3vbdwQHk0wSOSXkW6lGykCsGaXlfOheqJRLB4chyi+z2OFxQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:19:25.695598Z","bundle_sha256":"f8b126e24b78d174607c6f8a77aca3808490c1bf54a19689e3aa2d0b1d2bb326"}}