{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7FN5QAJZIJEFZK7YEQUYPHVKCH","short_pith_number":"pith:7FN5QAJZ","canonical_record":{"source":{"id":"1611.09545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T10:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"d3644a70d63c34f397645c9f070f713ebc93602c39e318f4a1817dca68293d19","abstract_canon_sha256":"9df116f8c06c0bf39302ee54b65e80cc75f22e66d5b5286536abc3c5af305ee2"},"schema_version":"1.0"},"canonical_sha256":"f95bd8013942485cabf82429879eaa11e20a44a18102912e1d8605de1595cdec","source":{"kind":"arxiv","id":"1611.09545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09545","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09545v1","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09545","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"7FN5QAJZIJEF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FN5QAJZIJEFZK7Y","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FN5QAJZ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7FN5QAJZIJEFZK7YEQUYPHVKCH","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T10:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"d3644a70d63c34f397645c9f070f713ebc93602c39e318f4a1817dca68293d19","abstract_canon_sha256":"9df116f8c06c0bf39302ee54b65e80cc75f22e66d5b5286536abc3c5af305ee2"},"schema_version":"1.0"},"canonical_sha256":"f95bd8013942485cabf82429879eaa11e20a44a18102912e1d8605de1595cdec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:18.130347Z","signature_b64":"qRfvdg5n45/JIRlD44kCfltOqNzvnotAGuNNuPZY6pBlO4g0tUSOtx4OvrAAzCHWs+bH9U5j+xwN1PEA+q36BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95bd8013942485cabf82429879eaa11e20a44a18102912e1d8605de1595cdec","last_reissued_at":"2026-05-18T00:56:18.129672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:18.129672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09545","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-05-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Y6rW+tELIWgB11nH1U1nHdBffy1CGMXWQFeMERseSqHN23Qy0kvcnZL4BjoTKjw1Vp+nHE+7Ec1/0Wt3A7XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:48:19.055195Z"},"content_sha256":"32fe2d46d908b6a587004248a689f720279b517cfe304c0f9c8d200250b8a642","schema_version":"1.0","event_id":"sha256:32fe2d46d908b6a587004248a689f720279b517cfe304c0f9c8d200250b8a642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7FN5QAJZIJEFZK7YEQUYPHVKCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Bounds for Chromatic Polynomials and Chromatic Roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason Brown","submitted_at":"2016-11-29T10:05:57Z","abstract_excerpt":"If $G$ is a $k$-chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$, $\\pi(G,x)$, is at most $x(x-1)\\cdots (x-(k-1))x^{n-k} = (x)_{\\downarrow k}x^{n-k}$ for every $x\\in \\mathbb{N}$. We improve here this bound by showing that \\[ \\pi(G,x) \\leq (x)_{\\downarrow k} (x-1)^{\\Delta(G)-k+1} x^{n-1-\\Delta(G)}\\] for every $x\\in \\mathbb{N},$ where $\\Delta(G)$ is the maximum degree of $G$. Secondly, we show that if $G$ is a connected $k$-chromatic graph of order $n$ where $k\\geq 4$ then $\\pi(G,x)$ is at most $(x)_{\\downarrow k}(x-1)^{n-k}$ for every real $x\\geq n-2+\\left( {n \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09545","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":""},"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-05-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxB9yR41L0ROHPbrpLdrYfkD6vYBuZ9dXKnw95Y/0upIty6RQ6RPOgLSbRlM74a3wL4Ynv72xKDcfLbpFXwbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:48:19.055569Z"},"content_sha256":"ecddd72a2f042c8cead15daa75f6dafdde42c66a5508d93e909847913c3d234f","schema_version":"1.0","event_id":"sha256:ecddd72a2f042c8cead15daa75f6dafdde42c66a5508d93e909847913c3d234f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/bundle.json","state_url":"https://pith.science/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/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-06-24T09:48:19Z","links":{"resolver":"https://pith.science/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH","bundle":"https://pith.science/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/bundle.json","state":"https://pith.science/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FN5QAJZIJEFZK7YEQUYPHVKCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7FN5QAJZIJEFZK7YEQUYPHVKCH","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":"9df116f8c06c0bf39302ee54b65e80cc75f22e66d5b5286536abc3c5af305ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T10:05:57Z","title_canon_sha256":"d3644a70d63c34f397645c9f070f713ebc93602c39e318f4a1817dca68293d19"},"schema_version":"1.0","source":{"id":"1611.09545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09545","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09545v1","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09545","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"7FN5QAJZIJEF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7FN5QAJZIJEFZK7Y","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7FN5QAJZ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:ecddd72a2f042c8cead15daa75f6dafdde42c66a5508d93e909847913c3d234f","target":"graph","created_at":"2026-05-18T00:56:18Z","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"},"paper":{"abstract_excerpt":"If $G$ is a $k$-chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$, $\\pi(G,x)$, is at most $x(x-1)\\cdots (x-(k-1))x^{n-k} = (x)_{\\downarrow k}x^{n-k}$ for every $x\\in \\mathbb{N}$. We improve here this bound by showing that \\[ \\pi(G,x) \\leq (x)_{\\downarrow k} (x-1)^{\\Delta(G)-k+1} x^{n-1-\\Delta(G)}\\] for every $x\\in \\mathbb{N},$ where $\\Delta(G)$ is the maximum degree of $G$. Secondly, we show that if $G$ is a connected $k$-chromatic graph of order $n$ where $k\\geq 4$ then $\\pi(G,x)$ is at most $(x)_{\\downarrow k}(x-1)^{n-k}$ for every real $x\\geq n-2+\\left( {n \\","authors_text":"Aysel Erey, Jason Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T10:05:57Z","title":"New Bounds for Chromatic Polynomials and Chromatic Roots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09545","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:32fe2d46d908b6a587004248a689f720279b517cfe304c0f9c8d200250b8a642","target":"record","created_at":"2026-05-18T00:56:18Z","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":"9df116f8c06c0bf39302ee54b65e80cc75f22e66d5b5286536abc3c5af305ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T10:05:57Z","title_canon_sha256":"d3644a70d63c34f397645c9f070f713ebc93602c39e318f4a1817dca68293d19"},"schema_version":"1.0","source":{"id":"1611.09545","kind":"arxiv","version":1}},"canonical_sha256":"f95bd8013942485cabf82429879eaa11e20a44a18102912e1d8605de1595cdec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95bd8013942485cabf82429879eaa11e20a44a18102912e1d8605de1595cdec","first_computed_at":"2026-05-18T00:56:18.129672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:18.129672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRfvdg5n45/JIRlD44kCfltOqNzvnotAGuNNuPZY6pBlO4g0tUSOtx4OvrAAzCHWs+bH9U5j+xwN1PEA+q36BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:18.130347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32fe2d46d908b6a587004248a689f720279b517cfe304c0f9c8d200250b8a642","sha256:ecddd72a2f042c8cead15daa75f6dafdde42c66a5508d93e909847913c3d234f"],"state_sha256":"35247a8b018f4a60d43f66dc6dcbd447a455951a6ac55b57f785500b1d25d049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCzFVNI3H1uPMNeo3xlq5rfzb2APE9XX/Z5rw3uLNv1Y383Fck7FneHsh+pDuBJwObB33ok41g8JK6zMjh1aAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:48:19.057517Z","bundle_sha256":"afcbd9bb1a3d4e29c038a40e311d38af817a4d01f9a88691b9490d02abb461e9"}}