{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E7VB7C76HO7AHGZYGMSMPVMNHT","short_pith_number":"pith:E7VB7C76","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"},"canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","source":{"kind":"arxiv","id":"1103.2427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2427","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2427v1","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2427","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"E7VB7C76HO7A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7VB7C76HO7AHGZY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7VB7C76","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E7VB7C76HO7AHGZYGMSMPVMNHT","target":"record","payload":{"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"},"canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","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"},"source_kind":"arxiv","source_id":"1103.2427","source_version":1,"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:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21v+v6Wi4ueegtC9Mg1gjtBnRJ5rmfjHWeWrb8SVsf3Y+SsHyIT1WfiWs33chvqZJa2pSvdRD4vPKDEUW9ijBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:34:15.565320Z"},"content_sha256":"3fc216c56aad78f99b3400729bcf56e326e77fd633fc760de47f617239df9080","schema_version":"1.0","event_id":"sha256:3fc216c56aad78f99b3400729bcf56e326e77fd633fc760de47f617239df9080"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E7VB7C76HO7AHGZYGMSMPVMNHT","target":"graph","payload":{"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"},"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:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJhkXKr5P4iRnneK9mOWYNsxDF3+kxdgDk5r2RxK6ZjAlOxxS4r0SjAOACMLAILPVVsfZOY0Fhh2AtJBQ6a6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:34:15.565681Z"},"content_sha256":"ae87a04a5a45fd2b93a35cba391b229bd65b72f375014a1538ee0f484a97c0b6","schema_version":"1.0","event_id":"sha256:ae87a04a5a45fd2b93a35cba391b229bd65b72f375014a1538ee0f484a97c0b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/bundle.json","state_url":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/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-30T08:34:15Z","links":{"resolver":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT","bundle":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/bundle.json","state":"https://pith.science/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7VB7C76HO7AHGZYGMSMPVMNHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E7VB7C76HO7AHGZYGMSMPVMNHT","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":"a14bb4824382285d5fa37601f9d68db5ae71e94c226600fadf80c8babc52ee2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-12T07:22:33Z","title_canon_sha256":"18a42feb097ccd84f40ee76310d79988e89222a57e0555cc6292b61c5a31ba5b"},"schema_version":"1.0","source":{"id":"1103.2427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2427","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2427v1","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2427","created_at":"2026-05-18T02:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"E7VB7C76HO7A","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7VB7C76HO7AHGZY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7VB7C76","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:ae87a04a5a45fd2b93a35cba391b229bd65b72f375014a1538ee0f484a97c0b6","target":"graph","created_at":"2026-05-18T02:22:19Z","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=(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","authors_text":"Guoqing Wang, Haoli Wang, Xirong Xu, Yuansheng Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-12T07:22:33Z","title":"On the Domination Number of Generalized Petersen Graphs P(ck,k)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2427","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:3fc216c56aad78f99b3400729bcf56e326e77fd633fc760de47f617239df9080","target":"record","created_at":"2026-05-18T02:22:19Z","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":"a14bb4824382285d5fa37601f9d68db5ae71e94c226600fadf80c8babc52ee2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-12T07:22:33Z","title_canon_sha256":"18a42feb097ccd84f40ee76310d79988e89222a57e0555cc6292b61c5a31ba5b"},"schema_version":"1.0","source":{"id":"1103.2427","kind":"arxiv","version":1}},"canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ea1f8bfe3bbe039b383324c7d58d3cc74b77fb821bfbe396bebb279bf781f7","first_computed_at":"2026-05-18T02:22:19.773219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:19.773219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8xWt0G5424R6HABCFey/mUGr6JGA0SG9UBc++o+ueBURsQLrud7yIj7Mpxq0306BnU49e1CHRepUlQTioyu0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:19.773985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fc216c56aad78f99b3400729bcf56e326e77fd633fc760de47f617239df9080","sha256:ae87a04a5a45fd2b93a35cba391b229bd65b72f375014a1538ee0f484a97c0b6"],"state_sha256":"9c5070912d1e1bb6bbf57b9302db70fed2a4f43af11ed1826d1afbdca7f27644"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U1ebgvfdQecG/3pWsDB03/OCw/YVOjpDkOMgugTCJcQ0w9rClqatFUx4svQ2JKl5805c2F459pwRdNyu3AXIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:34:15.567703Z","bundle_sha256":"d57a922ca655d957901c53899ef6e538f59cb3c5a4e735d2074da3c345eb7acd"}}