{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:JEQKPISYIBGUXBNFRVXX4OYGK7","short_pith_number":"pith:JEQKPISY","schema_version":"1.0","canonical_sha256":"4920a7a258404d4b85a58d6f7e3b0657cb2ff8974772fd8f79a20a4e5778fc8f","source":{"kind":"arxiv","id":"0905.3487","version":1},"attestation_state":"computed","paper":{"title":"A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2009-05-21T13:15:37Z","abstract_excerpt":"If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we provide an elementary proof of the inequality claiming that the absolute value of I(G;-1) is not greater than 2^phi(G), for every graph G, where phi(G) is its decycling number."},"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":"0905.3487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-21T13:15:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a8c5a314420cd35d5f9c0152b07f13eb4142349392c3e6464a42322b051e6750","abstract_canon_sha256":"670b0148b8bd55e5b146ad4f221276c6fd8997ef1cb05b65197f2a455229a825"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.140069Z","signature_b64":"Dodt1lf0rGwv6a08yOCuIK+2rdHSmhn4PX5Edu/VSwNxfqt69iGVLxwf52hj6U8grIJRSosWtfai6dTU1FR7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4920a7a258404d4b85a58d6f7e3b0657cb2ff8974772fd8f79a20a4e5778fc8f","last_reissued_at":"2026-05-18T04:31:12.139419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.139419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2009-05-21T13:15:37Z","abstract_excerpt":"If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we provide an elementary proof of the inequality claiming that the absolute value of I(G;-1) is not greater than 2^phi(G), for every graph G, where phi(G) is its decycling number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3487","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":"0905.3487","created_at":"2026-05-18T04:31:12.139522+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.3487v1","created_at":"2026-05-18T04:31:12.139522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3487","created_at":"2026-05-18T04:31:12.139522+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEQKPISYIBGU","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEQKPISYIBGUXBNF","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEQKPISY","created_at":"2026-05-18T12:26:00.592388+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/JEQKPISYIBGUXBNFRVXX4OYGK7","json":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7.json","graph_json":"https://pith.science/api/pith-number/JEQKPISYIBGUXBNFRVXX4OYGK7/graph.json","events_json":"https://pith.science/api/pith-number/JEQKPISYIBGUXBNFRVXX4OYGK7/events.json","paper":"https://pith.science/paper/JEQKPISY"},"agent_actions":{"view_html":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7","download_json":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7.json","view_paper":"https://pith.science/paper/JEQKPISY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.3487&json=true","fetch_graph":"https://pith.science/api/pith-number/JEQKPISYIBGUXBNFRVXX4OYGK7/graph.json","fetch_events":"https://pith.science/api/pith-number/JEQKPISYIBGUXBNFRVXX4OYGK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7/action/storage_attestation","attest_author":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7/action/author_attestation","sign_citation":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7/action/citation_signature","submit_replication":"https://pith.science/pith/JEQKPISYIBGUXBNFRVXX4OYGK7/action/replication_record"}},"created_at":"2026-05-18T04:31:12.139522+00:00","updated_at":"2026-05-18T04:31:12.139522+00:00"}