{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MYH4XMP7R4DSLVXL4YV4PXDDPF","short_pith_number":"pith:MYH4XMP7","schema_version":"1.0","canonical_sha256":"660fcbb1ff8f0725d6ebe62bc7dc63794e3f4bcd47b1e8c8ae31f3cca5739b3c","source":{"kind":"arxiv","id":"1708.00119","version":2},"attestation_state":"computed","paper":{"title":"Classifying Families of Character Degree Graphs of Solvable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.GR","authors_text":"Jacob Laubacher, Mark W. Bissler","submitted_at":"2017-08-01T01:14:18Z","abstract_excerpt":"We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs $\\Gamma_{k,t}$ occur as the prime character degree graph of a solvable group."},"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":"1708.00119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-08-01T01:14:18Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"b426f8a125ef87d9abfdce4fe1cc2b9608e6430e9593c0e4f0b8e7257c8ec08b","abstract_canon_sha256":"9b65b5e0c49bd5c42468abc3267f4cbbd65fec545898fdcb90c8a7c085929f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:04.802542Z","signature_b64":"sxW3zWfoC6PlgyeaPJ7Tz7mAE1eBa+2vVzk23UoyT2JEyQ4dIhu0u9n7v12osEWuORTcNE7b2is7RskwkkrIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"660fcbb1ff8f0725d6ebe62bc7dc63794e3f4bcd47b1e8c8ae31f3cca5739b3c","last_reissued_at":"2026-05-18T00:21:04.801845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:04.801845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying Families of Character Degree Graphs of Solvable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.GR","authors_text":"Jacob Laubacher, Mark W. Bissler","submitted_at":"2017-08-01T01:14:18Z","abstract_excerpt":"We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine completely which graphs $\\Gamma_{k,t}$ occur as the prime character degree graph of a solvable group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00119","kind":"arxiv","version":2},"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":"1708.00119","created_at":"2026-05-18T00:21:04.801960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00119v2","created_at":"2026-05-18T00:21:04.801960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00119","created_at":"2026-05-18T00:21:04.801960+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYH4XMP7R4DS","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYH4XMP7R4DSLVXL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYH4XMP7","created_at":"2026-05-18T12:31:31.346846+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/MYH4XMP7R4DSLVXL4YV4PXDDPF","json":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF.json","graph_json":"https://pith.science/api/pith-number/MYH4XMP7R4DSLVXL4YV4PXDDPF/graph.json","events_json":"https://pith.science/api/pith-number/MYH4XMP7R4DSLVXL4YV4PXDDPF/events.json","paper":"https://pith.science/paper/MYH4XMP7"},"agent_actions":{"view_html":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF","download_json":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF.json","view_paper":"https://pith.science/paper/MYH4XMP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00119&json=true","fetch_graph":"https://pith.science/api/pith-number/MYH4XMP7R4DSLVXL4YV4PXDDPF/graph.json","fetch_events":"https://pith.science/api/pith-number/MYH4XMP7R4DSLVXL4YV4PXDDPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF/action/storage_attestation","attest_author":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF/action/author_attestation","sign_citation":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF/action/citation_signature","submit_replication":"https://pith.science/pith/MYH4XMP7R4DSLVXL4YV4PXDDPF/action/replication_record"}},"created_at":"2026-05-18T00:21:04.801960+00:00","updated_at":"2026-05-18T00:21:04.801960+00:00"}