{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DUKIBQBBPZRWWHNWROPRCHKILE","short_pith_number":"pith:DUKIBQBB","schema_version":"1.0","canonical_sha256":"1d1480c0217e636b1db68b9f111d485911d5d7f3609b96bd3cb608bad67d965d","source":{"kind":"arxiv","id":"2505.04429","version":1},"attestation_state":"computed","paper":{"title":"Perfect divisibility of (fork, antifork$\\cup K_1$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baogang Xu, Miaoxia Zhuang, Ran Chen","submitted_at":"2025-05-07T13:58:32Z","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"},"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":"2505.04429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-07T13:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"5434fea4fd5fd678363541e500088ff6678b03fc522830bbb8e4ef34237fa021","abstract_canon_sha256":"7af93372b6c6211501307b891f3552462adfac5b1691f09d9afb07999d17bae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:51.607712Z","signature_b64":"H+rlf1ZsIA3hi2JnbvRgNhUemYmVtcqWcrFbY4xL0FK77bBfDWYgkRUTJXG6owQv3hC61FbBExTu8zLd8OqvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1480c0217e636b1db68b9f111d485911d5d7f3609b96bd3cb608bad67d965d","last_reissued_at":"2026-07-05T10:59:51.607182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:51.607182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect divisibility of (fork, antifork$\\cup K_1$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baogang Xu, Miaoxia Zhuang, Ran Chen","submitted_at":"2025-05-07T13:58:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04429","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/2505.04429/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":"2505.04429","created_at":"2026-07-05T10:59:51.607244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04429v1","created_at":"2026-07-05T10:59:51.607244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04429","created_at":"2026-07-05T10:59:51.607244+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUKIBQBBPZRW","created_at":"2026-07-05T10:59:51.607244+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUKIBQBBPZRWWHNW","created_at":"2026-07-05T10:59:51.607244+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUKIBQBB","created_at":"2026-07-05T10:59:51.607244+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/DUKIBQBBPZRWWHNWROPRCHKILE","json":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE.json","graph_json":"https://pith.science/api/pith-number/DUKIBQBBPZRWWHNWROPRCHKILE/graph.json","events_json":"https://pith.science/api/pith-number/DUKIBQBBPZRWWHNWROPRCHKILE/events.json","paper":"https://pith.science/paper/DUKIBQBB"},"agent_actions":{"view_html":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE","download_json":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE.json","view_paper":"https://pith.science/paper/DUKIBQBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04429&json=true","fetch_graph":"https://pith.science/api/pith-number/DUKIBQBBPZRWWHNWROPRCHKILE/graph.json","fetch_events":"https://pith.science/api/pith-number/DUKIBQBBPZRWWHNWROPRCHKILE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE/action/storage_attestation","attest_author":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE/action/author_attestation","sign_citation":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE/action/citation_signature","submit_replication":"https://pith.science/pith/DUKIBQBBPZRWWHNWROPRCHKILE/action/replication_record"}},"created_at":"2026-07-05T10:59:51.607244+00:00","updated_at":"2026-07-05T10:59:51.607244+00:00"}