{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QQ4WPDNSAQEHNSOC2VOT25IPEF","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":"1ed53e13036cc60a6e4fa85da444b2e0babbc0ba59631ce5a0cb4d320e42abf3","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T10:29:02Z","title_canon_sha256":"4a5e48066b826869d03c95db81ce9127d7d6f4a0839d4ae38aba91fe9fcfdd8d"},"schema_version":"1.0","source":{"id":"1905.10781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10781","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10781v1","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10781","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"QQ4WPDNSAQEH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QQ4WPDNSAQEHNSOC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QQ4WPDNS","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:be75ea8d942e92976c65d6087590b5fa97292a9fa8a3f3d5eb9a44b71a524cf8","target":"graph","created_at":"2026-05-17T23:45:05Z","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 finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\\geq 2$, let $C_n$ denote the cyclic group of order $n$ and let $r$ be the number of distinct prime divisors of $n$. The minimum degree $\\delta(\\mathcal{P}(C_n))$ of $\\mathcal{P}(C_n)$ is known for $r\\in\\{1,2\\}$, see [18]. For $r\\geq 3$, under certain conditions involving the prime divisors of $n$, we identify at most $r-1$ vertices such that $\\delta(\\mathcal{P}(C_n))$ is equ","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Ramesh Prasad Panda","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T10:29:02Z","title":"On the minimum degree of the power graph of a finite cyclic group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10781","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:b7c0693b44b99910fda96d2a9fbfec57b222eb7f1b1892b09038cf832f7ffeee","target":"record","created_at":"2026-05-17T23:45:05Z","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":"1ed53e13036cc60a6e4fa85da444b2e0babbc0ba59631ce5a0cb4d320e42abf3","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T10:29:02Z","title_canon_sha256":"4a5e48066b826869d03c95db81ce9127d7d6f4a0839d4ae38aba91fe9fcfdd8d"},"schema_version":"1.0","source":{"id":"1905.10781","kind":"arxiv","version":1}},"canonical_sha256":"8439678db2040876c9c2d55d3d750f2168cd7ed44b2bd5e104c9f437cd944714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8439678db2040876c9c2d55d3d750f2168cd7ed44b2bd5e104c9f437cd944714","first_computed_at":"2026-05-17T23:45:05.292278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:05.292278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vNKs7bE1mHRP19FMM0rsX+hAopwUKngxawb5AGjZ2rRUNhj469iXt3/Q7Va8lYOT82bAkWP6D838FA1Lfz8qCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:05.292950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7c0693b44b99910fda96d2a9fbfec57b222eb7f1b1892b09038cf832f7ffeee","sha256:be75ea8d942e92976c65d6087590b5fa97292a9fa8a3f3d5eb9a44b71a524cf8"],"state_sha256":"842e893bc23c478903992f9ecd981b30e777ce6c6dc58cbfae4399f0661ffdd3"}