{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FH663OWFXYVLRK3VNA6IAUHJ5Z","short_pith_number":"pith:FH663OWF","schema_version":"1.0","canonical_sha256":"29fdedbac5be2ab8ab75683c8050e9ee657f88d1d935f71f59dddb0ee57098de","source":{"kind":"arxiv","id":"2606.22904","version":1},"attestation_state":"computed","paper":{"title":"On Connectivity of Comaximal Subgroup Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Angsuman Das, Arnab Mandal, Labani Sarkar","submitted_at":"2026-06-22T06:40:45Z","abstract_excerpt":"The co-maximal subgroup graph $\\Gamma(G)$ of a finite group $G$ is defined to be a graph with the set of all non-trivial proper subgroups of $G$ as the set of vertices and two distinct vertices $H$ and $K$ are adjacent if and only if $HK=G$. The deleted co-maximal subgroup graph of $G$, denoted by $\\Gamma^*(G)$, is defined as the graph obtained by removing the isolated vertices from $\\Gamma(G)$. In this paper, we prove that for any finite group $G$, $\\Gamma^*(G)$ is connected. Furthermore, we show that $\\Gamma^*(G)$ either contains a cycle or is a star. When $\\Gamma^*(G)$ contains a cycle, its"},"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":"2606.22904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-06-22T06:40:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"607139623be6d9fd7c3a7e9209ce6ac1119c2f45157b593f24e41539122ba17e","abstract_canon_sha256":"eabe890341e5e21f4feeddfca72834073d2c1ba57c2161c2cd3373c6578bef4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:03.770530Z","signature_b64":"oCzj453+pYHH4DGho2GZOPfxfNwEzo1DS3BQ6zrIwtU1lTVuhE5kTsygoPN3OEcgKRn0bucZMGSPIER4caL9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29fdedbac5be2ab8ab75683c8050e9ee657f88d1d935f71f59dddb0ee57098de","last_reissued_at":"2026-06-23T03:14:03.770183Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:03.770183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Connectivity of Comaximal Subgroup Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Angsuman Das, Arnab Mandal, Labani Sarkar","submitted_at":"2026-06-22T06:40:45Z","abstract_excerpt":"The co-maximal subgroup graph $\\Gamma(G)$ of a finite group $G$ is defined to be a graph with the set of all non-trivial proper subgroups of $G$ as the set of vertices and two distinct vertices $H$ and $K$ are adjacent if and only if $HK=G$. The deleted co-maximal subgroup graph of $G$, denoted by $\\Gamma^*(G)$, is defined as the graph obtained by removing the isolated vertices from $\\Gamma(G)$. In this paper, we prove that for any finite group $G$, $\\Gamma^*(G)$ is connected. Furthermore, we show that $\\Gamma^*(G)$ either contains a cycle or is a star. When $\\Gamma^*(G)$ contains a cycle, its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22904","created_at":"2026-06-23T03:14:03.770242+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22904v1","created_at":"2026-06-23T03:14:03.770242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22904","created_at":"2026-06-23T03:14:03.770242+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH663OWFXYVL","created_at":"2026-06-23T03:14:03.770242+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH663OWFXYVLRK3V","created_at":"2026-06-23T03:14:03.770242+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH663OWF","created_at":"2026-06-23T03:14:03.770242+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/FH663OWFXYVLRK3VNA6IAUHJ5Z","json":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z.json","graph_json":"https://pith.science/api/pith-number/FH663OWFXYVLRK3VNA6IAUHJ5Z/graph.json","events_json":"https://pith.science/api/pith-number/FH663OWFXYVLRK3VNA6IAUHJ5Z/events.json","paper":"https://pith.science/paper/FH663OWF"},"agent_actions":{"view_html":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z","download_json":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z.json","view_paper":"https://pith.science/paper/FH663OWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22904&json=true","fetch_graph":"https://pith.science/api/pith-number/FH663OWFXYVLRK3VNA6IAUHJ5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/FH663OWFXYVLRK3VNA6IAUHJ5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z/action/storage_attestation","attest_author":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z/action/author_attestation","sign_citation":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z/action/citation_signature","submit_replication":"https://pith.science/pith/FH663OWFXYVLRK3VNA6IAUHJ5Z/action/replication_record"}},"created_at":"2026-06-23T03:14:03.770242+00:00","updated_at":"2026-06-23T03:14:03.770242+00:00"}