{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5FBUTQ2OVBUBNZMD27VAYP3BRR","short_pith_number":"pith:5FBUTQ2O","canonical_record":{"source":{"id":"1809.10415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-09-27T09:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"17c5a8f49a014c1c94b5a68ef8c8aec18de3e12b0ba005fb9469e8c7e4c681a0","abstract_canon_sha256":"b2f4172c635546369ead2777c3857b24ac50a3c3641f186c8c64efd31b968e8a"},"schema_version":"1.0"},"canonical_sha256":"e94349c34ea86816e583d7ea0c3f618c6d906f48f1020ef43dcff63a4dce1642","source":{"kind":"arxiv","id":"1809.10415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10415","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10415v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10415","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"5FBUTQ2OVBUB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FBUTQ2OVBUBNZMD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FBUTQ2O","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5FBUTQ2OVBUBNZMD27VAYP3BRR","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-09-27T09:08:38Z","cross_cats_sorted":[],"title_canon_sha256":"17c5a8f49a014c1c94b5a68ef8c8aec18de3e12b0ba005fb9469e8c7e4c681a0","abstract_canon_sha256":"b2f4172c635546369ead2777c3857b24ac50a3c3641f186c8c64efd31b968e8a"},"schema_version":"1.0"},"canonical_sha256":"e94349c34ea86816e583d7ea0c3f618c6d906f48f1020ef43dcff63a4dce1642","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.405068Z","signature_b64":"a2lF3HLA7AGnSvX+ay1NxPabT0ejyk8E0vVWig38BTlEeyZTcG7vmcV1ET+eH8Ga7hz8JewcCd2DBGR4BniVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e94349c34ea86816e583d7ea0c3f618c6d906f48f1020ef43dcff63a4dce1642","last_reissued_at":"2026-05-18T00:04:38.404665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.404665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10415","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMnJHpyEESJQfu61B0KXjRA46MW6P0TADC4gncn9tJe/GSRqsNqRIp8WPYZsE9rSSeZkmC4L553QJpIPXOn0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:55:16.562302Z"},"content_sha256":"d5303510251749aebae16a3ab6fd888096d26f5df3201950a650f16dac47884d","schema_version":"1.0","event_id":"sha256:d5303510251749aebae16a3ab6fd888096d26f5df3201950a650f16dac47884d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5FBUTQ2OVBUBNZMD27VAYP3BRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the character degree graph of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Carlo Casolo, Emanuele Pacifici, Lucia Sanus, Silvio Dolfi, Zeinab Akhlaghi","submitted_at":"2018-09-27T09:08:38Z","abstract_excerpt":"Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G), two distinct vertices p and q being adjacent if and only if pq divides some number in cd(G). In this paper, we consider the complement of the character degree graph, and we characterize the finite groups for which this complement graph is not bipartite. This extends the analysis of [1], where the solvable case was treated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10415","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kb8FosxTi1itAETW/NSBugHiMWYuqK/hOwgjSTfg2RCct41JcSiXWob/U8Wmm6/e8VSHZtvUmp6LbXolnC1UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:55:16.562984Z"},"content_sha256":"729d5457729cab1e0d3b3ca7175ddadd87dfa33318e0b354b83306b3508a66a3","schema_version":"1.0","event_id":"sha256:729d5457729cab1e0d3b3ca7175ddadd87dfa33318e0b354b83306b3508a66a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/bundle.json","state_url":"https://pith.science/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T11:55:16Z","links":{"resolver":"https://pith.science/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR","bundle":"https://pith.science/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/bundle.json","state":"https://pith.science/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FBUTQ2OVBUBNZMD27VAYP3BRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5FBUTQ2OVBUBNZMD27VAYP3BRR","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":"b2f4172c635546369ead2777c3857b24ac50a3c3641f186c8c64efd31b968e8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-09-27T09:08:38Z","title_canon_sha256":"17c5a8f49a014c1c94b5a68ef8c8aec18de3e12b0ba005fb9469e8c7e4c681a0"},"schema_version":"1.0","source":{"id":"1809.10415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10415","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10415v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10415","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"5FBUTQ2OVBUB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FBUTQ2OVBUBNZMD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FBUTQ2O","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:729d5457729cab1e0d3b3ca7175ddadd87dfa33318e0b354b83306b3508a66a3","target":"graph","created_at":"2026-05-18T00:04:38Z","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"},"paper":{"abstract_excerpt":"Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G), two distinct vertices p and q being adjacent if and only if pq divides some number in cd(G). In this paper, we consider the complement of the character degree graph, and we characterize the finite groups for which this complement graph is not bipartite. This extends the analysis of [1], where the solvable case was treated.","authors_text":"Carlo Casolo, Emanuele Pacifici, Lucia Sanus, Silvio Dolfi, Zeinab Akhlaghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-09-27T09:08:38Z","title":"On the character degree graph of finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10415","kind":"arxiv","version":1},"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:d5303510251749aebae16a3ab6fd888096d26f5df3201950a650f16dac47884d","target":"record","created_at":"2026-05-18T00:04:38Z","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":"b2f4172c635546369ead2777c3857b24ac50a3c3641f186c8c64efd31b968e8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-09-27T09:08:38Z","title_canon_sha256":"17c5a8f49a014c1c94b5a68ef8c8aec18de3e12b0ba005fb9469e8c7e4c681a0"},"schema_version":"1.0","source":{"id":"1809.10415","kind":"arxiv","version":1}},"canonical_sha256":"e94349c34ea86816e583d7ea0c3f618c6d906f48f1020ef43dcff63a4dce1642","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e94349c34ea86816e583d7ea0c3f618c6d906f48f1020ef43dcff63a4dce1642","first_computed_at":"2026-05-18T00:04:38.404665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.404665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2lF3HLA7AGnSvX+ay1NxPabT0ejyk8E0vVWig38BTlEeyZTcG7vmcV1ET+eH8Ga7hz8JewcCd2DBGR4BniVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.405068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5303510251749aebae16a3ab6fd888096d26f5df3201950a650f16dac47884d","sha256:729d5457729cab1e0d3b3ca7175ddadd87dfa33318e0b354b83306b3508a66a3"],"state_sha256":"6722597ffb9e96a38cb8d1198816b4c2c59abe3e17084790dda62af21fd94e15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7hFI4x2JjVcDr7kHfBt3i6VKzzVOz0jYLNWf9ZZaIO50X3OvKQCYApHlnlVQ0OXeFNoH+8T8qvXbmvGekMNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:55:16.566611Z","bundle_sha256":"98587eb09ffa8d55a141a4fd890c88cb9f4456ede77038818064fba2b120df64"}}