{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FX4UBK2YQT6I5TLBT6BEZWGHQD","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":"78149f3d243cdb6392cbb129c6a47de7da08ab6195467014a6e29bc8742980b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T05:08:16Z","title_canon_sha256":"fc587ed95194a753fc7a46aa61abb49f9f98b159ee9104b1b7d29bb3ec78c688"},"schema_version":"1.0","source":{"id":"2504.14863","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.14863","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"2504.14863v2","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14863","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"FX4UBK2YQT6I","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_16","alias_value":"FX4UBK2YQT6I5TLB","created_at":"2026-07-05T10:52:23Z"},{"alias_kind":"pith_short_8","alias_value":"FX4UBK2Y","created_at":"2026-07-05T10:52:23Z"}],"graph_snapshots":[{"event_id":"sha256:f35bcb044e8bd4d51ae3ecce236f9115d2b736552820ac8045b99b8c81f73f38","target":"graph","created_at":"2026-07-05T10:52: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.14863/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fork is a graph obtained from $K_{1,3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\\omega(H[B]) < \\omega(H)$. In this paper, we prove that the perfect divisibility of fork-free graphs is equivalent to that of claw-free graphs. We also prove that, for $F\\in \\{P_7, P_6\\cup K_1\\}$, each (fork, $F$)-free graph $G$ is perfectly divisible and hence $\\chi(G)\\leq \\binom{\\omega(G)+1}{2}$.","authors_text":"Baogang Xu, Miaoxia Zhuang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T05:08:16Z","title":"On minimal nonperfectly divisible fork-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14863","kind":"arxiv","version":2},"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:2fc56d779f6e9d1137f9ea57c66fe5f18151880619175c4a51ce2e6f1fd58470","target":"record","created_at":"2026-07-05T10:52: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":"78149f3d243cdb6392cbb129c6a47de7da08ab6195467014a6e29bc8742980b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T05:08:16Z","title_canon_sha256":"fc587ed95194a753fc7a46aa61abb49f9f98b159ee9104b1b7d29bb3ec78c688"},"schema_version":"1.0","source":{"id":"2504.14863","kind":"arxiv","version":2}},"canonical_sha256":"2df940ab5884fc8ecd619f824cd8c780f687787503cec939b18e833507a91042","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2df940ab5884fc8ecd619f824cd8c780f687787503cec939b18e833507a91042","first_computed_at":"2026-07-05T10:52:23.309080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:23.309080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jw5t8P/FasGhnaSVmggImuojmREaLkvZXPqjUUCk7dRbcemUVKELbW4+lM3IM92QLga0GvNHro5cHI36QYayAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:23.309589Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.14863","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc56d779f6e9d1137f9ea57c66fe5f18151880619175c4a51ce2e6f1fd58470","sha256:f35bcb044e8bd4d51ae3ecce236f9115d2b736552820ac8045b99b8c81f73f38"],"state_sha256":"e78b54fac4d02b331decdcab7ca5e53fac5d0ff773c6c8eacec3f2a69fd74f77"}