{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MGYCD3MRQ5YWGIJXY2JYY7PSV3","short_pith_number":"pith:MGYCD3MR","canonical_record":{"source":{"id":"1508.01396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T13:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"6bb74daf61cd8cc5d3f9bb932aac4735cc39e6b1a448bb14ec13c44198253723","abstract_canon_sha256":"fc00c65573bc553e25933d161ca4938b1911dd54a1e20f03642e8e6e2cc7908d"},"schema_version":"1.0"},"canonical_sha256":"61b021ed918771632137c6938c7df2aecdb17f49307dcdcf302520596ae928d0","source":{"kind":"arxiv","id":"1508.01396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01396","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01396v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01396","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"MGYCD3MRQ5YW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MGYCD3MRQ5YWGIJX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MGYCD3MR","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MGYCD3MRQ5YWGIJXY2JYY7PSV3","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T13:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"6bb74daf61cd8cc5d3f9bb932aac4735cc39e6b1a448bb14ec13c44198253723","abstract_canon_sha256":"fc00c65573bc553e25933d161ca4938b1911dd54a1e20f03642e8e6e2cc7908d"},"schema_version":"1.0"},"canonical_sha256":"61b021ed918771632137c6938c7df2aecdb17f49307dcdcf302520596ae928d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:42.728730Z","signature_b64":"2NrdFEMYnb2JERtbdAD1xqacedJsnd/Aww5HJG+Obbfmqc/Q5jUtCRrUuRMl7KfNcRPas77zT4lES3XsaqoqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b021ed918771632137c6938c7df2aecdb17f49307dcdcf302520596ae928d0","last_reissued_at":"2026-05-18T01:35:42.728312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:42.728312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01396","source_version":1,"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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kyWAcjDGxAOCW+4kNuvrR9ABgdgpVYnMZHaAAJ7mCgKVZZXXBtdLynRIFitD19Ih77FVd/pqHuQI4M4FmWlyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:03:02.807770Z"},"content_sha256":"f774a613c3e734f512f73147f6854cbf77c52632324d5fad8c53577ad21f5fd6","schema_version":"1.0","event_id":"sha256:f774a613c3e734f512f73147f6854cbf77c52632324d5fad8c53577ad21f5fd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MGYCD3MRQ5YWGIJXY2JYY7PSV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unique colorability and clique minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell","submitted_at":"2015-08-06T13:45:52Z","abstract_excerpt":"For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of size 1 or 2. Hadwiger's conjecture states that h(G) is at least c(G), where c(G) is the chromatic number of G. Seymour conjectured that s(G) is at least |V(G)|/2 for all graphs without antitriangles, i. e. three pairwise nonadjacent vertices. Here we concentrate on graphs G with exactly one c(G)-coloring. We prove generalizations of (i) if c(G) is at most 6 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01396","kind":"arxiv","version":1},"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:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLc8IIYgR8beEcdDganQR9Wpi3jJyFgylY71TIOiz+pyQ7Vfr0T3KJXlv3DdDp35nP4W82plr1ptD2S5x3aaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:03:02.808115Z"},"content_sha256":"693b19375c9ba244ee523e5dd550d7a3a3e0d6281df4bdbbcbf4d1c845aea4ba","schema_version":"1.0","event_id":"sha256:693b19375c9ba244ee523e5dd550d7a3a3e0d6281df4bdbbcbf4d1c845aea4ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/bundle.json","state_url":"https://pith.science/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/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-22T13:03:02Z","links":{"resolver":"https://pith.science/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3","bundle":"https://pith.science/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/bundle.json","state":"https://pith.science/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGYCD3MRQ5YWGIJXY2JYY7PSV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MGYCD3MRQ5YWGIJXY2JYY7PSV3","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":"fc00c65573bc553e25933d161ca4938b1911dd54a1e20f03642e8e6e2cc7908d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T13:45:52Z","title_canon_sha256":"6bb74daf61cd8cc5d3f9bb932aac4735cc39e6b1a448bb14ec13c44198253723"},"schema_version":"1.0","source":{"id":"1508.01396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01396","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01396v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01396","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"MGYCD3MRQ5YW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MGYCD3MRQ5YWGIJX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MGYCD3MR","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:693b19375c9ba244ee523e5dd550d7a3a3e0d6281df4bdbbcbf4d1c845aea4ba","target":"graph","created_at":"2026-05-18T01:35:42Z","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":"For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected subgraphs of size 1 or 2. Hadwiger's conjecture states that h(G) is at least c(G), where c(G) is the chromatic number of G. Seymour conjectured that s(G) is at least |V(G)|/2 for all graphs without antitriangles, i. e. three pairwise nonadjacent vertices. Here we concentrate on graphs G with exactly one c(G)-coloring. We prove generalizations of (i) if c(G) is at most 6 ","authors_text":"Matthias Kriesell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T13:45:52Z","title":"Unique colorability and clique minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01396","kind":"arxiv","version":1},"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:f774a613c3e734f512f73147f6854cbf77c52632324d5fad8c53577ad21f5fd6","target":"record","created_at":"2026-05-18T01:35:42Z","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":"fc00c65573bc553e25933d161ca4938b1911dd54a1e20f03642e8e6e2cc7908d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T13:45:52Z","title_canon_sha256":"6bb74daf61cd8cc5d3f9bb932aac4735cc39e6b1a448bb14ec13c44198253723"},"schema_version":"1.0","source":{"id":"1508.01396","kind":"arxiv","version":1}},"canonical_sha256":"61b021ed918771632137c6938c7df2aecdb17f49307dcdcf302520596ae928d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61b021ed918771632137c6938c7df2aecdb17f49307dcdcf302520596ae928d0","first_computed_at":"2026-05-18T01:35:42.728312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:42.728312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2NrdFEMYnb2JERtbdAD1xqacedJsnd/Aww5HJG+Obbfmqc/Q5jUtCRrUuRMl7KfNcRPas77zT4lES3XsaqoqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:42.728730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f774a613c3e734f512f73147f6854cbf77c52632324d5fad8c53577ad21f5fd6","sha256:693b19375c9ba244ee523e5dd550d7a3a3e0d6281df4bdbbcbf4d1c845aea4ba"],"state_sha256":"a4bceb7f539d879c5decc1a02fe37b205b4857cfc5b3d3ed9b2968313c2f1c90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6RP1UrhZ+6DVCacSeV/gTDqPtZi3x1ysXNom6g7o6op2e7jHEL8f0pwNABx/lQnW5BnRr6Xv/dzep1Dhb17DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:03:02.810140Z","bundle_sha256":"bc8a252f17082eddf7e39cf5f3083daf0d60b639c178ee7927ecec80ea2f35d4"}}