{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VMWIMC5IS3VWSGM2MAIZINN4KC","short_pith_number":"pith:VMWIMC5I","canonical_record":{"source":{"id":"2502.15019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T20:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"b40d9cec445033e38b7c19b942cad83b686f685d9bfb19d36ca2fc1db20e6702","abstract_canon_sha256":"d39a4cfb68c014ea21b09f35a3caeb91d66b13cfa3ea0fb8767ccff9b5d311cc"},"schema_version":"1.0"},"canonical_sha256":"ab2c860ba896eb69199a60119435bc50924cd30c10eeaa3cb4ff853f94b67308","source":{"kind":"arxiv","id":"2502.15019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.15019","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.15019v1","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15019","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"VMWIMC5IS3VW","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_16","alias_value":"VMWIMC5IS3VWSGM2","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_8","alias_value":"VMWIMC5I","created_at":"2026-07-05T11:21:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VMWIMC5IS3VWSGM2MAIZINN4KC","target":"record","payload":{"canonical_record":{"source":{"id":"2502.15019","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T20:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"b40d9cec445033e38b7c19b942cad83b686f685d9bfb19d36ca2fc1db20e6702","abstract_canon_sha256":"d39a4cfb68c014ea21b09f35a3caeb91d66b13cfa3ea0fb8767ccff9b5d311cc"},"schema_version":"1.0"},"canonical_sha256":"ab2c860ba896eb69199a60119435bc50924cd30c10eeaa3cb4ff853f94b67308","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:42.862243Z","signature_b64":"7PTCa0+CvRsA7k+bbO8b6FU3cAcEKroeEn28QT73zEAIIH5CweuFTJx6r5AOgi0SxnLNKuxIYJ2+bVJ1OPiHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2c860ba896eb69199a60119435bc50924cd30c10eeaa3cb4ff853f94b67308","last_reissued_at":"2026-07-05T11:21:42.861665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:42.861665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.15019","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-07-05T11:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gm0mFJJTnxPTrnsrCVAsXvSmahCWYMrpFfef4ywdFtR4x+HP6SA87VN5IMDovQjUUYNW2owguqOgkbCq1y3uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:10:24.129833Z"},"content_sha256":"caaee0c14aca59e72f679b3fb0fc384e1654fd420745bf5582f109c78236b4f2","schema_version":"1.0","event_id":"sha256:caaee0c14aca59e72f679b3fb0fc384e1654fd420745bf5582f109c78236b4f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VMWIMC5IS3VWSGM2MAIZINN4KC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the clique covering numbers of Johnson graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"S{\\o}ren Fuglede J{\\o}rgensen","submitted_at":"2025-02-20T20:14:31Z","abstract_excerpt":"We initiate a study of the vertex clique covering numbers of Johnson graphs $J(N, k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs.\n  We prove identities for the values of these numbers when $k \\leq 3$, and $k \\geq N - 3$, and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of $J(2k, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15019","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.15019/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"},"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-07-05T11:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqo2Uum4/ouh4s0S31dlWtcK1vMXvVFZnnXVNvPSGYbSuaBvjEsSjIskJeLXVV9GgUYEC9Wy3eHODuEeSri7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:10:24.130335Z"},"content_sha256":"16a9db4970cac50014d2586a048c6a6549ac939f10db1f2b8f65dbf65630a789","schema_version":"1.0","event_id":"sha256:16a9db4970cac50014d2586a048c6a6549ac939f10db1f2b8f65dbf65630a789"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/bundle.json","state_url":"https://pith.science/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/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-08-08T04:10:24Z","links":{"resolver":"https://pith.science/pith/VMWIMC5IS3VWSGM2MAIZINN4KC","bundle":"https://pith.science/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/bundle.json","state":"https://pith.science/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMWIMC5IS3VWSGM2MAIZINN4KC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VMWIMC5IS3VWSGM2MAIZINN4KC","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":"d39a4cfb68c014ea21b09f35a3caeb91d66b13cfa3ea0fb8767ccff9b5d311cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T20:14:31Z","title_canon_sha256":"b40d9cec445033e38b7c19b942cad83b686f685d9bfb19d36ca2fc1db20e6702"},"schema_version":"1.0","source":{"id":"2502.15019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.15019","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.15019v1","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15019","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"VMWIMC5IS3VW","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_16","alias_value":"VMWIMC5IS3VWSGM2","created_at":"2026-07-05T11:21:42Z"},{"alias_kind":"pith_short_8","alias_value":"VMWIMC5I","created_at":"2026-07-05T11:21:42Z"}],"graph_snapshots":[{"event_id":"sha256:16a9db4970cac50014d2586a048c6a6549ac939f10db1f2b8f65dbf65630a789","target":"graph","created_at":"2026-07-05T11:21:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.15019/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We initiate a study of the vertex clique covering numbers of Johnson graphs $J(N, k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs.\n  We prove identities for the values of these numbers when $k \\leq 3$, and $k \\geq N - 3$, and using computational methods, we provide explicit values for a range of small graphs. By drawing on connections to coding theory and combinatorial design theory, we prove various bounds on the clique covering numbers for general Johnson graphs, and we show how constant-weight lexicodes can be utilized to create optimal covers of $J(2k, ","authors_text":"S{\\o}ren Fuglede J{\\o}rgensen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T20:14:31Z","title":"On the clique covering numbers of Johnson graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15019","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:caaee0c14aca59e72f679b3fb0fc384e1654fd420745bf5582f109c78236b4f2","target":"record","created_at":"2026-07-05T11:21:42Z","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":"d39a4cfb68c014ea21b09f35a3caeb91d66b13cfa3ea0fb8767ccff9b5d311cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-20T20:14:31Z","title_canon_sha256":"b40d9cec445033e38b7c19b942cad83b686f685d9bfb19d36ca2fc1db20e6702"},"schema_version":"1.0","source":{"id":"2502.15019","kind":"arxiv","version":1}},"canonical_sha256":"ab2c860ba896eb69199a60119435bc50924cd30c10eeaa3cb4ff853f94b67308","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab2c860ba896eb69199a60119435bc50924cd30c10eeaa3cb4ff853f94b67308","first_computed_at":"2026-07-05T11:21:42.861665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:42.861665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7PTCa0+CvRsA7k+bbO8b6FU3cAcEKroeEn28QT73zEAIIH5CweuFTJx6r5AOgi0SxnLNKuxIYJ2+bVJ1OPiHDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:42.862243Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.15019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caaee0c14aca59e72f679b3fb0fc384e1654fd420745bf5582f109c78236b4f2","sha256:16a9db4970cac50014d2586a048c6a6549ac939f10db1f2b8f65dbf65630a789"],"state_sha256":"d2b49f27d3f6e8a29b7132702f98b8748fefd76c066075271f4e2ac9aa1ea736"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FlGZEYzzmWmlwKOKwtlDR+N7xuJ8nbRgly8JsXtkjuJAzkVwbqQnvfrWxG9yi9hGwWfMJPZnBu80Q2PBFBjhDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:10:24.134551Z","bundle_sha256":"9b35dec897e8e95d13b692b5e239ccb264343ff463294ecadaa5bd99f7afad74"}}