{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EUGHGNU4L2LKMKYJC7QR3MPKPZ","short_pith_number":"pith:EUGHGNU4","canonical_record":{"source":{"id":"1903.11268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T07:10:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"46857f6ea466049ad8e67c6241213240dd1a0b7b9ad0dcbe7869b7af825dc690","abstract_canon_sha256":"db82d80001ae140a643762a156cf7abad343db6a909b58ff004df1f653ff8b3e"},"schema_version":"1.0"},"canonical_sha256":"250c73369c5e96a62b0917e11db1ea7e7c2de7fc64b0b4c2194a5c1020aefdcd","source":{"kind":"arxiv","id":"1903.11268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11268","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11268v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11268","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"EUGHGNU4L2LK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUGHGNU4L2LKMKYJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUGHGNU4","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EUGHGNU4L2LKMKYJC7QR3MPKPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T07:10:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"46857f6ea466049ad8e67c6241213240dd1a0b7b9ad0dcbe7869b7af825dc690","abstract_canon_sha256":"db82d80001ae140a643762a156cf7abad343db6a909b58ff004df1f653ff8b3e"},"schema_version":"1.0"},"canonical_sha256":"250c73369c5e96a62b0917e11db1ea7e7c2de7fc64b0b4c2194a5c1020aefdcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.713840Z","signature_b64":"hnQMrVBeckG8PpcecaIk+aKmhijj9rKfdYQ1Mrl6hiUedRsPuBycTQ0x+DhJjVgQ7z2VpA2+oCFst7YkKtmgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250c73369c5e96a62b0917e11db1ea7e7c2de7fc64b0b4c2194a5c1020aefdcd","last_reissued_at":"2026-05-17T23:50:03.713333Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.713333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11268","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qmpQVxbFA5P/f7Nl+R9inapL7znBQn8qLOkq/Dvv2Eq6O39GnlC0SoKEV+JuNrWKZUEVeX7BZ6cteHdIvVwbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:06:20.419469Z"},"content_sha256":"ccee843f3aa52afa4fac7fa32f1ab52c80a2b2eda223ff4276547671acbaa82a","schema_version":"1.0","event_id":"sha256:ccee843f3aa52afa4fac7fa32f1ab52c80a2b2eda223ff4276547671acbaa82a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EUGHGNU4L2LKMKYJC7QR3MPKPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On graphs with no induced five-vertex path or paraglider","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Shenwei Huang, T. Karthick","submitted_at":"2019-03-27T07:10:24Z","abstract_excerpt":"Given two graphs $H_1$ and $H_2$, a graph is $(H_1,\\,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. For a positive integer $t$, $P_t$ is the chordless path on $t$ vertices. A paraglider is the graph that consists of a chorless cycle $C_4$ plus a vertex adjacent to three vertices of the $C_4$. In this paper, we study the structure of ($P_5$, paraglider)-free graphs, and show that every such graph $G$ satisfies $\\chi(G)\\le \\lceil \\frac{3}{2}\\omega(G) \\rceil$, where $\\chi(G)$ and $\\omega(G)$ are the chromatic number and clique number of $G$, respectively. Our bound is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11268","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-17T23:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKkTkaQ7DrAeiK0XjVhwS+meH1YzNL625BKuX/usJERqhpzP2Ac/lVqqFjdDZkLs7lWDPK2rg4kKsdt8kc5bAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:06:20.419842Z"},"content_sha256":"817df5f1d36346136135b0ec0af22ca99cf3925064a9cc948455c2d586d98c3b","schema_version":"1.0","event_id":"sha256:817df5f1d36346136135b0ec0af22ca99cf3925064a9cc948455c2d586d98c3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/bundle.json","state_url":"https://pith.science/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/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-31T05:06:20Z","links":{"resolver":"https://pith.science/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ","bundle":"https://pith.science/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/bundle.json","state":"https://pith.science/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUGHGNU4L2LKMKYJC7QR3MPKPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUGHGNU4L2LKMKYJC7QR3MPKPZ","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":"db82d80001ae140a643762a156cf7abad343db6a909b58ff004df1f653ff8b3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T07:10:24Z","title_canon_sha256":"46857f6ea466049ad8e67c6241213240dd1a0b7b9ad0dcbe7869b7af825dc690"},"schema_version":"1.0","source":{"id":"1903.11268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11268","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11268v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11268","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"EUGHGNU4L2LK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EUGHGNU4L2LKMKYJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EUGHGNU4","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:817df5f1d36346136135b0ec0af22ca99cf3925064a9cc948455c2d586d98c3b","target":"graph","created_at":"2026-05-17T23:50:03Z","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":"Given two graphs $H_1$ and $H_2$, a graph is $(H_1,\\,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. For a positive integer $t$, $P_t$ is the chordless path on $t$ vertices. A paraglider is the graph that consists of a chorless cycle $C_4$ plus a vertex adjacent to three vertices of the $C_4$. In this paper, we study the structure of ($P_5$, paraglider)-free graphs, and show that every such graph $G$ satisfies $\\chi(G)\\le \\lceil \\frac{3}{2}\\omega(G) \\rceil$, where $\\chi(G)$ and $\\omega(G)$ are the chromatic number and clique number of $G$, respectively. Our bound is","authors_text":"Shenwei Huang, T. Karthick","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T07:10:24Z","title":"On graphs with no induced five-vertex path or paraglider"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11268","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:ccee843f3aa52afa4fac7fa32f1ab52c80a2b2eda223ff4276547671acbaa82a","target":"record","created_at":"2026-05-17T23:50:03Z","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":"db82d80001ae140a643762a156cf7abad343db6a909b58ff004df1f653ff8b3e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-27T07:10:24Z","title_canon_sha256":"46857f6ea466049ad8e67c6241213240dd1a0b7b9ad0dcbe7869b7af825dc690"},"schema_version":"1.0","source":{"id":"1903.11268","kind":"arxiv","version":1}},"canonical_sha256":"250c73369c5e96a62b0917e11db1ea7e7c2de7fc64b0b4c2194a5c1020aefdcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"250c73369c5e96a62b0917e11db1ea7e7c2de7fc64b0b4c2194a5c1020aefdcd","first_computed_at":"2026-05-17T23:50:03.713333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.713333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hnQMrVBeckG8PpcecaIk+aKmhijj9rKfdYQ1Mrl6hiUedRsPuBycTQ0x+DhJjVgQ7z2VpA2+oCFst7YkKtmgAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.713840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccee843f3aa52afa4fac7fa32f1ab52c80a2b2eda223ff4276547671acbaa82a","sha256:817df5f1d36346136135b0ec0af22ca99cf3925064a9cc948455c2d586d98c3b"],"state_sha256":"8f71ea5595c39c5e584ad12eb9d540454fa08e2cb4be55f0c3d418dc86dce3cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57GZYr9mPlyyJQpxia+YrK42LqH2tTYvh2Tl2AZmCRZPLBQQd1lT7FCzxn0ot2T8IGn31bKr12XRBmfXGobVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:06:20.423125Z","bundle_sha256":"e6f48135dc4e24bf7c27355fb08a2f81b171e63169ba195bca79063e67264a36"}}