{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PXKTQKKOKULZNGBRTC6CLO3SZO","short_pith_number":"pith:PXKTQKKO","schema_version":"1.0","canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","source":{"kind":"arxiv","id":"1506.03647","version":3},"attestation_state":"computed","paper":{"title":"Exhaustive generation of $k$-critical $\\mathcal H$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur, Oliver Schaudt","submitted_at":"2015-06-11T12:29:14Z","abstract_excerpt":"We describe an algorithm for generating all $k$-critical $\\mathcal H$-free graphs, based on a method of Ho\\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$ and $k=5$. We also show that there are only finitely many $4$-critical graphs $(P_8,C_4)$-free graphs. For each case of these cases we also give the complete lists of critical graphs and vertex-critical graphs. These results generalize previous work by Hell and Huang, and yield certifying algorithms for the $3$-colorability problem in the respective classes.\n"},"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":"1506.03647","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-11T12:29:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2dae389b871c08438abdbcdfa5e6347b12f84479e4e8f40078a30e1e606a8428","abstract_canon_sha256":"c58b81ed650ca8b494cdd140f384a3f2e15babd9ed39ae02872659afb62d312e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:22.172697Z","signature_b64":"AhrABOi/DNuLWFTxsqbz6ERFGy+C7eKZ65wnySqJJ2g+sMWyUl0ErX4nwWEhLfm2rm9rUxEWZ1QQgRRwa+9BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","last_reissued_at":"2026-05-18T01:35:22.171929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:22.171929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exhaustive generation of $k$-critical $\\mathcal H$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Goedgebeur, Oliver Schaudt","submitted_at":"2015-06-11T12:29:14Z","abstract_excerpt":"We describe an algorithm for generating all $k$-critical $\\mathcal H$-free graphs, based on a method of Ho\\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$ and $k=5$. We also show that there are only finitely many $4$-critical graphs $(P_8,C_4)$-free graphs. For each case of these cases we also give the complete lists of critical graphs and vertex-critical graphs. These results generalize previous work by Hell and Huang, and yield certifying algorithms for the $3$-colorability problem in the respective classes.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03647","kind":"arxiv","version":3},"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":"1506.03647","created_at":"2026-05-18T01:35:22.172073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03647v3","created_at":"2026-05-18T01:35:22.172073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03647","created_at":"2026-05-18T01:35:22.172073+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXKTQKKOKULZ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXKTQKKOKULZNGBR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXKTQKKO","created_at":"2026-05-18T12:29:37.295048+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/PXKTQKKOKULZNGBRTC6CLO3SZO","json":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO.json","graph_json":"https://pith.science/api/pith-number/PXKTQKKOKULZNGBRTC6CLO3SZO/graph.json","events_json":"https://pith.science/api/pith-number/PXKTQKKOKULZNGBRTC6CLO3SZO/events.json","paper":"https://pith.science/paper/PXKTQKKO"},"agent_actions":{"view_html":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO","download_json":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO.json","view_paper":"https://pith.science/paper/PXKTQKKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03647&json=true","fetch_graph":"https://pith.science/api/pith-number/PXKTQKKOKULZNGBRTC6CLO3SZO/graph.json","fetch_events":"https://pith.science/api/pith-number/PXKTQKKOKULZNGBRTC6CLO3SZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/action/storage_attestation","attest_author":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/action/author_attestation","sign_citation":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/action/citation_signature","submit_replication":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/action/replication_record"}},"created_at":"2026-05-18T01:35:22.172073+00:00","updated_at":"2026-05-18T01:35:22.172073+00:00"}