{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HGWF3AWXE4BDAR5ILCI6QQFELE","short_pith_number":"pith:HGWF3AWX","canonical_record":{"source":{"id":"1805.11437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T14:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"e8c581894a3702e7e098875d1b40520ac3aeaaa7e0c5e7623c2609bb62d5753e","abstract_canon_sha256":"2709957cab4d161f836f61abfa0958903000307c66dab0a1d5c1a03b43bc68d0"},"schema_version":"1.0"},"canonical_sha256":"39ac5d82d727023047a85891e840a45903616896ef288a6c56c339421b0cbecb","source":{"kind":"arxiv","id":"1805.11437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11437","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11437v1","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11437","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"HGWF3AWXE4BD","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HGWF3AWXE4BDAR5I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HGWF3AWX","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HGWF3AWXE4BDAR5ILCI6QQFELE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T14:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"e8c581894a3702e7e098875d1b40520ac3aeaaa7e0c5e7623c2609bb62d5753e","abstract_canon_sha256":"2709957cab4d161f836f61abfa0958903000307c66dab0a1d5c1a03b43bc68d0"},"schema_version":"1.0"},"canonical_sha256":"39ac5d82d727023047a85891e840a45903616896ef288a6c56c339421b0cbecb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:42.561216Z","signature_b64":"HIz2cPhm8auL2O46t8O1Mx0f3WMn9dilqgBH5JscS72B8Khu/lJrC8Sc7x2ABAjsv5BzA4W1otAX80xzBc5UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ac5d82d727023047a85891e840a45903616896ef288a6c56c339421b0cbecb","last_reissued_at":"2026-05-18T00:14:42.560627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:42.560627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11437","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-18T00:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBKxa0488SoxMsk+1VMDyCjBEMx70G+GGEG74K/JnHin3nsR6QJcIHKzrebLpxAI8Mbilz18FgVFm2daYvg4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:38:49.554554Z"},"content_sha256":"d32be9d729eb2c5b0a543e93bd87b82e0d286b49d73f4536847ef063409e6d64","schema_version":"1.0","event_id":"sha256:d32be9d729eb2c5b0a543e93bd87b82e0d286b49d73f4536847ef063409e6d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HGWF3AWXE4BDAR5ILCI6QQFELE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Lov\\'asz Tihany Conjecture for graphs with forbidden holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zi-Xia Song","submitted_at":"2018-05-27T14:05:48Z","abstract_excerpt":"A hole in a graph is an induced cycle of length at least $4$. Let $s\\ge2$ and $t\\ge2$ be integers. A graph $G$ is $(s,t)$-splittable if $V(G)$ can be partitioned into two sets $S$ and $T$ such that $\\chi(G[S ]) \\ge s$ and $\\chi(G[T ]) \\ge t$. The well-known Erd\\H{o}s-Lov\\'asz Tihany Conjecture from 1968 states that every graph $G$ with $\\omega(G) < \\chi(G) = s + t - 1$ is $(s,t)$-splittable. This conjecture is hard, and few related results are known. However, it has been verified to be true for line graphs, quasi-line graphs, and graphs with independence number $2$. In this paper, we establish"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11437","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-18T00:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CkNCGgs3r95uYQlhyPDqs/AGQMgeaNUP6vEgrIjcfB7dse2B20mmDXQMsSBPeVK0h2onvK675oc/xcmGLrjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:38:49.554905Z"},"content_sha256":"77b23708af211023dec8babf66b2b332f17d2e156a51e6808c27c32947572ccb","schema_version":"1.0","event_id":"sha256:77b23708af211023dec8babf66b2b332f17d2e156a51e6808c27c32947572ccb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/bundle.json","state_url":"https://pith.science/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/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-03T01:38:49Z","links":{"resolver":"https://pith.science/pith/HGWF3AWXE4BDAR5ILCI6QQFELE","bundle":"https://pith.science/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/bundle.json","state":"https://pith.science/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGWF3AWXE4BDAR5ILCI6QQFELE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HGWF3AWXE4BDAR5ILCI6QQFELE","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":"2709957cab4d161f836f61abfa0958903000307c66dab0a1d5c1a03b43bc68d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T14:05:48Z","title_canon_sha256":"e8c581894a3702e7e098875d1b40520ac3aeaaa7e0c5e7623c2609bb62d5753e"},"schema_version":"1.0","source":{"id":"1805.11437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11437","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11437v1","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11437","created_at":"2026-05-18T00:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"HGWF3AWXE4BD","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HGWF3AWXE4BDAR5I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HGWF3AWX","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:77b23708af211023dec8babf66b2b332f17d2e156a51e6808c27c32947572ccb","target":"graph","created_at":"2026-05-18T00:14: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":"A hole in a graph is an induced cycle of length at least $4$. Let $s\\ge2$ and $t\\ge2$ be integers. A graph $G$ is $(s,t)$-splittable if $V(G)$ can be partitioned into two sets $S$ and $T$ such that $\\chi(G[S ]) \\ge s$ and $\\chi(G[T ]) \\ge t$. The well-known Erd\\H{o}s-Lov\\'asz Tihany Conjecture from 1968 states that every graph $G$ with $\\omega(G) < \\chi(G) = s + t - 1$ is $(s,t)$-splittable. This conjecture is hard, and few related results are known. However, it has been verified to be true for line graphs, quasi-line graphs, and graphs with independence number $2$. In this paper, we establish","authors_text":"Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T14:05:48Z","title":"Erd\\H{o}s-Lov\\'asz Tihany Conjecture for graphs with forbidden holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11437","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:d32be9d729eb2c5b0a543e93bd87b82e0d286b49d73f4536847ef063409e6d64","target":"record","created_at":"2026-05-18T00:14: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":"2709957cab4d161f836f61abfa0958903000307c66dab0a1d5c1a03b43bc68d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T14:05:48Z","title_canon_sha256":"e8c581894a3702e7e098875d1b40520ac3aeaaa7e0c5e7623c2609bb62d5753e"},"schema_version":"1.0","source":{"id":"1805.11437","kind":"arxiv","version":1}},"canonical_sha256":"39ac5d82d727023047a85891e840a45903616896ef288a6c56c339421b0cbecb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39ac5d82d727023047a85891e840a45903616896ef288a6c56c339421b0cbecb","first_computed_at":"2026-05-18T00:14:42.560627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:42.560627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIz2cPhm8auL2O46t8O1Mx0f3WMn9dilqgBH5JscS72B8Khu/lJrC8Sc7x2ABAjsv5BzA4W1otAX80xzBc5UCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:42.561216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d32be9d729eb2c5b0a543e93bd87b82e0d286b49d73f4536847ef063409e6d64","sha256:77b23708af211023dec8babf66b2b332f17d2e156a51e6808c27c32947572ccb"],"state_sha256":"8a45dc2984eda430b19b99ed694e340e5fe14da1a230de5704c30c7a3eef147f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQIsQVIDra+FRfnnau7Wgby8jeZMR+2m8zudk7gHA197upR4fBvtwsKn4PmGnWrxtwwv/9KTIm9+yDUcuyQWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:38:49.556851Z","bundle_sha256":"ab7e12da051cc6f6ef1973414545888a7c5cc64bad54b149f1c55ce43bd0102a"}}