{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CLO3G6A6KFB4KAE45ZQG3PLTKV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a15101bcc5c7d12f536e1d84297af7719d1b50a7ddabc056a004ac48cb172c02","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-30T08:43:57Z","title_canon_sha256":"9bb2c666b706eb6f6182423db86cdbc95bd89174580804f833fca6b4b3b90337"},"schema_version":"1.0","source":{"id":"2604.27594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27594","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27594v2","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27594","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"CLO3G6A6KFB4","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_16","alias_value":"CLO3G6A6KFB4KAE4","created_at":"2026-05-20T00:03:13Z"},{"alias_kind":"pith_short_8","alias_value":"CLO3G6A6","created_at":"2026-05-20T00:03:13Z"}],"graph_snapshots":[{"event_id":"sha256:9a5d7367e06ae9ed9b37121d3435f5bd54b143e74f339c1877973881b7923e47","target":"graph","created_at":"2026-05-20T00:03:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"275685c28bc638e4395b91225fb8b34d3609721d610d7bf09415727d0949b00c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:04:02.531144Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27594/integrity.json","findings":[],"snapshot_sha256":"3faf59f62bd8e3bf6698d107275bc8c954aca42609ad31312a5ac3dc0259e853","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chinh T. Hoang, Manoj Belavadi","cross_cats":[],"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-30T08:43:57Z","title":"Structural description of (bull, house)-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27594","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T08:53:14.708082Z","id":"ceeb58f3-3198-489a-a8cb-82f20594c09f","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"ceeb58f3-3198-489a-a8cb-82f20594c09f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f77fee3fb7da6ecba6995ee452e5a0a8e9e28a6afce060f8fd2b3f33eff8069d","target":"record","created_at":"2026-05-20T00:03:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a15101bcc5c7d12f536e1d84297af7719d1b50a7ddabc056a004ac48cb172c02","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-30T08:43:57Z","title_canon_sha256":"9bb2c666b706eb6f6182423db86cdbc95bd89174580804f833fca6b4b3b90337"},"schema_version":"1.0","source":{"id":"2604.27594","kind":"arxiv","version":2}},"canonical_sha256":"12ddb3781e5143c5009cee606dbd7355534dbe604bd85b21fd6248090952e3f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12ddb3781e5143c5009cee606dbd7355534dbe604bd85b21fd6248090952e3f8","first_computed_at":"2026-05-20T00:03:13.100935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:13.100935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"smQsFuFJwFJwFXhi7+hbMs5l+H8Us8FG5vHPYeBiuhnkOauCvC5bdbJbyTdo70vULOXrAvBHgx3XxsAQi+wiAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:13.101728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f77fee3fb7da6ecba6995ee452e5a0a8e9e28a6afce060f8fd2b3f33eff8069d","sha256:9a5d7367e06ae9ed9b37121d3435f5bd54b143e74f339c1877973881b7923e47"],"state_sha256":"9b988ecb281d9f589ebe7a70daafcc58f9216c0102c1db10c9504268a5e5780b"}