{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TQWDURR32SLNTWM5LILHTCKZUH","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":"4372c320403cb66663ff8e9ce7b2ed57c3321a97443cf77d425e7b217796d00d","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:04:09Z","title_canon_sha256":"622ef9bd0e9af186aad7386bc6f15a7413477a85d9e75bed8354f7858ad79f8c"},"schema_version":"1.0","source":{"id":"1606.02967","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02967","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02967v2","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02967","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"TQWDURR32SLN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TQWDURR32SLNTWM5","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TQWDURR3","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:3801b0dd03578a8afdf776f898eccbe8d16b0077e67cd7955d354b5399469b8f","target":"graph","created_at":"2026-05-18T01:12:32Z","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":"It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on $t$ vertices, for fixed $t$. We propose an algorithm that, given a 3-colorable graph without an induced path on $t$ vertices, computes a coloring with $\\max\\{5,2\\lceil{\\frac{t-1}{2}}\\rceil-2\\}$ many colors. If the input graph is triangle-free, we only need $\\max\\{4,\\lceil{\\frac{t-1}{2}}\\rceil+1\\}$ many colors. The running time of our algorithm is $O((3^{t-2}+t^2)m+n)$ if the input graph has $n$ vertices and $m$ edges.","authors_text":"Maria Chudnovsky, Maya Stein, Mingxian Zhong, Oliver Schaudt, Sophie Spirkl","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:04:09Z","title":"Approximately coloring graphs without long induced paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02967","kind":"arxiv","version":2},"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:28de88524ccd2e9540f2709f38f079a2ab3b04ca8a30af0de72a5408774c34fd","target":"record","created_at":"2026-05-18T01:12:32Z","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":"4372c320403cb66663ff8e9ce7b2ed57c3321a97443cf77d425e7b217796d00d","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:04:09Z","title_canon_sha256":"622ef9bd0e9af186aad7386bc6f15a7413477a85d9e75bed8354f7858ad79f8c"},"schema_version":"1.0","source":{"id":"1606.02967","kind":"arxiv","version":2}},"canonical_sha256":"9c2c3a463bd496d9d99d5a16798959a1e8ca4681de02afa95face5ad75afe1c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c2c3a463bd496d9d99d5a16798959a1e8ca4681de02afa95face5ad75afe1c3","first_computed_at":"2026-05-18T01:12:32.456691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:32.456691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYj8RSkaiynNhrhoIo35mMiBY/ZRo7yl/MjpoNoploX22dvtPlcNPJfXx/bx2MrCDmN7GXKY8BdYChJHE7DnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:32.457256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02967","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28de88524ccd2e9540f2709f38f079a2ab3b04ca8a30af0de72a5408774c34fd","sha256:3801b0dd03578a8afdf776f898eccbe8d16b0077e67cd7955d354b5399469b8f"],"state_sha256":"936d40a90f9a8af5a9d98de33e4e6da4c746db281f8511538bd0bae5078da743"}