{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FV743ZDXD6G5NQLNMGJEQGCB53","short_pith_number":"pith:FV743ZDX","canonical_record":{"source":{"id":"1703.07149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T11:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"debab190c69572bc5195e508949f2d3f86aa05146ac12249d42de25e0390820a","abstract_canon_sha256":"7da99e3b4f6142adeb54759b016c9d6318944dc17edefe796a283701727976fb"},"schema_version":"1.0"},"canonical_sha256":"2d7fcde4771f8dd6c16d6192481841eee19f780580ad3e1aa6b1f842a6a565fe","source":{"kind":"arxiv","id":"1703.07149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07149","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07149v2","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07149","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"FV743ZDXD6G5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FV743ZDXD6G5NQLN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FV743ZDX","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FV743ZDXD6G5NQLNMGJEQGCB53","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T11:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"debab190c69572bc5195e508949f2d3f86aa05146ac12249d42de25e0390820a","abstract_canon_sha256":"7da99e3b4f6142adeb54759b016c9d6318944dc17edefe796a283701727976fb"},"schema_version":"1.0"},"canonical_sha256":"2d7fcde4771f8dd6c16d6192481841eee19f780580ad3e1aa6b1f842a6a565fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.550368Z","signature_b64":"P5zuE+v/1/KCOf3ZE/s7yMTyxBWgrq75aoAmVbEpyb1XfEnjo0DTG8eDnyT5JA5ci8MKpk0jfOVkJGqUhD64BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7fcde4771f8dd6c16d6192481841eee19f780580ad3e1aa6b1f842a6a565fe","last_reissued_at":"2026-05-18T00:02:19.549991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.549991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07149","source_version":2,"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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91zMXigA5kkenJVq0AqZ0rjqHy/vdGouo1tDywy/MExv+SBHym0bFTxJanbfFmPcoYzLnm6UQW7qdEjXGS4JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:37:45.787300Z"},"content_sha256":"b5f942c303e12f9024fb5e401a4cb0e9c809daef7489adc663b6a9e2a73f81b8","schema_version":"1.0","event_id":"sha256:b5f942c303e12f9024fb5e401a4cb0e9c809daef7489adc663b6a9e2a73f81b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FV743ZDXD6G5NQLNMGJEQGCB53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex connectivity of the power graph of a finite cyclic group","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":"2017-03-21T11:09:00Z","abstract_excerpt":"Let $n=p_1^{n_1}p_2^{n_2}\\ldots p_r^{n_r}$, where $r,n_1,\\ldots, n_r$ are positive integers and $p_1,p_2,\\ldots,p_r$ are distinct prime numbers with $p_1<p_2<\\cdots <p_r$. For the cyclic group $C_n$ of order $n$, let $\\mathcal{P}(C_n)$ be the power graph of $C_n$ and $\\kappa(\\mathcal{P}(C_n))$ be the vertex connectivity of $\\mathcal{P}(C_n)$. It is known that $\\kappa(\\mathcal{P}(C_n))=p_1^{n_1} -1$ if $r=1$. For $r\\geq 2$, we determine the exact value of $\\kappa(\\mathcal{P}(C_n))$ when $2\\phi(p_1\\ldots p_{r-1})\\geq p_1\\ldots p_{r-1}$, and give an upper bound for $\\kappa(\\mathcal{P}(C_n))$ when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07149","kind":"arxiv","version":2},"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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwa7l1kN0lyJ8BU1zxGWMEcWltSVGE9nkGapqDuf8Lc9VIQylFZlzBb82kTRGBx08qxfcbUkVOUZEQgZ+kgLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:37:45.787681Z"},"content_sha256":"6789ed464f8a54371798bc311edda13152d2f652bda5411174dec5f53ef86b04","schema_version":"1.0","event_id":"sha256:6789ed464f8a54371798bc311edda13152d2f652bda5411174dec5f53ef86b04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FV743ZDXD6G5NQLNMGJEQGCB53/bundle.json","state_url":"https://pith.science/pith/FV743ZDXD6G5NQLNMGJEQGCB53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FV743ZDXD6G5NQLNMGJEQGCB53/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-24T06:37:45Z","links":{"resolver":"https://pith.science/pith/FV743ZDXD6G5NQLNMGJEQGCB53","bundle":"https://pith.science/pith/FV743ZDXD6G5NQLNMGJEQGCB53/bundle.json","state":"https://pith.science/pith/FV743ZDXD6G5NQLNMGJEQGCB53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FV743ZDXD6G5NQLNMGJEQGCB53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FV743ZDXD6G5NQLNMGJEQGCB53","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":"7da99e3b4f6142adeb54759b016c9d6318944dc17edefe796a283701727976fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T11:09:00Z","title_canon_sha256":"debab190c69572bc5195e508949f2d3f86aa05146ac12249d42de25e0390820a"},"schema_version":"1.0","source":{"id":"1703.07149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07149","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07149v2","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07149","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"FV743ZDXD6G5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FV743ZDXD6G5NQLN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FV743ZDX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:6789ed464f8a54371798bc311edda13152d2f652bda5411174dec5f53ef86b04","target":"graph","created_at":"2026-05-18T00:02: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 $n=p_1^{n_1}p_2^{n_2}\\ldots p_r^{n_r}$, where $r,n_1,\\ldots, n_r$ are positive integers and $p_1,p_2,\\ldots,p_r$ are distinct prime numbers with $p_1<p_2<\\cdots <p_r$. For the cyclic group $C_n$ of order $n$, let $\\mathcal{P}(C_n)$ be the power graph of $C_n$ and $\\kappa(\\mathcal{P}(C_n))$ be the vertex connectivity of $\\mathcal{P}(C_n)$. It is known that $\\kappa(\\mathcal{P}(C_n))=p_1^{n_1} -1$ if $r=1$. For $r\\geq 2$, we determine the exact value of $\\kappa(\\mathcal{P}(C_n))$ when $2\\phi(p_1\\ldots p_{r-1})\\geq p_1\\ldots p_{r-1}$, and give an upper bound for $\\kappa(\\mathcal{P}(C_n))$ when","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":"2017-03-21T11:09:00Z","title":"Vertex connectivity of the power graph of a finite cyclic group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07149","kind":"arxiv","version":2},"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:b5f942c303e12f9024fb5e401a4cb0e9c809daef7489adc663b6a9e2a73f81b8","target":"record","created_at":"2026-05-18T00:02: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":"7da99e3b4f6142adeb54759b016c9d6318944dc17edefe796a283701727976fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T11:09:00Z","title_canon_sha256":"debab190c69572bc5195e508949f2d3f86aa05146ac12249d42de25e0390820a"},"schema_version":"1.0","source":{"id":"1703.07149","kind":"arxiv","version":2}},"canonical_sha256":"2d7fcde4771f8dd6c16d6192481841eee19f780580ad3e1aa6b1f842a6a565fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d7fcde4771f8dd6c16d6192481841eee19f780580ad3e1aa6b1f842a6a565fe","first_computed_at":"2026-05-18T00:02:19.549991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.549991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5zuE+v/1/KCOf3ZE/s7yMTyxBWgrq75aoAmVbEpyb1XfEnjo0DTG8eDnyT5JA5ci8MKpk0jfOVkJGqUhD64BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.550368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5f942c303e12f9024fb5e401a4cb0e9c809daef7489adc663b6a9e2a73f81b8","sha256:6789ed464f8a54371798bc311edda13152d2f652bda5411174dec5f53ef86b04"],"state_sha256":"f15f536a1fe2078a7f6fc9e118f1679e5f4cedaa8d86b48bf6fbba758814e140"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8j/grJ9HpjKlSjcJElI4b+PVkBvb3R037BZEcEtfJKjEYXivvifV27xdiMh4OVqSST+ZYiWA+VShOHxfi4ADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:37:45.789617Z","bundle_sha256":"c7aeddb27f5ba5a01a5aff04bc2ac860ed7d8052926b61a5c021f3639890edf9"}}