{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:E7CDDCP7GY6EX7LJNMKCPRF6VC","short_pith_number":"pith:E7CDDCP7","schema_version":"1.0","canonical_sha256":"27c43189ff363c4bfd696b1427c4bea8a36035fb4be4229e74e1c469d6a7a0d4","source":{"kind":"arxiv","id":"math/0411239","version":1},"attestation_state":"computed","paper":{"title":"Very well-covered graphs with log-concave independence polynomials","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2004-11-10T18:13:58Z","abstract_excerpt":"If for any $k$ the $k$-th coefficient of a polynomial $I(G;x)$ is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Alavi, Malde, Schwenk and Erdos (1987) conjectured that $I(G;x)$ is unimodal, whenever $G$ is a forest, while Brown, Dilcher and Nowakowski (2000) conjectured that $I(G;x)$ is unimodal for any well-covered graph G. Michael and Traves (2003) showed that the assertion is false for well-covered graphs with $a(G)$ > 3 ($a(G)$ is the size of a maximum stable set of the graph $G$), whi"},"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":"math/0411239","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2004-11-10T18:13:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6598b7c226932a22e4dbf3d115d16722b7106c55b470a6720959b11cb34d1b78","abstract_canon_sha256":"b7833d6d2572bebd45e902f911e4ac4b7a239b1c36a5969b950364d6706462d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:00.327221Z","signature_b64":"zU6kuhmzvo+ffGsllLFrY1hTh4sXhiV9Mv+JZYR15GB7cVWmzIs2+oITtAZvMS0XKeNc5F9La5oVd3wBSiQPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27c43189ff363c4bfd696b1427c4bea8a36035fb4be4229e74e1c469d6a7a0d4","last_reissued_at":"2026-05-18T04:31:00.326582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:00.326582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Very well-covered graphs with log-concave independence polynomials","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2004-11-10T18:13:58Z","abstract_excerpt":"If for any $k$ the $k$-th coefficient of a polynomial $I(G;x)$ is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Alavi, Malde, Schwenk and Erdos (1987) conjectured that $I(G;x)$ is unimodal, whenever $G$ is a forest, while Brown, Dilcher and Nowakowski (2000) conjectured that $I(G;x)$ is unimodal for any well-covered graph G. Michael and Traves (2003) showed that the assertion is false for well-covered graphs with $a(G)$ > 3 ($a(G)$ is the size of a maximum stable set of the graph $G$), whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411239","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":"math/0411239","created_at":"2026-05-18T04:31:00.326672+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0411239v1","created_at":"2026-05-18T04:31:00.326672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411239","created_at":"2026-05-18T04:31:00.326672+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7CDDCP7GY6E","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7CDDCP7GY6EX7LJ","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7CDDCP7","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14076","citing_title":"The 2-Quasi-Regularizability Conjecture and Independence Polynomials of Wp Graphs","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC","json":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC.json","graph_json":"https://pith.science/api/pith-number/E7CDDCP7GY6EX7LJNMKCPRF6VC/graph.json","events_json":"https://pith.science/api/pith-number/E7CDDCP7GY6EX7LJNMKCPRF6VC/events.json","paper":"https://pith.science/paper/E7CDDCP7"},"agent_actions":{"view_html":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC","download_json":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC.json","view_paper":"https://pith.science/paper/E7CDDCP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0411239&json=true","fetch_graph":"https://pith.science/api/pith-number/E7CDDCP7GY6EX7LJNMKCPRF6VC/graph.json","fetch_events":"https://pith.science/api/pith-number/E7CDDCP7GY6EX7LJNMKCPRF6VC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC/action/storage_attestation","attest_author":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC/action/author_attestation","sign_citation":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC/action/citation_signature","submit_replication":"https://pith.science/pith/E7CDDCP7GY6EX7LJNMKCPRF6VC/action/replication_record"}},"created_at":"2026-05-18T04:31:00.326672+00:00","updated_at":"2026-05-18T04:31:00.326672+00:00"}