{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EHRS5Z2CCHUOBWKHBBA4V2JND3","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":"badce98eb45cb78ed8e154417422fdfb6b48f25125cad56391233087bfbab2ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T18:40:44Z","title_canon_sha256":"bea501782f4173693afef49464c393fb3e04dfc485bddc4dbbbbcc73e01fc81b"},"schema_version":"1.0","source":{"id":"1709.08236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08236","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08236v1","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08236","created_at":"2026-05-18T00:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"EHRS5Z2CCHUO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EHRS5Z2CCHUOBWKH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EHRS5Z2C","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:e2184a2c514d8e4539f74d98c05a116e451d95692494c378f17f933149e1be1b","target":"graph","created_at":"2026-05-18T00:34:26Z","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":"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","authors_text":"Ben Cameron, Jason I. Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T18:40:44Z","title":"On the Unimodality of Independence Polynomials of Very Well-Covered Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08236","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:65ba98933835ab512633dab23e23dc0ac17de960240c44466250041767e8aa24","target":"record","created_at":"2026-05-18T00:34:26Z","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":"badce98eb45cb78ed8e154417422fdfb6b48f25125cad56391233087bfbab2ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-24T18:40:44Z","title_canon_sha256":"bea501782f4173693afef49464c393fb3e04dfc485bddc4dbbbbcc73e01fc81b"},"schema_version":"1.0","source":{"id":"1709.08236","kind":"arxiv","version":1}},"canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","first_computed_at":"2026-05-18T00:34:26.066920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:26.066920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MDqe45G5b+EWFB+VLQwPhl9HG5b0zigg/Q8nJwbh20vdFwBFZFMpVVipTuaqaYhhWV2cBrJ8R+jz0Hcpf+LZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:26.067351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65ba98933835ab512633dab23e23dc0ac17de960240c44466250041767e8aa24","sha256:e2184a2c514d8e4539f74d98c05a116e451d95692494c378f17f933149e1be1b"],"state_sha256":"f5379e7a23d917d6208103b21914bade654b86f53e5fc3964a2efeb9b7c41e71"}