{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XXPZ74OXMNFDDTZREO56N6MYAQ","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":"321e3fb96e645d9caef890c6e69fd072fcbf9003723b33985c530e71b4a23b1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T01:32:15Z","title_canon_sha256":"76ad6835bfb6c87e5c8dc7db6673da758e3194738a12f7afd7c269f66f833bbb"},"schema_version":"1.0","source":{"id":"2402.14211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14211","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14211v2","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14211","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"XXPZ74OXMNFD","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"XXPZ74OXMNFDDTZR","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"XXPZ74OX","created_at":"2026-07-05T08:15:12Z"}],"graph_snapshots":[{"event_id":"sha256:524c25b0436ca8b3efae581708b25a7d422cefb785181cc16f6ba233c5b86dfb","target":"graph","created_at":"2026-07-05T08:15:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.14211/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that for every integer $t\\geq 1$ there exists an integer $c_t\\geq 1$ such that every $n$-vertex even-hole-free graph with no clique of size $t$ has treewidth at most $c_t\\log{n}$. This resolves a conjecture of Sintiari and Trotignon, who also proved that the logarithmic bound is asymptotically best possible. It follows that several \\textsf{NP}-hard problems such as \\textsc{Stable Set}, \\textsc{Vertex Cover}, \\textsc{Dominating Set} and \\textsc{Coloring} admit polynomial-time algorithms on this class of graphs. As a consequence, for every positive integer $r$, $r$-{\\sc Coloring} can be","authors_text":"Daniel Lokshtanov, Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T01:32:15Z","title":"Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14211","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:bfa66eb1fab1bc21806a6c84ce0f4b3edbba3b667930201292aeb272efd59873","target":"record","created_at":"2026-07-05T08:15:12Z","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":"321e3fb96e645d9caef890c6e69fd072fcbf9003723b33985c530e71b4a23b1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-02-22T01:32:15Z","title_canon_sha256":"76ad6835bfb6c87e5c8dc7db6673da758e3194738a12f7afd7c269f66f833bbb"},"schema_version":"1.0","source":{"id":"2402.14211","kind":"arxiv","version":2}},"canonical_sha256":"bddf9ff1d7634a31cf3123bbe6f9980427731ba3b26758892a4b4e02f407ba60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bddf9ff1d7634a31cf3123bbe6f9980427731ba3b26758892a4b4e02f407ba60","first_computed_at":"2026-07-05T08:15:12.243388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:15:12.243388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/kYwyRUdi+KyVObN2C0JAcHnzuEeZxZf4AlGIR2ll6PLU0wdTik15TVhrzdDkYPa+av6ryEcV3XN0fGtpvOKAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:15:12.243844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.14211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfa66eb1fab1bc21806a6c84ce0f4b3edbba3b667930201292aeb272efd59873","sha256:524c25b0436ca8b3efae581708b25a7d422cefb785181cc16f6ba233c5b86dfb"],"state_sha256":"ea6a86f90addcf6d5fd8d198f74913a8f875264f0f271049b4c532f2eaceeba0"}