{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6YEMQ3QAK6ST7PGYJQS2QU44XD","short_pith_number":"pith:6YEMQ3QA","canonical_record":{"source":{"id":"1708.09571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T05:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"8d8e2f72150e2d810a4f18e847606edddfc2d7a230d78b567ac6e4597fbd604d","abstract_canon_sha256":"93460f584ed65f32ff09b8a1c592499e22fc5532188d673e7025a49d5b1258ed"},"schema_version":"1.0"},"canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","source":{"kind":"arxiv","id":"1708.09571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09571","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09571v1","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09571","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"6YEMQ3QAK6ST","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YEMQ3QAK6ST7PGY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YEMQ3QA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6YEMQ3QAK6ST7PGYJQS2QU44XD","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T05:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"8d8e2f72150e2d810a4f18e847606edddfc2d7a230d78b567ac6e4597fbd604d","abstract_canon_sha256":"93460f584ed65f32ff09b8a1c592499e22fc5532188d673e7025a49d5b1258ed"},"schema_version":"1.0"},"canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:16.118679Z","signature_b64":"1sns2qmO5vZuXimzohBYbJEz6SQsFYFbmUGD52pF7z0kOhF6K/w4BBnxsA+6BQ3sxCCQsY+zwg6tZrp7GsCmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","last_reissued_at":"2026-05-18T00:36:16.117879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:16.117879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09571","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-18T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WGSrN4xenMFAhB8K+fn+RU15UfMCPmotAY8voj2A40hGWumolKVDGQeOYzZxMxQQ3Mjow2BlYJuZ0a78IqvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:23:04.646425Z"},"content_sha256":"9b0e59a9500ddda1106587c0e402fa424421e877bf1f38eae423e141e8de6b43","schema_version":"1.0","event_id":"sha256:9b0e59a9500ddda1106587c0e402fa424421e877bf1f38eae423e141e8de6b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6YEMQ3QAK6ST7PGYJQS2QU44XD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anagram-free colourings of graph subdivisions","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":"2017-08-31T05:58:08Z","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$. A vertex colouring of a graph is anagram-free if no subpath of the graph is an anagram. Anagram-free graph colouring was independently introduced by Kam\\v{c}ev, {\\L}uczak and Sudakov and ourselves. In this paper we introduce the study of anagram-free colourings of graph subdivisions. We show that every graph has an anagram-free $8$-colourable subdivision. The number of division vertices per edge is exponential in the number of edges. For trees, we construct anagram-free $10$-colourable subdivis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09571","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-18T00:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlB/wzWIM2hNbT1Cmdo36j2RlC++roRFpIm3ne+OLpU/ZyEuO3BbYxaQSru5QRmxViqmBWdwgARhNGy5cA4lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:23:04.646775Z"},"content_sha256":"34f43a7750e99fd124b5188a1ee88c86fd1c48f39ce440b24b56973950f8a106","schema_version":"1.0","event_id":"sha256:34f43a7750e99fd124b5188a1ee88c86fd1c48f39ce440b24b56973950f8a106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/bundle.json","state_url":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/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-01T15:23:04Z","links":{"resolver":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD","bundle":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/bundle.json","state":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6YEMQ3QAK6ST7PGYJQS2QU44XD","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":"93460f584ed65f32ff09b8a1c592499e22fc5532188d673e7025a49d5b1258ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T05:58:08Z","title_canon_sha256":"8d8e2f72150e2d810a4f18e847606edddfc2d7a230d78b567ac6e4597fbd604d"},"schema_version":"1.0","source":{"id":"1708.09571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09571","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09571v1","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09571","created_at":"2026-05-18T00:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"6YEMQ3QAK6ST","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6YEMQ3QAK6ST7PGY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6YEMQ3QA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:34f43a7750e99fd124b5188a1ee88c86fd1c48f39ce440b24b56973950f8a106","target":"graph","created_at":"2026-05-18T00:36:16Z","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$. A vertex colouring of a graph is anagram-free if no subpath of the graph is an anagram. Anagram-free graph colouring was independently introduced by Kam\\v{c}ev, {\\L}uczak and Sudakov and ourselves. In this paper we introduce the study of anagram-free colourings of graph subdivisions. We show that every graph has an anagram-free $8$-colourable subdivision. The number of division vertices per edge is exponential in the number of edges. For trees, we construct anagram-free $10$-colourable subdivis","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":"2017-08-31T05:58:08Z","title":"Anagram-free colourings of graph subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09571","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:9b0e59a9500ddda1106587c0e402fa424421e877bf1f38eae423e141e8de6b43","target":"record","created_at":"2026-05-18T00:36:16Z","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":"93460f584ed65f32ff09b8a1c592499e22fc5532188d673e7025a49d5b1258ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T05:58:08Z","title_canon_sha256":"8d8e2f72150e2d810a4f18e847606edddfc2d7a230d78b567ac6e4597fbd604d"},"schema_version":"1.0","source":{"id":"1708.09571","kind":"arxiv","version":1}},"canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","first_computed_at":"2026-05-18T00:36:16.117879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:16.117879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1sns2qmO5vZuXimzohBYbJEz6SQsFYFbmUGD52pF7z0kOhF6K/w4BBnxsA+6BQ3sxCCQsY+zwg6tZrp7GsCmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:16.118679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b0e59a9500ddda1106587c0e402fa424421e877bf1f38eae423e141e8de6b43","sha256:34f43a7750e99fd124b5188a1ee88c86fd1c48f39ce440b24b56973950f8a106"],"state_sha256":"1823f379cc0a63b53fff4b4427635ea0ea23ffb64e8605e8e9a4f21efa5bec88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emJEuATEg+ZF92eR5Ivx+UjqLM1HFIXrE6X7C0L1NffSY3ScrgPgM0wQK3cHb+3y57h3M5FkkN6TDbGs7gJhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:23:04.648685Z","bundle_sha256":"0c0dd07f1abc3eb60945192a6fa2d12f0178ebe6d906a51f919f126a5e469578"}}