{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EHRS5Z2CCHUOBWKHBBA4V2JND3","short_pith_number":"pith:EHRS5Z2C","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"},"canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","source":{"kind":"arxiv","id":"1709.08236","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EHRS5Z2CCHUOBWKHBBA4V2JND3","target":"record","payload":{"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"},"canonical_sha256":"21e32ee74211e8e0d9470841cae92d1effbb330bf18cc7cb3a7228b13cad68e2","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"},"source_kind":"arxiv","source_id":"1709.08236","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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHpids7gye7vLx7eyY6U99MVV4XL3Eck6Zw0wU54fNQ4+cVuuIK1W07BrlqbgwJeO98keFtKoN87ODQQmBZuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:30:36.521015Z"},"content_sha256":"65ba98933835ab512633dab23e23dc0ac17de960240c44466250041767e8aa24","schema_version":"1.0","event_id":"sha256:65ba98933835ab512633dab23e23dc0ac17de960240c44466250041767e8aa24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EHRS5Z2CCHUOBWKHBBA4V2JND3","target":"graph","payload":{"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"},"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:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79OQyEpyBjGUN/IinLF2AgKPLutM7WTus/wcHUAsyXAVVJc94DPivuv5rYnVJ1teZRKNDzQ+otsLi1dM+J2LDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:30:36.521449Z"},"content_sha256":"e2184a2c514d8e4539f74d98c05a116e451d95692494c378f17f933149e1be1b","schema_version":"1.0","event_id":"sha256:e2184a2c514d8e4539f74d98c05a116e451d95692494c378f17f933149e1be1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/bundle.json","state_url":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/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-05-26T13:30:36Z","links":{"resolver":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3","bundle":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/bundle.json","state":"https://pith.science/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHRS5Z2CCHUOBWKHBBA4V2JND3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQ0m+OkoSbrbCSmG6Z7ftktiUmHmS41kg4N8iX+Qq9ReuLOaXOSfP5vohYec83+/YjAao/0zIQ4bk2i/k5rzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:30:36.524049Z","bundle_sha256":"cac8fa045526f2cf37d1573e42fae22922e99f641860418b0042af08928c1a7e"}}