{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W5VG2R6IMGWE2BPKM543PEX3PF","short_pith_number":"pith:W5VG2R6I","canonical_record":{"source":{"id":"1703.05684","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-16T15:57:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"60cc1416d8eb9af4b4e17973104aac697c770b5079742cdc725e33c6d3ca8bba","abstract_canon_sha256":"97b769fd27f4bdeea925c94e0b0ac3c36347f955af84155794ba4db7bcb2c4e8"},"schema_version":"1.0"},"canonical_sha256":"b76a6d47c861ac4d05ea6779b792fb797fded88848e10c7b71b47ae98668d43d","source":{"kind":"arxiv","id":"1703.05684","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05684","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05684v4","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05684","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"W5VG2R6IMGWE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5VG2R6IMGWE2BPK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5VG2R6I","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W5VG2R6IMGWE2BPKM543PEX3PF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05684","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-16T15:57:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"60cc1416d8eb9af4b4e17973104aac697c770b5079742cdc725e33c6d3ca8bba","abstract_canon_sha256":"97b769fd27f4bdeea925c94e0b0ac3c36347f955af84155794ba4db7bcb2c4e8"},"schema_version":"1.0"},"canonical_sha256":"b76a6d47c861ac4d05ea6779b792fb797fded88848e10c7b71b47ae98668d43d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:10.328205Z","signature_b64":"uixkhgUaIOv+tjNKWIRj51xm6orddfb+aTzccUmFXygiQkURliqOCffxk5DyPXknLjkTlFv5DKsto4HfdAYnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76a6d47c861ac4d05ea6779b792fb797fded88848e10c7b71b47ae98668d43d","last_reissued_at":"2026-05-18T00:24:10.327524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:10.327524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05684","source_version":4,"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-18T00:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMv6arY5qziCoP2kAdgXTZeoB1R9wDoml3mhrI10iLK5+ME0v//ilcVCVWu4YO4cbiVDnJDWKf/rZeeGtANqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:36.503775Z"},"content_sha256":"1a72e8f334c040c52b9dbde8ed2d0dc848c2474f9bc54964063cb762e9212bc0","schema_version":"1.0","event_id":"sha256:1a72e8f334c040c52b9dbde8ed2d0dc848c2474f9bc54964063cb762e9212bc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W5VG2R6IMGWE2BPKM543PEX3PF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstructions for three-coloring and list three-coloring $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, Maria Chudnovsky, Mingxian Zhong, Oliver Schaudt","submitted_at":"2017-03-16T15:57:37Z","abstract_excerpt":"A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the case when $H$ is connected. This solves a problem posed by Golovach et al. As a second result, we characterize all graphs $H$ for which there are only finitely many $H$-free minimal obstructions for list 3-colorability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05684","kind":"arxiv","version":4},"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-18T00:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcunXAng10IAx6oKGaKb11oCr7yeRE7Ndw19ccmg4MAe1AKBtMB3jWWhGVG61tWfHCXueoQV+Prb4lbDvDeyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:36.504397Z"},"content_sha256":"5ead9631494f91b52387981a56cafa1c13fe1932084478fa999cdca284a823c5","schema_version":"1.0","event_id":"sha256:5ead9631494f91b52387981a56cafa1c13fe1932084478fa999cdca284a823c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5VG2R6IMGWE2BPKM543PEX3PF/bundle.json","state_url":"https://pith.science/pith/W5VG2R6IMGWE2BPKM543PEX3PF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5VG2R6IMGWE2BPKM543PEX3PF/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-05-31T05:08:36Z","links":{"resolver":"https://pith.science/pith/W5VG2R6IMGWE2BPKM543PEX3PF","bundle":"https://pith.science/pith/W5VG2R6IMGWE2BPKM543PEX3PF/bundle.json","state":"https://pith.science/pith/W5VG2R6IMGWE2BPKM543PEX3PF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5VG2R6IMGWE2BPKM543PEX3PF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W5VG2R6IMGWE2BPKM543PEX3PF","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":"97b769fd27f4bdeea925c94e0b0ac3c36347f955af84155794ba4db7bcb2c4e8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-16T15:57:37Z","title_canon_sha256":"60cc1416d8eb9af4b4e17973104aac697c770b5079742cdc725e33c6d3ca8bba"},"schema_version":"1.0","source":{"id":"1703.05684","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05684","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05684v4","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05684","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"W5VG2R6IMGWE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5VG2R6IMGWE2BPK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5VG2R6I","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:5ead9631494f91b52387981a56cafa1c13fe1932084478fa999cdca284a823c5","target":"graph","created_at":"2026-05-18T00:24:10Z","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":"A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the case when $H$ is connected. This solves a problem posed by Golovach et al. As a second result, we characterize all graphs $H$ for which there are only finitely many $H$-free minimal obstructions for list 3-colorability.","authors_text":"Jan Goedgebeur, Maria Chudnovsky, Mingxian Zhong, Oliver Schaudt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-16T15:57:37Z","title":"Obstructions for three-coloring and list three-coloring $H$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05684","kind":"arxiv","version":4},"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:1a72e8f334c040c52b9dbde8ed2d0dc848c2474f9bc54964063cb762e9212bc0","target":"record","created_at":"2026-05-18T00:24:10Z","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":"97b769fd27f4bdeea925c94e0b0ac3c36347f955af84155794ba4db7bcb2c4e8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-16T15:57:37Z","title_canon_sha256":"60cc1416d8eb9af4b4e17973104aac697c770b5079742cdc725e33c6d3ca8bba"},"schema_version":"1.0","source":{"id":"1703.05684","kind":"arxiv","version":4}},"canonical_sha256":"b76a6d47c861ac4d05ea6779b792fb797fded88848e10c7b71b47ae98668d43d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76a6d47c861ac4d05ea6779b792fb797fded88848e10c7b71b47ae98668d43d","first_computed_at":"2026-05-18T00:24:10.327524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:10.327524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uixkhgUaIOv+tjNKWIRj51xm6orddfb+aTzccUmFXygiQkURliqOCffxk5DyPXknLjkTlFv5DKsto4HfdAYnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:10.328205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05684","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a72e8f334c040c52b9dbde8ed2d0dc848c2474f9bc54964063cb762e9212bc0","sha256:5ead9631494f91b52387981a56cafa1c13fe1932084478fa999cdca284a823c5"],"state_sha256":"42a3ff5392bce289bbb3235cbde233dd8adebbfe5742b7936cae686477d7cc4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2G+iaEwziCv6ejRDUot8P2UoN/hAVooSwf7A+ErgIaCGCMwbKyaTRjY1HPu0Xb7XZt/1WBu6FaCqcumNnHPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:08:36.507355Z","bundle_sha256":"b3b9d7414c414ee228d8a82086e104dd3dd0b810b2dc8b55e264b81777531ab8"}}