{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5TUDVQI6TG5UJJWUCSRPXCSQEG","short_pith_number":"pith:5TUDVQI6","schema_version":"1.0","canonical_sha256":"ece83ac11e99bb44a6d414a2fb8a5021985a0e4c04bd79c7251537e414f2f6c9","source":{"kind":"arxiv","id":"1806.02115","version":1},"attestation_state":"computed","paper":{"title":"Group Partitions via Commutativity and Related Topics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ali Mahmoudifar, Ali Reza Moghaddamfar, Faez Salehzadeh","submitted_at":"2018-06-06T11:01:05Z","abstract_excerpt":"Let $G$ be a nonabelian group, $A\\subseteq G$ an abelian subgroup and $n\\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting subsets $A_1, A_2, \\ldots, A_n$ of $G$, such that $|A_i|>1$ for each $i=1, 2, \\ldots, n$. We first classify all nonabelian groups, up to isomorphism, which have an $n$-abelian partition for $n=2, 3$. Then, we provide some formulas concerning the number of spanning trees of commuting graphs associated with certain finite groups. Finally, we point out some ways to f"},"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":"1806.02115","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.GR","submitted_at":"2018-06-06T11:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"4888c04a4cf2ed9454405e7e298133ad20973754ba3fc6babdd2445666253402","abstract_canon_sha256":"40bbe1b4721db70abbc83cb190769bc4518418deaafab728ac7297e96b882e2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.627573Z","signature_b64":"CN/mzudZW9y/EIdHIMoN3jnr6EEILrtmQambj/cmWJ7H/E7Gk1eymoBkGhtWye+AXHcapy/n6+a850bAtG8vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece83ac11e99bb44a6d414a2fb8a5021985a0e4c04bd79c7251537e414f2f6c9","last_reissued_at":"2026-05-18T00:14:02.626899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.626899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Partitions via Commutativity and Related Topics","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ali Mahmoudifar, Ali Reza Moghaddamfar, Faez Salehzadeh","submitted_at":"2018-06-06T11:01:05Z","abstract_excerpt":"Let $G$ be a nonabelian group, $A\\subseteq G$ an abelian subgroup and $n\\geqslant 2$ an integer. We say that $G$ has an $n$-abelian partition with respect to $A$, if there exists a partition of $G$ into $A$ and $n$ disjoint commuting subsets $A_1, A_2, \\ldots, A_n$ of $G$, such that $|A_i|>1$ for each $i=1, 2, \\ldots, n$. We first classify all nonabelian groups, up to isomorphism, which have an $n$-abelian partition for $n=2, 3$. Then, we provide some formulas concerning the number of spanning trees of commuting graphs associated with certain finite groups. Finally, we point out some ways to f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02115","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":"1806.02115","created_at":"2026-05-18T00:14:02.626988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02115v1","created_at":"2026-05-18T00:14:02.626988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02115","created_at":"2026-05-18T00:14:02.626988+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TUDVQI6TG5U","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TUDVQI6TG5UJJWU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TUDVQI6","created_at":"2026-05-18T12:32:08.215937+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/5TUDVQI6TG5UJJWUCSRPXCSQEG","json":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG.json","graph_json":"https://pith.science/api/pith-number/5TUDVQI6TG5UJJWUCSRPXCSQEG/graph.json","events_json":"https://pith.science/api/pith-number/5TUDVQI6TG5UJJWUCSRPXCSQEG/events.json","paper":"https://pith.science/paper/5TUDVQI6"},"agent_actions":{"view_html":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG","download_json":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG.json","view_paper":"https://pith.science/paper/5TUDVQI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02115&json=true","fetch_graph":"https://pith.science/api/pith-number/5TUDVQI6TG5UJJWUCSRPXCSQEG/graph.json","fetch_events":"https://pith.science/api/pith-number/5TUDVQI6TG5UJJWUCSRPXCSQEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG/action/storage_attestation","attest_author":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG/action/author_attestation","sign_citation":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG/action/citation_signature","submit_replication":"https://pith.science/pith/5TUDVQI6TG5UJJWUCSRPXCSQEG/action/replication_record"}},"created_at":"2026-05-18T00:14:02.626988+00:00","updated_at":"2026-05-18T00:14:02.626988+00:00"}