{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MTGQMNWSQYA34WGUD6JK2PL57P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3dbb0ce18e96f88fe58a36d92730e1619fdbe65e2104c753e15f736128610a22","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2023-05-12T08:10:44Z","title_canon_sha256":"36b178ec9f6a7a0fc33dfb33b041ab8ac3ac7a5e0a839ebe1700384394ebf573"},"schema_version":"1.0","source":{"id":"2305.07301","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.07301","created_at":"2026-07-05T11:43:52Z"},{"alias_kind":"arxiv_version","alias_value":"2305.07301v5","created_at":"2026-07-05T11:43:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.07301","created_at":"2026-07-05T11:43:52Z"},{"alias_kind":"pith_short_12","alias_value":"MTGQMNWSQYA3","created_at":"2026-07-05T11:43:52Z"},{"alias_kind":"pith_short_16","alias_value":"MTGQMNWSQYA34WGU","created_at":"2026-07-05T11:43:52Z"},{"alias_kind":"pith_short_8","alias_value":"MTGQMNWS","created_at":"2026-07-05T11:43:52Z"}],"graph_snapshots":[{"event_id":"sha256:6cba8420b745358c983f82cf63a495d58f6c67f8b04c86aff7aa0895fbdb7281","target":"graph","created_at":"2026-07-05T11:43:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.07301/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Natalia V. Maslova, Peter J. Cameron, V. Arvind, Xuanlong Ma","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2023-05-12T08:10:44Z","title":"Aspects of the commuting graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.07301","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4669dde5e96a974694dd943b08c93b0c9f7f9e73fa890b2eb1cb09f8592c179b","target":"record","created_at":"2026-07-05T11:43:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3dbb0ce18e96f88fe58a36d92730e1619fdbe65e2104c753e15f736128610a22","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GR","submitted_at":"2023-05-12T08:10:44Z","title_canon_sha256":"36b178ec9f6a7a0fc33dfb33b041ab8ac3ac7a5e0a839ebe1700384394ebf573"},"schema_version":"1.0","source":{"id":"2305.07301","kind":"arxiv","version":5}},"canonical_sha256":"64cd0636d28601be58d41f92ad3d7dfbef116e97b803aa1842e5742229096d81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64cd0636d28601be58d41f92ad3d7dfbef116e97b803aa1842e5742229096d81","first_computed_at":"2026-07-05T11:43:52.314144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:52.314144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2zkQZkm5v3FLZfoZ+uq3/1w4mJTmMzWBy7BUq2pW7ICEJifT6QRKGkOsjf2vkew7p9EOZU4MPU57GztOdkyBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:52.314658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.07301","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4669dde5e96a974694dd943b08c93b0c9f7f9e73fa890b2eb1cb09f8592c179b","sha256:6cba8420b745358c983f82cf63a495d58f6c67f8b04c86aff7aa0895fbdb7281"],"state_sha256":"00bae33abe2c91ef5cd1f759db3e4df589910874c90fca3e05e69fb23139abcc"}