{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DLZHMHXYVJGUUYXSXNU2IYIVRR","short_pith_number":"pith:DLZHMHXY","canonical_record":{"source":{"id":"1607.01117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T05:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"2b6bde41479051f033b449c026db86130147ee2dff3dbb930a08aa1bf5ca2045","abstract_canon_sha256":"8416328a3925f36f57f54ce6032aa48e7de47c8e1619e681e5e3b581d12c57bc"},"schema_version":"1.0"},"canonical_sha256":"1af2761ef8aa4d4a62f2bb69a461158c63c052fe6e6d1367e84cda9cc067b5ee","source":{"kind":"arxiv","id":"1607.01117","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01117","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01117v2","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01117","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"DLZHMHXYVJGU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLZHMHXYVJGUUYXS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLZHMHXY","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DLZHMHXYVJGUUYXSXNU2IYIVRR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T05:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"2b6bde41479051f033b449c026db86130147ee2dff3dbb930a08aa1bf5ca2045","abstract_canon_sha256":"8416328a3925f36f57f54ce6032aa48e7de47c8e1619e681e5e3b581d12c57bc"},"schema_version":"1.0"},"canonical_sha256":"1af2761ef8aa4d4a62f2bb69a461158c63c052fe6e6d1367e84cda9cc067b5ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.050462Z","signature_b64":"beENCxPaOHxjMuoNAc3DXAmj3qyffVRo0kQ2dos58JfjaHTg19i15ZGa+XgFefITNQRc6gW3EVx+YPg6576XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af2761ef8aa4d4a62f2bb69a461158c63c052fe6e6d1367e84cda9cc067b5ee","last_reissued_at":"2026-05-17T23:40:50.049608Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.049608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01117","source_version":2,"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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBIq5Kg1QViBM9aC5HzTm239BpWVDQT2/8nmbuZWocKHzRJ8BUiJmFmFXgVUSEzjyLMvZAYi4d/B2GY9kcNZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:50:09.287683Z"},"content_sha256":"cab96cf4f460466d78f54f8f91228fb9d31d5e529ce72f3681aab2f3c794a3b4","schema_version":"1.0","event_id":"sha256:cab96cf4f460466d78f54f8f91228fb9d31d5e529ce72f3681aab2f3c794a3b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DLZHMHXYVJGUUYXSXNU2IYIVRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anagram-free Graph Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Tim E. Wilson","submitted_at":"2016-07-05T05:35:52Z","abstract_excerpt":"An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al. (2002) asked whether anagram-free chromatic number is bounded by a function of the maximum degree. We answer this question in the negative by constructing graphs with maximum degree 3 and unbounded anagram-free chromatic number. We also prove upper and lower bounds on the anagram-free chromatic number of trees in terms of their radius and pathwidth. Finally, we explore extensions to edge colouring and $k$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01117","kind":"arxiv","version":2},"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-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jM91YjvqPSArWkNCVouqxczMZdigYuJY8concEsVHtqxwdw7ngVpQAKsPrcTxih56L+d1DATVjHHpG2M4MMbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:50:09.288029Z"},"content_sha256":"3b9263f10d515196b65f86d3d461c7eab04ea3c3f32501b2b3233f662c1070a9","schema_version":"1.0","event_id":"sha256:3b9263f10d515196b65f86d3d461c7eab04ea3c3f32501b2b3233f662c1070a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/bundle.json","state_url":"https://pith.science/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/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-07-01T13:50:09Z","links":{"resolver":"https://pith.science/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR","bundle":"https://pith.science/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/bundle.json","state":"https://pith.science/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLZHMHXYVJGUUYXSXNU2IYIVRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DLZHMHXYVJGUUYXSXNU2IYIVRR","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":"8416328a3925f36f57f54ce6032aa48e7de47c8e1619e681e5e3b581d12c57bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T05:35:52Z","title_canon_sha256":"2b6bde41479051f033b449c026db86130147ee2dff3dbb930a08aa1bf5ca2045"},"schema_version":"1.0","source":{"id":"1607.01117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01117","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01117v2","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01117","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"DLZHMHXYVJGU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DLZHMHXYVJGUUYXS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DLZHMHXY","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3b9263f10d515196b65f86d3d461c7eab04ea3c3f32501b2b3233f662c1070a9","target":"graph","created_at":"2026-05-17T23:40:50Z","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":"An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al. (2002) asked whether anagram-free chromatic number is bounded by a function of the maximum degree. We answer this question in the negative by constructing graphs with maximum degree 3 and unbounded anagram-free chromatic number. We also prove upper and lower bounds on the anagram-free chromatic number of trees in terms of their radius and pathwidth. Finally, we explore extensions to edge colouring and $k$","authors_text":"David R. Wood, Tim E. Wilson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T05:35:52Z","title":"Anagram-free Graph Colouring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01117","kind":"arxiv","version":2},"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:cab96cf4f460466d78f54f8f91228fb9d31d5e529ce72f3681aab2f3c794a3b4","target":"record","created_at":"2026-05-17T23:40:50Z","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":"8416328a3925f36f57f54ce6032aa48e7de47c8e1619e681e5e3b581d12c57bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-05T05:35:52Z","title_canon_sha256":"2b6bde41479051f033b449c026db86130147ee2dff3dbb930a08aa1bf5ca2045"},"schema_version":"1.0","source":{"id":"1607.01117","kind":"arxiv","version":2}},"canonical_sha256":"1af2761ef8aa4d4a62f2bb69a461158c63c052fe6e6d1367e84cda9cc067b5ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1af2761ef8aa4d4a62f2bb69a461158c63c052fe6e6d1367e84cda9cc067b5ee","first_computed_at":"2026-05-17T23:40:50.049608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:50.049608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"beENCxPaOHxjMuoNAc3DXAmj3qyffVRo0kQ2dos58JfjaHTg19i15ZGa+XgFefITNQRc6gW3EVx+YPg6576XDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:50.050462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab96cf4f460466d78f54f8f91228fb9d31d5e529ce72f3681aab2f3c794a3b4","sha256:3b9263f10d515196b65f86d3d461c7eab04ea3c3f32501b2b3233f662c1070a9"],"state_sha256":"742b01d4949d8c2c77a8aa753ca523beeb725fd35c888790285778cf27399165"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOc2rekN/u5cv1amviUO27gpAY0GcQvAmvk/zd9xg3pCajmgsZQRFmqE6kOK7bqR1COqF1DSClSXoWIes2TwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T13:50:09.290046Z","bundle_sha256":"39a2a9b700b80b07a2af0a8450b291186ee0f932b2d55f66d75a162638a84d38"}}