{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PXKTQKKOKULZNGBRTC6CLO3SZO","short_pith_number":"pith:PXKTQKKO","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"},"canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","source":{"kind":"arxiv","id":"1506.03647","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03647","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03647v3","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03647","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"PXKTQKKOKULZ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXKTQKKOKULZNGBR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXKTQKKO","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PXKTQKKOKULZNGBRTC6CLO3SZO","target":"record","payload":{"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"},"canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","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"},"source_kind":"arxiv","source_id":"1506.03647","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqX1C0k4/0U53L3t3oipcQTZA6h8q15q41jYLJMaFz8fhfMV/AYBmGxGZG7pjIETjZ8fAX6EvocktbNMRkaTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:11:04.858609Z"},"content_sha256":"29b84706b47bf98c77ed7772b900d2bf99a95228d0ee9dad050907148c624aa4","schema_version":"1.0","event_id":"sha256:29b84706b47bf98c77ed7772b900d2bf99a95228d0ee9dad050907148c624aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PXKTQKKOKULZNGBRTC6CLO3SZO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQHLmRBrIVuJdVIEqps3bNbmwASpP7ValAbrB0OLftgaHl4ewTksKf3NbN1Z+S7vNxYFmAIBgHiXNuQLVXgzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:11:04.858957Z"},"content_sha256":"16dbd8083acaef3e84d6d9fc39abf995b94af24f1659a0c6a752f9af76fed10d","schema_version":"1.0","event_id":"sha256:16dbd8083acaef3e84d6d9fc39abf995b94af24f1659a0c6a752f9af76fed10d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/bundle.json","state_url":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T04:11:04Z","links":{"resolver":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO","bundle":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/bundle.json","state":"https://pith.science/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXKTQKKOKULZNGBRTC6CLO3SZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PXKTQKKOKULZNGBRTC6CLO3SZO","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":"c58b81ed650ca8b494cdd140f384a3f2e15babd9ed39ae02872659afb62d312e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-11T12:29:14Z","title_canon_sha256":"2dae389b871c08438abdbcdfa5e6347b12f84479e4e8f40078a30e1e606a8428"},"schema_version":"1.0","source":{"id":"1506.03647","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03647","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03647v3","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03647","created_at":"2026-05-18T01:35:22Z"},{"alias_kind":"pith_short_12","alias_value":"PXKTQKKOKULZ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXKTQKKOKULZNGBR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXKTQKKO","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:16dbd8083acaef3e84d6d9fc39abf995b94af24f1659a0c6a752f9af76fed10d","target":"graph","created_at":"2026-05-18T01:35:22Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jan Goedgebeur, Oliver Schaudt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-11T12:29:14Z","title":"Exhaustive generation of $k$-critical $\\mathcal H$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03647","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29b84706b47bf98c77ed7772b900d2bf99a95228d0ee9dad050907148c624aa4","target":"record","created_at":"2026-05-18T01:35:22Z","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":"c58b81ed650ca8b494cdd140f384a3f2e15babd9ed39ae02872659afb62d312e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-11T12:29:14Z","title_canon_sha256":"2dae389b871c08438abdbcdfa5e6347b12f84479e4e8f40078a30e1e606a8428"},"schema_version":"1.0","source":{"id":"1506.03647","kind":"arxiv","version":3}},"canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dd538294e551796983198bc25bb72cba37552321321020ab4e8c1bff8a03249","first_computed_at":"2026-05-18T01:35:22.171929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:22.171929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AhrABOi/DNuLWFTxsqbz6ERFGy+C7eKZ65wnySqJJ2g+sMWyUl0ErX4nwWEhLfm2rm9rUxEWZ1QQgRRwa+9BBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:22.172697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03647","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29b84706b47bf98c77ed7772b900d2bf99a95228d0ee9dad050907148c624aa4","sha256:16dbd8083acaef3e84d6d9fc39abf995b94af24f1659a0c6a752f9af76fed10d"],"state_sha256":"65ec362467160ab36ac0eb0b555d69cef36b93b9e221ceb054d2d63e1b79ad3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdLLao4byakUaVbhH5ZAAeAF5xFI+tsU/DKD7GDhh4dgPxNMfg09LRpByNIEPEY6OuJyM+KZmg6E5CzZArlWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:11:04.860947Z","bundle_sha256":"fab33024370506f57d2376f25eec11bad55ffa11e4fc034976955811a31030a7"}}