{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NSEZ3D645I6VWYXAHGF5DELPCM","short_pith_number":"pith:NSEZ3D64","schema_version":"1.0","canonical_sha256":"6c899d8fdcea3d5b62e0398bd1916f133e508d36ab962d100c4a68399a23bf56","source":{"kind":"arxiv","id":"1504.00801","version":1},"attestation_state":"computed","paper":{"title":"Permutability graph of cyclic subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"P. Devi, R. Rajkumar","submitted_at":"2015-04-03T10:32:18Z","abstract_excerpt":"Let $G$ be a group. \\textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\\Gamma_c(G)$ are adjacent if and only if the corresponding subgroups permute in $G$. In this paper, we classify the finite groups whose permutability graph of cyclic subgroups belongs to one of the following: bipartite, tree, star graph, triangle-free, complete bipartite, $P_n$, $C_n$, $K_4$, $K_{1,3}$-free, unicyclic. We classify abelian groups whose permutability graph of cyclic subgroup"},"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":"1504.00801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-04-03T10:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"bb67bdd5839f91fe2eb5311ec69398d26d38559da5d981e56d241c3969762545","abstract_canon_sha256":"2de9140e3b3b35ddb06ca899ca10cc2ededeffd3e8f201dd9907406b579dc43e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:37.038061Z","signature_b64":"DOHkz239gFg2OqIUAhLJLjhxVVOculUlovTknOz7RYgCRDKYo/0ezyx4hHCIclITCiNnAsTCeRj47K+i+lwBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c899d8fdcea3d5b62e0398bd1916f133e508d36ab962d100c4a68399a23bf56","last_reissued_at":"2026-05-18T02:19:37.037449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:37.037449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutability graph of cyclic subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"P. Devi, R. Rajkumar","submitted_at":"2015-04-03T10:32:18Z","abstract_excerpt":"Let $G$ be a group. \\textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\\Gamma_c(G)$ are adjacent if and only if the corresponding subgroups permute in $G$. In this paper, we classify the finite groups whose permutability graph of cyclic subgroups belongs to one of the following: bipartite, tree, star graph, triangle-free, complete bipartite, $P_n$, $C_n$, $K_4$, $K_{1,3}$-free, unicyclic. We classify abelian groups whose permutability graph of cyclic subgroup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00801","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":"1504.00801","created_at":"2026-05-18T02:19:37.037541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00801v1","created_at":"2026-05-18T02:19:37.037541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00801","created_at":"2026-05-18T02:19:37.037541+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSEZ3D645I6V","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSEZ3D645I6VWYXA","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSEZ3D64","created_at":"2026-05-18T12:29:34.919912+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/NSEZ3D645I6VWYXAHGF5DELPCM","json":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM.json","graph_json":"https://pith.science/api/pith-number/NSEZ3D645I6VWYXAHGF5DELPCM/graph.json","events_json":"https://pith.science/api/pith-number/NSEZ3D645I6VWYXAHGF5DELPCM/events.json","paper":"https://pith.science/paper/NSEZ3D64"},"agent_actions":{"view_html":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM","download_json":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM.json","view_paper":"https://pith.science/paper/NSEZ3D64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00801&json=true","fetch_graph":"https://pith.science/api/pith-number/NSEZ3D645I6VWYXAHGF5DELPCM/graph.json","fetch_events":"https://pith.science/api/pith-number/NSEZ3D645I6VWYXAHGF5DELPCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM/action/storage_attestation","attest_author":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM/action/author_attestation","sign_citation":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM/action/citation_signature","submit_replication":"https://pith.science/pith/NSEZ3D645I6VWYXAHGF5DELPCM/action/replication_record"}},"created_at":"2026-05-18T02:19:37.037541+00:00","updated_at":"2026-05-18T02:19:37.037541+00:00"}