{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:52WI56LZUI5PFP2WLT37VVZY4J","short_pith_number":"pith:52WI56LZ","schema_version":"1.0","canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","source":{"kind":"arxiv","id":"2608.13519","version":1},"attestation_state":"computed","paper":{"title":"Every fork-free graph is perfectly weight divisible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Feng Liu, Jiasheng Zeng, Qi Wu, Shuang Sun, Yan Wang","submitted_at":"2026-08-13T17:38:36Z","abstract_excerpt":"A graph $G$ is \\emph{perfectly weight divisible} if, for every positive integral weight function on $V(G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum weight of a clique in $H$. Perfect divisibility and its weighted form provide a natural approach to polynomial $\\chi$-boundedness. A \\emph{fork}, also known as a \\emph{chair}, is the graph obtained from a claw by subdividing one of its edges once. In this paper, "},"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":"2608.13519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T17:38:36Z","cross_cats_sorted":[],"title_canon_sha256":"7f1e7851b95646447b7c02ccc1bb5f0932906237de6235132a7dc309d650f870","abstract_canon_sha256":"a54ae8bacd7a15ff78e6eabdc68801a471c87a92937c24a8db8175efb6a44c64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T01:24:56.763952Z","signature_b64":"aLP01/pQU5hZm+CxwUqgu6bVP2UXPIKGcafJyWdtGhPHPEbnKcQRocVGOi8fWBrSkNaBhAENqjxKcXTtqKfPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","last_reissued_at":"2026-08-14T01:24:56.761595Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T01:24:56.761595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every fork-free graph is perfectly weight divisible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Feng Liu, Jiasheng Zeng, Qi Wu, Shuang Sun, Yan Wang","submitted_at":"2026-08-13T17:38:36Z","abstract_excerpt":"A graph $G$ is \\emph{perfectly weight divisible} if, for every positive integral weight function on $V(G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum weight of a clique in $H$. Perfect divisibility and its weighted form provide a natural approach to polynomial $\\chi$-boundedness. A \\emph{fork}, also known as a \\emph{chair}, is the graph obtained from a claw by subdividing one of its edges once. In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13519","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/2608.13519/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":"2608.13519","created_at":"2026-08-14T01:24:56.763130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.13519v1","created_at":"2026-08-14T01:24:56.763130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13519","created_at":"2026-08-14T01:24:56.763130+00:00"},{"alias_kind":"pith_short_12","alias_value":"52WI56LZUI5P","created_at":"2026-08-14T01:24:56.763130+00:00"},{"alias_kind":"pith_short_16","alias_value":"52WI56LZUI5PFP2W","created_at":"2026-08-14T01:24:56.763130+00:00"},{"alias_kind":"pith_short_8","alias_value":"52WI56LZ","created_at":"2026-08-14T01:24:56.763130+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/52WI56LZUI5PFP2WLT37VVZY4J","json":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J.json","graph_json":"https://pith.science/api/pith-number/52WI56LZUI5PFP2WLT37VVZY4J/graph.json","events_json":"https://pith.science/api/pith-number/52WI56LZUI5PFP2WLT37VVZY4J/events.json","paper":"https://pith.science/paper/52WI56LZ"},"agent_actions":{"view_html":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J","download_json":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J.json","view_paper":"https://pith.science/paper/52WI56LZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.13519&json=true","fetch_graph":"https://pith.science/api/pith-number/52WI56LZUI5PFP2WLT37VVZY4J/graph.json","fetch_events":"https://pith.science/api/pith-number/52WI56LZUI5PFP2WLT37VVZY4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/action/storage_attestation","attest_author":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/action/author_attestation","sign_citation":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/action/citation_signature","submit_replication":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/action/replication_record"}},"created_at":"2026-08-14T01:24:56.763130+00:00","updated_at":"2026-08-14T01:24:56.763130+00:00"}