{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XH2GEZ3YQMJHKQG5UYSS7LF35V","short_pith_number":"pith:XH2GEZ3Y","canonical_record":{"source":{"id":"1607.01605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T13:11:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3d76975d31536f39cd758c398de30b594000aa4e4f98f5e5e628e02dd0c05a01","abstract_canon_sha256":"e20f1bb1625255b9cd87cf80aa60eac1e5c2e3fa55e56a3af82ca93ce2dc562c"},"schema_version":"1.0"},"canonical_sha256":"b9f462677883127540dda6252facbbed4b17cfd405454a466b9139eee080ecda","source":{"kind":"arxiv","id":"1607.01605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01605","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01605v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01605","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"XH2GEZ3YQMJH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XH2GEZ3YQMJHKQG5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XH2GEZ3Y","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XH2GEZ3YQMJHKQG5UYSS7LF35V","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T13:11:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3d76975d31536f39cd758c398de30b594000aa4e4f98f5e5e628e02dd0c05a01","abstract_canon_sha256":"e20f1bb1625255b9cd87cf80aa60eac1e5c2e3fa55e56a3af82ca93ce2dc562c"},"schema_version":"1.0"},"canonical_sha256":"b9f462677883127540dda6252facbbed4b17cfd405454a466b9139eee080ecda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.835404Z","signature_b64":"CsBlTlOKMPzUlXsfKKWaoP1eiM9H3qRaBI52B7EITB4Dk5URnrzC4lkerowaxjLKKxxGuHcAWhVR3AaD/oykAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f462677883127540dda6252facbbed4b17cfd405454a466b9139eee080ecda","last_reissued_at":"2026-05-18T01:11:25.834943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.834943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01605","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rCP7INnetvodU4LCBtWn/FK55ZTIfa1alIj56k0TnFeIFIM68xJAO/3iKZbcXwCUkeITi6mnSvQCWMBqVrpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:38:21.649174Z"},"content_sha256":"b263df93dff3d61602b69305ea55b145ec036e434ae7e5719d75ed736c638afa","schema_version":"1.0","event_id":"sha256:b263df93dff3d61602b69305ea55b145ec036e434ae7e5719d75ed736c638afa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XH2GEZ3YQMJHKQG5UYSS7LF35V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The chromatic number of the square of the 8-cube","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":"2016-07-06T13:11:13Z","abstract_excerpt":"A cube-like graph is a Cayley graph for the elementary abelian group of order $2^n$. In studies of the chromatic number of cube-like graphs, the $k$th power of the $n$-dimensional hypercube, $Q_n^k$, is frequently considered. This coloring problem can be considered in the framework of coding theory, as the graph $Q_n^k$ can be constructed with one vertex for each binary word of length $n$ and edges between vertices exactly when the Hamming distance between the corresponding words is at most $k$. Consequently, a proper coloring of $Q_n^k$ corresponds to a partition of the $n$-dimensional binary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01605","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kfjZ6TcHSO+Xx5zIAGoN8pWDHZ/LbJli58BW6ONZxI6FASLhelEGDsfW3GA5facH+MSOsZVvKvh+vZZ3QtdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:38:21.649531Z"},"content_sha256":"e4c92161a5659bdd64e0a6e3537883ff013416d5548ee33b97e9c9239bbc196b","schema_version":"1.0","event_id":"sha256:e4c92161a5659bdd64e0a6e3537883ff013416d5548ee33b97e9c9239bbc196b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/bundle.json","state_url":"https://pith.science/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/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-20T18:38:21Z","links":{"resolver":"https://pith.science/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V","bundle":"https://pith.science/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/bundle.json","state":"https://pith.science/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XH2GEZ3YQMJHKQG5UYSS7LF35V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XH2GEZ3YQMJHKQG5UYSS7LF35V","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":"e20f1bb1625255b9cd87cf80aa60eac1e5c2e3fa55e56a3af82ca93ce2dc562c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T13:11:13Z","title_canon_sha256":"3d76975d31536f39cd758c398de30b594000aa4e4f98f5e5e628e02dd0c05a01"},"schema_version":"1.0","source":{"id":"1607.01605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01605","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01605v1","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01605","created_at":"2026-05-18T01:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"XH2GEZ3YQMJH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XH2GEZ3YQMJHKQG5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XH2GEZ3Y","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:e4c92161a5659bdd64e0a6e3537883ff013416d5548ee33b97e9c9239bbc196b","target":"graph","created_at":"2026-05-18T01:11:25Z","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":"A cube-like graph is a Cayley graph for the elementary abelian group of order $2^n$. In studies of the chromatic number of cube-like graphs, the $k$th power of the $n$-dimensional hypercube, $Q_n^k$, is frequently considered. This coloring problem can be considered in the framework of coding theory, as the graph $Q_n^k$ can be constructed with one vertex for each binary word of length $n$ and edges between vertices exactly when the Hamming distance between the corresponding words is at most $k$. Consequently, a proper coloring of $Q_n^k$ corresponds to a partition of the $n$-dimensional binary","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":"2016-07-06T13:11:13Z","title":"The chromatic number of the square of the 8-cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01605","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:b263df93dff3d61602b69305ea55b145ec036e434ae7e5719d75ed736c638afa","target":"record","created_at":"2026-05-18T01:11:25Z","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":"e20f1bb1625255b9cd87cf80aa60eac1e5c2e3fa55e56a3af82ca93ce2dc562c","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T13:11:13Z","title_canon_sha256":"3d76975d31536f39cd758c398de30b594000aa4e4f98f5e5e628e02dd0c05a01"},"schema_version":"1.0","source":{"id":"1607.01605","kind":"arxiv","version":1}},"canonical_sha256":"b9f462677883127540dda6252facbbed4b17cfd405454a466b9139eee080ecda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9f462677883127540dda6252facbbed4b17cfd405454a466b9139eee080ecda","first_computed_at":"2026-05-18T01:11:25.834943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:25.834943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsBlTlOKMPzUlXsfKKWaoP1eiM9H3qRaBI52B7EITB4Dk5URnrzC4lkerowaxjLKKxxGuHcAWhVR3AaD/oykAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:25.835404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b263df93dff3d61602b69305ea55b145ec036e434ae7e5719d75ed736c638afa","sha256:e4c92161a5659bdd64e0a6e3537883ff013416d5548ee33b97e9c9239bbc196b"],"state_sha256":"2dc260296fc838fc7dff739c360bdddccc5c9420d7c228de998a53779fcc4b83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrahzpgbcbZSL1tBExXqRSvtM/xA2DQI+sGj3GRCJpoT2iJDA7YU1/pD9UbFvwySxsLoKylHnrkOTky3PRltAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:38:21.651462Z","bundle_sha256":"ff0ee993a63eaa69d8415e74a75153f9f4bb76193dbda46166cb51eb43223c65"}}