{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JNF5L5LE6ANZOP47VO7WVUYW7K","short_pith_number":"pith:JNF5L5LE","schema_version":"1.0","canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","source":{"kind":"arxiv","id":"1803.05396","version":3},"attestation_state":"computed","paper":{"title":"$H$-colouring $P_t$-free graphs in subexponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Scott, Carla Groenland, Karolina Okrasa, Paul Seymour, Pawel Rz\\k{a}\\.zewski, Sophie Spirkl","submitted_at":"2018-03-14T16:45:27Z","abstract_excerpt":"A graph is called $P_t$-free if it does not contain the path on $t$ vertices as an induced subgraph. Let $H$ be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the generating function for (list) graph homomorphisms from $G$ to $H$ can be calculated in subexponential time $2^{O\\left(\\sqrt{tn\\log(n)}\\right)}$ for $n=|V(G)|$ in the class of $P_t$-free graphs $G$. As a corollary, we show that the number of 3-colourings of a $P_t$-free graph $G$ can be found in subexponential time. On the other hand, no subexponential time algorithm exi"},"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":"1803.05396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-14T16:45:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"39919b235eb701e1a9b69efb54971e4d4d06b0750fcaa33844129e8e3edf192c","abstract_canon_sha256":"ed3309a183d2fb8703d8a11b75de59e9cbfe2f42e0c67f5ae509288395ce414a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.783397Z","signature_b64":"M3K90hLVVQVxogyigYkpGAFfjkAC+4bRChzRCxfYoAOJK+4U/sR6+Y8Db/mdZBdZTaLhekjb9o5U4g2mE0wwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","last_reissued_at":"2026-05-17T23:50:42.783004Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.783004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$H$-colouring $P_t$-free graphs in subexponential time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alex Scott, Carla Groenland, Karolina Okrasa, Paul Seymour, Pawel Rz\\k{a}\\.zewski, Sophie Spirkl","submitted_at":"2018-03-14T16:45:27Z","abstract_excerpt":"A graph is called $P_t$-free if it does not contain the path on $t$ vertices as an induced subgraph. Let $H$ be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the generating function for (list) graph homomorphisms from $G$ to $H$ can be calculated in subexponential time $2^{O\\left(\\sqrt{tn\\log(n)}\\right)}$ for $n=|V(G)|$ in the class of $P_t$-free graphs $G$. As a corollary, we show that the number of 3-colourings of a $P_t$-free graph $G$ can be found in subexponential time. On the other hand, no subexponential time algorithm exi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05396","kind":"arxiv","version":3},"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":"1803.05396","created_at":"2026-05-17T23:50:42.783067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05396v3","created_at":"2026-05-17T23:50:42.783067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05396","created_at":"2026-05-17T23:50:42.783067+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNF5L5LE6ANZ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNF5L5LE6ANZOP47","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNF5L5LE","created_at":"2026-05-18T12:32:31.084164+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/JNF5L5LE6ANZOP47VO7WVUYW7K","json":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K.json","graph_json":"https://pith.science/api/pith-number/JNF5L5LE6ANZOP47VO7WVUYW7K/graph.json","events_json":"https://pith.science/api/pith-number/JNF5L5LE6ANZOP47VO7WVUYW7K/events.json","paper":"https://pith.science/paper/JNF5L5LE"},"agent_actions":{"view_html":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K","download_json":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K.json","view_paper":"https://pith.science/paper/JNF5L5LE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05396&json=true","fetch_graph":"https://pith.science/api/pith-number/JNF5L5LE6ANZOP47VO7WVUYW7K/graph.json","fetch_events":"https://pith.science/api/pith-number/JNF5L5LE6ANZOP47VO7WVUYW7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/action/storage_attestation","attest_author":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/action/author_attestation","sign_citation":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/action/citation_signature","submit_replication":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/action/replication_record"}},"created_at":"2026-05-17T23:50:42.783067+00:00","updated_at":"2026-05-17T23:50:42.783067+00:00"}