{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JANHYKRFH52AKPSUWBUFVPPNFN","short_pith_number":"pith:JANHYKRF","schema_version":"1.0","canonical_sha256":"481a7c2a253f74053e54b0685abded2b65432d357cb7ed4e989441bd5888d8d0","source":{"kind":"arxiv","id":"2308.05442","version":1},"attestation_state":"computed","paper":{"title":"Optimal chromatic bound for ($P_3\\cup P_2$, house)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Jinfeng Li, Rui Li","submitted_at":"2023-08-10T08:58:12Z","abstract_excerpt":"Let $G$ and $H$ be two vertex disjoint graphs. The {\\em union} $G\\cup H$ is the graph with $V(G\\cup H)=V(G)\\cup V(H)$ and $E(G\\cup H)=E(G)\\cup E(H)$. We use $P_k$ to denote a {\\em path} on $k$ vertices, use {\\em house} to denote the complement of $P_5$. In this paper, we show that $\\chi(G)\\le2\\omega(G)$ if $G$ is ($P_3\\cup P_2$, house)-free. Moreover, this bound is optimal when $\\omega(G)\\ge2$."},"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":"2308.05442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-10T08:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"50efb767881b6b4663845ea20ab781407f4852d02773d17490158a91733d2fe6","abstract_canon_sha256":"415a5510c1378716f1fed690217b09b81f0563656046cf9fa2a3cc97405d1099"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:00.783651Z","signature_b64":"DR0pWx0blXMi1d1KXCd6Hp/RZCAabdq7VprQpAPMJDI0JW0x2Y5mBNHeJdeS5FdlAlz238pO7y5UhvNSnnRrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"481a7c2a253f74053e54b0685abded2b65432d357cb7ed4e989441bd5888d8d0","last_reissued_at":"2026-07-05T06:40:00.783212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:00.783212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal chromatic bound for ($P_3\\cup P_2$, house)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Jinfeng Li, Rui Li","submitted_at":"2023-08-10T08:58:12Z","abstract_excerpt":"Let $G$ and $H$ be two vertex disjoint graphs. The {\\em union} $G\\cup H$ is the graph with $V(G\\cup H)=V(G)\\cup V(H)$ and $E(G\\cup H)=E(G)\\cup E(H)$. We use $P_k$ to denote a {\\em path} on $k$ vertices, use {\\em house} to denote the complement of $P_5$. In this paper, we show that $\\chi(G)\\le2\\omega(G)$ if $G$ is ($P_3\\cup P_2$, house)-free. Moreover, this bound is optimal when $\\omega(G)\\ge2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05442","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.05442/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.05442","created_at":"2026-07-05T06:40:00.783267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.05442v1","created_at":"2026-07-05T06:40:00.783267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05442","created_at":"2026-07-05T06:40:00.783267+00:00"},{"alias_kind":"pith_short_12","alias_value":"JANHYKRFH52A","created_at":"2026-07-05T06:40:00.783267+00:00"},{"alias_kind":"pith_short_16","alias_value":"JANHYKRFH52AKPSU","created_at":"2026-07-05T06:40:00.783267+00:00"},{"alias_kind":"pith_short_8","alias_value":"JANHYKRF","created_at":"2026-07-05T06:40:00.783267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14524","citing_title":"Coloring of some $(P_2\\cup P_4)$-free graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN","json":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN.json","graph_json":"https://pith.science/api/pith-number/JANHYKRFH52AKPSUWBUFVPPNFN/graph.json","events_json":"https://pith.science/api/pith-number/JANHYKRFH52AKPSUWBUFVPPNFN/events.json","paper":"https://pith.science/paper/JANHYKRF"},"agent_actions":{"view_html":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN","download_json":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN.json","view_paper":"https://pith.science/paper/JANHYKRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.05442&json=true","fetch_graph":"https://pith.science/api/pith-number/JANHYKRFH52AKPSUWBUFVPPNFN/graph.json","fetch_events":"https://pith.science/api/pith-number/JANHYKRFH52AKPSUWBUFVPPNFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN/action/storage_attestation","attest_author":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN/action/author_attestation","sign_citation":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN/action/citation_signature","submit_replication":"https://pith.science/pith/JANHYKRFH52AKPSUWBUFVPPNFN/action/replication_record"}},"created_at":"2026-07-05T06:40:00.783267+00:00","updated_at":"2026-07-05T06:40:00.783267+00:00"}