{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OVQIT5CCKWCT6H3S354P2E2IO4","short_pith_number":"pith:OVQIT5CC","schema_version":"1.0","canonical_sha256":"756089f44255853f1f72df78fd1348770b6c906cfe57ed7e7d90a48afc889c0f","source":{"kind":"arxiv","id":"1706.00337","version":2},"attestation_state":"computed","paper":{"title":"Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-06-01T15:16:51Z","abstract_excerpt":"We prove that every triangle-free graph of tree-width t has chromatic number at most ceil((t + 3)/2), and demonstrate that this bound is tight. The argument also establishes a connection between coloring graphs of tree-width t and on-line coloring of graphs of path-width t."},"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":"1706.00337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T15:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"ffec8ce895fc50f0c8b03dfed6ac878199b79b9b12ddbea8caa486e0451239dd","abstract_canon_sha256":"b801cd3ab282fe787c75e88b0316f1d499c246e240dd44a260a46764702be837"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.437209Z","signature_b64":"uNM8FUt38qGNd/qa6FxaHnYrBAOs1FZ8jfqnNZwjIjISsPQ/EsgS7IdCkHTd0YULe8CD0QdJkazq/qWVsJBwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756089f44255853f1f72df78fd1348770b6c906cfe57ed7e7d90a48afc889c0f","last_reissued_at":"2026-05-18T00:42:43.436520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.436520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free graphs of tree-width t are ceil((t + 3)/2)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-06-01T15:16:51Z","abstract_excerpt":"We prove that every triangle-free graph of tree-width t has chromatic number at most ceil((t + 3)/2), and demonstrate that this bound is tight. The argument also establishes a connection between coloring graphs of tree-width t and on-line coloring of graphs of path-width t."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00337","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":"1706.00337","created_at":"2026-05-18T00:42:43.436634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00337v2","created_at":"2026-05-18T00:42:43.436634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00337","created_at":"2026-05-18T00:42:43.436634+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVQIT5CCKWCT","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVQIT5CCKWCT6H3S","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVQIT5CC","created_at":"2026-05-18T12:31:34.259226+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/OVQIT5CCKWCT6H3S354P2E2IO4","json":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4.json","graph_json":"https://pith.science/api/pith-number/OVQIT5CCKWCT6H3S354P2E2IO4/graph.json","events_json":"https://pith.science/api/pith-number/OVQIT5CCKWCT6H3S354P2E2IO4/events.json","paper":"https://pith.science/paper/OVQIT5CC"},"agent_actions":{"view_html":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4","download_json":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4.json","view_paper":"https://pith.science/paper/OVQIT5CC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00337&json=true","fetch_graph":"https://pith.science/api/pith-number/OVQIT5CCKWCT6H3S354P2E2IO4/graph.json","fetch_events":"https://pith.science/api/pith-number/OVQIT5CCKWCT6H3S354P2E2IO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4/action/storage_attestation","attest_author":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4/action/author_attestation","sign_citation":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4/action/citation_signature","submit_replication":"https://pith.science/pith/OVQIT5CCKWCT6H3S354P2E2IO4/action/replication_record"}},"created_at":"2026-05-18T00:42:43.436634+00:00","updated_at":"2026-05-18T00:42:43.436634+00:00"}