{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:34T43ZMLOGD2KXDV4AP46O6MPL","short_pith_number":"pith:34T43ZML","schema_version":"1.0","canonical_sha256":"df27cde58b7187a55c75e01fcf3bcc7afc907eb39c8a672d1ae3c2c89ab0de85","source":{"kind":"arxiv","id":"1509.06913","version":1},"attestation_state":"computed","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$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.06913","created_at":"2026-05-18T01:32:17.538116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06913v1","created_at":"2026-05-18T01:32:17.538116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06913","created_at":"2026-05-18T01:32:17.538116+00:00"},{"alias_kind":"pith_short_12","alias_value":"34T43ZMLOGD2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"34T43ZMLOGD2KXDV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"34T43ZML","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL","json":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL.json","graph_json":"https://pith.science/api/pith-number/34T43ZMLOGD2KXDV4AP46O6MPL/graph.json","events_json":"https://pith.science/api/pith-number/34T43ZMLOGD2KXDV4AP46O6MPL/events.json","paper":"https://pith.science/paper/34T43ZML"},"agent_actions":{"view_html":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL","download_json":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL.json","view_paper":"https://pith.science/paper/34T43ZML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06913&json=true","fetch_graph":"https://pith.science/api/pith-number/34T43ZMLOGD2KXDV4AP46O6MPL/graph.json","fetch_events":"https://pith.science/api/pith-number/34T43ZMLOGD2KXDV4AP46O6MPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/action/storage_attestation","attest_author":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/action/author_attestation","sign_citation":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/action/citation_signature","submit_replication":"https://pith.science/pith/34T43ZMLOGD2KXDV4AP46O6MPL/action/replication_record"}},"created_at":"2026-05-18T01:32:17.538116+00:00","updated_at":"2026-05-18T01:32:17.538116+00:00"}