{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MDFBPY4S34JXV3J5744CYFMO7X","short_pith_number":"pith:MDFBPY4S","schema_version":"1.0","canonical_sha256":"60ca17e392df137aed3dff382c158efdd0eeff6e61f8baea7ff3b7cfde2a4582","source":{"kind":"arxiv","id":"1908.08226","version":2},"attestation_state":"computed","paper":{"title":"Groups with maximum vertex degree commuting graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"G. Arunkumar, Sushil Bhunia","submitted_at":"2019-08-22T07:07:34Z","abstract_excerpt":"Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph ${\\Gamma}(G)$, whose vertex set is $G\\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that ${\\Gamma}(G)$ is strong $k$ star free if the $k$ star graph is not a subgraph of ${\\Gamma}(G)$. In this paper, we characterize all strong $5$ star free commuting graphs. As a byproduct, we classify all strong claw-free graphs. Also, we prove that the set of all non-abelian groups whose commuting graph is strong $k$ star free is finite."},"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":"1908.08226","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2019-08-22T07:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"134b85f2aa1ab49851952aca0c1a7a1e3ec3b8fc81b79cba9c864d592e18b2fa","abstract_canon_sha256":"2612396e5eb675a520c5fc37fd0260155685cdf8d1c0852ad53ade4dcb839312"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:42.077725Z","signature_b64":"PSuLBJ92vqvC8J64HfDjdQnzn8lTcH2n5iL6sNNWCYKaUQyXFzb3OR241GgNnGupUD7UcRLF2sGyd8O4nW2dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60ca17e392df137aed3dff382c158efdd0eeff6e61f8baea7ff3b7cfde2a4582","last_reissued_at":"2026-07-05T05:23:42.077329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:42.077329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Groups with maximum vertex degree commuting graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"G. Arunkumar, Sushil Bhunia","submitted_at":"2019-08-22T07:07:34Z","abstract_excerpt":"Let $G$ be a group and $Z(G)$ be its center. We associate a commuting graph ${\\Gamma}(G)$, whose vertex set is $G\\setminus Z(G)$ and two distinct vertices are adjacent if they commute. We say that ${\\Gamma}(G)$ is strong $k$ star free if the $k$ star graph is not a subgraph of ${\\Gamma}(G)$. In this paper, we characterize all strong $5$ star free commuting graphs. As a byproduct, we classify all strong claw-free graphs. Also, we prove that the set of all non-abelian groups whose commuting graph is strong $k$ star free is finite."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08226","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08226/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":"1908.08226","created_at":"2026-07-05T05:23:42.077386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08226v2","created_at":"2026-07-05T05:23:42.077386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08226","created_at":"2026-07-05T05:23:42.077386+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDFBPY4S34JX","created_at":"2026-07-05T05:23:42.077386+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDFBPY4S34JXV3J5","created_at":"2026-07-05T05:23:42.077386+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDFBPY4S","created_at":"2026-07-05T05:23:42.077386+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/MDFBPY4S34JXV3J5744CYFMO7X","json":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X.json","graph_json":"https://pith.science/api/pith-number/MDFBPY4S34JXV3J5744CYFMO7X/graph.json","events_json":"https://pith.science/api/pith-number/MDFBPY4S34JXV3J5744CYFMO7X/events.json","paper":"https://pith.science/paper/MDFBPY4S"},"agent_actions":{"view_html":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X","download_json":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X.json","view_paper":"https://pith.science/paper/MDFBPY4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08226&json=true","fetch_graph":"https://pith.science/api/pith-number/MDFBPY4S34JXV3J5744CYFMO7X/graph.json","fetch_events":"https://pith.science/api/pith-number/MDFBPY4S34JXV3J5744CYFMO7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X/action/storage_attestation","attest_author":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X/action/author_attestation","sign_citation":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X/action/citation_signature","submit_replication":"https://pith.science/pith/MDFBPY4S34JXV3J5744CYFMO7X/action/replication_record"}},"created_at":"2026-07-05T05:23:42.077386+00:00","updated_at":"2026-07-05T05:23:42.077386+00:00"}