{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:66KMY3WB3IKN7JR42F3SNMWB76","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":"3f71e5eda1beec05c4278a6765f8783a6e46854e466f28999b5b0eaa9b12c0e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T21:41:47Z","title_canon_sha256":"7951631a0468a107de411de05555335a8c284a8c894e586bb48e5fcb20010549"},"schema_version":"1.0","source":{"id":"1803.03315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03315","created_at":"2026-05-18T00:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03315v1","created_at":"2026-05-18T00:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03315","created_at":"2026-05-18T00:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"66KMY3WB3IKN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"66KMY3WB3IKN7JR4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"66KMY3WB","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:58948b943ad4d2a3c03489a9fed7526cb3c4948411f88d8dc90c2974f636f4a7","target":"graph","created_at":"2026-05-18T00:21:40Z","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":"As usual, $P_n$ ($n \\geq 1$) denotes the path on $n$ vertices, and $C_n$ ($n \\geq 3$) denotes the cycle on $n$ vertices. For a family $\\mathcal{H}$ of graphs, we say that a graph $G$ is $\\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to any graph in $\\mathcal{H}$. We present a decomposition theorem for the class of $(P_7,C_4,C_5)$-free graphs; in fact, we give a complete structural characterization of $(P_7,C_4,C_5)$-free graphs that do not admit a clique-cutset. We use this decomposition theorem to show that the class of $(P_7,C_4,C_5)$-free graphs is $\\chi$-bounded by a linear","authors_text":"Irena Penev, Kathie Cameron, Shenwei Huang, Vaidy Sivaraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T21:41:47Z","title":"The class of $(P_7,C_4,C_5)$-free graphs: decomposition, algorithms, and $\\chi$-boundedness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03315","kind":"arxiv","version":1},"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:240a81ab98a9dfbaa1fec32f3e7343f4585756664117039c8ce130c843f4b391","target":"record","created_at":"2026-05-18T00:21:40Z","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":"3f71e5eda1beec05c4278a6765f8783a6e46854e466f28999b5b0eaa9b12c0e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T21:41:47Z","title_canon_sha256":"7951631a0468a107de411de05555335a8c284a8c894e586bb48e5fcb20010549"},"schema_version":"1.0","source":{"id":"1803.03315","kind":"arxiv","version":1}},"canonical_sha256":"f794cc6ec1da14dfa63cd17726b2c1ff89825af41cce498337ec053e3eae417c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f794cc6ec1da14dfa63cd17726b2c1ff89825af41cce498337ec053e3eae417c","first_computed_at":"2026-05-18T00:21:40.008592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:40.008592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PqRvYCKVU5fF7kFl+B/1zcDeUZw//gey8a3B9cFFMTGZE4uokr6kRnxBeqMQ6RaIckSNAtgtwGfFxUxO1tYwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:40.009183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:240a81ab98a9dfbaa1fec32f3e7343f4585756664117039c8ce130c843f4b391","sha256:58948b943ad4d2a3c03489a9fed7526cb3c4948411f88d8dc90c2974f636f4a7"],"state_sha256":"d36575126a0695b036a20b2ea69f11d8797507fb1849480552ebc80cac29762b"}