{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GSRPY65RXWLCH4JORRVLVT5SJU","short_pith_number":"pith:GSRPY65R","schema_version":"1.0","canonical_sha256":"34a2fc7bb1bd9623f12e8c6abacfb24d09a40ad4c36d609a46e1e6b068378462","source":{"kind":"arxiv","id":"2409.13892","version":1},"attestation_state":"computed","paper":{"title":"On the zero-free region for the chromatic polynomial of graphs with maximum degree $\\Delta$ and girth $g$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Procacci, Emanuel Juliano, Paula M. S. Fialho","submitted_at":"2024-09-20T20:47:30Z","abstract_excerpt":"The purpose of the present paper is to provide, for all pairs of integers $(\\Delta,g)$ with $\\D\\ge 3$ and $g\\ge 3$, a positive number $C(\\Delta, g)$ such that chromatic polynomial $P_G(q)$ of a graph $G$ with maximum degree $\\Delta$ and finite girth $g$ is free of zero if $|q|\\ge C(\\Delta, g)$. Our bounds enlarge the zero-free region in the complex plane of $P_G(q)$ in comparison to previous bounds. In particular, for small values of $\\D$ our estimates yield a sensible improvement on the bounds recently obtained by Jenssen, Patel and Regts in \\cite{JPR}, while they coincide with those of \\cite"},"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":"2409.13892","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-20T20:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"e5447ca4f82d21576d2dbce0d6e2b0a60e6ac98bcfe3da3c014c5f743bffcaa3","abstract_canon_sha256":"b1996c0e3a786cdf88259ccb898410f0dbd8632ba7724fb699cb1b4425e83150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:08.261731Z","signature_b64":"KB4hjFvvzZW64ni4Q6lQdSz0qwgk2G/a482riBIYfT4JsJVs0fMKrSlytNtLEKDh5gUfHckl1cnVgQf2X1n/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a2fc7bb1bd9623f12e8c6abacfb24d09a40ad4c36d609a46e1e6b068378462","last_reissued_at":"2026-07-05T09:10:08.261387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:08.261387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the zero-free region for the chromatic polynomial of graphs with maximum degree $\\Delta$ and girth $g$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aldo Procacci, Emanuel Juliano, Paula M. S. Fialho","submitted_at":"2024-09-20T20:47:30Z","abstract_excerpt":"The purpose of the present paper is to provide, for all pairs of integers $(\\Delta,g)$ with $\\D\\ge 3$ and $g\\ge 3$, a positive number $C(\\Delta, g)$ such that chromatic polynomial $P_G(q)$ of a graph $G$ with maximum degree $\\Delta$ and finite girth $g$ is free of zero if $|q|\\ge C(\\Delta, g)$. Our bounds enlarge the zero-free region in the complex plane of $P_G(q)$ in comparison to previous bounds. In particular, for small values of $\\D$ our estimates yield a sensible improvement on the bounds recently obtained by Jenssen, Patel and Regts in \\cite{JPR}, while they coincide with those of \\cite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13892","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/2409.13892/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":"2409.13892","created_at":"2026-07-05T09:10:08.261445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13892v1","created_at":"2026-07-05T09:10:08.261445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13892","created_at":"2026-07-05T09:10:08.261445+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSRPY65RXWLC","created_at":"2026-07-05T09:10:08.261445+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSRPY65RXWLCH4JO","created_at":"2026-07-05T09:10:08.261445+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSRPY65R","created_at":"2026-07-05T09:10:08.261445+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22766","citing_title":"On the independent set polynomial of graphs and claw-free graphs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU","json":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU.json","graph_json":"https://pith.science/api/pith-number/GSRPY65RXWLCH4JORRVLVT5SJU/graph.json","events_json":"https://pith.science/api/pith-number/GSRPY65RXWLCH4JORRVLVT5SJU/events.json","paper":"https://pith.science/paper/GSRPY65R"},"agent_actions":{"view_html":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU","download_json":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU.json","view_paper":"https://pith.science/paper/GSRPY65R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13892&json=true","fetch_graph":"https://pith.science/api/pith-number/GSRPY65RXWLCH4JORRVLVT5SJU/graph.json","fetch_events":"https://pith.science/api/pith-number/GSRPY65RXWLCH4JORRVLVT5SJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU/action/storage_attestation","attest_author":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU/action/author_attestation","sign_citation":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU/action/citation_signature","submit_replication":"https://pith.science/pith/GSRPY65RXWLCH4JORRVLVT5SJU/action/replication_record"}},"created_at":"2026-07-05T09:10:08.261445+00:00","updated_at":"2026-07-05T09:10:08.261445+00:00"}