{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EVZ3QN4MQNR6FPLCKG4IB56VC6","short_pith_number":"pith:EVZ3QN4M","schema_version":"1.0","canonical_sha256":"2573b8378c8363e2bd6251b880f7d517aece632851cfbd95562ebf2402b843f5","source":{"kind":"arxiv","id":"1311.6426","version":2},"attestation_state":"computed","paper":{"title":"On the roots of $\\sigma$-polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason Brown","submitted_at":"2013-11-25T20:04:53Z","abstract_excerpt":"Given a graph $G$ of order $n$, the $\\sigma$-$polynomial$ of $G$ is the generating function $\\sigma(G,x) = \\sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti [1] proved that $\\sigma$-polynomials of graphs with chromatic number at least $n-2$ had all real roots, and conjectured the same held for chromatic number $n-3$. We affirm this conjecture."},"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":"1311.6426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-25T20:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"2fd607b4b04eb0bbcac12db4b8a42da805f60c13617d8b04b8038a0836e2d340","abstract_canon_sha256":"2a60f082db1c99114fe61df4579ec8b7ac178f638729a943d029e0469b1e65d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.824325Z","signature_b64":"u4Q7ZAtqK8DYicdu265wwbHyGLWOTaopAmgQQFrKiRLJyq1JzB9Uy0x6yO0pU2mrzLpRoVJ1GriNU8PnKPyVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2573b8378c8363e2bd6251b880f7d517aece632851cfbd95562ebf2402b843f5","last_reissued_at":"2026-05-18T00:36:41.823572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.823572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the roots of $\\sigma$-polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason Brown","submitted_at":"2013-11-25T20:04:53Z","abstract_excerpt":"Given a graph $G$ of order $n$, the $\\sigma$-$polynomial$ of $G$ is the generating function $\\sigma(G,x) = \\sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti [1] proved that $\\sigma$-polynomials of graphs with chromatic number at least $n-2$ had all real roots, and conjectured the same held for chromatic number $n-3$. We affirm this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6426","kind":"arxiv","version":2},"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":"1311.6426","created_at":"2026-05-18T00:36:41.823687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6426v2","created_at":"2026-05-18T00:36:41.823687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6426","created_at":"2026-05-18T00:36:41.823687+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVZ3QN4MQNR6","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVZ3QN4MQNR6FPLC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVZ3QN4M","created_at":"2026-05-18T12:27:43.054852+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/EVZ3QN4MQNR6FPLCKG4IB56VC6","json":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6.json","graph_json":"https://pith.science/api/pith-number/EVZ3QN4MQNR6FPLCKG4IB56VC6/graph.json","events_json":"https://pith.science/api/pith-number/EVZ3QN4MQNR6FPLCKG4IB56VC6/events.json","paper":"https://pith.science/paper/EVZ3QN4M"},"agent_actions":{"view_html":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6","download_json":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6.json","view_paper":"https://pith.science/paper/EVZ3QN4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6426&json=true","fetch_graph":"https://pith.science/api/pith-number/EVZ3QN4MQNR6FPLCKG4IB56VC6/graph.json","fetch_events":"https://pith.science/api/pith-number/EVZ3QN4MQNR6FPLCKG4IB56VC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6/action/storage_attestation","attest_author":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6/action/author_attestation","sign_citation":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6/action/citation_signature","submit_replication":"https://pith.science/pith/EVZ3QN4MQNR6FPLCKG4IB56VC6/action/replication_record"}},"created_at":"2026-05-18T00:36:41.823687+00:00","updated_at":"2026-05-18T00:36:41.823687+00:00"}