{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QHKX2SHYNAEHPTQJVFT5SDNDNM","short_pith_number":"pith:QHKX2SHY","schema_version":"1.0","canonical_sha256":"81d57d48f8680877ce09a967d90da36b1aa3b0cbbc8d782f193c2075592c7892","source":{"kind":"arxiv","id":"1709.09278","version":3},"attestation_state":"computed","paper":{"title":"Classifying Character Degree Graphs With 6 Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.GR","authors_text":"Jacob Laubacher, Mark L. Lewis, Mark W. Bissler","submitted_at":"2017-09-26T22:40:57Z","abstract_excerpt":"We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also completely classify the disconnected graphs with six vertices."},"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":"1709.09278","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-09-26T22:40:57Z","cross_cats_sorted":["math.RT"],"title_canon_sha256":"3a3f50dda11d651a48f9a7b6686a598c5d1b845b8af2829a33c3cf93f36ba534","abstract_canon_sha256":"4719e35833d8716613312affd2f089768513d21738e7d5196ab77813b2caa4a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:50.533867Z","signature_b64":"22l4FwqdB240QzxO5d82jb6ntoLmDUdVcYSH+cSLSNtGH3t+GsRoD0rameDIcga80QXVqXbiUyUFtbPcMh0XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81d57d48f8680877ce09a967d90da36b1aa3b0cbbc8d782f193c2075592c7892","last_reissued_at":"2026-05-18T00:07:50.533304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:50.533304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying Character Degree Graphs With 6 Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RT"],"primary_cat":"math.GR","authors_text":"Jacob Laubacher, Mark L. Lewis, Mark W. Bissler","submitted_at":"2017-09-26T22:40:57Z","abstract_excerpt":"We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also completely classify the disconnected graphs with six vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09278","kind":"arxiv","version":3},"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":"1709.09278","created_at":"2026-05-18T00:07:50.533406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09278v3","created_at":"2026-05-18T00:07:50.533406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09278","created_at":"2026-05-18T00:07:50.533406+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHKX2SHYNAEH","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHKX2SHYNAEHPTQJ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHKX2SHY","created_at":"2026-05-18T12:31:39.905425+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/QHKX2SHYNAEHPTQJVFT5SDNDNM","json":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM.json","graph_json":"https://pith.science/api/pith-number/QHKX2SHYNAEHPTQJVFT5SDNDNM/graph.json","events_json":"https://pith.science/api/pith-number/QHKX2SHYNAEHPTQJVFT5SDNDNM/events.json","paper":"https://pith.science/paper/QHKX2SHY"},"agent_actions":{"view_html":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM","download_json":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM.json","view_paper":"https://pith.science/paper/QHKX2SHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09278&json=true","fetch_graph":"https://pith.science/api/pith-number/QHKX2SHYNAEHPTQJVFT5SDNDNM/graph.json","fetch_events":"https://pith.science/api/pith-number/QHKX2SHYNAEHPTQJVFT5SDNDNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM/action/storage_attestation","attest_author":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM/action/author_attestation","sign_citation":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM/action/citation_signature","submit_replication":"https://pith.science/pith/QHKX2SHYNAEHPTQJVFT5SDNDNM/action/replication_record"}},"created_at":"2026-05-18T00:07:50.533406+00:00","updated_at":"2026-05-18T00:07:50.533406+00:00"}