{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KWKVBTJ34N4YSKRCPA43HHGRV6","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":"78ad0d6e0f92e127c0fd3fc96d66d5bfe1a690d44300f091ea4244869cc715e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T16:30:57Z","title_canon_sha256":"196ee8ba85a6d0188c12bb1d86c909fefa8adeef779472c0eddf58ad663c8c81"},"schema_version":"1.0","source":{"id":"1401.2092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2092","created_at":"2026-05-18T02:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2092v2","created_at":"2026-05-18T02:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2092","created_at":"2026-05-18T02:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"KWKVBTJ34N4Y","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KWKVBTJ34N4YSKRC","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KWKVBTJ3","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:bdc466beb5bd5130b288afff868928718daa844581b020e0411c8850cc171ded","target":"graph","created_at":"2026-05-18T02:44:01Z","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 {\\em domination polynomial} of $G$ is the polynomial ${D(G, x)=\\sum_{i=0}^{n} d(G,i) x^{i}}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$.\n  Let $n$ be any positive integer and $F_n$ be the Friendship graph with $2n + 1$ vertices and $3n$ edges, formed by the join of $K_{1}$ with $nK_{2}$. We study the domination polynomials of this family of graphs, and in particular examine the domination roots of the family, and find the limiting curve for the roots. We also show that for every $n\\geq 2$, $F_n$ is not $\\mathcal{D}$-unique, t","authors_text":"Jason Brown, Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T16:30:57Z","title":"On the Domination Polynomials of Friendship Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2092","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:7ed268c07d90d4c144e650928ff2df7e7f6c7efff1a031316443d37baee7731a","target":"record","created_at":"2026-05-18T02:44:01Z","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":"78ad0d6e0f92e127c0fd3fc96d66d5bfe1a690d44300f091ea4244869cc715e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-08T16:30:57Z","title_canon_sha256":"196ee8ba85a6d0188c12bb1d86c909fefa8adeef779472c0eddf58ad663c8c81"},"schema_version":"1.0","source":{"id":"1401.2092","kind":"arxiv","version":2}},"canonical_sha256":"559550cd3be379892a227839b39cd1af8c6fcacae299db26bbb936091b68b2ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"559550cd3be379892a227839b39cd1af8c6fcacae299db26bbb936091b68b2ee","first_computed_at":"2026-05-18T02:44:01.912335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:01.912335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sTV9LHnrNg3878ZgFE1BEGWPg+EoBzDOrnC0tLEjhzHymuIhdklzqcnNpInI/M66XiupySzYi5FeW/CMdo8CBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:01.912817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ed268c07d90d4c144e650928ff2df7e7f6c7efff1a031316443d37baee7731a","sha256:bdc466beb5bd5130b288afff868928718daa844581b020e0411c8850cc171ded"],"state_sha256":"c136dcf7c5be706f5c9c8f08293c7618484e023342287426ae3f78d1f0f4bf83"}