{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:66KMY3WB3IKN7JR42F3SNMWB76","short_pith_number":"pith:66KMY3WB","schema_version":"1.0","canonical_sha256":"f794cc6ec1da14dfa63cd17726b2c1ff89825af41cce498337ec053e3eae417c","source":{"kind":"arxiv","id":"1803.03315","version":1},"attestation_state":"computed","paper":{"title":"The class of $(P_7,C_4,C_5)$-free graphs: decomposition, algorithms, and $\\chi$-boundedness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irena Penev, Kathie Cameron, Shenwei Huang, Vaidy Sivaraman","submitted_at":"2018-03-08T21:41:47Z","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"},"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":"1803.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-08T21:41:47Z","cross_cats_sorted":[],"title_canon_sha256":"7951631a0468a107de411de05555335a8c284a8c894e586bb48e5fcb20010549","abstract_canon_sha256":"3f71e5eda1beec05c4278a6765f8783a6e46854e466f28999b5b0eaa9b12c0e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:40.009183Z","signature_b64":"PqRvYCKVU5fF7kFl+B/1zcDeUZw//gey8a3B9cFFMTGZE4uokr6kRnxBeqMQ6RaIckSNAtgtwGfFxUxO1tYwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f794cc6ec1da14dfa63cd17726b2c1ff89825af41cce498337ec053e3eae417c","last_reissued_at":"2026-05-18T00:21:40.008592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:40.008592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The class of $(P_7,C_4,C_5)$-free graphs: decomposition, algorithms, and $\\chi$-boundedness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irena Penev, Kathie Cameron, Shenwei Huang, Vaidy Sivaraman","submitted_at":"2018-03-08T21:41:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03315","kind":"arxiv","version":1},"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":"1803.03315","created_at":"2026-05-18T00:21:40.008682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03315v1","created_at":"2026-05-18T00:21:40.008682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03315","created_at":"2026-05-18T00:21:40.008682+00:00"},{"alias_kind":"pith_short_12","alias_value":"66KMY3WB3IKN","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"66KMY3WB3IKN7JR4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"66KMY3WB","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05018","citing_title":"Structural domination and coloring of some ($P_7, C_7$)-free graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76","json":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76.json","graph_json":"https://pith.science/api/pith-number/66KMY3WB3IKN7JR42F3SNMWB76/graph.json","events_json":"https://pith.science/api/pith-number/66KMY3WB3IKN7JR42F3SNMWB76/events.json","paper":"https://pith.science/paper/66KMY3WB"},"agent_actions":{"view_html":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76","download_json":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76.json","view_paper":"https://pith.science/paper/66KMY3WB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03315&json=true","fetch_graph":"https://pith.science/api/pith-number/66KMY3WB3IKN7JR42F3SNMWB76/graph.json","fetch_events":"https://pith.science/api/pith-number/66KMY3WB3IKN7JR42F3SNMWB76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76/action/storage_attestation","attest_author":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76/action/author_attestation","sign_citation":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76/action/citation_signature","submit_replication":"https://pith.science/pith/66KMY3WB3IKN7JR42F3SNMWB76/action/replication_record"}},"created_at":"2026-05-18T00:21:40.008682+00:00","updated_at":"2026-05-18T00:21:40.008682+00:00"}