{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CUGQRDTBSLBEZ5NGMIJ3HY2HRT","short_pith_number":"pith:CUGQRDTB","schema_version":"1.0","canonical_sha256":"150d088e6192c24cf5a66213b3e3478cdf7e5dd4c6c6ef416d52b8f8ae80d519","source":{"kind":"arxiv","id":"1907.07633","version":1},"attestation_state":"computed","paper":{"title":"A Database of Groups with Equivalent Character Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Michael Stemper, Steve Goldstein, William Cocke","submitted_at":"2019-07-17T16:37:33Z","abstract_excerpt":"Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is computationally intriguing. We have constructed a database containing for all finite groups of order less than 2000 (excluding those of order 1024), a partitioning of groups into classes having the same character table. To handle the 408,641,062 groups of order 1536 and other orders with a large number of groups we utilized high-throughput computing together with a ne"},"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":"1907.07633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-07-17T16:37:33Z","cross_cats_sorted":[],"title_canon_sha256":"605811412a8a4969374d7da913da586f448ffa2f5b86be4e948696f9eea88276","abstract_canon_sha256":"b0f27f8ad62952efc60a3372cbf756e0a991f8fd2fcbedd00ea1319cdec8ba82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.504614Z","signature_b64":"TseVmDstUF6Wi2Ag8QkmicQnwOMuEe4qHKdib6tKktD5Ctm27IOQzBdUjhZsCWlmTRZT8+1xobTTUFVppCvnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"150d088e6192c24cf5a66213b3e3478cdf7e5dd4c6c6ef416d52b8f8ae80d519","last_reissued_at":"2026-05-17T23:40:21.503927Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.503927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Database of Groups with Equivalent Character Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Michael Stemper, Steve Goldstein, William Cocke","submitted_at":"2019-07-17T16:37:33Z","abstract_excerpt":"Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is computationally intriguing. We have constructed a database containing for all finite groups of order less than 2000 (excluding those of order 1024), a partitioning of groups into classes having the same character table. To handle the 408,641,062 groups of order 1536 and other orders with a large number of groups we utilized high-throughput computing together with a ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07633","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":"1907.07633","created_at":"2026-05-17T23:40:21.504080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07633v1","created_at":"2026-05-17T23:40:21.504080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07633","created_at":"2026-05-17T23:40:21.504080+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUGQRDTBSLBE","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUGQRDTBSLBEZ5NG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUGQRDTB","created_at":"2026-05-18T12:33:15.570797+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/CUGQRDTBSLBEZ5NGMIJ3HY2HRT","json":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT.json","graph_json":"https://pith.science/api/pith-number/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/graph.json","events_json":"https://pith.science/api/pith-number/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/events.json","paper":"https://pith.science/paper/CUGQRDTB"},"agent_actions":{"view_html":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT","download_json":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT.json","view_paper":"https://pith.science/paper/CUGQRDTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07633&json=true","fetch_graph":"https://pith.science/api/pith-number/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/graph.json","fetch_events":"https://pith.science/api/pith-number/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/action/storage_attestation","attest_author":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/action/author_attestation","sign_citation":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/action/citation_signature","submit_replication":"https://pith.science/pith/CUGQRDTBSLBEZ5NGMIJ3HY2HRT/action/replication_record"}},"created_at":"2026-05-17T23:40:21.504080+00:00","updated_at":"2026-05-17T23:40:21.504080+00:00"}