{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EHRS5Z2CCHUOBWKHBBA4V2JND3","short_pith_number":"pith:EHRS5Z2C","schema_version":"1.0","canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","source":{"kind":"arxiv","id":"1709.08236","version":1},"attestation_state":"computed","paper":{"title":"On the Unimodality of Independence Polynomials of Very Well-Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Cameron, Jason I. Brown","submitted_at":"2017-09-24T18:40:44Z","abstract_excerpt":"The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing). In this article we show that every graph is embeddable as an induced subgraph of a very well-covered graph whose independence polynomial is unimodal, by considering the location of the roots of"},"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":"1709.08236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T18:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"bea501782f4173693afef49464c393fb3e04dfc485bddc4dbbbbcc73e01fc81b","abstract_canon_sha256":"badce98eb45cb78ed8e154417422fdfb6b48f25125cad56391233087bfbab2ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:26.067351Z","signature_b64":"MDqe45G5b+EWFB+VLQwPhl9HG5b0zigg/Q8nJwbh20vdFwBFZFMpVVipTuaqaYhhWV2cBrJ8R+jz0Hcpf+LZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","last_reissued_at":"2026-05-18T00:34:26.066920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:26.066920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Unimodality of Independence Polynomials of Very Well-Covered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Cameron, Jason I. Brown","submitted_at":"2017-09-24T18:40:44Z","abstract_excerpt":"The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing). In this article we show that every graph is embeddable as an induced subgraph of a very well-covered graph whose independence polynomial is unimodal, by considering the location of the roots of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08236","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":"1709.08236","created_at":"2026-05-18T00:34:26.066982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08236v1","created_at":"2026-05-18T00:34:26.066982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08236","created_at":"2026-05-18T00:34:26.066982+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHRS5Z2CCHUO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHRS5Z2CCHUOBWKH","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHRS5Z2C","created_at":"2026-05-18T12:31:12.930513+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/EHRS5Z2CCHUOBWKHBBA4V2JND3","json":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3.json","graph_json":"https://pith.science/api/pith-number/EHRS5Z2CCHUOBWKHBBA4V2JND3/graph.json","events_json":"https://pith.science/api/pith-number/EHRS5Z2CCHUOBWKHBBA4V2JND3/events.json","paper":"https://pith.science/paper/EHRS5Z2C"},"agent_actions":{"view_html":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3","download_json":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3.json","view_paper":"https://pith.science/paper/EHRS5Z2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08236&json=true","fetch_graph":"https://pith.science/api/pith-number/EHRS5Z2CCHUOBWKHBBA4V2JND3/graph.json","fetch_events":"https://pith.science/api/pith-number/EHRS5Z2CCHUOBWKHBBA4V2JND3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/action/storage_attestation","attest_author":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/action/author_attestation","sign_citation":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/action/citation_signature","submit_replication":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/action/replication_record"}},"created_at":"2026-05-18T00:34:26.066982+00:00","updated_at":"2026-05-18T00:34:26.066982+00:00"}