{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:44VVBNI2G76R4RY62DH565UDL2","short_pith_number":"pith:44VVBNI2","canonical_record":{"source":{"id":"1810.11316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-25T14:18:22Z","cross_cats_sorted":[],"title_canon_sha256":"3f5c6de3b08eab96d9651f04f893ee8a6b18a7c621b128a74296e0251930cd9c","abstract_canon_sha256":"eaa814922ce316345f2dbbd7474c243cd42b04f4ecd53d1651440c8e42f22865"},"schema_version":"1.0"},"canonical_sha256":"e72b50b51a37fd1e471ed0cfdf76835eaa1a5e663d6a857fe5b94448be1e2805","source":{"kind":"arxiv","id":"1810.11316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11316","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11316v1","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11316","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"44VVBNI2G76R","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44VVBNI2G76R4RY6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44VVBNI2","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:44VVBNI2G76R4RY62DH565UDL2","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-25T14:18:22Z","cross_cats_sorted":[],"title_canon_sha256":"3f5c6de3b08eab96d9651f04f893ee8a6b18a7c621b128a74296e0251930cd9c","abstract_canon_sha256":"eaa814922ce316345f2dbbd7474c243cd42b04f4ecd53d1651440c8e42f22865"},"schema_version":"1.0"},"canonical_sha256":"e72b50b51a37fd1e471ed0cfdf76835eaa1a5e663d6a857fe5b94448be1e2805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:14.512229Z","signature_b64":"ytNzHI9mH+fym8u1ieAdTikR2M7/AxwWKZdtrPolLLWxGsuCPcGcBTCyhrp1ANjXb448d/gaYo0fFnR4dSWJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e72b50b51a37fd1e471ed0cfdf76835eaa1a5e663d6a857fe5b94448be1e2805","last_reissued_at":"2026-05-18T00:02:14.511504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:14.511504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11316","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:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLkebNOEoVLcAAuFm2hErkWnyhfJcXYpt91ybiGyqEl2gKaSZTP0P/a8m9wUOWnUMDeT2rSckxIxJXNjrjVoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:23:41.326767Z"},"content_sha256":"11eda0d7d09d43b893d34e5a3c60e2d9d5619d65bf03ef5bb3e2d07b5f3b2596","schema_version":"1.0","event_id":"sha256:11eda0d7d09d43b893d34e5a3c60e2d9d5619d65bf03ef5bb3e2d07b5f3b2596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:44VVBNI2G76R4RY62DH565UDL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex connectivity of the power graph of a finite cyclic group II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Sriparna Chattopadhyay","submitted_at":"2018-10-25T14:18:22Z","abstract_excerpt":"The power graph $\\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. The vertex connectivity $\\kappa(\\mathcal{P}(G))$ of $\\mathcal{P}(G)$ is the minimum number of vertices which need to be removed from $G$ so that the induced subgraph of $\\mathcal{P}(G)$ on the remaining vertices is disconnected or has only one vertex. For a positive integer $n$, let $C_n$ be the cyclic group of order $n$. Suppose that the prime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11316","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:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ul6WVC8bsAOsq5/jxTcWrSw/vkzoxUQIi4Z7L/dAU6btzqn8l5/YuHImzeopObtOqvwzex12ogc+mgT66zfuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:23:41.327117Z"},"content_sha256":"e440e05d4183937ea23bb7d09fffa9d41211792058935a5a598fb1416ccc06c4","schema_version":"1.0","event_id":"sha256:e440e05d4183937ea23bb7d09fffa9d41211792058935a5a598fb1416ccc06c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44VVBNI2G76R4RY62DH565UDL2/bundle.json","state_url":"https://pith.science/pith/44VVBNI2G76R4RY62DH565UDL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44VVBNI2G76R4RY62DH565UDL2/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-24T02:23:41Z","links":{"resolver":"https://pith.science/pith/44VVBNI2G76R4RY62DH565UDL2","bundle":"https://pith.science/pith/44VVBNI2G76R4RY62DH565UDL2/bundle.json","state":"https://pith.science/pith/44VVBNI2G76R4RY62DH565UDL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44VVBNI2G76R4RY62DH565UDL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:44VVBNI2G76R4RY62DH565UDL2","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":"eaa814922ce316345f2dbbd7474c243cd42b04f4ecd53d1651440c8e42f22865","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-25T14:18:22Z","title_canon_sha256":"3f5c6de3b08eab96d9651f04f893ee8a6b18a7c621b128a74296e0251930cd9c"},"schema_version":"1.0","source":{"id":"1810.11316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11316","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11316v1","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11316","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"44VVBNI2G76R","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44VVBNI2G76R4RY6","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44VVBNI2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:e440e05d4183937ea23bb7d09fffa9d41211792058935a5a598fb1416ccc06c4","target":"graph","created_at":"2026-05-18T00:02:14Z","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 $\\mathcal{P}(G)$ of a given finite group $G$ is the simple undirected graph whose vertices are the elements of $G$, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. The vertex connectivity $\\kappa(\\mathcal{P}(G))$ of $\\mathcal{P}(G)$ is the minimum number of vertices which need to be removed from $G$ so that the induced subgraph of $\\mathcal{P}(G)$ on the remaining vertices is disconnected or has only one vertex. For a positive integer $n$, let $C_n$ be the cyclic group of order $n$. Suppose that the prime","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Sriparna Chattopadhyay","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-25T14:18:22Z","title":"Vertex connectivity of the power graph of a finite cyclic group II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11316","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:11eda0d7d09d43b893d34e5a3c60e2d9d5619d65bf03ef5bb3e2d07b5f3b2596","target":"record","created_at":"2026-05-18T00:02:14Z","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":"eaa814922ce316345f2dbbd7474c243cd42b04f4ecd53d1651440c8e42f22865","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-25T14:18:22Z","title_canon_sha256":"3f5c6de3b08eab96d9651f04f893ee8a6b18a7c621b128a74296e0251930cd9c"},"schema_version":"1.0","source":{"id":"1810.11316","kind":"arxiv","version":1}},"canonical_sha256":"e72b50b51a37fd1e471ed0cfdf76835eaa1a5e663d6a857fe5b94448be1e2805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e72b50b51a37fd1e471ed0cfdf76835eaa1a5e663d6a857fe5b94448be1e2805","first_computed_at":"2026-05-18T00:02:14.511504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:14.511504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ytNzHI9mH+fym8u1ieAdTikR2M7/AxwWKZdtrPolLLWxGsuCPcGcBTCyhrp1ANjXb448d/gaYo0fFnR4dSWJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:14.512229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11eda0d7d09d43b893d34e5a3c60e2d9d5619d65bf03ef5bb3e2d07b5f3b2596","sha256:e440e05d4183937ea23bb7d09fffa9d41211792058935a5a598fb1416ccc06c4"],"state_sha256":"5f3e7098f8bf3cb124b8ad04cb352dd7277c199505f5ae9cfddea4e801460d07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KfpHEdkiHYTzB76YR5WJGdnrODXT5tSVFThdJgCECRNfc1fv7G0oOoYia+C0E81Jw7gkOJ78KdzvEEHAlFypDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:23:41.329019Z","bundle_sha256":"d5753bc519af44b9eaccfcd3295712304aa3f2746da6217331636cf30a2a2ae6"}}