{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G7WIJNP7SV5W6TBC5SSIK6IGU6","short_pith_number":"pith:G7WIJNP7","schema_version":"1.0","canonical_sha256":"37ec84b5ff957b6f4c22eca4857906a785bd448f11cf336b74dba5c675e4c58b","source":{"kind":"arxiv","id":"1501.05856","version":1},"attestation_state":"computed","paper":{"title":"Domination polynomial of generalized friendship and generalized book graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Saeid Alikhani, Somayeh Jahari","submitted_at":"2015-01-23T16:16:32Z","abstract_excerpt":"Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining n copies of the cycle graph of order 4 with a common edge and study the domination polynomials of some generalized book graphs. In particular we examine the domination roots of these families and find the limiting curve for the roots."},"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":"1501.05856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-23T16:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"bd52721046f0b5609b7e42e227c88c6704ba4a26b71fd7c5e2f5d9c92055a083","abstract_canon_sha256":"abc9d03ada4b77b6672163b18f647b25b4779f9587b01cb6cdbdb7fa7a25dd5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.835919Z","signature_b64":"LQkob3Eq3aYY/eeUFoip1Q2iaHFsnYHOxjTRsjSAtfKRhAm6EP+VCqASOP35acgFBnPQTvzdIjhFFcRCl8WKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37ec84b5ff957b6f4c22eca4857906a785bd448f11cf336b74dba5c675e4c58b","last_reissued_at":"2026-05-18T02:28:48.835585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.835585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination polynomial of generalized friendship and generalized book graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Saeid Alikhani, Somayeh Jahari","submitted_at":"2015-01-23T16:16:32Z","abstract_excerpt":"Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining n copies of the cycle graph of order 4 with a common edge and study the domination polynomials of some generalized book graphs. In particular we examine the domination roots of these families and find the limiting curve for the roots."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05856","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":"1501.05856","created_at":"2026-05-18T02:28:48.835639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05856v1","created_at":"2026-05-18T02:28:48.835639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05856","created_at":"2026-05-18T02:28:48.835639+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7WIJNP7SV5W","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7WIJNP7SV5W6TBC","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7WIJNP7","created_at":"2026-05-18T12:29:22.688609+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/G7WIJNP7SV5W6TBC5SSIK6IGU6","json":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6.json","graph_json":"https://pith.science/api/pith-number/G7WIJNP7SV5W6TBC5SSIK6IGU6/graph.json","events_json":"https://pith.science/api/pith-number/G7WIJNP7SV5W6TBC5SSIK6IGU6/events.json","paper":"https://pith.science/paper/G7WIJNP7"},"agent_actions":{"view_html":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6","download_json":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6.json","view_paper":"https://pith.science/paper/G7WIJNP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05856&json=true","fetch_graph":"https://pith.science/api/pith-number/G7WIJNP7SV5W6TBC5SSIK6IGU6/graph.json","fetch_events":"https://pith.science/api/pith-number/G7WIJNP7SV5W6TBC5SSIK6IGU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6/action/storage_attestation","attest_author":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6/action/author_attestation","sign_citation":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6/action/citation_signature","submit_replication":"https://pith.science/pith/G7WIJNP7SV5W6TBC5SSIK6IGU6/action/replication_record"}},"created_at":"2026-05-18T02:28:48.835639+00:00","updated_at":"2026-05-18T02:28:48.835639+00:00"}