{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FDK5I5V6YGMI6SXWR6YFYZQSIK","short_pith_number":"pith:FDK5I5V6","schema_version":"1.0","canonical_sha256":"28d5d476bec1988f4af68fb05c66124285773c2497f3b4aa037db5d0c7ff2de6","source":{"kind":"arxiv","id":"1706.04351","version":1},"attestation_state":"computed","paper":{"title":"On the character degree graph of solvable groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Carlo Casolo, Emanuele Pacifici, Khatoon Khedri, Silvio Dolfi, Zeinab Akhlaghi","submitted_at":"2017-06-14T07:58:52Z","abstract_excerpt":"Let \\(G\\) be a finite solvable group, and let \\(\\Delta(G)\\) denote the \\emph{prime graph} built on the set of degrees of the irreducible complex characters of \\(G\\). A fundamental result by P.P. P\\'alfy asserts that the complement $\\bar{\\Delta}(G)$ of the graph \\(\\Delta(G)\\) does not contain any cycle of length \\(3\\). In this paper we generalize P\\'alfy's result, showing that $\\bar{\\Delta}(G)$ does not contain any cycle of odd length, whence it is a bipartite graph. As an immediate consequence, the set of vertices of \\(\\Delta(G)\\) can be covered by two subsets, each inducing a complete subgrap"},"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":"1706.04351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-14T07:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"690e0764f6c8c80b0b1176b523221b0cba2393abf74978dfa1d48c8d7981b5f8","abstract_canon_sha256":"b68ebf8859f35f4659cd67d3c486151938b40fd623bddb0b256a8e4b09432806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:22.923563Z","signature_b64":"0zC3f8SMJoehRjqSfSkXz2q2Y9N5sJwl1sVK777AQxOZzxQ3ilQmSp4yH3oe8PcD6XrumMklUoQepJTaxfnPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d5d476bec1988f4af68fb05c66124285773c2497f3b4aa037db5d0c7ff2de6","last_reissued_at":"2026-05-18T00:42:22.923093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:22.923093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the character degree graph of solvable groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Carlo Casolo, Emanuele Pacifici, Khatoon Khedri, Silvio Dolfi, Zeinab Akhlaghi","submitted_at":"2017-06-14T07:58:52Z","abstract_excerpt":"Let \\(G\\) be a finite solvable group, and let \\(\\Delta(G)\\) denote the \\emph{prime graph} built on the set of degrees of the irreducible complex characters of \\(G\\). A fundamental result by P.P. P\\'alfy asserts that the complement $\\bar{\\Delta}(G)$ of the graph \\(\\Delta(G)\\) does not contain any cycle of length \\(3\\). In this paper we generalize P\\'alfy's result, showing that $\\bar{\\Delta}(G)$ does not contain any cycle of odd length, whence it is a bipartite graph. As an immediate consequence, the set of vertices of \\(\\Delta(G)\\) can be covered by two subsets, each inducing a complete subgrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04351","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":"1706.04351","created_at":"2026-05-18T00:42:22.923160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04351v1","created_at":"2026-05-18T00:42:22.923160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04351","created_at":"2026-05-18T00:42:22.923160+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDK5I5V6YGMI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDK5I5V6YGMI6SXW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDK5I5V6","created_at":"2026-05-18T12:31:15.632608+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/FDK5I5V6YGMI6SXWR6YFYZQSIK","json":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK.json","graph_json":"https://pith.science/api/pith-number/FDK5I5V6YGMI6SXWR6YFYZQSIK/graph.json","events_json":"https://pith.science/api/pith-number/FDK5I5V6YGMI6SXWR6YFYZQSIK/events.json","paper":"https://pith.science/paper/FDK5I5V6"},"agent_actions":{"view_html":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK","download_json":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK.json","view_paper":"https://pith.science/paper/FDK5I5V6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04351&json=true","fetch_graph":"https://pith.science/api/pith-number/FDK5I5V6YGMI6SXWR6YFYZQSIK/graph.json","fetch_events":"https://pith.science/api/pith-number/FDK5I5V6YGMI6SXWR6YFYZQSIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK/action/storage_attestation","attest_author":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK/action/author_attestation","sign_citation":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK/action/citation_signature","submit_replication":"https://pith.science/pith/FDK5I5V6YGMI6SXWR6YFYZQSIK/action/replication_record"}},"created_at":"2026-05-18T00:42:22.923160+00:00","updated_at":"2026-05-18T00:42:22.923160+00:00"}