{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:E7VB7C76HO7AHGZYGMSMPVMNHT","short_pith_number":"pith:E7VB7C76","schema_version":"1.0","canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","source":{"kind":"arxiv","id":"1103.2427","version":1},"attestation_state":"computed","paper":{"title":"On the Domination Number of Generalized Petersen Graphs P(ck,k)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Xirong Xu, Yuansheng Yang","submitted_at":"2011-03-12T07:22:33Z","abstract_excerpt":"Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \\subseteq V(G)$ is a $dominating$ $set$ if for each $v \\in V(G)$ either $v \\in S$ or $v$ is adjacent to some $w \\in S$. That is, $S$ is a dominating set if and only if $N[S]=V(G)$. The domination number $\\gamma(G)$ is the minimum cardinalities of minimal dominating sets. In this paper, we give an improved upper bound on the domination number of generalized Petersen graphs $P(ck,k)$ for $c\\geq 3$ and $k\\geq 3$. We also prove that $\\gamma(P(4k,k))=2k+1$ for even $k$, $\\gamma(P(5k,k"},"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":"1103.2427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-12T07:22:33Z","cross_cats_sorted":[],"title_canon_sha256":"18a42feb097ccd84f40ee76310d79988e89222a57e0555cc6292b61c5a31ba5b","abstract_canon_sha256":"a14bb4824382285d5fa37601f9d68db5ae71e94c226600fadf80c8babc52ee2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:19.773985Z","signature_b64":"8xWt0G5424R6HABCFey/mUGr6JGA0SG9UBc++o+ueBURsQLrud7yIj7Mpxq0306BnU49e1CHRepUlQTioyu0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","last_reissued_at":"2026-05-18T02:22:19.773219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:19.773219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Domination Number of Generalized Petersen Graphs P(ck,k)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Xirong Xu, Yuansheng Yang","submitted_at":"2011-03-12T07:22:33Z","abstract_excerpt":"Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \\subseteq V(G)$ is a $dominating$ $set$ if for each $v \\in V(G)$ either $v \\in S$ or $v$ is adjacent to some $w \\in S$. That is, $S$ is a dominating set if and only if $N[S]=V(G)$. The domination number $\\gamma(G)$ is the minimum cardinalities of minimal dominating sets. In this paper, we give an improved upper bound on the domination number of generalized Petersen graphs $P(ck,k)$ for $c\\geq 3$ and $k\\geq 3$. We also prove that $\\gamma(P(4k,k))=2k+1$ for even $k$, $\\gamma(P(5k,k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2427","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":"1103.2427","created_at":"2026-05-18T02:22:19.773371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2427v1","created_at":"2026-05-18T02:22:19.773371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2427","created_at":"2026-05-18T02:22:19.773371+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7VB7C76HO7A","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7VB7C76HO7AHGZY","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7VB7C76","created_at":"2026-05-18T12:26:26.731475+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/E7VB7C76HO7AHGZYGMSMPVMNHT","json":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT.json","graph_json":"https://pith.science/api/pith-number/E7VB7C76HO7AHGZYGMSMPVMNHT/graph.json","events_json":"https://pith.science/api/pith-number/E7VB7C76HO7AHGZYGMSMPVMNHT/events.json","paper":"https://pith.science/paper/E7VB7C76"},"agent_actions":{"view_html":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT","download_json":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT.json","view_paper":"https://pith.science/paper/E7VB7C76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2427&json=true","fetch_graph":"https://pith.science/api/pith-number/E7VB7C76HO7AHGZYGMSMPVMNHT/graph.json","fetch_events":"https://pith.science/api/pith-number/E7VB7C76HO7AHGZYGMSMPVMNHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/action/storage_attestation","attest_author":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/action/author_attestation","sign_citation":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/action/citation_signature","submit_replication":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/action/replication_record"}},"created_at":"2026-05-18T02:22:19.773371+00:00","updated_at":"2026-05-18T02:22:19.773371+00:00"}