{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AAJT35DDUYZWPP4ABXSKROZN2K","short_pith_number":"pith:AAJT35DD","schema_version":"1.0","canonical_sha256":"00133df463a63367bf800de4a8bb2dd2b6b00b6cdcd6b3c142da3fe88d88a8a1","source":{"kind":"arxiv","id":"1509.05950","version":1},"attestation_state":"computed","paper":{"title":"On the roots of hypergraph chromatic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sukhada Fadnavis","submitted_at":"2015-09-20T00:15:09Z","abstract_excerpt":"Let $G = (V,E)$ be a finite, simple, connected graph with chromatic polynomial $P_G(q)$. Sokal \\cite{sokal} proved that the roots of the chromatic polynomial of $G$ are bounded in absolute value by $KD$ where, $D$ is the maximum degree of the graph and $7< K < 8$ is a constant. In this paper we generalize this result to uniform hypergraphs. To prove our results we will use the theory of the bounded exponential type graph polynomials."},"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":"1509.05950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-20T00:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"f9cb18f6bda4652ccfe17d507793397e59aa79f931a523273f8d9d38c26a8acf","abstract_canon_sha256":"b1d1fe219abdb7b8be883019d8232de0b8814e2020b34ca0b3ae9201c8b7f8a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:36.287379Z","signature_b64":"U8iKq3CcoDBeZWMZ+/tRAfYFxoFa0Pe605GElAarin9F1HXvPga5Jw+GgP+U6tWasMGPvB63fM7z6XKgn0fFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00133df463a63367bf800de4a8bb2dd2b6b00b6cdcd6b3c142da3fe88d88a8a1","last_reissued_at":"2026-05-18T01:32:36.286918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:36.286918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the roots of hypergraph chromatic polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sukhada Fadnavis","submitted_at":"2015-09-20T00:15:09Z","abstract_excerpt":"Let $G = (V,E)$ be a finite, simple, connected graph with chromatic polynomial $P_G(q)$. Sokal \\cite{sokal} proved that the roots of the chromatic polynomial of $G$ are bounded in absolute value by $KD$ where, $D$ is the maximum degree of the graph and $7< K < 8$ is a constant. In this paper we generalize this result to uniform hypergraphs. To prove our results we will use the theory of the bounded exponential type graph polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05950","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05950","created_at":"2026-05-18T01:32:36.286986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05950v1","created_at":"2026-05-18T01:32:36.286986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05950","created_at":"2026-05-18T01:32:36.286986+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAJT35DDUYZW","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAJT35DDUYZWPP4A","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAJT35DD","created_at":"2026-05-18T12:29:10.953037+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/AAJT35DDUYZWPP4ABXSKROZN2K","json":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K.json","graph_json":"https://pith.science/api/pith-number/AAJT35DDUYZWPP4ABXSKROZN2K/graph.json","events_json":"https://pith.science/api/pith-number/AAJT35DDUYZWPP4ABXSKROZN2K/events.json","paper":"https://pith.science/paper/AAJT35DD"},"agent_actions":{"view_html":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K","download_json":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K.json","view_paper":"https://pith.science/paper/AAJT35DD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05950&json=true","fetch_graph":"https://pith.science/api/pith-number/AAJT35DDUYZWPP4ABXSKROZN2K/graph.json","fetch_events":"https://pith.science/api/pith-number/AAJT35DDUYZWPP4ABXSKROZN2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K/action/storage_attestation","attest_author":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K/action/author_attestation","sign_citation":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K/action/citation_signature","submit_replication":"https://pith.science/pith/AAJT35DDUYZWPP4ABXSKROZN2K/action/replication_record"}},"created_at":"2026-05-18T01:32:36.286986+00:00","updated_at":"2026-05-18T01:32:36.286986+00:00"}