{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZKY3DNSDHQL7CH5GAQSINJGW5U","short_pith_number":"pith:ZKY3DNSD","schema_version":"1.0","canonical_sha256":"cab1b1b6433c17f11fa6042486a4d6ed38c980887a4004f4e6a50f5efb7e11b0","source":{"kind":"arxiv","id":"1707.08918","version":1},"attestation_state":"computed","paper":{"title":"Coloring ($P_5$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2017-07-27T15:58:42Z","abstract_excerpt":"We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$)."},"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":"1707.08918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-27T15:58:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b64a2319e3af85988589083f7a205425d1654353219b2e684d1bd2e11e072eb4","abstract_canon_sha256":"c26d2abe98bf58c093f66014a951314ba7eb5cf2343645f8c23194fcb1eafcae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:19.104892Z","signature_b64":"Hsxd8hZUq2oGlbQn8hZgLfDcBtIxn+pqI8qMj1Yr5ISFvhfxDrQt1tlvSnI035LFrCpI/XEjgrAi+Nr/LKndCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab1b1b6433c17f11fa6042486a4d6ed38c980887a4004f4e6a50f5efb7e11b0","last_reissued_at":"2026-05-18T00:39:19.104222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:19.104222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring ($P_5$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2017-07-27T15:58:42Z","abstract_excerpt":"We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices $a,b,c,d,e$ and edges $ab,bc,cd,be,ce$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08918","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":"1707.08918","created_at":"2026-05-18T00:39:19.104330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08918v1","created_at":"2026-05-18T00:39:19.104330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08918","created_at":"2026-05-18T00:39:19.104330+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKY3DNSDHQL7","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKY3DNSDHQL7CH5G","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKY3DNSD","created_at":"2026-05-18T12:31:59.375834+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/ZKY3DNSDHQL7CH5GAQSINJGW5U","json":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U.json","graph_json":"https://pith.science/api/pith-number/ZKY3DNSDHQL7CH5GAQSINJGW5U/graph.json","events_json":"https://pith.science/api/pith-number/ZKY3DNSDHQL7CH5GAQSINJGW5U/events.json","paper":"https://pith.science/paper/ZKY3DNSD"},"agent_actions":{"view_html":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U","download_json":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U.json","view_paper":"https://pith.science/paper/ZKY3DNSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08918&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKY3DNSDHQL7CH5GAQSINJGW5U/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKY3DNSDHQL7CH5GAQSINJGW5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U/action/storage_attestation","attest_author":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U/action/author_attestation","sign_citation":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U/action/citation_signature","submit_replication":"https://pith.science/pith/ZKY3DNSDHQL7CH5GAQSINJGW5U/action/replication_record"}},"created_at":"2026-05-18T00:39:19.104330+00:00","updated_at":"2026-05-18T00:39:19.104330+00:00"}