{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QOZW3G37J6B2ORHQGCVG3AZULW","short_pith_number":"pith:QOZW3G37","canonical_record":{"source":{"id":"1406.3812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a74e75553f722fbab045c825c201cdae29e9dc56aa526bab816c19100f70dec","abstract_canon_sha256":"8ad7590696ae514e1937bb5664d099049451bc02e87abb91b15b8857c4b5809d"},"schema_version":"1.0"},"canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","source":{"kind":"arxiv","id":"1406.3812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3812","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3812v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3812","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"QOZW3G37J6B2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOZW3G37J6B2ORHQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOZW3G37","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QOZW3G37J6B2ORHQGCVG3AZULW","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a74e75553f722fbab045c825c201cdae29e9dc56aa526bab816c19100f70dec","abstract_canon_sha256":"8ad7590696ae514e1937bb5664d099049451bc02e87abb91b15b8857c4b5809d"},"schema_version":"1.0"},"canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.684989Z","signature_b64":"uAroKngK863PUW3WfXizYBvd/4BoEBC//laimsLITvdJCrDURrNDyc78n2SXi4fdUGVhj5bsDQ0DQf6tMBCUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","last_reissued_at":"2026-05-18T02:49:39.684670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.684670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3812","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KT6X1m05yrT71oBkhwWDCe+IoQRj7I0QUr71ZbFIhX7yEL0f+Uh3PMkpj7eLHCj9HtWrx5n+Swc4n+h9Ea5WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:50:05.453559Z"},"content_sha256":"6fdd26c3da9b8153c12f3ee09c731d991d385355760e3648092bded46a45926f","schema_version":"1.0","event_id":"sha256:6fdd26c3da9b8153c12f3ee09c731d991d385355760e3648092bded46a45926f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QOZW3G37J6B2ORHQGCVG3AZULW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hadwiger number of graphs with small chordality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Petr A. Golovach, Pim van 't Hof, Pinar Heggernes","submitted_at":"2014-06-15T13:08:56Z","abstract_excerpt":"The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer h such that G has a minor with h vertices and diameter at most $s$. We show that this problem can be solved in polynomial time on AT-free graphs when s>=2, but is NP-hard on chordal graphs for every fixed s>"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3812","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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPtco7ialXhiogogYCiV8xRKObgQOmOofMlr26RkLJW62ne334yVX0M1PlAJqLMHEXme1PHyXM7Vo2FbFcXVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:50:05.454182Z"},"content_sha256":"35ffca5200d26ba994db00d5463db0f050d4001607ddfad9871abbfe82ff82ec","schema_version":"1.0","event_id":"sha256:35ffca5200d26ba994db00d5463db0f050d4001607ddfad9871abbfe82ff82ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/bundle.json","state_url":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOZW3G37J6B2ORHQGCVG3AZULW/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-26T04:50:05Z","links":{"resolver":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW","bundle":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/bundle.json","state":"https://pith.science/pith/QOZW3G37J6B2ORHQGCVG3AZULW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOZW3G37J6B2ORHQGCVG3AZULW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QOZW3G37J6B2ORHQGCVG3AZULW","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":"8ad7590696ae514e1937bb5664d099049451bc02e87abb91b15b8857c4b5809d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","title_canon_sha256":"7a74e75553f722fbab045c825c201cdae29e9dc56aa526bab816c19100f70dec"},"schema_version":"1.0","source":{"id":"1406.3812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3812","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3812v1","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3812","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"QOZW3G37J6B2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOZW3G37J6B2ORHQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOZW3G37","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:35ffca5200d26ba994db00d5463db0f050d4001607ddfad9871abbfe82ff82ec","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in polynomial time on cographs and on bipartite permutation graphs. We also consider a natural generalization of this problem that asks for the largest integer h such that G has a minor with h vertices and diameter at most $s$. We show that this problem can be solved in polynomial time on AT-free graphs when s>=2, but is NP-hard on chordal graphs for every fixed s>","authors_text":"Christophe Paul, Petr A. Golovach, Pim van 't Hof, Pinar Heggernes","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","title":"Hadwiger number of graphs with small chordality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3812","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:6fdd26c3da9b8153c12f3ee09c731d991d385355760e3648092bded46a45926f","target":"record","created_at":"2026-05-18T02:49:39Z","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":"8ad7590696ae514e1937bb5664d099049451bc02e87abb91b15b8857c4b5809d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-15T13:08:56Z","title_canon_sha256":"7a74e75553f722fbab045c825c201cdae29e9dc56aa526bab816c19100f70dec"},"schema_version":"1.0","source":{"id":"1406.3812","kind":"arxiv","version":1}},"canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b36d9b7f4f83a744f030aa6d83345db5af16a71d9374ad1f3a69e2d550e205","first_computed_at":"2026-05-18T02:49:39.684670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.684670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uAroKngK863PUW3WfXizYBvd/4BoEBC//laimsLITvdJCrDURrNDyc78n2SXi4fdUGVhj5bsDQ0DQf6tMBCUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.684989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fdd26c3da9b8153c12f3ee09c731d991d385355760e3648092bded46a45926f","sha256:35ffca5200d26ba994db00d5463db0f050d4001607ddfad9871abbfe82ff82ec"],"state_sha256":"cfd1a3b496475596cbed7c45513bc79ce4462e93f7bcac939aad3feaa93c275b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DL+Lncl5xQmxgYbxwXIMXltqc8loEsGhJ730hmOArBfIZWiBoLvFMRUvnumgFvFLlVBwnfG6w3H9Oo6fYluqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:50:05.457390Z","bundle_sha256":"5ba1f189b12f8557baded51526eeafccb00fb1d4df47fca7e5464a48368cdf6b"}}