{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QQ4WPDNSAQEHNSOC2VOT25IPEF","short_pith_number":"pith:QQ4WPDNS","schema_version":"1.0","canonical_sha256":"8439678db2040876c9c2d55d3d750f2168cd7ed44b2bd5e104c9f437cd944714","source":{"kind":"arxiv","id":"1905.10781","version":1},"attestation_state":"computed","paper":{"title":"On the minimum degree of the power graph of a finite cyclic group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Ramesh Prasad Panda","submitted_at":"2019-05-26T10:29:02Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.10781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-26T10:29:02Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"4a5e48066b826869d03c95db81ce9127d7d6f4a0839d4ae38aba91fe9fcfdd8d","abstract_canon_sha256":"1ed53e13036cc60a6e4fa85da444b2e0babbc0ba59631ce5a0cb4d320e42abf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:05.292950Z","signature_b64":"vNKs7bE1mHRP19FMM0rsX+hAopwUKngxawb5AGjZ2rRUNhj469iXt3/Q7Va8lYOT82bAkWP6D838FA1Lfz8qCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8439678db2040876c9c2d55d3d750f2168cd7ed44b2bd5e104c9f437cd944714","last_reissued_at":"2026-05-17T23:45:05.292278Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:05.292278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimum degree of the power graph of a finite cyclic group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Binod Kumar Sahoo, Kamal Lochan Patra, Ramesh Prasad Panda","submitted_at":"2019-05-26T10:29:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10781","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.10781","created_at":"2026-05-17T23:45:05.292389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10781v1","created_at":"2026-05-17T23:45:05.292389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10781","created_at":"2026-05-17T23:45:05.292389+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ4WPDNSAQEH","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ4WPDNSAQEHNSOC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ4WPDNS","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF","json":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF.json","graph_json":"https://pith.science/api/pith-number/QQ4WPDNSAQEHNSOC2VOT25IPEF/graph.json","events_json":"https://pith.science/api/pith-number/QQ4WPDNSAQEHNSOC2VOT25IPEF/events.json","paper":"https://pith.science/paper/QQ4WPDNS"},"agent_actions":{"view_html":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF","download_json":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF.json","view_paper":"https://pith.science/paper/QQ4WPDNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10781&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ4WPDNSAQEHNSOC2VOT25IPEF/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ4WPDNSAQEHNSOC2VOT25IPEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF/action/storage_attestation","attest_author":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF/action/author_attestation","sign_citation":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF/action/citation_signature","submit_replication":"https://pith.science/pith/QQ4WPDNSAQEHNSOC2VOT25IPEF/action/replication_record"}},"created_at":"2026-05-17T23:45:05.292389+00:00","updated_at":"2026-05-17T23:45:05.292389+00:00"}