{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ENRZGDY5NHEF6GDVBQ4QSKTHE7","short_pith_number":"pith:ENRZGDY5","schema_version":"1.0","canonical_sha256":"2363930f1d69c85f18750c39092a6727e22c90a8e0012f163699b9695728814d","source":{"kind":"arxiv","id":"2504.04496","version":1},"attestation_state":"computed","paper":{"title":"Trisimplicial vertices in (fork, odd parachute)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Feng Liu, Kaiyang Lan, Yidong Zhou","submitted_at":"2025-04-06T14:10:11Z","abstract_excerpt":"An {\\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new edge $uv$ such that $x$ is adjacent to $u$ but not to $v$ for each $x\\in V(H)$. A graph $G$ is perfectly divisible if for each induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\\omega(H[B])<\\omega(H)$. A vertex of a graph is {\\em trisimplicial} if its neighbourhood is the union of three cliques. In this paper, we prove that $\\chi(G)\\leq \\binom{\\omega(G)+1}{2}$ if $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.04496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-06T14:10:11Z","cross_cats_sorted":[],"title_canon_sha256":"a1827c18639a783df2b1b484aaa5eafe359273b9c006bf5f99a1dad6a4ad7800","abstract_canon_sha256":"67210f165ab9e6b9b21a4b3b872b66d7194773314321ea7156d0f29c8588ac8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:24.912186Z","signature_b64":"+CHXK1dHkakv1/TzKC3jhE6yquDR3pkGvBhhd/WvVNTaJGLtrUmh4iuQ3WiUnPd72bFjYSk9VJTPA6SSa8MkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2363930f1d69c85f18750c39092a6727e22c90a8e0012f163699b9695728814d","last_reissued_at":"2026-07-05T10:45:24.911401Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:24.911401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trisimplicial vertices in (fork, odd parachute)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Di Wu, Feng Liu, Kaiyang Lan, Yidong Zhou","submitted_at":"2025-04-06T14:10:11Z","abstract_excerpt":"An {\\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new edge $uv$ such that $x$ is adjacent to $u$ but not to $v$ for each $x\\in V(H)$. A graph $G$ is perfectly divisible if for each induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\\omega(H[B])<\\omega(H)$. A vertex of a graph is {\\em trisimplicial} if its neighbourhood is the union of three cliques. In this paper, we prove that $\\chi(G)\\leq \\binom{\\omega(G)+1}{2}$ if $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04496","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/2504.04496/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.04496","created_at":"2026-07-05T10:45:24.911502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04496v1","created_at":"2026-07-05T10:45:24.911502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04496","created_at":"2026-07-05T10:45:24.911502+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENRZGDY5NHEF","created_at":"2026-07-05T10:45:24.911502+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENRZGDY5NHEF6GDV","created_at":"2026-07-05T10:45:24.911502+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENRZGDY5","created_at":"2026-07-05T10:45:24.911502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7","json":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7.json","graph_json":"https://pith.science/api/pith-number/ENRZGDY5NHEF6GDVBQ4QSKTHE7/graph.json","events_json":"https://pith.science/api/pith-number/ENRZGDY5NHEF6GDVBQ4QSKTHE7/events.json","paper":"https://pith.science/paper/ENRZGDY5"},"agent_actions":{"view_html":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7","download_json":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7.json","view_paper":"https://pith.science/paper/ENRZGDY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04496&json=true","fetch_graph":"https://pith.science/api/pith-number/ENRZGDY5NHEF6GDVBQ4QSKTHE7/graph.json","fetch_events":"https://pith.science/api/pith-number/ENRZGDY5NHEF6GDVBQ4QSKTHE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7/action/storage_attestation","attest_author":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7/action/author_attestation","sign_citation":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7/action/citation_signature","submit_replication":"https://pith.science/pith/ENRZGDY5NHEF6GDVBQ4QSKTHE7/action/replication_record"}},"created_at":"2026-07-05T10:45:24.911502+00:00","updated_at":"2026-07-05T10:45:24.911502+00:00"}