{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SL52LNGB4EV7Y7ZC2DEDVG46OH","short_pith_number":"pith:SL52LNGB","schema_version":"1.0","canonical_sha256":"92fba5b4c1e12bfc7f22d0c83a9b9e71cbdeaf6c7522a0ae7c6c32943a2b3bb2","source":{"kind":"arxiv","id":"1904.08180","version":1},"attestation_state":"computed","paper":{"title":"The intersection of two vertex coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Angele M. Foley, Chinh T. Hoang, Dallas J. Fraser, Kevin Holmes, Tom P. LaMantia","submitted_at":"2019-04-17T10:56:02Z","abstract_excerpt":"A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems are unresolved: the complexity of coloring even hole-free graphs, and the complexity of coloring {4K1, C4}-free graphs. The intersection of these two problems is the problem of coloring {4K1, C4, C6}-free graphs. In this paper we present partial results on this problem."},"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":"1904.08180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-17T10:56:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e41514ce09e16c4a47ceaeebdbc1688fdb7a52ac42e8158d8174fb5ce35e60e6","abstract_canon_sha256":"45ea8503cac7d2aa2e982be081ba5e4b29d307dcbc5ee31a916b21326c57a2dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.494635Z","signature_b64":"XrjON2IBOTKVJ8GbOkd+PqglUoymo1IqAGqU+RhQH2Nkjk9pT2+iB3CpwbWXD+7yQZXTKSJ5Qg0Vk9WZ9GtACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92fba5b4c1e12bfc7f22d0c83a9b9e71cbdeaf6c7522a0ae7c6c32943a2b3bb2","last_reissued_at":"2026-05-17T23:48:18.494199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.494199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The intersection of two vertex coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Angele M. Foley, Chinh T. Hoang, Dallas J. Fraser, Kevin Holmes, Tom P. LaMantia","submitted_at":"2019-04-17T10:56:02Z","abstract_excerpt":"A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any graph in L as an induced subgraph. Currently, the following two problems are unresolved: the complexity of coloring even hole-free graphs, and the complexity of coloring {4K1, C4}-free graphs. The intersection of these two problems is the problem of coloring {4K1, C4, C6}-free graphs. In this paper we present partial results on this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08180","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":"1904.08180","created_at":"2026-05-17T23:48:18.494258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08180v1","created_at":"2026-05-17T23:48:18.494258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08180","created_at":"2026-05-17T23:48:18.494258+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL52LNGB4EV7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL52LNGB4EV7Y7ZC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL52LNGB","created_at":"2026-05-18T12:33:27.125529+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/SL52LNGB4EV7Y7ZC2DEDVG46OH","json":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH.json","graph_json":"https://pith.science/api/pith-number/SL52LNGB4EV7Y7ZC2DEDVG46OH/graph.json","events_json":"https://pith.science/api/pith-number/SL52LNGB4EV7Y7ZC2DEDVG46OH/events.json","paper":"https://pith.science/paper/SL52LNGB"},"agent_actions":{"view_html":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH","download_json":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH.json","view_paper":"https://pith.science/paper/SL52LNGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08180&json=true","fetch_graph":"https://pith.science/api/pith-number/SL52LNGB4EV7Y7ZC2DEDVG46OH/graph.json","fetch_events":"https://pith.science/api/pith-number/SL52LNGB4EV7Y7ZC2DEDVG46OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH/action/storage_attestation","attest_author":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH/action/author_attestation","sign_citation":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH/action/citation_signature","submit_replication":"https://pith.science/pith/SL52LNGB4EV7Y7ZC2DEDVG46OH/action/replication_record"}},"created_at":"2026-05-17T23:48:18.494258+00:00","updated_at":"2026-05-17T23:48:18.494258+00:00"}