{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5GZKACWTFQCGTWDAZNSJUJAARA","short_pith_number":"pith:5GZKACWT","schema_version":"1.0","canonical_sha256":"e9b2a00ad32c0469d860cb649a2400883b08763270786cf61d0dce370ce1e316","source":{"kind":"arxiv","id":"1702.01094","version":2},"attestation_state":"computed","paper":{"title":"Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2017-02-03T17:44:43Z","abstract_excerpt":"We prove that for all nonnegative integers k,s there exists c with the following property. Let G be a graph with clique number at most k and chromatic number more than c. Then for every vertex-colouring (not necessarily optimal) of G, some induced subgraph of G is an s-vertex path, and all its vertices have different colours. This extends a recent result of Gyarfas and Sarkozy, who proved the same (when k=2) for graphs G with girth at least five."},"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":"1702.01094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-03T17:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"61ef5c89f7c2e2858b4d77bc394d84975e09c7722c166c06a6b3424241ab996d","abstract_canon_sha256":"97766f3a0dee1e5f94a9c20371a9abdb0955d2a0eaec1a5c4235cf20270a084c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:07.429167Z","signature_b64":"rdLu47EirPzbAUChHKfRz++F7CfxWdDnJEOVRewsFxiRm/pw/POVXWxEgg/pFoGWEiwF84q0chODs/SDCtfRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9b2a00ad32c0469d860cb649a2400883b08763270786cf61d0dce370ce1e316","last_reissued_at":"2026-05-18T00:41:07.428653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:07.428653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2017-02-03T17:44:43Z","abstract_excerpt":"We prove that for all nonnegative integers k,s there exists c with the following property. Let G be a graph with clique number at most k and chromatic number more than c. Then for every vertex-colouring (not necessarily optimal) of G, some induced subgraph of G is an s-vertex path, and all its vertices have different colours. This extends a recent result of Gyarfas and Sarkozy, who proved the same (when k=2) for graphs G with girth at least five."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01094","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":"1702.01094","created_at":"2026-05-18T00:41:07.428740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01094v2","created_at":"2026-05-18T00:41:07.428740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01094","created_at":"2026-05-18T00:41:07.428740+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GZKACWTFQCG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GZKACWTFQCGTWDA","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GZKACWT","created_at":"2026-05-18T12:31:00.734936+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/5GZKACWTFQCGTWDAZNSJUJAARA","json":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA.json","graph_json":"https://pith.science/api/pith-number/5GZKACWTFQCGTWDAZNSJUJAARA/graph.json","events_json":"https://pith.science/api/pith-number/5GZKACWTFQCGTWDAZNSJUJAARA/events.json","paper":"https://pith.science/paper/5GZKACWT"},"agent_actions":{"view_html":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA","download_json":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA.json","view_paper":"https://pith.science/paper/5GZKACWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01094&json=true","fetch_graph":"https://pith.science/api/pith-number/5GZKACWTFQCGTWDAZNSJUJAARA/graph.json","fetch_events":"https://pith.science/api/pith-number/5GZKACWTFQCGTWDAZNSJUJAARA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA/action/storage_attestation","attest_author":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA/action/author_attestation","sign_citation":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA/action/citation_signature","submit_replication":"https://pith.science/pith/5GZKACWTFQCGTWDAZNSJUJAARA/action/replication_record"}},"created_at":"2026-05-18T00:41:07.428740+00:00","updated_at":"2026-05-18T00:41:07.428740+00:00"}