{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TQWDURR32SLNTWM5LILHTCKZUH","short_pith_number":"pith:TQWDURR3","schema_version":"1.0","canonical_sha256":"9c2c3a463bd496d9d99d5a16798959a1e8ca4681de02afa95face5ad75afe1c3","source":{"kind":"arxiv","id":"1606.02967","version":2},"attestation_state":"computed","paper":{"title":"Approximately coloring graphs without long induced paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Maya Stein, Mingxian Zhong, Oliver Schaudt, Sophie Spirkl","submitted_at":"2016-06-09T14:04:09Z","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."},"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":"1606.02967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T14:04:09Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"622ef9bd0e9af186aad7386bc6f15a7413477a85d9e75bed8354f7858ad79f8c","abstract_canon_sha256":"4372c320403cb66663ff8e9ce7b2ed57c3321a97443cf77d425e7b217796d00d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.457256Z","signature_b64":"KYj8RSkaiynNhrhoIo35mMiBY/ZRo7yl/MjpoNoploX22dvtPlcNPJfXx/bx2MrCDmN7GXKY8BdYChJHE7DnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c2c3a463bd496d9d99d5a16798959a1e8ca4681de02afa95face5ad75afe1c3","last_reissued_at":"2026-05-18T01:12:32.456691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.456691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately coloring graphs without long induced paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Maya Stein, Mingxian Zhong, Oliver Schaudt, Sophie Spirkl","submitted_at":"2016-06-09T14:04:09Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02967","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":"1606.02967","created_at":"2026-05-18T01:12:32.456785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02967v2","created_at":"2026-05-18T01:12:32.456785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02967","created_at":"2026-05-18T01:12:32.456785+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQWDURR32SLN","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQWDURR32SLNTWM5","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQWDURR3","created_at":"2026-05-18T12:30:46.583412+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/TQWDURR32SLNTWM5LILHTCKZUH","json":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH.json","graph_json":"https://pith.science/api/pith-number/TQWDURR32SLNTWM5LILHTCKZUH/graph.json","events_json":"https://pith.science/api/pith-number/TQWDURR32SLNTWM5LILHTCKZUH/events.json","paper":"https://pith.science/paper/TQWDURR3"},"agent_actions":{"view_html":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH","download_json":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH.json","view_paper":"https://pith.science/paper/TQWDURR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02967&json=true","fetch_graph":"https://pith.science/api/pith-number/TQWDURR32SLNTWM5LILHTCKZUH/graph.json","fetch_events":"https://pith.science/api/pith-number/TQWDURR32SLNTWM5LILHTCKZUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH/action/storage_attestation","attest_author":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH/action/author_attestation","sign_citation":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH/action/citation_signature","submit_replication":"https://pith.science/pith/TQWDURR32SLNTWM5LILHTCKZUH/action/replication_record"}},"created_at":"2026-05-18T01:12:32.456785+00:00","updated_at":"2026-05-18T01:12:32.456785+00:00"}