{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JBS5UYK7T62BMY2E7ROD2CUY5F","short_pith_number":"pith:JBS5UYK7","schema_version":"1.0","canonical_sha256":"4865da615f9fb4166344fc5c3d0a98e94fdc214f6e2b8e29cbf78fd48f5505b2","source":{"kind":"arxiv","id":"1209.5185","version":4},"attestation_state":"computed","paper":{"title":"Bounds on Characteristic Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengwei Zhou, Suijie Wang, Yeong-Nan Yeh","submitted_at":"2012-09-24T08:17:05Z","abstract_excerpt":"Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\\chi_G(t)=a_0t^n-a_1t^{n-1}+\\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\\in \\Bbb{Z}$ and $0\\le k\\le q+r+1$, we obtain a sharp two-side bound for the partial binomial sum of the coefficient sequence, that is, \\[ {r+q\\choose k}\\le \\sum_{i=0}^{k}{q\\choose k-i}a_{i}\\le {m+q\\choose k}. \\] Indeed, this bound holds for the characteristic polynomial of hyperplane arrangements and matroids, and its weak version can be generalized to the characteristic polynomial of toric arrangements and arithmetic "},"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":"1209.5185","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-24T08:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"e2ed87eb38d02f0707ee447ef1cbaa38ab309c4e47df35c2e268d59e03271cc9","abstract_canon_sha256":"cc6f117cec38fc3c6d1443ab77c412518f8aa66f68cb83801c7ff519b94399d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.797350Z","signature_b64":"QVpCGe5P72qkxpUppaFVgGdjOCxHDgQK8cyvlvObBf9fqabsuexHFb3IDTg/5BOkm0J/j2mkm2vAPfBu7DPaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4865da615f9fb4166344fc5c3d0a98e94fdc214f6e2b8e29cbf78fd48f5505b2","last_reissued_at":"2026-05-18T01:34:13.796586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.796586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Characteristic Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengwei Zhou, Suijie Wang, Yeong-Nan Yeh","submitted_at":"2012-09-24T08:17:05Z","abstract_excerpt":"Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\\chi_G(t)=a_0t^n-a_1t^{n-1}+\\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\\in \\Bbb{Z}$ and $0\\le k\\le q+r+1$, we obtain a sharp two-side bound for the partial binomial sum of the coefficient sequence, that is, \\[ {r+q\\choose k}\\le \\sum_{i=0}^{k}{q\\choose k-i}a_{i}\\le {m+q\\choose k}. \\] Indeed, this bound holds for the characteristic polynomial of hyperplane arrangements and matroids, and its weak version can be generalized to the characteristic polynomial of toric arrangements and arithmetic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5185","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1209.5185","created_at":"2026-05-18T01:34:13.796713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5185v4","created_at":"2026-05-18T01:34:13.796713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5185","created_at":"2026-05-18T01:34:13.796713+00:00"},{"alias_kind":"pith_short_12","alias_value":"JBS5UYK7T62B","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JBS5UYK7T62BMY2E","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JBS5UYK7","created_at":"2026-05-18T12:27:11.947152+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/JBS5UYK7T62BMY2E7ROD2CUY5F","json":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F.json","graph_json":"https://pith.science/api/pith-number/JBS5UYK7T62BMY2E7ROD2CUY5F/graph.json","events_json":"https://pith.science/api/pith-number/JBS5UYK7T62BMY2E7ROD2CUY5F/events.json","paper":"https://pith.science/paper/JBS5UYK7"},"agent_actions":{"view_html":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F","download_json":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F.json","view_paper":"https://pith.science/paper/JBS5UYK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5185&json=true","fetch_graph":"https://pith.science/api/pith-number/JBS5UYK7T62BMY2E7ROD2CUY5F/graph.json","fetch_events":"https://pith.science/api/pith-number/JBS5UYK7T62BMY2E7ROD2CUY5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F/action/storage_attestation","attest_author":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F/action/author_attestation","sign_citation":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F/action/citation_signature","submit_replication":"https://pith.science/pith/JBS5UYK7T62BMY2E7ROD2CUY5F/action/replication_record"}},"created_at":"2026-05-18T01:34:13.796713+00:00","updated_at":"2026-05-18T01:34:13.796713+00:00"}