{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SKYQ4HTTMPZ6RSDDX7VS7SZ3BC","short_pith_number":"pith:SKYQ4HTT","canonical_record":{"source":{"id":"2308.08768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-17T03:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"adb1c9bbef6b29679419af053f91d40cfdb09d73fd6dbec24c130185e34d4337","abstract_canon_sha256":"ca9c7b42ebe5b5592dd348cbf202b2aba74a7916c45a8f2eaeb1944a60e1e17f"},"schema_version":"1.0"},"canonical_sha256":"92b10e1e7363f3e8c863bfeb2fcb3b08a269578542148028ebbb4f741c613fe2","source":{"kind":"arxiv","id":"2308.08768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.08768","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"2308.08768v1","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08768","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"SKYQ4HTTMPZ6","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_16","alias_value":"SKYQ4HTTMPZ6RSDD","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_8","alias_value":"SKYQ4HTT","created_at":"2026-07-05T06:42:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SKYQ4HTTMPZ6RSDDX7VS7SZ3BC","target":"record","payload":{"canonical_record":{"source":{"id":"2308.08768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-17T03:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"adb1c9bbef6b29679419af053f91d40cfdb09d73fd6dbec24c130185e34d4337","abstract_canon_sha256":"ca9c7b42ebe5b5592dd348cbf202b2aba74a7916c45a8f2eaeb1944a60e1e17f"},"schema_version":"1.0"},"canonical_sha256":"92b10e1e7363f3e8c863bfeb2fcb3b08a269578542148028ebbb4f741c613fe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:11.009518Z","signature_b64":"eExJn2hJuPUaNlr0lTTBR8logbXBcs9O3TO7Rbt9Yq3ofDBIXe+TuaPAsynyVD1AcyW54LcUpG8Yni3RIBpvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b10e1e7363f3e8c863bfeb2fcb3b08a269578542148028ebbb4f741c613fe2","last_reissued_at":"2026-07-05T06:42:11.009099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:11.009099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.08768","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-07-05T06:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vok7qCDgQBAFtY3twTDB3OuN28s4figNnJZvj/lclkqI8dmQSnc9/538TJw4Tua5mQmIKN8OflwLaxho3OnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:21:26.524380Z"},"content_sha256":"9e39e11d6362c36a74faf747b149817f4e0f7d4e0f47889d507330f4f9518fd8","schema_version":"1.0","event_id":"sha256:9e39e11d6362c36a74faf747b149817f4e0f7d4e0f47889d507330f4f9518fd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SKYQ4HTTMPZ6RSDDX7VS7SZ3BC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tight linear chromatic bound for ($P_3\\cup P_2, W_4$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Jinfeng Li, Rui Li","submitted_at":"2023-08-17T03:51:53Z","abstract_excerpt":"For two vertex disjoint graphs $H$ and $F$, we use $H\\cup F$ to denote the graph with vertex set $V(H)\\cup V(F)$ and edge set $E(H)\\cup E(F)$, and use $H+F$ to denote the graph with vertex set $V(H)\\cup V(F)$ and edge set $E(H)\\cup E(F)\\cup\\{xy\\;|\\; x\\in V(H), y\\in V(F)$$\\}$. A $W_4$ is the graph $K_1+C_4$. In this paper, we prove that $\\chi(G)\\le 2\\omega(G)$ if $G$ is a ($P_3\\cup P_2, W_4$)-free graph. This bound is tight when $\\omega =2$ and $3$, and improves the main result of Wang and Zhang. Also, this bound partially generalizes some results of Prashant {\\em et al.}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08768","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.08768/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvtofa2q/j4ksDpIr90vcs1WHbq2kWdFosXyYi8AkNnFsgRXGwmhLNvviaWUub1FwAp4eNELRNxICBmpXeMDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:21:26.524901Z"},"content_sha256":"f84f9617c02a8621a270946e0c30de313773ca47eee48c37bb0cb050aa147358","schema_version":"1.0","event_id":"sha256:f84f9617c02a8621a270946e0c30de313773ca47eee48c37bb0cb050aa147358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/bundle.json","state_url":"https://pith.science/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/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-08-12T22:21:26Z","links":{"resolver":"https://pith.science/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC","bundle":"https://pith.science/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/bundle.json","state":"https://pith.science/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKYQ4HTTMPZ6RSDDX7VS7SZ3BC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SKYQ4HTTMPZ6RSDDX7VS7SZ3BC","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":"ca9c7b42ebe5b5592dd348cbf202b2aba74a7916c45a8f2eaeb1944a60e1e17f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-17T03:51:53Z","title_canon_sha256":"adb1c9bbef6b29679419af053f91d40cfdb09d73fd6dbec24c130185e34d4337"},"schema_version":"1.0","source":{"id":"2308.08768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.08768","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"2308.08768v1","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08768","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"SKYQ4HTTMPZ6","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_16","alias_value":"SKYQ4HTTMPZ6RSDD","created_at":"2026-07-05T06:42:11Z"},{"alias_kind":"pith_short_8","alias_value":"SKYQ4HTT","created_at":"2026-07-05T06:42:11Z"}],"graph_snapshots":[{"event_id":"sha256:f84f9617c02a8621a270946e0c30de313773ca47eee48c37bb0cb050aa147358","target":"graph","created_at":"2026-07-05T06:42:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.08768/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For two vertex disjoint graphs $H$ and $F$, we use $H\\cup F$ to denote the graph with vertex set $V(H)\\cup V(F)$ and edge set $E(H)\\cup E(F)$, and use $H+F$ to denote the graph with vertex set $V(H)\\cup V(F)$ and edge set $E(H)\\cup E(F)\\cup\\{xy\\;|\\; x\\in V(H), y\\in V(F)$$\\}$. A $W_4$ is the graph $K_1+C_4$. In this paper, we prove that $\\chi(G)\\le 2\\omega(G)$ if $G$ is a ($P_3\\cup P_2, W_4$)-free graph. This bound is tight when $\\omega =2$ and $3$, and improves the main result of Wang and Zhang. Also, this bound partially generalizes some results of Prashant {\\em et al.}.","authors_text":"Di Wu, Jinfeng Li, Rui Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-17T03:51:53Z","title":"A tight linear chromatic bound for ($P_3\\cup P_2, W_4$)-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08768","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:9e39e11d6362c36a74faf747b149817f4e0f7d4e0f47889d507330f4f9518fd8","target":"record","created_at":"2026-07-05T06:42:11Z","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":"ca9c7b42ebe5b5592dd348cbf202b2aba74a7916c45a8f2eaeb1944a60e1e17f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-17T03:51:53Z","title_canon_sha256":"adb1c9bbef6b29679419af053f91d40cfdb09d73fd6dbec24c130185e34d4337"},"schema_version":"1.0","source":{"id":"2308.08768","kind":"arxiv","version":1}},"canonical_sha256":"92b10e1e7363f3e8c863bfeb2fcb3b08a269578542148028ebbb4f741c613fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b10e1e7363f3e8c863bfeb2fcb3b08a269578542148028ebbb4f741c613fe2","first_computed_at":"2026-07-05T06:42:11.009099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:42:11.009099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eExJn2hJuPUaNlr0lTTBR8logbXBcs9O3TO7Rbt9Yq3ofDBIXe+TuaPAsynyVD1AcyW54LcUpG8Yni3RIBpvDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:42:11.009518Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.08768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e39e11d6362c36a74faf747b149817f4e0f7d4e0f47889d507330f4f9518fd8","sha256:f84f9617c02a8621a270946e0c30de313773ca47eee48c37bb0cb050aa147358"],"state_sha256":"7712ec6700a8951fb0f5c54f860c06e9db39f7a1007b62a8830bbb2b848d2c01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/REeWX31CNEopLY/eV4ZVCXHLTsAY3QNhhLXyCN5vDphDBfJGGMGEODScL3mdcDJIpeHrjmQxwrpPHyIEwRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:21:26.528546Z","bundle_sha256":"60b0a354a39f9a4396bfe330ecf0015387646c8d3bcf9e435533e75a8d3c82ee"}}