{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:52WI56LZUI5PFP2WLT37VVZY4J","short_pith_number":"pith:52WI56LZ","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"},"canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","source":{"kind":"arxiv","id":"2608.13519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13519","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13519v1","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13519","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"52WI56LZUI5P","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_16","alias_value":"52WI56LZUI5PFP2W","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_8","alias_value":"52WI56LZ","created_at":"2026-08-14T01:24:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:52WI56LZUI5PFP2WLT37VVZY4J","target":"record","payload":{"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"},"canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","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"},"source_kind":"arxiv","source_id":"2608.13519","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T01:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8IVkO4ABsfcImHC5WTeqZYBt+owzWNxBLmUL1+wVWl9QGuwb/cIXqVUAHozg1ZM5KGpoLXuQoFOxNbeW2KnYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:01:31.184609Z"},"content_sha256":"fae8c6217fa8197efad54417340408926aa2c5b699ef14738d60d9c54962e206","schema_version":"1.0","event_id":"sha256:fae8c6217fa8197efad54417340408926aa2c5b699ef14738d60d9c54962e206"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:52WI56LZUI5PFP2WLT37VVZY4J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-14T01:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Cjf5OSpQ5gGB+CxT7zpV8AgqXiNRg/X9VngiNRsG+b7fjM3/FjZfS7dK5Y3RsSFHwNzOS3iz/4TRwHVPyg9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:01:31.185617Z"},"content_sha256":"62803bf9fd6830c2ca5c374d174fdecb1d57f73b71f4c832cbfbd958e36eb534","schema_version":"1.0","event_id":"sha256:62803bf9fd6830c2ca5c374d174fdecb1d57f73b71f4c832cbfbd958e36eb534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/bundle.json","state_url":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52WI56LZUI5PFP2WLT37VVZY4J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T05:01:31Z","links":{"resolver":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J","bundle":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/bundle.json","state":"https://pith.science/pith/52WI56LZUI5PFP2WLT37VVZY4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52WI56LZUI5PFP2WLT37VVZY4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:52WI56LZUI5PFP2WLT37VVZY4J","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":"a54ae8bacd7a15ff78e6eabdc68801a471c87a92937c24a8db8175efb6a44c64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T17:38:36Z","title_canon_sha256":"7f1e7851b95646447b7c02ccc1bb5f0932906237de6235132a7dc309d650f870"},"schema_version":"1.0","source":{"id":"2608.13519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13519","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13519v1","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13519","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"52WI56LZUI5P","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_16","alias_value":"52WI56LZUI5PFP2W","created_at":"2026-08-14T01:24:56Z"},{"alias_kind":"pith_short_8","alias_value":"52WI56LZ","created_at":"2026-08-14T01:24:56Z"}],"graph_snapshots":[{"event_id":"sha256:62803bf9fd6830c2ca5c374d174fdecb1d57f73b71f4c832cbfbd958e36eb534","target":"graph","created_at":"2026-08-14T01:24:56Z","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/2608.13519/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Feng Liu, Jiasheng Zeng, Qi Wu, Shuang Sun, Yan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T17:38:36Z","title":"Every fork-free graph is perfectly weight divisible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13519","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:fae8c6217fa8197efad54417340408926aa2c5b699ef14738d60d9c54962e206","target":"record","created_at":"2026-08-14T01:24:56Z","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":"a54ae8bacd7a15ff78e6eabdc68801a471c87a92937c24a8db8175efb6a44c64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T17:38:36Z","title_canon_sha256":"7f1e7851b95646447b7c02ccc1bb5f0932906237de6235132a7dc309d650f870"},"schema_version":"1.0","source":{"id":"2608.13519","kind":"arxiv","version":1}},"canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eeac8ef979a23af2bf565cf7fad738e269a96e215f5a6964788b498e0223d9d1","first_computed_at":"2026-08-14T01:24:56.761595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T01:24:56.761595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLP01/pQU5hZm+CxwUqgu6bVP2UXPIKGcafJyWdtGhPHPEbnKcQRocVGOi8fWBrSkNaBhAENqjxKcXTtqKfPDw==","signature_status":"signed_v1","signed_at":"2026-08-14T01:24:56.763952Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.13519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae8c6217fa8197efad54417340408926aa2c5b699ef14738d60d9c54962e206","sha256:62803bf9fd6830c2ca5c374d174fdecb1d57f73b71f4c832cbfbd958e36eb534"],"state_sha256":"ca10b0cf3ee5ad952c256b18e7e9275edb3af03f82a41fd36e9eb63addfc550a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"if5voqwXOcpAR2ucHPQPwXU918VKWPsdHV51nsGoqKQuoflWo8qkz6BXS1FAuN/gVESnRyi1dCSSVD5mA8dDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:01:31.190849Z","bundle_sha256":"6cbd54c125a938bda1fa9ba0115437fa42de285248e8c8e4cf7ac27de8dc5009"}}