{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JNF5L5LE6ANZOP47VO7WVUYW7K","short_pith_number":"pith:JNF5L5LE","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"},"canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","source":{"kind":"arxiv","id":"1803.05396","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05396","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05396v3","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05396","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"JNF5L5LE6ANZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNF5L5LE6ANZOP47","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNF5L5LE","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JNF5L5LE6ANZOP47VO7WVUYW7K","target":"record","payload":{"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"},"canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","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"},"source_kind":"arxiv","source_id":"1803.05396","source_version":3,"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-17T23:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HA+4JkbI1ckn79uv6W8y8I/IcAkkAcVqi2GMPbLlc44wtHpc6ZXy48ocn4Khsf7V5nQAyaFijTjomcMJieOUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:13:46.319437Z"},"content_sha256":"37fbf09219b554f09ea4a7996ec3753ae0a41697e44f699dd9240e0654a7345f","schema_version":"1.0","event_id":"sha256:37fbf09219b554f09ea4a7996ec3753ae0a41697e44f699dd9240e0654a7345f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JNF5L5LE6ANZOP47VO7WVUYW7K","target":"graph","payload":{"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"},"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-17T23:50:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOGJ1gP5JOS1eeEdvWeDbXV+arIajFPPzczqwmFXQmOEf/ANqPyZOioDbJKjpoB1LpubE4lStV4gHVvW3K4CCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:13:46.319924Z"},"content_sha256":"c512fe128b30d5c59fdb157f3b8acfb832ccee5c816145d827f4f9ba840c955f","schema_version":"1.0","event_id":"sha256:c512fe128b30d5c59fdb157f3b8acfb832ccee5c816145d827f4f9ba840c955f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/bundle.json","state_url":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/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-05-22T15:13:46Z","links":{"resolver":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K","bundle":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/bundle.json","state":"https://pith.science/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNF5L5LE6ANZOP47VO7WVUYW7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JNF5L5LE6ANZOP47VO7WVUYW7K","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":"ed3309a183d2fb8703d8a11b75de59e9cbfe2f42e0c67f5ae509288395ce414a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-14T16:45:27Z","title_canon_sha256":"39919b235eb701e1a9b69efb54971e4d4d06b0750fcaa33844129e8e3edf192c"},"schema_version":"1.0","source":{"id":"1803.05396","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05396","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05396v3","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05396","created_at":"2026-05-17T23:50:42Z"},{"alias_kind":"pith_short_12","alias_value":"JNF5L5LE6ANZ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNF5L5LE6ANZOP47","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNF5L5LE","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:c512fe128b30d5c59fdb157f3b8acfb832ccee5c816145d827f4f9ba840c955f","target":"graph","created_at":"2026-05-17T23:50:42Z","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":"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","authors_text":"Alex Scott, Carla Groenland, Karolina Okrasa, Paul Seymour, Pawel Rz\\k{a}\\.zewski, Sophie Spirkl","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-14T16:45:27Z","title":"$H$-colouring $P_t$-free graphs in subexponential time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05396","kind":"arxiv","version":3},"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:37fbf09219b554f09ea4a7996ec3753ae0a41697e44f699dd9240e0654a7345f","target":"record","created_at":"2026-05-17T23:50:42Z","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":"ed3309a183d2fb8703d8a11b75de59e9cbfe2f42e0c67f5ae509288395ce414a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-14T16:45:27Z","title_canon_sha256":"39919b235eb701e1a9b69efb54971e4d4d06b0750fcaa33844129e8e3edf192c"},"schema_version":"1.0","source":{"id":"1803.05396","kind":"arxiv","version":3}},"canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b4bd5f564f01b973f9fabbf6ad316fab28668a5b83ed3898703c413735a0f2a","first_computed_at":"2026-05-17T23:50:42.783004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:42.783004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M3K90hLVVQVxogyigYkpGAFfjkAC+4bRChzRCxfYoAOJK+4U/sR6+Y8Db/mdZBdZTaLhekjb9o5U4g2mE0wwBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:42.783397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05396","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37fbf09219b554f09ea4a7996ec3753ae0a41697e44f699dd9240e0654a7345f","sha256:c512fe128b30d5c59fdb157f3b8acfb832ccee5c816145d827f4f9ba840c955f"],"state_sha256":"31298668d388315c1d41a4aa64b551ce2d7dacb96eca0be68225d7b82fd75d1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWZBSCV7AAwwMcqR4Dq4Jvvj+Fb7wVMBRtCH3DBjCnyNrVWgATzRcs52fYySgiKnSS7TZT93KWkbsg2y4gm/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:13:46.322497Z","bundle_sha256":"b8e157825ec1bada77e909c99f4288f03f047b610bed0043eeb75f1bccd1e747"}}