{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MTGQMNWSQYA34WGUD6JK2PL57P","short_pith_number":"pith:MTGQMNWS","schema_version":"1.0","canonical_sha256":"64cd0636d28601be58d41f92ad3d7dfbef116e97b803aa1842e5742229096d81","source":{"kind":"arxiv","id":"2305.07301","version":5},"attestation_state":"computed","paper":{"title":"Aspects of the commuting graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Natalia V. Maslova, Peter J. Cameron, V. Arvind, Xuanlong Ma","submitted_at":"2023-05-12T08:10:44Z","abstract_excerpt":"The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute.\n  Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given graph is the commuting graph of a finite group; we give a quasipolynomial algorithm, and a polynomial algorithm for the case when the group is an extra\\-special p-group for p an odd prime; we give new results on the question of whether the commuting graph of a given group is a cograph or a chordal graph, two classes of graphs defined by forbidden subgraphs.\n "},"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":"2305.07301","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2023-05-12T08:10:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"36b178ec9f6a7a0fc33dfb33b041ab8ac3ac7a5e0a839ebe1700384394ebf573","abstract_canon_sha256":"3dbb0ce18e96f88fe58a36d92730e1619fdbe65e2104c753e15f736128610a22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:52.314658Z","signature_b64":"n2zkQZkm5v3FLZfoZ+uq3/1w4mJTmMzWBy7BUq2pW7ICEJifT6QRKGkOsjf2vkew7p9EOZU4MPU57GztOdkyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64cd0636d28601be58d41f92ad3d7dfbef116e97b803aa1842e5742229096d81","last_reissued_at":"2026-07-05T11:43:52.314144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:52.314144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aspects of the commuting graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Natalia V. Maslova, Peter J. Cameron, V. Arvind, Xuanlong Ma","submitted_at":"2023-05-12T08:10:44Z","abstract_excerpt":"The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute.\n  Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given graph is the commuting graph of a finite group; we give a quasipolynomial algorithm, and a polynomial algorithm for the case when the group is an extra\\-special p-group for p an odd prime; we give new results on the question of whether the commuting graph of a given group is a cograph or a chordal graph, two classes of graphs defined by forbidden subgraphs.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07301","kind":"arxiv","version":5},"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/2305.07301/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":"2305.07301","created_at":"2026-07-05T11:43:52.314202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.07301v5","created_at":"2026-07-05T11:43:52.314202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07301","created_at":"2026-07-05T11:43:52.314202+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTGQMNWSQYA3","created_at":"2026-07-05T11:43:52.314202+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTGQMNWSQYA34WGU","created_at":"2026-07-05T11:43:52.314202+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTGQMNWS","created_at":"2026-07-05T11:43:52.314202+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05860","citing_title":"On the Complexity of Problems on Graphs Defined on Groups","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P","json":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P.json","graph_json":"https://pith.science/api/pith-number/MTGQMNWSQYA34WGUD6JK2PL57P/graph.json","events_json":"https://pith.science/api/pith-number/MTGQMNWSQYA34WGUD6JK2PL57P/events.json","paper":"https://pith.science/paper/MTGQMNWS"},"agent_actions":{"view_html":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P","download_json":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P.json","view_paper":"https://pith.science/paper/MTGQMNWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.07301&json=true","fetch_graph":"https://pith.science/api/pith-number/MTGQMNWSQYA34WGUD6JK2PL57P/graph.json","fetch_events":"https://pith.science/api/pith-number/MTGQMNWSQYA34WGUD6JK2PL57P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P/action/storage_attestation","attest_author":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P/action/author_attestation","sign_citation":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P/action/citation_signature","submit_replication":"https://pith.science/pith/MTGQMNWSQYA34WGUD6JK2PL57P/action/replication_record"}},"created_at":"2026-07-05T11:43:52.314202+00:00","updated_at":"2026-07-05T11:43:52.314202+00:00"}