{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6YEMQ3QAK6ST7PGYJQS2QU44XD","short_pith_number":"pith:6YEMQ3QA","schema_version":"1.0","canonical_sha256":"f608c86e0057a53fbcd84c25a8539cb8d5ed1324a12a16b325e919b1c2841367","source":{"kind":"arxiv","id":"1708.09571","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.09571","created_at":"2026-05-18T00:36:16.118007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09571v1","created_at":"2026-05-18T00:36:16.118007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09571","created_at":"2026-05-18T00:36:16.118007+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YEMQ3QAK6ST","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YEMQ3QAK6ST7PGY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YEMQ3QA","created_at":"2026-05-18T12:31:03.183658+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/6YEMQ3QAK6ST7PGYJQS2QU44XD","json":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD.json","graph_json":"https://pith.science/api/pith-number/6YEMQ3QAK6ST7PGYJQS2QU44XD/graph.json","events_json":"https://pith.science/api/pith-number/6YEMQ3QAK6ST7PGYJQS2QU44XD/events.json","paper":"https://pith.science/paper/6YEMQ3QA"},"agent_actions":{"view_html":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD","download_json":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD.json","view_paper":"https://pith.science/paper/6YEMQ3QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09571&json=true","fetch_graph":"https://pith.science/api/pith-number/6YEMQ3QAK6ST7PGYJQS2QU44XD/graph.json","fetch_events":"https://pith.science/api/pith-number/6YEMQ3QAK6ST7PGYJQS2QU44XD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/action/storage_attestation","attest_author":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/action/author_attestation","sign_citation":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/action/citation_signature","submit_replication":"https://pith.science/pith/6YEMQ3QAK6ST7PGYJQS2QU44XD/action/replication_record"}},"created_at":"2026-05-18T00:36:16.118007+00:00","updated_at":"2026-05-18T00:36:16.118007+00:00"}