{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZGBGNTTKWNBOZU757SQ2RI4BVC","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":"ebfa3a20cc349a0fc7f73da19135a0718598ceb2a6518bc63754f1b734bbf7bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T08:15:30Z","title_canon_sha256":"21f95ccb1822c04a529042e395f296834dc3a3ea954cc0fb7c98ba16392e56dd"},"schema_version":"1.0","source":{"id":"1605.02291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02291","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02291v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02291","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZGBGNTTKWNBO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGBGNTTKWNBOZU75","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGBGNTTK","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:db85b63e2150be81c9b44c60863dc4cc3ef40690d0fc38ff84639159cf383a98","target":"graph","created_at":"2026-05-18T01:15:21Z","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_{i=1}^n d(G,i) x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. For two graphs $G$ and $H$, let $\\mathcal{C} = \\{C_1,C_2, \\cdots, C_k\\}$ be a clique cover of $G$ and $U\\subseteq V(H)$. We consider clique cover product which denoted by $G^\\mathcal{C} \\star H^U$ and obtained from $G$ as follows: for each clique $C_i \\in \\mathcal{C}$, add a copy of the graph $H$ and join every vertex of $C_i$ to every vertex of $U$. We prove that the domination polynomial of clique cov","authors_text":"Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T08:15:30Z","title":"Domination polynomial of clique cover product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02291","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:5b589ef77cae1c82ced05ad3e61eebbfd8ba3986b0cbba0ce81bdefe8ba0b2b6","target":"record","created_at":"2026-05-18T01:15:21Z","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":"ebfa3a20cc349a0fc7f73da19135a0718598ceb2a6518bc63754f1b734bbf7bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T08:15:30Z","title_canon_sha256":"21f95ccb1822c04a529042e395f296834dc3a3ea954cc0fb7c98ba16392e56dd"},"schema_version":"1.0","source":{"id":"1605.02291","kind":"arxiv","version":1}},"canonical_sha256":"c98266ce6ab342ecd3fdfca1a8a381a8adf57cd76823a81a6d7597ae06a81d9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98266ce6ab342ecd3fdfca1a8a381a8adf57cd76823a81a6d7597ae06a81d9b","first_computed_at":"2026-05-18T01:15:21.350238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.350238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPZze1tYu7kY5oPjxOca2w9V94FZvR4ZWNpEId7onY6JhHazcPB6rcUuQdnS6sb3xA4Nj3qvc3LRswXGfN0mAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.351063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b589ef77cae1c82ced05ad3e61eebbfd8ba3986b0cbba0ce81bdefe8ba0b2b6","sha256:db85b63e2150be81c9b44c60863dc4cc3ef40690d0fc38ff84639159cf383a98"],"state_sha256":"5ee904487d6f2f4145958db7315ae07dbc520419915affb2c07df18ef3cc51de"}