{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EJVPXTDGBEZOD35JBF3VN26JCX","short_pith_number":"pith:EJVPXTDG","canonical_record":{"source":{"id":"2506.12660","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T23:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"6f63b3d01423be00a10e85f566cfd0ad2f0f66c4ccb173d06fc1914bd02199b4","abstract_canon_sha256":"16f0369ceb55f854d627980611492453f7bcbfc8b3a028a20cd58d1ef47151fd"},"schema_version":"1.0"},"canonical_sha256":"226afbcc660932e1efa9097756ebc915f0d636e091af4cd249f69f97fb7f522d","source":{"kind":"arxiv","id":"2506.12660","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12660","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12660v2","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12660","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_12","alias_value":"EJVPXTDGBEZO","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_16","alias_value":"EJVPXTDGBEZOD35J","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_8","alias_value":"EJVPXTDG","created_at":"2026-07-05T11:23:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EJVPXTDGBEZOD35JBF3VN26JCX","target":"record","payload":{"canonical_record":{"source":{"id":"2506.12660","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T23:31:41Z","cross_cats_sorted":[],"title_canon_sha256":"6f63b3d01423be00a10e85f566cfd0ad2f0f66c4ccb173d06fc1914bd02199b4","abstract_canon_sha256":"16f0369ceb55f854d627980611492453f7bcbfc8b3a028a20cd58d1ef47151fd"},"schema_version":"1.0"},"canonical_sha256":"226afbcc660932e1efa9097756ebc915f0d636e091af4cd249f69f97fb7f522d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:30.124587Z","signature_b64":"bRwZwjbDUjgcslc1+3aaLsdsNZMmkSYWTfBUBrA9pp7qzQtkyE8qGzNWcRdEPJKJHCALaJo+ZtvB8We9vic6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226afbcc660932e1efa9097756ebc915f0d636e091af4cd249f69f97fb7f522d","last_reissued_at":"2026-07-05T11:23:30.124099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:30.124099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.12660","source_version":2,"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-07-05T11:23:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NSTNyoNTj7N3W8kw7bDikZPG+QcDdziys7nsgCL1qsIcIgxATw9raRR5zM6sHdJtlxCwwYZ1RNh+MVjsry1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:19:25.900245Z"},"content_sha256":"fe6c76214162b34f92d5ae3ea19ad8c69fed5ab0a55ad10f82ddeac87e53964c","schema_version":"1.0","event_id":"sha256:fe6c76214162b34f92d5ae3ea19ad8c69fed5ab0a55ad10f82ddeac87e53964c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EJVPXTDGBEZOD35JBF3VN26JCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the structure of perfectly divisible graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ch\\'inh T. Ho\\`ang","submitted_at":"2025-06-14T23:31:41Z","abstract_excerpt":"A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ contains a set $X$ of vertices such that $X$ meets all largest cliques of $H$, and $X$ induces a perfect graph. The chromatic number of a perfectly divisible graph $G$ is bounded by $\\omega^2$ where $\\omega$ denotes the number of vertices in a largest clique of $G$. A graph $G$ is minimally non-perfectly divisible if $G$ is not perfectly divisible but each of its proper induced subgraph is. A set $C$ of vertices of $G$ is a clique cutset if $C$ induces a clique in $G$, and $G-C$ is disconnected. We prove that a $P_5$-free "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12660","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/2506.12660/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-07-05T11:23:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCyGk6GnQzXoSLZQuXT6ouvd0Z2RXREiTqpZqH2Jk5fqFzS2J21K/ytHtRGvkxiZUWROYXX0piutDFPSm/ZXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:19:25.901214Z"},"content_sha256":"9ac1ce22320508fae78a5b207445073e32ffe37a877c359e26fac220ad47d0f9","schema_version":"1.0","event_id":"sha256:9ac1ce22320508fae78a5b207445073e32ffe37a877c359e26fac220ad47d0f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJVPXTDGBEZOD35JBF3VN26JCX/bundle.json","state_url":"https://pith.science/pith/EJVPXTDGBEZOD35JBF3VN26JCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJVPXTDGBEZOD35JBF3VN26JCX/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-20T16:19:25Z","links":{"resolver":"https://pith.science/pith/EJVPXTDGBEZOD35JBF3VN26JCX","bundle":"https://pith.science/pith/EJVPXTDGBEZOD35JBF3VN26JCX/bundle.json","state":"https://pith.science/pith/EJVPXTDGBEZOD35JBF3VN26JCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJVPXTDGBEZOD35JBF3VN26JCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EJVPXTDGBEZOD35JBF3VN26JCX","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":"16f0369ceb55f854d627980611492453f7bcbfc8b3a028a20cd58d1ef47151fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T23:31:41Z","title_canon_sha256":"6f63b3d01423be00a10e85f566cfd0ad2f0f66c4ccb173d06fc1914bd02199b4"},"schema_version":"1.0","source":{"id":"2506.12660","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12660","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12660v2","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12660","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_12","alias_value":"EJVPXTDGBEZO","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_16","alias_value":"EJVPXTDGBEZOD35J","created_at":"2026-07-05T11:23:30Z"},{"alias_kind":"pith_short_8","alias_value":"EJVPXTDG","created_at":"2026-07-05T11:23:30Z"}],"graph_snapshots":[{"event_id":"sha256:9ac1ce22320508fae78a5b207445073e32ffe37a877c359e26fac220ad47d0f9","target":"graph","created_at":"2026-07-05T11:23:30Z","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/2506.12660/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ contains a set $X$ of vertices such that $X$ meets all largest cliques of $H$, and $X$ induces a perfect graph. The chromatic number of a perfectly divisible graph $G$ is bounded by $\\omega^2$ where $\\omega$ denotes the number of vertices in a largest clique of $G$. A graph $G$ is minimally non-perfectly divisible if $G$ is not perfectly divisible but each of its proper induced subgraph is. A set $C$ of vertices of $G$ is a clique cutset if $C$ induces a clique in $G$, and $G-C$ is disconnected. We prove that a $P_5$-free ","authors_text":"Ch\\'inh T. Ho\\`ang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T23:31:41Z","title":"On the structure of perfectly divisible graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12660","kind":"arxiv","version":2},"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:fe6c76214162b34f92d5ae3ea19ad8c69fed5ab0a55ad10f82ddeac87e53964c","target":"record","created_at":"2026-07-05T11:23:30Z","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":"16f0369ceb55f854d627980611492453f7bcbfc8b3a028a20cd58d1ef47151fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T23:31:41Z","title_canon_sha256":"6f63b3d01423be00a10e85f566cfd0ad2f0f66c4ccb173d06fc1914bd02199b4"},"schema_version":"1.0","source":{"id":"2506.12660","kind":"arxiv","version":2}},"canonical_sha256":"226afbcc660932e1efa9097756ebc915f0d636e091af4cd249f69f97fb7f522d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"226afbcc660932e1efa9097756ebc915f0d636e091af4cd249f69f97fb7f522d","first_computed_at":"2026-07-05T11:23:30.124099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:30.124099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bRwZwjbDUjgcslc1+3aaLsdsNZMmkSYWTfBUBrA9pp7qzQtkyE8qGzNWcRdEPJKJHCALaJo+ZtvB8We9vic6AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:30.124587Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12660","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe6c76214162b34f92d5ae3ea19ad8c69fed5ab0a55ad10f82ddeac87e53964c","sha256:9ac1ce22320508fae78a5b207445073e32ffe37a877c359e26fac220ad47d0f9"],"state_sha256":"e4b49763bb75efeed497787ec608f3df8e424dde0fa58b9d2a58d8b0ff5ddfdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uYP/nyOZ/fSSEwlXOfR0GZbhywHqq7RikdDnAp9WbiC8ZMmEgoXmvE69cKiMyeoC2bI+38TaKTJomsxNuTeDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T16:19:25.908239Z","bundle_sha256":"681d7ea829fe2ee54ed95ecee37b82219d5aacf0a6660139150f10dbafd3c54a"}}