{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B2AI25UEE7U5JERVE2FHYO726S","short_pith_number":"pith:B2AI25UE","canonical_record":{"source":{"id":"1809.04278","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T07:04:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0cbd89a13327edec52b203e07c93ba34edea00da918f677c95a779a2a026704c","abstract_canon_sha256":"58521329dd1612a6d9ef42f0c32c29417ac1f8586f727615b130e1ddfd4d096e"},"schema_version":"1.0"},"canonical_sha256":"0e808d768427e9d49235268a7c3bfaf4855a536a6143fe10f28bfbbd91cd86be","source":{"kind":"arxiv","id":"1809.04278","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04278","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04278v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04278","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"B2AI25UEE7U5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2AI25UEE7U5JERV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2AI25UE","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B2AI25UEE7U5JERVE2FHYO726S","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04278","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T07:04:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0cbd89a13327edec52b203e07c93ba34edea00da918f677c95a779a2a026704c","abstract_canon_sha256":"58521329dd1612a6d9ef42f0c32c29417ac1f8586f727615b130e1ddfd4d096e"},"schema_version":"1.0"},"canonical_sha256":"0e808d768427e9d49235268a7c3bfaf4855a536a6143fe10f28bfbbd91cd86be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.675205Z","signature_b64":"k203UsMhestqsaSegRcbzwOwBsvFtt4jcItyG+NSuJpPJ2wwpakUV2u7VKpNKoAaUsLA26RNev//QwwMKPvCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e808d768427e9d49235268a7c3bfaf4855a536a6143fe10f28bfbbd91cd86be","last_reissued_at":"2026-05-17T23:43:23.674448Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.674448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04278","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-17T23:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yyW0kCHZUYINHNC4sx+CEuqROZCglZAZQQSvxpDX9itsizpj2kKQAq1kWU4BKbyhJm20pChAtIFIPvT020gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:59:34.951969Z"},"content_sha256":"a9c5f69285d75985b1a4bfad345c2c4c91d09c77073c71f219e33cd03e739af3","schema_version":"1.0","event_id":"sha256:a9c5f69285d75985b1a4bfad345c2c4c91d09c77073c71f219e33cd03e739af3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B2AI25UEE7U5JERVE2FHYO726S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classes of graphs with no long cycle as a vertex-minor are polynomially $\\chi$-bounded","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"O-joung Kwon, Ringi Kim, Sang-il Oum, Vaidy Sivaraman","submitted_at":"2018-09-12T07:04:53Z","abstract_excerpt":"A class $\\mathcal G$ of graphs is $\\chi$-bounded if there is a function $f$ such that for every graph $G\\in \\mathcal G$ and every induced subgraph $H$ of $G$, $\\chi(H)\\le f(\\omega(H))$. In addition, we say that $\\mathcal G$ is polynomially $\\chi$-bounded if $f$ can be taken as a polynomial function. We prove that for every integer $n\\ge3$, there exists a polynomial $f$ such that $\\chi(G)\\le f(\\omega(G))$ for all graphs with no vertex-minor isomorphic to the cycle graph $C_n$. To prove this, we show that if $\\mathcal G$ is polynomially $\\chi$-bounded, then so is the closure of $\\mathcal G$ unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04278","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-17T23:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ky1vCQAeeqEsI6dI6+L5HuPgCWRkP252n9pDeSZ35s1DKH7B/CGoyzzgF5hXKnbF7aFP8ePziNjShqoKBr1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:59:34.952758Z"},"content_sha256":"45034954c9639a97d9c1c30d1fda548d5d5926673954d8a8c0f6d7852d31f938","schema_version":"1.0","event_id":"sha256:45034954c9639a97d9c1c30d1fda548d5d5926673954d8a8c0f6d7852d31f938"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2AI25UEE7U5JERVE2FHYO726S/bundle.json","state_url":"https://pith.science/pith/B2AI25UEE7U5JERVE2FHYO726S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2AI25UEE7U5JERVE2FHYO726S/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-10T22:59:34Z","links":{"resolver":"https://pith.science/pith/B2AI25UEE7U5JERVE2FHYO726S","bundle":"https://pith.science/pith/B2AI25UEE7U5JERVE2FHYO726S/bundle.json","state":"https://pith.science/pith/B2AI25UEE7U5JERVE2FHYO726S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2AI25UEE7U5JERVE2FHYO726S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B2AI25UEE7U5JERVE2FHYO726S","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":"58521329dd1612a6d9ef42f0c32c29417ac1f8586f727615b130e1ddfd4d096e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T07:04:53Z","title_canon_sha256":"0cbd89a13327edec52b203e07c93ba34edea00da918f677c95a779a2a026704c"},"schema_version":"1.0","source":{"id":"1809.04278","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04278","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04278v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04278","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"B2AI25UEE7U5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2AI25UEE7U5JERV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2AI25UE","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:45034954c9639a97d9c1c30d1fda548d5d5926673954d8a8c0f6d7852d31f938","target":"graph","created_at":"2026-05-17T23:43:23Z","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 class $\\mathcal G$ of graphs is $\\chi$-bounded if there is a function $f$ such that for every graph $G\\in \\mathcal G$ and every induced subgraph $H$ of $G$, $\\chi(H)\\le f(\\omega(H))$. In addition, we say that $\\mathcal G$ is polynomially $\\chi$-bounded if $f$ can be taken as a polynomial function. We prove that for every integer $n\\ge3$, there exists a polynomial $f$ such that $\\chi(G)\\le f(\\omega(G))$ for all graphs with no vertex-minor isomorphic to the cycle graph $C_n$. To prove this, we show that if $\\mathcal G$ is polynomially $\\chi$-bounded, then so is the closure of $\\mathcal G$ unde","authors_text":"O-joung Kwon, Ringi Kim, Sang-il Oum, Vaidy Sivaraman","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T07:04:53Z","title":"Classes of graphs with no long cycle as a vertex-minor are polynomially $\\chi$-bounded"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04278","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:a9c5f69285d75985b1a4bfad345c2c4c91d09c77073c71f219e33cd03e739af3","target":"record","created_at":"2026-05-17T23:43:23Z","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":"58521329dd1612a6d9ef42f0c32c29417ac1f8586f727615b130e1ddfd4d096e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-12T07:04:53Z","title_canon_sha256":"0cbd89a13327edec52b203e07c93ba34edea00da918f677c95a779a2a026704c"},"schema_version":"1.0","source":{"id":"1809.04278","kind":"arxiv","version":3}},"canonical_sha256":"0e808d768427e9d49235268a7c3bfaf4855a536a6143fe10f28bfbbd91cd86be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e808d768427e9d49235268a7c3bfaf4855a536a6143fe10f28bfbbd91cd86be","first_computed_at":"2026-05-17T23:43:23.674448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:23.674448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k203UsMhestqsaSegRcbzwOwBsvFtt4jcItyG+NSuJpPJ2wwpakUV2u7VKpNKoAaUsLA26RNev//QwwMKPvCCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:23.675205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04278","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9c5f69285d75985b1a4bfad345c2c4c91d09c77073c71f219e33cd03e739af3","sha256:45034954c9639a97d9c1c30d1fda548d5d5926673954d8a8c0f6d7852d31f938"],"state_sha256":"8f1f711a410185c0b942ced04798913a37d2c8ec4188a4b2a7c8f951d5223653"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtL/FO7NPLdGdZGjcdGl6QkhfZ0cay4+TNhU0zkPp47JBysm7ZUh3d+XsTRzzQ91qggRtyo5wyLiCosJYITBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:59:34.956809Z","bundle_sha256":"903431bf71f61fee54ae412cb758792ffd333d46bfb3f907ca0f5c143b5d634c"}}