{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PW2VCPQCMRRK25AJWBFB52HP4R","short_pith_number":"pith:PW2VCPQC","schema_version":"1.0","canonical_sha256":"7db5513e026462ad7409b04a1ee8efe464764a7ea005e32ff8b7c88775930d71","source":{"kind":"arxiv","id":"2508.07034","version":1},"attestation_state":"computed","paper":{"title":"Optimal $\\chi$-boundness of $\\ell$-holed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rong Wu, Yan Wang","submitted_at":"2025-08-09T16:13:21Z","abstract_excerpt":"A graph is {\\em{$\\ell$-holed}} if all of its induced cycles of length at least four have length exactly $\\ell$. In the paper, we prove that if $G$ is an $\\ell$-holed graph with odd $\\ell\\geq 7$, then $\\chi(G)\\leq {\\lceil {\\ell \\over {\\ell-1}}\\omega(G) \\rceil}$. This result is sharp."},"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":"2508.07034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-09T16:13:21Z","cross_cats_sorted":[],"title_canon_sha256":"89882a766afb15668c4bbbd66878073c0dcdb8d7e6bdc175113f514dc2eefb53","abstract_canon_sha256":"26666f3ee99d9e100685422b0e7ead1f3c9e75ccbb743f82fd30796862c7ac86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:39.708202Z","signature_b64":"ffBcmbGsOLq6M2yKV9LMiqiEO7TSwQ2TrQxwa+kEMlgV0OjAHwsqx1NHhkdQam2mc0BiiemDGKgmQTNIyUh6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7db5513e026462ad7409b04a1ee8efe464764a7ea005e32ff8b7c88775930d71","last_reissued_at":"2026-07-05T11:51:39.707724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:39.707724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal $\\chi$-boundness of $\\ell$-holed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rong Wu, Yan Wang","submitted_at":"2025-08-09T16:13:21Z","abstract_excerpt":"A graph is {\\em{$\\ell$-holed}} if all of its induced cycles of length at least four have length exactly $\\ell$. In the paper, we prove that if $G$ is an $\\ell$-holed graph with odd $\\ell\\geq 7$, then $\\chi(G)\\leq {\\lceil {\\ell \\over {\\ell-1}}\\omega(G) \\rceil}$. This result is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07034","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/2508.07034/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":"2508.07034","created_at":"2026-07-05T11:51:39.707779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.07034v1","created_at":"2026-07-05T11:51:39.707779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07034","created_at":"2026-07-05T11:51:39.707779+00:00"},{"alias_kind":"pith_short_12","alias_value":"PW2VCPQCMRRK","created_at":"2026-07-05T11:51:39.707779+00:00"},{"alias_kind":"pith_short_16","alias_value":"PW2VCPQCMRRK25AJ","created_at":"2026-07-05T11:51:39.707779+00:00"},{"alias_kind":"pith_short_8","alias_value":"PW2VCPQC","created_at":"2026-07-05T11:51:39.707779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27943","citing_title":"Graphs with girth 8 and without longer even holes are 3-colorable","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R","json":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R.json","graph_json":"https://pith.science/api/pith-number/PW2VCPQCMRRK25AJWBFB52HP4R/graph.json","events_json":"https://pith.science/api/pith-number/PW2VCPQCMRRK25AJWBFB52HP4R/events.json","paper":"https://pith.science/paper/PW2VCPQC"},"agent_actions":{"view_html":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R","download_json":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R.json","view_paper":"https://pith.science/paper/PW2VCPQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.07034&json=true","fetch_graph":"https://pith.science/api/pith-number/PW2VCPQCMRRK25AJWBFB52HP4R/graph.json","fetch_events":"https://pith.science/api/pith-number/PW2VCPQCMRRK25AJWBFB52HP4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R/action/storage_attestation","attest_author":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R/action/author_attestation","sign_citation":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R/action/citation_signature","submit_replication":"https://pith.science/pith/PW2VCPQCMRRK25AJWBFB52HP4R/action/replication_record"}},"created_at":"2026-07-05T11:51:39.707779+00:00","updated_at":"2026-07-05T11:51:39.707779+00:00"}