{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NICMMYWRNABE4KH3BJ2BJNB4PW","short_pith_number":"pith:NICMMYWR","schema_version":"1.0","canonical_sha256":"6a04c662d168024e28fb0a7414b43c7dac6bbd31822c758e0edc1fa4e62e18a0","source":{"kind":"arxiv","id":"2411.12230","version":1},"attestation_state":"computed","paper":{"title":"Explicit construction of the maximal subgroups of the Monster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Anthony Pisani, Heiko Dietrich, Melissa Lee, Tomasz Popiel","submitted_at":"2024-11-19T04:57:23Z","abstract_excerpt":"Seysen's Python package mmgroup provides functionality for fast computations within the sporadic simple group $\\mathbb{M}$, the Monster. The aim of this work is to present an mmgroup database of maximal subgroups of $\\mathbb{M}$: for each conjugacy class $C$ of maximal subgroups in $\\mathbb{M}$, we construct explicit group elements in mmgroup and prove that these elements generate a group in $C$. Our generators and the computations verifying correctness are available in accompanying code. The maximal subgroups of $\\mathbb{M}$ have been classified in a number of papers spanning several decades;"},"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":"2411.12230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2024-11-19T04:57:23Z","cross_cats_sorted":[],"title_canon_sha256":"0cfa39ac5b98da3eceb6c9bda861c3c4ede04322ba351620ad96dad91f51a53e","abstract_canon_sha256":"930aecc6d870fc2c3a44416d867249696b9e969c203a790c76412b0106f65bfc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:18.097782Z","signature_b64":"RbXAwiLtwH8RBof2sZCFI92BG9lscUJ+UuBgLqYvz0ZK1sCCpG5CppYJYLpCCuB1P2SDBxgQSXCccTNS49MHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a04c662d168024e28fb0a7414b43c7dac6bbd31822c758e0edc1fa4e62e18a0","last_reissued_at":"2026-07-05T09:37:18.097327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:18.097327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit construction of the maximal subgroups of the Monster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Anthony Pisani, Heiko Dietrich, Melissa Lee, Tomasz Popiel","submitted_at":"2024-11-19T04:57:23Z","abstract_excerpt":"Seysen's Python package mmgroup provides functionality for fast computations within the sporadic simple group $\\mathbb{M}$, the Monster. The aim of this work is to present an mmgroup database of maximal subgroups of $\\mathbb{M}$: for each conjugacy class $C$ of maximal subgroups in $\\mathbb{M}$, we construct explicit group elements in mmgroup and prove that these elements generate a group in $C$. Our generators and the computations verifying correctness are available in accompanying code. The maximal subgroups of $\\mathbb{M}$ have been classified in a number of papers spanning several decades;"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.12230/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.12230","created_at":"2026-07-05T09:37:18.097404+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.12230v1","created_at":"2026-07-05T09:37:18.097404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12230","created_at":"2026-07-05T09:37:18.097404+00:00"},{"alias_kind":"pith_short_12","alias_value":"NICMMYWRNABE","created_at":"2026-07-05T09:37:18.097404+00:00"},{"alias_kind":"pith_short_16","alias_value":"NICMMYWRNABE4KH3","created_at":"2026-07-05T09:37:18.097404+00:00"},{"alias_kind":"pith_short_8","alias_value":"NICMMYWR","created_at":"2026-07-05T09:37:18.097404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12866","citing_title":"Finite permutation groups with quasi-semiregular elements","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW","json":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW.json","graph_json":"https://pith.science/api/pith-number/NICMMYWRNABE4KH3BJ2BJNB4PW/graph.json","events_json":"https://pith.science/api/pith-number/NICMMYWRNABE4KH3BJ2BJNB4PW/events.json","paper":"https://pith.science/paper/NICMMYWR"},"agent_actions":{"view_html":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW","download_json":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW.json","view_paper":"https://pith.science/paper/NICMMYWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.12230&json=true","fetch_graph":"https://pith.science/api/pith-number/NICMMYWRNABE4KH3BJ2BJNB4PW/graph.json","fetch_events":"https://pith.science/api/pith-number/NICMMYWRNABE4KH3BJ2BJNB4PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW/action/storage_attestation","attest_author":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW/action/author_attestation","sign_citation":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW/action/citation_signature","submit_replication":"https://pith.science/pith/NICMMYWRNABE4KH3BJ2BJNB4PW/action/replication_record"}},"created_at":"2026-07-05T09:37:18.097404+00:00","updated_at":"2026-07-05T09:37:18.097404+00:00"}