{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:34T43ZMLOGD2KXDV4AP46O6MPL","short_pith_number":"pith:34T43ZML","canonical_record":{"source":{"id":"1509.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-23T10:24:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dda1781b1aeaf3505fe6e3d00226266a504a2e7b92aad6c4d009976c256e1a37","abstract_canon_sha256":"e2d0294a556f462b2f3d39469688622c1a62a2a645e3be570ca5166040f39519"},"schema_version":"1.0"},"canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","source":{"kind":"arxiv","id":"1509.06913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06913","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06913v1","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06913","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"34T43ZMLOGD2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34T43ZMLOGD2KXDV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34T43ZML","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:34T43ZMLOGD2KXDV4AP46O6MPL","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-23T10:24:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dda1781b1aeaf3505fe6e3d00226266a504a2e7b92aad6c4d009976c256e1a37","abstract_canon_sha256":"e2d0294a556f462b2f3d39469688622c1a62a2a645e3be570ca5166040f39519"},"schema_version":"1.0"},"canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:17.538748Z","signature_b64":"gv4CKT/cA4R7LmjhPUFzK4tyXujHGa0J3koQM1QL5VxezkNP/QEaoLbNpZXc36BQ/oxPy1z/05sZvpSuBRAjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","last_reissued_at":"2026-05-18T01:32:17.538042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:17.538042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06913","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:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yk+liSe7k/uGmbNAdW+H/Tq/dz5ROrPPQbMIOf75gjtnljnMiKxYXTlrgtz7Ji916O9Eus2ZeoeZZAGLGGgCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:57:11.522963Z"},"content_sha256":"6b7d65d29e38d093a6d2e38fe3a3ccda052bb9b39f53deb4ca6db5bee66e9990","schema_version":"1.0","event_id":"sha256:6b7d65d29e38d093a6d2e38fe3a3ccda052bb9b39f53deb4ca6db5bee66e9990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:34T43ZMLOGD2KXDV4AP46O6MPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A coloring of the square of the 8-cube with 13 colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2015-09-23T10:24:22Z","abstract_excerpt":"Let $\\chi_{\\bar{k}}(n)$ be the number of colors required to color the $n$-dimensional hypercube such that no two vertices with the same color are at a distance at most $k$. In other words, $\\chi_{\\bar{k}}(n)$ is the minimum number of binary codes with minimum distance at least $k+1$ required to partition the $n$-dimensional Hamming space. By giving an explicit coloring, it is shown that $\\chi_{\\bar{2}}(8)=13$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06913","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:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmdx8Eml71oYmIbHJ3eziqOCVN6iXngMRYE3eMWRpv38GlOo3t+G2G3tbWBs6+zjgc2V8QxJ6YvOOGNgh6ztDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:57:11.523311Z"},"content_sha256":"09303a909ec2f3f8fedf10d4bffbbf85b0e24fb213fa4493197bae951d913b3b","schema_version":"1.0","event_id":"sha256:09303a909ec2f3f8fedf10d4bffbbf85b0e24fb213fa4493197bae951d913b3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/bundle.json","state_url":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34T43ZMLOGD2KXDV4AP46O6MPL/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-06-20T20:57:11Z","links":{"resolver":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL","bundle":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/bundle.json","state":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34T43ZMLOGD2KXDV4AP46O6MPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:34T43ZMLOGD2KXDV4AP46O6MPL","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":"e2d0294a556f462b2f3d39469688622c1a62a2a645e3be570ca5166040f39519","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-23T10:24:22Z","title_canon_sha256":"dda1781b1aeaf3505fe6e3d00226266a504a2e7b92aad6c4d009976c256e1a37"},"schema_version":"1.0","source":{"id":"1509.06913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06913","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06913v1","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06913","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"34T43ZMLOGD2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"34T43ZMLOGD2KXDV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"34T43ZML","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:09303a909ec2f3f8fedf10d4bffbbf85b0e24fb213fa4493197bae951d913b3b","target":"graph","created_at":"2026-05-18T01:32:17Z","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 $\\chi_{\\bar{k}}(n)$ be the number of colors required to color the $n$-dimensional hypercube such that no two vertices with the same color are at a distance at most $k$. In other words, $\\chi_{\\bar{k}}(n)$ is the minimum number of binary codes with minimum distance at least $k+1$ required to partition the $n$-dimensional Hamming space. By giving an explicit coloring, it is shown that $\\chi_{\\bar{2}}(8)=13$.","authors_text":"Janne I. Kokkala, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-23T10:24:22Z","title":"A coloring of the square of the 8-cube with 13 colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06913","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:6b7d65d29e38d093a6d2e38fe3a3ccda052bb9b39f53deb4ca6db5bee66e9990","target":"record","created_at":"2026-05-18T01:32:17Z","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":"e2d0294a556f462b2f3d39469688622c1a62a2a645e3be570ca5166040f39519","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-23T10:24:22Z","title_canon_sha256":"dda1781b1aeaf3505fe6e3d00226266a504a2e7b92aad6c4d009976c256e1a37"},"schema_version":"1.0","source":{"id":"1509.06913","kind":"arxiv","version":1}},"canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","first_computed_at":"2026-05-18T01:32:17.538042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:17.538042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gv4CKT/cA4R7LmjhPUFzK4tyXujHGa0J3koQM1QL5VxezkNP/QEaoLbNpZXc36BQ/oxPy1z/05sZvpSuBRAjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:17.538748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b7d65d29e38d093a6d2e38fe3a3ccda052bb9b39f53deb4ca6db5bee66e9990","sha256:09303a909ec2f3f8fedf10d4bffbbf85b0e24fb213fa4493197bae951d913b3b"],"state_sha256":"dc5b9f92cf70ba70b640a5bedb20ba82e78f55f87a9c37c7f489868a015ca71d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1VVmzRutr4dM0wMoZ3CE1aEoeG6uMNxIAMHja4ciDAkbD9CNH4tvnBh1iBAYR+GW7/xS9gOoJ3KwO0PaxxADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:57:11.525240Z","bundle_sha256":"110ee02247448faf950b692b4c7a4af404a6cdb91823d01f19b86e572b3f92f8"}}