{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UHKO4I7UHDIPG7LOWDIKVB4LNM","short_pith_number":"pith:UHKO4I7U","schema_version":"1.0","canonical_sha256":"a1d4ee23f438d0f37d6eb0d0aa878b6b38b4af8fdb400e4b4c8a6738c06499c0","source":{"kind":"arxiv","id":"1511.08911","version":2},"attestation_state":"computed","paper":{"title":"4-coloring ($P_6$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor","submitted_at":"2015-11-28T16:45:09Z","abstract_excerpt":"We present a polynomial-time algorithm that determines whether a graph that contains no induced path on six vertices and no bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce) is 4-colorable. We also show that for any fixed k the k-coloring problem can be solved in polynomial time in the class of ($P_6$, bull, gem)-free graphs."},"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":"1511.08911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-28T16:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"5faceccea155e3347e5cebd3fe0c779ccc258d78a1b13edf9a0f0f8ef46c7d67","abstract_canon_sha256":"a229c37e3711d8e1990e532337c9f9616a805d91f8cd32d5c4e420488a202c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:03.307157Z","signature_b64":"3IH0Jnjs1BqhcBFvWRZ2dEAW3slDLvkAb4Nj5GCBauQHNw+L54qI4o4jgw9zoiPjtoOju+jUS7Ze6JrBOnRJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1d4ee23f438d0f37d6eb0d0aa878b6b38b4af8fdb400e4b4c8a6738c06499c0","last_reissued_at":"2026-05-18T01:20:03.306276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:03.306276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"4-coloring ($P_6$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor","submitted_at":"2015-11-28T16:45:09Z","abstract_excerpt":"We present a polynomial-time algorithm that determines whether a graph that contains no induced path on six vertices and no bull (the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, ce) is 4-colorable. We also show that for any fixed k the k-coloring problem can be solved in polynomial time in the class of ($P_6$, bull, gem)-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08911","kind":"arxiv","version":2},"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":"1511.08911","created_at":"2026-05-18T01:20:03.306444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08911v2","created_at":"2026-05-18T01:20:03.306444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08911","created_at":"2026-05-18T01:20:03.306444+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHKO4I7UHDIP","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHKO4I7UHDIPG7LO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHKO4I7U","created_at":"2026-05-18T12:29:44.643036+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/UHKO4I7UHDIPG7LOWDIKVB4LNM","json":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM.json","graph_json":"https://pith.science/api/pith-number/UHKO4I7UHDIPG7LOWDIKVB4LNM/graph.json","events_json":"https://pith.science/api/pith-number/UHKO4I7UHDIPG7LOWDIKVB4LNM/events.json","paper":"https://pith.science/paper/UHKO4I7U"},"agent_actions":{"view_html":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM","download_json":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM.json","view_paper":"https://pith.science/paper/UHKO4I7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08911&json=true","fetch_graph":"https://pith.science/api/pith-number/UHKO4I7UHDIPG7LOWDIKVB4LNM/graph.json","fetch_events":"https://pith.science/api/pith-number/UHKO4I7UHDIPG7LOWDIKVB4LNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM/action/storage_attestation","attest_author":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM/action/author_attestation","sign_citation":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM/action/citation_signature","submit_replication":"https://pith.science/pith/UHKO4I7UHDIPG7LOWDIKVB4LNM/action/replication_record"}},"created_at":"2026-05-18T01:20:03.306444+00:00","updated_at":"2026-05-18T01:20:03.306444+00:00"}