{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WKOSDIVQT2UBYVB2VVESTR3EVR","short_pith_number":"pith:WKOSDIVQ","schema_version":"1.0","canonical_sha256":"b29d21a2b09ea81c543aad4929c764ac52b9902cbd6dde0ad5b4eddeebf1ac41","source":{"kind":"arxiv","id":"2507.18506","version":2},"attestation_state":"computed","paper":{"title":"Perfect divisions in ($P_2 \\cup P_4$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongyang Wang, Lizhong Chen","submitted_at":"2025-07-24T15:24:59Z","abstract_excerpt":"A graph $G$ has a perfect division if its vertex set can be partitioned into two sets $A$, $B$ such that $G[A]$ is perfect and $\\omega(G[B]) < \\omega(G)$. We call $G$ perfectly divisible if every induced subgraph of $G$ admits a perfect division. We prove that every ($P_2 \\cup P_4$, bull)-free graph $G$ with $\\omega(G) \\geq 3$ has a perfect division if $G$ contains no homogeneous set. The clique-number condition is tight: a counterexample exists for $\\omega(G) = 2$. Additionally, we present a short proof of the perfect divisibility of ($P_5$, bull)-free graphs, originally established by Chudno"},"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":"2507.18506","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-24T15:24:59Z","cross_cats_sorted":[],"title_canon_sha256":"e63f48c2a3be5ee04abe38b027534271b83a8059b8d2704aeb7ca55d3e483235","abstract_canon_sha256":"8632b6216655ef73eae4963aeda25ec693dcc1e1462367313477355455a9dff8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:32.704384Z","signature_b64":"nHXb+PyElrrmiA/rSxyVc5jHNLTorGqNorcyT6QC86oi2M1ujn2dckSIxqhOzz0g0WgNeknVI3T+1gmDG3ZyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29d21a2b09ea81c543aad4929c764ac52b9902cbd6dde0ad5b4eddeebf1ac41","last_reissued_at":"2026-07-05T11:51:32.703928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:32.703928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect divisions in ($P_2 \\cup P_4$, bull)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongyang Wang, Lizhong Chen","submitted_at":"2025-07-24T15:24:59Z","abstract_excerpt":"A graph $G$ has a perfect division if its vertex set can be partitioned into two sets $A$, $B$ such that $G[A]$ is perfect and $\\omega(G[B]) < \\omega(G)$. We call $G$ perfectly divisible if every induced subgraph of $G$ admits a perfect division. We prove that every ($P_2 \\cup P_4$, bull)-free graph $G$ with $\\omega(G) \\geq 3$ has a perfect division if $G$ contains no homogeneous set. The clique-number condition is tight: a counterexample exists for $\\omega(G) = 2$. Additionally, we present a short proof of the perfect divisibility of ($P_5$, bull)-free graphs, originally established by Chudno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18506","kind":"arxiv","version":2},"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/2507.18506/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":"2507.18506","created_at":"2026-07-05T11:51:32.703994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.18506v2","created_at":"2026-07-05T11:51:32.703994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18506","created_at":"2026-07-05T11:51:32.703994+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKOSDIVQT2UB","created_at":"2026-07-05T11:51:32.703994+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKOSDIVQT2UBYVB2","created_at":"2026-07-05T11:51:32.703994+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKOSDIVQ","created_at":"2026-07-05T11:51:32.703994+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/WKOSDIVQT2UBYVB2VVESTR3EVR","json":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR.json","graph_json":"https://pith.science/api/pith-number/WKOSDIVQT2UBYVB2VVESTR3EVR/graph.json","events_json":"https://pith.science/api/pith-number/WKOSDIVQT2UBYVB2VVESTR3EVR/events.json","paper":"https://pith.science/paper/WKOSDIVQ"},"agent_actions":{"view_html":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR","download_json":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR.json","view_paper":"https://pith.science/paper/WKOSDIVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.18506&json=true","fetch_graph":"https://pith.science/api/pith-number/WKOSDIVQT2UBYVB2VVESTR3EVR/graph.json","fetch_events":"https://pith.science/api/pith-number/WKOSDIVQT2UBYVB2VVESTR3EVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR/action/storage_attestation","attest_author":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR/action/author_attestation","sign_citation":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR/action/citation_signature","submit_replication":"https://pith.science/pith/WKOSDIVQT2UBYVB2VVESTR3EVR/action/replication_record"}},"created_at":"2026-07-05T11:51:32.703994+00:00","updated_at":"2026-07-05T11:51:32.703994+00:00"}