{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:5TBFRNSYRWQ7WAGCVYQGU3LQWI","short_pith_number":"pith:5TBFRNSY","canonical_record":{"source":{"id":"0904.4819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-30T13:12:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0ed3ed7b81408144443eb01492f726d3f04c32e1f610b8175f5af2738971dd30","abstract_canon_sha256":"122ad52afc451259294610e40b6ec1925623d0ddb957bd8a9d5560e9439eb0ec"},"schema_version":"1.0"},"canonical_sha256":"ecc258b6588da1fb00c2ae206a6d70b20494db5b4db482b050f94e8a27cd21cc","source":{"kind":"arxiv","id":"0904.4819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4819","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4819v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4819","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"5TBFRNSYRWQ7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5TBFRNSYRWQ7WAGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5TBFRNSY","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:5TBFRNSYRWQ7WAGCVYQGU3LQWI","target":"record","payload":{"canonical_record":{"source":{"id":"0904.4819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-30T13:12:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0ed3ed7b81408144443eb01492f726d3f04c32e1f610b8175f5af2738971dd30","abstract_canon_sha256":"122ad52afc451259294610e40b6ec1925623d0ddb957bd8a9d5560e9439eb0ec"},"schema_version":"1.0"},"canonical_sha256":"ecc258b6588da1fb00c2ae206a6d70b20494db5b4db482b050f94e8a27cd21cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.167641Z","signature_b64":"xU6KqOeFa4EPxafxaDk3fNf+IJe24hU2z+QH/ZJgAM2MIndHTjMK+lbDsULPn+9k7sghPSCUUJ7bI2GdJVzbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc258b6588da1fb00c2ae206a6d70b20494db5b4db482b050f94e8a27cd21cc","last_reissued_at":"2026-05-18T04:31:12.167104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.167104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.4819","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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fz8s1lBUGP8XflUiuyr8KtDOoiRmgwfniuE0rhA7hOnF0unzdNw7QUa9ScGqThm4x4FNI1zS3wWto7ZgbkNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:07:33.917681Z"},"content_sha256":"16b6724e9b0234dbd536eb530f8598aec5180ea13c1126bf845157d0c3b631ef","schema_version":"1.0","event_id":"sha256:16b6724e9b0234dbd536eb530f8598aec5180ea13c1126bf845157d0c3b631ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:5TBFRNSYRWQ7WAGCVYQGU3LQWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The independence polynomial of a graph at -1","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-04-30T13:12:01Z","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.\n  In this paper we prove that: 1. I(T;-1) equels either -1 or 0 or 1 for every tree T; 2. I(G;-1)=0 for every connected well-covered graph G of girth > 5, non-isomorphic to C_{7} or K_{2}; 3. the absolute value of I(G;-1) is not greater than 2^nu(G), for every graph G, where nu(G) is its cyclomatic number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4819","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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydiZJGfC/1gj6Svvhw9DHh5tF0SBPlqY+j/wuBMODgoiEdEGSUVa3tSRh39H9CNekgiNBXL4mocpRHo3vCR+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:07:33.918036Z"},"content_sha256":"3b7316c6531e80d40c15934e17567703c46fbada9f28756c751f54703c87cb04","schema_version":"1.0","event_id":"sha256:3b7316c6531e80d40c15934e17567703c46fbada9f28756c751f54703c87cb04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/bundle.json","state_url":"https://pith.science/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/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-30T18:07:33Z","links":{"resolver":"https://pith.science/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI","bundle":"https://pith.science/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/bundle.json","state":"https://pith.science/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TBFRNSYRWQ7WAGCVYQGU3LQWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:5TBFRNSYRWQ7WAGCVYQGU3LQWI","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":"122ad52afc451259294610e40b6ec1925623d0ddb957bd8a9d5560e9439eb0ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-30T13:12:01Z","title_canon_sha256":"0ed3ed7b81408144443eb01492f726d3f04c32e1f610b8175f5af2738971dd30"},"schema_version":"1.0","source":{"id":"0904.4819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4819","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4819v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4819","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"5TBFRNSYRWQ7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5TBFRNSYRWQ7WAGC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5TBFRNSY","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:3b7316c6531e80d40c15934e17567703c46fbada9f28756c751f54703c87cb04","target":"graph","created_at":"2026-05-18T04:31:12Z","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":"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.\n  In this paper we prove that: 1. I(T;-1) equels either -1 or 0 or 1 for every tree T; 2. I(G;-1)=0 for every connected well-covered graph G of girth > 5, non-isomorphic to C_{7} or K_{2}; 3. the absolute value of I(G;-1) is not greater than 2^nu(G), for every graph G, where nu(G) is its cyclomatic number.","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-30T13:12:01Z","title":"The independence polynomial of a graph at -1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4819","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:16b6724e9b0234dbd536eb530f8598aec5180ea13c1126bf845157d0c3b631ef","target":"record","created_at":"2026-05-18T04:31:12Z","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":"122ad52afc451259294610e40b6ec1925623d0ddb957bd8a9d5560e9439eb0ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-04-30T13:12:01Z","title_canon_sha256":"0ed3ed7b81408144443eb01492f726d3f04c32e1f610b8175f5af2738971dd30"},"schema_version":"1.0","source":{"id":"0904.4819","kind":"arxiv","version":1}},"canonical_sha256":"ecc258b6588da1fb00c2ae206a6d70b20494db5b4db482b050f94e8a27cd21cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecc258b6588da1fb00c2ae206a6d70b20494db5b4db482b050f94e8a27cd21cc","first_computed_at":"2026-05-18T04:31:12.167104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:12.167104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xU6KqOeFa4EPxafxaDk3fNf+IJe24hU2z+QH/ZJgAM2MIndHTjMK+lbDsULPn+9k7sghPSCUUJ7bI2GdJVzbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:12.167641Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.4819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16b6724e9b0234dbd536eb530f8598aec5180ea13c1126bf845157d0c3b631ef","sha256:3b7316c6531e80d40c15934e17567703c46fbada9f28756c751f54703c87cb04"],"state_sha256":"327965ac7db32541aec4a5eaf641f6cab4e68a9e27f1a89935690d1202a07fc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZPfp6hhIQzpGbdqGTrHZaa9P9xQZex7FXXsaji+3kPOkOOjFQB9OMcH80U5eYvcfKYK8W1VV/3UBSxoNsq1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:07:33.920018Z","bundle_sha256":"ad0418daa07f5bf6692eb6986b81da418931d676aba46ce4c54ef299b4d75f1c"}}