{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5GCM7IE45ZSBAW73NBH7BSPDPV","short_pith_number":"pith:5GCM7IE4","canonical_record":{"source":{"id":"1305.3734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T09:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"20180dc14e86aab0acd302372db4d865b07d5e5034bedc27a3ca9598d7df631b","abstract_canon_sha256":"841d1ac5a85d79ad5c4db46b5e365ae95599123f0a6eda2fde45c719305e2f56"},"schema_version":"1.0"},"canonical_sha256":"e984cfa09cee64105bfb684ff0c9e37d551c80afcd6334c9f25e24a6dff50aa4","source":{"kind":"arxiv","id":"1305.3734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3734","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3734v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3734","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"5GCM7IE45ZSB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5GCM7IE45ZSBAW73","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5GCM7IE4","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5GCM7IE45ZSBAW73NBH7BSPDPV","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T09:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"20180dc14e86aab0acd302372db4d865b07d5e5034bedc27a3ca9598d7df631b","abstract_canon_sha256":"841d1ac5a85d79ad5c4db46b5e365ae95599123f0a6eda2fde45c719305e2f56"},"schema_version":"1.0"},"canonical_sha256":"e984cfa09cee64105bfb684ff0c9e37d551c80afcd6334c9f25e24a6dff50aa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.904864Z","signature_b64":"9ePBh+tE2s07022W8HK677/+aqAHeRPczjxbnUEFlJl55u/3BcVo/GKVlJ9gT46h7S42NOOOvqWLbHN+ET1XBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e984cfa09cee64105bfb684ff0c9e37d551c80afcd6334c9f25e24a6dff50aa4","last_reissued_at":"2026-05-18T02:57:35.904308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.904308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3734","source_version":2,"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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4vx+2q63Jf+x7GyJyKBoMFgSVagees3+Cfu3xZ23isANzJjv6s+Z/xkh37v5KN/2ASw6G+dOASkmY/KSgxbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:30:19.364230Z"},"content_sha256":"7819a705ba04555d8f66db8bc6ff1a3f24b64793ee46258a31252042b9956118","schema_version":"1.0","event_id":"sha256:7819a705ba04555d8f66db8bc6ff1a3f24b64793ee46258a31252042b9956118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5GCM7IE45ZSBAW73NBH7BSPDPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Final title: \"More on domination polynomial and domination root\" Previous title: \"Graphs with domination roots in the right half-plane\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emeric Deutsch, Saeid Alikhani","submitted_at":"2013-05-16T09:33:10Z","abstract_excerpt":"Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is clear that (0,\\infty) is zero free interval for domination polynomial of a graph. It is interesting to investigate graphs which have complex domination roots with positive real parts. In this paper, we first investigate complexity of the domination polynomial at specific points. Then we present and investigate some families of graphs whose complex domination ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3734","kind":"arxiv","version":2},"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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyuNbPmronHn8qHR0kPa/YlWjx+NWRPRwinDQKePo+ePP9ZTKdhDEa6NS18Iz1mzbzHdQh5o79mlV8WNnOjABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:30:19.365148Z"},"content_sha256":"d7430bc8c2d54100462c8d33a67ca066ab0e58744deb304c74d3691429161391","schema_version":"1.0","event_id":"sha256:d7430bc8c2d54100462c8d33a67ca066ab0e58744deb304c74d3691429161391"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/bundle.json","state_url":"https://pith.science/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/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-31T01:30:19Z","links":{"resolver":"https://pith.science/pith/5GCM7IE45ZSBAW73NBH7BSPDPV","bundle":"https://pith.science/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/bundle.json","state":"https://pith.science/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GCM7IE45ZSBAW73NBH7BSPDPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5GCM7IE45ZSBAW73NBH7BSPDPV","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":"841d1ac5a85d79ad5c4db46b5e365ae95599123f0a6eda2fde45c719305e2f56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T09:33:10Z","title_canon_sha256":"20180dc14e86aab0acd302372db4d865b07d5e5034bedc27a3ca9598d7df631b"},"schema_version":"1.0","source":{"id":"1305.3734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3734","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3734v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3734","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"5GCM7IE45ZSB","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5GCM7IE45ZSBAW73","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5GCM7IE4","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:d7430bc8c2d54100462c8d33a67ca066ab0e58744deb304c74d3691429161391","target":"graph","created_at":"2026-05-18T02:57:35Z","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":"Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is clear that (0,\\infty) is zero free interval for domination polynomial of a graph. It is interesting to investigate graphs which have complex domination roots with positive real parts. In this paper, we first investigate complexity of the domination polynomial at specific points. Then we present and investigate some families of graphs whose complex domination ro","authors_text":"Emeric Deutsch, Saeid Alikhani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T09:33:10Z","title":"Final title: \"More on domination polynomial and domination root\" Previous title: \"Graphs with domination roots in the right half-plane\""},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3734","kind":"arxiv","version":2},"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:7819a705ba04555d8f66db8bc6ff1a3f24b64793ee46258a31252042b9956118","target":"record","created_at":"2026-05-18T02:57:35Z","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":"841d1ac5a85d79ad5c4db46b5e365ae95599123f0a6eda2fde45c719305e2f56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T09:33:10Z","title_canon_sha256":"20180dc14e86aab0acd302372db4d865b07d5e5034bedc27a3ca9598d7df631b"},"schema_version":"1.0","source":{"id":"1305.3734","kind":"arxiv","version":2}},"canonical_sha256":"e984cfa09cee64105bfb684ff0c9e37d551c80afcd6334c9f25e24a6dff50aa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e984cfa09cee64105bfb684ff0c9e37d551c80afcd6334c9f25e24a6dff50aa4","first_computed_at":"2026-05-18T02:57:35.904308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:35.904308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ePBh+tE2s07022W8HK677/+aqAHeRPczjxbnUEFlJl55u/3BcVo/GKVlJ9gT46h7S42NOOOvqWLbHN+ET1XBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:35.904864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7819a705ba04555d8f66db8bc6ff1a3f24b64793ee46258a31252042b9956118","sha256:d7430bc8c2d54100462c8d33a67ca066ab0e58744deb304c74d3691429161391"],"state_sha256":"785996a9e4126b05bc2e079180c4859743dedd7632714012a4a44cb89c423ace"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgklgj11GZmaqQSF3ZeXaGA5gX4h09mTacHtka/wrbj8dL1CgWywBBGJCWSXeOuw6ihX6G6vgO4csNQ/M99XDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:30:19.369453Z","bundle_sha256":"bf7fdf477f319bc6c7c3cab5c7f5ec2c9571f04f6c7d7de76c41c497f120573a"}}