{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DUKIBQBBPZRWWHNWROPRCHKILE","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":"7af93372b6c6211501307b891f3552462adfac5b1691f09d9afb07999d17bae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-07T13:58:32Z","title_canon_sha256":"5434fea4fd5fd678363541e500088ff6678b03fc522830bbb8e4ef34237fa021"},"schema_version":"1.0","source":{"id":"2505.04429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04429","created_at":"2026-07-05T10:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04429v1","created_at":"2026-07-05T10:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04429","created_at":"2026-07-05T10:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"DUKIBQBBPZRW","created_at":"2026-07-05T10:59:51Z"},{"alias_kind":"pith_short_16","alias_value":"DUKIBQBBPZRWWHNW","created_at":"2026-07-05T10:59:51Z"},{"alias_kind":"pith_short_8","alias_value":"DUKIBQBB","created_at":"2026-07-05T10:59:51Z"}],"graph_snapshots":[{"event_id":"sha256:b0e604b6e3d4b1513ab7084d07f115853bc287727be18c8bca1daa7bec31f4fd","target":"graph","created_at":"2026-07-05T10:59:51Z","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/2505.04429/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A {\\em fork} is a graph obtained from $K_{1,3}$ (usually called {\\em claw}) by subdividing an edge once, an {\\em antifork} is the complement graph of a fork, and a {\\em co-cricket} is a union of $K_1$ and $K_4-e$. 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)$. Karthick {\\em et al.} [Electron. J. Comb. 28 (2021), P2.20.] conjectured that fork-free graphs are perfectly divisible, and they proved that each (fork, co-cricket)-free graph is either claw-free or perfectly d","authors_text":"Baogang Xu, Miaoxia Zhuang, Ran Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-07T13:58:32Z","title":"Perfect divisibility of (fork, antifork$\\cup K_1$)-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04429","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:6c2e0bab996b4b3e77d00ab406072c46246e05f8a4528dcf7d615986bf8f589f","target":"record","created_at":"2026-07-05T10:59:51Z","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":"7af93372b6c6211501307b891f3552462adfac5b1691f09d9afb07999d17bae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-07T13:58:32Z","title_canon_sha256":"5434fea4fd5fd678363541e500088ff6678b03fc522830bbb8e4ef34237fa021"},"schema_version":"1.0","source":{"id":"2505.04429","kind":"arxiv","version":1}},"canonical_sha256":"1d1480c0217e636b1db68b9f111d485911d5d7f3609b96bd3cb608bad67d965d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1480c0217e636b1db68b9f111d485911d5d7f3609b96bd3cb608bad67d965d","first_computed_at":"2026-07-05T10:59:51.607182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:51.607182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+rlf1ZsIA3hi2JnbvRgNhUemYmVtcqWcrFbY4xL0FK77bBfDWYgkRUTJXG6owQv3hC61FbBExTu8zLd8OqvBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:51.607712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.04429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c2e0bab996b4b3e77d00ab406072c46246e05f8a4528dcf7d615986bf8f589f","sha256:b0e604b6e3d4b1513ab7084d07f115853bc287727be18c8bca1daa7bec31f4fd"],"state_sha256":"5764e389c3a3341e7866de52cebacf018685f6e174def2e3a28cd2787569c86c"}