{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZEYVQJJSNR6AFPFANUY7HU4FLS","short_pith_number":"pith:ZEYVQJJS","schema_version":"1.0","canonical_sha256":"c9315825326c7c02bca06d31f3d3855c95ab6fecbe3a7e78dee25489d648f837","source":{"kind":"arxiv","id":"1309.5629","version":1},"attestation_state":"computed","paper":{"title":"Groups having complete bipartite divisor graphs for their conjugacy class sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Pablo Spiga, Roghayeh Hafezieh","submitted_at":"2013-09-22T18:48:07Z","abstract_excerpt":"Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers that divide these conjugacy class sizes, and with {p,n} being an edge if gcd(p,n)\\neq 1.\n  In this paper we construct infinitely many groups whose bipartite divisor graph for their conjugacy class sizes is the complete bipartite graph K_{2,5}, giving a solution to a question of Taeri."},"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":"1309.5629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-09-22T18:48:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4b32a88997f2b0d390ad9ea0c32af8cb320e803fd7d4fa4d106ad6cd8369a0ab","abstract_canon_sha256":"8b5b81d6d93a6469c0e105d592a65368eb7a190aa28e1f21e26a07a19941d9b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:35.725054Z","signature_b64":"+5v+9afzDiqFJNGO1FyyzWGky5Le9f/Vj4pxCBrf+ghMo8sv/5TDmEfkAUhQ3wVmGm8m5e1C6Kq0NEPbEAuvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9315825326c7c02bca06d31f3d3855c95ab6fecbe3a7e78dee25489d648f837","last_reissued_at":"2026-05-18T03:12:35.724265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:35.724265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Groups having complete bipartite divisor graphs for their conjugacy class sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Pablo Spiga, Roghayeh Hafezieh","submitted_at":"2013-09-22T18:48:07Z","abstract_excerpt":"Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers that divide these conjugacy class sizes, and with {p,n} being an edge if gcd(p,n)\\neq 1.\n  In this paper we construct infinitely many groups whose bipartite divisor graph for their conjugacy class sizes is the complete bipartite graph K_{2,5}, giving a solution to a question of Taeri."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5629","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":"1309.5629","created_at":"2026-05-18T03:12:35.724393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5629v1","created_at":"2026-05-18T03:12:35.724393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5629","created_at":"2026-05-18T03:12:35.724393+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEYVQJJSNR6A","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEYVQJJSNR6AFPFA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEYVQJJS","created_at":"2026-05-18T12:28:09.283467+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/ZEYVQJJSNR6AFPFANUY7HU4FLS","json":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS.json","graph_json":"https://pith.science/api/pith-number/ZEYVQJJSNR6AFPFANUY7HU4FLS/graph.json","events_json":"https://pith.science/api/pith-number/ZEYVQJJSNR6AFPFANUY7HU4FLS/events.json","paper":"https://pith.science/paper/ZEYVQJJS"},"agent_actions":{"view_html":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS","download_json":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS.json","view_paper":"https://pith.science/paper/ZEYVQJJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5629&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEYVQJJSNR6AFPFANUY7HU4FLS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEYVQJJSNR6AFPFANUY7HU4FLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS/action/storage_attestation","attest_author":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS/action/author_attestation","sign_citation":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS/action/citation_signature","submit_replication":"https://pith.science/pith/ZEYVQJJSNR6AFPFANUY7HU4FLS/action/replication_record"}},"created_at":"2026-05-18T03:12:35.724393+00:00","updated_at":"2026-05-18T03:12:35.724393+00:00"}