{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3KUK6CFF75FN4KIZTWSWGKWIS7","short_pith_number":"pith:3KUK6CFF","schema_version":"1.0","canonical_sha256":"daa8af08a5ff4ade29199da5632ac897c4079ae1ddfdc08dc4f61986a6fa10d6","source":{"kind":"arxiv","id":"2404.18860","version":1},"attestation_state":"computed","paper":{"title":"Constructive Recognition of Special Linear Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alice Niemeyer, Cheryl Praeger, Daniel Rademacher, Max Horn","submitted_at":"2024-04-29T16:51:25Z","abstract_excerpt":"We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\\times d$ matrices over a finite field $\\mathbb{F}_q$, known to be isomorphic to the special linear group $\\mathrm{SL}(d,q)$, the algorithm computes a special generating set $S$ for $G$. These generators enable efficient computations with the input group, including solving the word problem. Implemented in the computer algebra system GAP, our algorithm outperforms existing state-of-the-art algorithms by a significant margin. A detailed"},"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":"2404.18860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2024-04-29T16:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"78c0402b72749d76a0960f6f7b128d80305afc73dc8e49c973b8f5584fa2dc31","abstract_canon_sha256":"49735d2c8b65847d526d5e194ea92f33f280c91e18c4d75b0c78b9db6eca207b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:21.707327Z","signature_b64":"KMPfEhUGqQhdXptmIZ2aMd8atBdikZYoFtJfXsBFvjDJ5dlHduiKZSptlNva0q/JIW/grMpY5yH4KR0cSV/kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daa8af08a5ff4ade29199da5632ac897c4079ae1ddfdc08dc4f61986a6fa10d6","last_reissued_at":"2026-07-05T08:13:21.706806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:21.706806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructive Recognition of Special Linear Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alice Niemeyer, Cheryl Praeger, Daniel Rademacher, Max Horn","submitted_at":"2024-04-29T16:51:25Z","abstract_excerpt":"We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\\times d$ matrices over a finite field $\\mathbb{F}_q$, known to be isomorphic to the special linear group $\\mathrm{SL}(d,q)$, the algorithm computes a special generating set $S$ for $G$. These generators enable efficient computations with the input group, including solving the word problem. Implemented in the computer algebra system GAP, our algorithm outperforms existing state-of-the-art algorithms by a significant margin. A detailed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18860","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/2404.18860/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":"2404.18860","created_at":"2026-07-05T08:13:21.706871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18860v1","created_at":"2026-07-05T08:13:21.706871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18860","created_at":"2026-07-05T08:13:21.706871+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KUK6CFF75FN","created_at":"2026-07-05T08:13:21.706871+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KUK6CFF75FN4KIZ","created_at":"2026-07-05T08:13:21.706871+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KUK6CFF","created_at":"2026-07-05T08:13:21.706871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.22638","citing_title":"The probability that two elements with large $1$-eigenspaces generate a classical group","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7","json":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7.json","graph_json":"https://pith.science/api/pith-number/3KUK6CFF75FN4KIZTWSWGKWIS7/graph.json","events_json":"https://pith.science/api/pith-number/3KUK6CFF75FN4KIZTWSWGKWIS7/events.json","paper":"https://pith.science/paper/3KUK6CFF"},"agent_actions":{"view_html":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7","download_json":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7.json","view_paper":"https://pith.science/paper/3KUK6CFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18860&json=true","fetch_graph":"https://pith.science/api/pith-number/3KUK6CFF75FN4KIZTWSWGKWIS7/graph.json","fetch_events":"https://pith.science/api/pith-number/3KUK6CFF75FN4KIZTWSWGKWIS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7/action/storage_attestation","attest_author":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7/action/author_attestation","sign_citation":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7/action/citation_signature","submit_replication":"https://pith.science/pith/3KUK6CFF75FN4KIZTWSWGKWIS7/action/replication_record"}},"created_at":"2026-07-05T08:13:21.706871+00:00","updated_at":"2026-07-05T08:13:21.706871+00:00"}