{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WZSDRC3EFP2U4XZKS443WRVDVZ","short_pith_number":"pith:WZSDRC3E","canonical_record":{"source":{"id":"1703.08834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-26T16:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"6825aab8779a29ed9885fa861ca7fa5b902f98955de9531f8c2be11816488756","abstract_canon_sha256":"af1fac95b0aeac5666e52351d89f36b985d94ff6faf11a6492d30a244c45524f"},"schema_version":"1.0"},"canonical_sha256":"b664388b642bf54e5f2a9739bb46a3ae7fb53ef98573625d664becbf99402378","source":{"kind":"arxiv","id":"1703.08834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08834","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08834v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08834","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"WZSDRC3EFP2U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZSDRC3EFP2U4XZK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZSDRC3E","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WZSDRC3EFP2U4XZKS443WRVDVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-26T16:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"6825aab8779a29ed9885fa861ca7fa5b902f98955de9531f8c2be11816488756","abstract_canon_sha256":"af1fac95b0aeac5666e52351d89f36b985d94ff6faf11a6492d30a244c45524f"},"schema_version":"1.0"},"canonical_sha256":"b664388b642bf54e5f2a9739bb46a3ae7fb53ef98573625d664becbf99402378","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.412947Z","signature_b64":"9NtklaMXka+HMDy5ZkbNlFpFizFxEjQ9a2SLDVgDKAqEDFZp6QH2JGJdI/qpTQT5I2FRLeKy/vhvSSBnalLjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b664388b642bf54e5f2a9739bb46a3ae7fb53ef98573625d664becbf99402378","last_reissued_at":"2026-05-18T00:47:55.412445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.412445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08834","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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hD94r9/Ocj2dwqaNWoPLok9Es8bI5hIz4gJZbJ0Dli7W7we8+g/oDJmmzvJ+8TSa4gRbvec5Y8og/Qz0dbxQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:22:19.268533Z"},"content_sha256":"ef0c5143a392ca4110ca75c74442c6b33931d1d347e3bb536a9ff5e603c94d37","schema_version":"1.0","event_id":"sha256:ef0c5143a392ca4110ca75c74442c6b33931d1d347e3bb536a9ff5e603c94d37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WZSDRC3EFP2U4XZKS443WRVDVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On connectedness of power graphs of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. V. Krishna, Ramesh Prasad Panda","submitted_at":"2017-03-26T16:11:09Z","abstract_excerpt":"The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of $p$-groups are studied. In particular, the number of components of that of abelian $p$-groups are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08834","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-18T00:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15yLOUP/IyhdMfOfjOYKdaQNqr/PwRNcUIgX3Qse7YsAe0CWY21N2Zxr6isGtdX5+vAdk3A9SAKgJog55elYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:22:19.268869Z"},"content_sha256":"358ce02e7d1482765e1a103987e467f8d8827ec2f1653dcaacbb080e94015e6d","schema_version":"1.0","event_id":"sha256:358ce02e7d1482765e1a103987e467f8d8827ec2f1653dcaacbb080e94015e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/bundle.json","state_url":"https://pith.science/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/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-06-24T05:22:19Z","links":{"resolver":"https://pith.science/pith/WZSDRC3EFP2U4XZKS443WRVDVZ","bundle":"https://pith.science/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/bundle.json","state":"https://pith.science/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZSDRC3EFP2U4XZKS443WRVDVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WZSDRC3EFP2U4XZKS443WRVDVZ","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":"af1fac95b0aeac5666e52351d89f36b985d94ff6faf11a6492d30a244c45524f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-26T16:11:09Z","title_canon_sha256":"6825aab8779a29ed9885fa861ca7fa5b902f98955de9531f8c2be11816488756"},"schema_version":"1.0","source":{"id":"1703.08834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08834","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08834v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08834","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"WZSDRC3EFP2U","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZSDRC3EFP2U4XZK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZSDRC3E","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:358ce02e7d1482765e1a103987e467f8d8827ec2f1653dcaacbb080e94015e6d","target":"graph","created_at":"2026-05-18T00:47:55Z","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":"The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of $p$-groups are studied. In particular, the number of components of that of abelian $p$-groups are determined.","authors_text":"K. V. Krishna, Ramesh Prasad Panda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-26T16:11:09Z","title":"On connectedness of power graphs of finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08834","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:ef0c5143a392ca4110ca75c74442c6b33931d1d347e3bb536a9ff5e603c94d37","target":"record","created_at":"2026-05-18T00:47:55Z","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":"af1fac95b0aeac5666e52351d89f36b985d94ff6faf11a6492d30a244c45524f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-26T16:11:09Z","title_canon_sha256":"6825aab8779a29ed9885fa861ca7fa5b902f98955de9531f8c2be11816488756"},"schema_version":"1.0","source":{"id":"1703.08834","kind":"arxiv","version":1}},"canonical_sha256":"b664388b642bf54e5f2a9739bb46a3ae7fb53ef98573625d664becbf99402378","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b664388b642bf54e5f2a9739bb46a3ae7fb53ef98573625d664becbf99402378","first_computed_at":"2026-05-18T00:47:55.412445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.412445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9NtklaMXka+HMDy5ZkbNlFpFizFxEjQ9a2SLDVgDKAqEDFZp6QH2JGJdI/qpTQT5I2FRLeKy/vhvSSBnalLjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.412947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef0c5143a392ca4110ca75c74442c6b33931d1d347e3bb536a9ff5e603c94d37","sha256:358ce02e7d1482765e1a103987e467f8d8827ec2f1653dcaacbb080e94015e6d"],"state_sha256":"a3a9e8eebae765e623b3146a2f9223a71c5c8044a870c9d23df983aa77b849a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXrr3O+YduRLOCopq0xeLCcgSvnrYuV6+wq4TOENVhdj6NzaFMqbUZ8YULttuOHzE/m0eq3HzvgSyyQNqjbbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:22:19.270837Z","bundle_sha256":"56b94aed46abeb2de5f845a437adacf8c9e3ce31958f3ac58b983cf3397311a8"}}