{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CLO3G6A6KFB4KAE45ZQG3PLTKV","short_pith_number":"pith:CLO3G6A6","schema_version":"1.0","canonical_sha256":"12ddb3781e5143c5009cee606dbd7355534dbe604bd85b21fd6248090952e3f8","source":{"kind":"arxiv","id":"2604.27594","version":2},"attestation_state":"computed","paper":{"title":"Structural description of (bull, house)-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A structural description of (bull, house)-free graphs shows that (bull, P5)-free graphs have only finitely many k-critical instances for each fixed k.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chinh T. Hoang, Manoj Belavadi","submitted_at":"2026-04-30T08:43:57Z","abstract_excerpt":"The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is (k-1)-colorable. It is known that the number of k-critical P_5-free graphs and bull-free graphs are infinite for large enough k. We give a structural description of (bull, house)-free graphs and also (bull, P_5)-free graphs. Using these structural properties we prove that for any fixed k, the number of k-critical (bull, P_5)-free graphs is finite. This impr"},"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":"2604.27594","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-30T08:43:57Z","cross_cats_sorted":[],"title_canon_sha256":"9bb2c666b706eb6f6182423db86cdbc95bd89174580804f833fca6b4b3b90337","abstract_canon_sha256":"a15101bcc5c7d12f536e1d84297af7719d1b50a7ddabc056a004ac48cb172c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:13.101728Z","signature_b64":"smQsFuFJwFJwFXhi7+hbMs5l+H8Us8FG5vHPYeBiuhnkOauCvC5bdbJbyTdo70vULOXrAvBHgx3XxsAQi+wiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ddb3781e5143c5009cee606dbd7355534dbe604bd85b21fd6248090952e3f8","last_reissued_at":"2026-05-20T00:03:13.100935Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:13.100935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural description of (bull, house)-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A structural description of (bull, house)-free graphs shows that (bull, P5)-free graphs have only finitely many k-critical instances for each fixed k.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chinh T. Hoang, Manoj Belavadi","submitted_at":"2026-04-30T08:43:57Z","abstract_excerpt":"The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is (k-1)-colorable. It is known that the number of k-critical P_5-free graphs and bull-free graphs are infinite for large enough k. We give a structural description of (bull, house)-free graphs and also (bull, P_5)-free graphs. Using these structural properties we prove that for any fixed k, the number of k-critical (bull, P_5)-free graphs is finite. This impr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give a structural description of (bull, house)-free graphs and also (bull, P_5)-free graphs. Using these structural properties we prove that for any fixed k, the number of k-critical (bull, P_5)-free graphs is finite.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the claimed structural description correctly captures every (bull, house)-free graph via the decomposition or case analysis used in the proof, without missing cases that would allow infinitely many critical graphs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Structural characterizations of (bull, house)-free and (bull, P5)-free graphs enable a finiteness proof for k-critical (bull, P5)-free graphs and a short proof of perfect divisibility.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A structural description of (bull, house)-free graphs shows that (bull, P5)-free graphs have only finitely many k-critical instances for each fixed k.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"275685c28bc638e4395b91225fb8b34d3609721d610d7bf09415727d0949b00c"},"source":{"id":"2604.27594","kind":"arxiv","version":2},"verdict":{"id":"ceeb58f3-3198-489a-a8cb-82f20594c09f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T08:53:14.708082Z","strongest_claim":"We give a structural description of (bull, house)-free graphs and also (bull, P_5)-free graphs. Using these structural properties we prove that for any fixed k, the number of k-critical (bull, P_5)-free graphs is finite.","one_line_summary":"Structural characterizations of (bull, house)-free and (bull, P5)-free graphs enable a finiteness proof for k-critical (bull, P5)-free graphs and a short proof of perfect divisibility.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the claimed structural description correctly captures every (bull, house)-free graph via the decomposition or case analysis used in the proof, without missing cases that would allow infinitely many critical graphs.","pith_extraction_headline":"A structural description of (bull, house)-free graphs shows that (bull, P5)-free graphs have only finitely many k-critical instances for each fixed k."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27594/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T19:04:02.531144Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"3faf59f62bd8e3bf6698d107275bc8c954aca42609ad31312a5ac3dc0259e853"},"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":"2604.27594","created_at":"2026-05-20T00:03:13.101056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.27594v2","created_at":"2026-05-20T00:03:13.101056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27594","created_at":"2026-05-20T00:03:13.101056+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLO3G6A6KFB4","created_at":"2026-05-20T00:03:13.101056+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLO3G6A6KFB4KAE4","created_at":"2026-05-20T00:03:13.101056+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLO3G6A6","created_at":"2026-05-20T00:03:13.101056+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/CLO3G6A6KFB4KAE45ZQG3PLTKV","json":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV.json","graph_json":"https://pith.science/api/pith-number/CLO3G6A6KFB4KAE45ZQG3PLTKV/graph.json","events_json":"https://pith.science/api/pith-number/CLO3G6A6KFB4KAE45ZQG3PLTKV/events.json","paper":"https://pith.science/paper/CLO3G6A6"},"agent_actions":{"view_html":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV","download_json":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV.json","view_paper":"https://pith.science/paper/CLO3G6A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.27594&json=true","fetch_graph":"https://pith.science/api/pith-number/CLO3G6A6KFB4KAE45ZQG3PLTKV/graph.json","fetch_events":"https://pith.science/api/pith-number/CLO3G6A6KFB4KAE45ZQG3PLTKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV/action/storage_attestation","attest_author":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV/action/author_attestation","sign_citation":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV/action/citation_signature","submit_replication":"https://pith.science/pith/CLO3G6A6KFB4KAE45ZQG3PLTKV/action/replication_record"}},"created_at":"2026-05-20T00:03:13.101056+00:00","updated_at":"2026-05-20T00:03:13.101056+00:00"}