{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SEDXARMXCG3MUSRJUQI37XILAN","short_pith_number":"pith:SEDXARMX","schema_version":"1.0","canonical_sha256":"910770459711b6ca4a29a411bfdd0b034242f17ad8d0542114f39985889f4e65","source":{"kind":"arxiv","id":"1802.01646","version":2},"attestation_state":"computed","paper":{"title":"Anagram-Free Chromatic Number is not Pathwidth-Bounded","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pat Morin, Paz Carmi, Vida Dujmovi\\'c","submitted_at":"2018-02-05T20:39:51Z","abstract_excerpt":"The anagram-free chromatic number is a new graph parameter introduced independently Kam\\v{c}ev, {\\L}uczak, and Sudakov (2017) and Wilson and Wood (2017). In this note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe $2n$-vertex planar graphs of pathwidth 3 with anagram-free chromatic number $\\Omega(\\log n)$. We also describe $kn$ vertex graphs with pathwidth $2k-1$ having anagram-free chromatic number in $\\Omega(k\\log n)$."},"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":"1802.01646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-05T20:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"3e63fb8821f84b9518c74d318dedd63dc27557506f22cf3c8d0fb4e9e1583e60","abstract_canon_sha256":"a5028e8b8cd22b9b61e44f3dc37c0ab9c79934e2c0fa3396e4ca87861d69a521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.023954Z","signature_b64":"hcnU/CntutH8bP5xDLw5sy0vB9wpMFGVsHslZRU6PRuMqh+ha+06NUHm3+gke9D21NrXBREzyeKPgmm87jg7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910770459711b6ca4a29a411bfdd0b034242f17ad8d0542114f39985889f4e65","last_reissued_at":"2026-05-18T00:22:33.023444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.023444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anagram-Free Chromatic Number is not Pathwidth-Bounded","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pat Morin, Paz Carmi, Vida Dujmovi\\'c","submitted_at":"2018-02-05T20:39:51Z","abstract_excerpt":"The anagram-free chromatic number is a new graph parameter introduced independently Kam\\v{c}ev, {\\L}uczak, and Sudakov (2017) and Wilson and Wood (2017). In this note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe $2n$-vertex planar graphs of pathwidth 3 with anagram-free chromatic number $\\Omega(\\log n)$. We also describe $kn$ vertex graphs with pathwidth $2k-1$ having anagram-free chromatic number in $\\Omega(k\\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01646","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01646","created_at":"2026-05-18T00:22:33.023517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01646v2","created_at":"2026-05-18T00:22:33.023517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01646","created_at":"2026-05-18T00:22:33.023517+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEDXARMXCG3M","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEDXARMXCG3MUSRJ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEDXARMX","created_at":"2026-05-18T12:32:53.628368+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/SEDXARMXCG3MUSRJUQI37XILAN","json":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN.json","graph_json":"https://pith.science/api/pith-number/SEDXARMXCG3MUSRJUQI37XILAN/graph.json","events_json":"https://pith.science/api/pith-number/SEDXARMXCG3MUSRJUQI37XILAN/events.json","paper":"https://pith.science/paper/SEDXARMX"},"agent_actions":{"view_html":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN","download_json":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN.json","view_paper":"https://pith.science/paper/SEDXARMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01646&json=true","fetch_graph":"https://pith.science/api/pith-number/SEDXARMXCG3MUSRJUQI37XILAN/graph.json","fetch_events":"https://pith.science/api/pith-number/SEDXARMXCG3MUSRJUQI37XILAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN/action/storage_attestation","attest_author":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN/action/author_attestation","sign_citation":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN/action/citation_signature","submit_replication":"https://pith.science/pith/SEDXARMXCG3MUSRJUQI37XILAN/action/replication_record"}},"created_at":"2026-05-18T00:22:33.023517+00:00","updated_at":"2026-05-18T00:22:33.023517+00:00"}