{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RI25V3CXXURPPYC45XTQHGQGOF","short_pith_number":"pith:RI25V3CX","schema_version":"1.0","canonical_sha256":"8a35daec57bd22f7e05cede7039a06717fad1f7877c64a6af179622c44262299","source":{"kind":"arxiv","id":"2606.00863","version":1},"attestation_state":"computed","paper":{"title":"On the generation problem in Thompson's groups $F_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Eytan Sapir, Gili Golan","submitted_at":"2026-05-30T19:29:13Z","abstract_excerpt":"We study the generation problem in the Higman-Thompson groups $F_n$ via the core and closure of subgroups of $F_n$ and associated automata. We give sufficient conditions for a subset $X \\subseteq F_n$ to generate $F_n$, and provide an algorithm which verifies these conditions when $X$ is finite. As an application, we answer a question of Aiello and Nagnibeda, motivated by Savchuk's problem on maximal subgroups of Thompson's group $F$. Specifically, we show that for every $n\\geq 2$, the Higman-Thompson group $F_n$ contains a maximal subgroup of infinite index which fixes no point of $(0,1)$. Th"},"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":"2606.00863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-05-30T19:29:13Z","cross_cats_sorted":[],"title_canon_sha256":"ddb88ec0fe8e814b83988ccd56b3c6bc661f40588a99abfd6071be9beb20d17e","abstract_canon_sha256":"890ab315002698f7b9d471dcea5a618b4b933f7c85472c1339012298b6015cba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:08.235100Z","signature_b64":"L7VMHHDVg6fQ8oJWlNd3DPVQEaCFrDXJre005W/3AsU+oHY1xm3Ci/tON74WMqU4gGkWYt2LGhZTv2jYls5bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a35daec57bd22f7e05cede7039a06717fad1f7877c64a6af179622c44262299","last_reissued_at":"2026-06-02T01:04:08.234766Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:08.234766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the generation problem in Thompson's groups $F_n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Eytan Sapir, Gili Golan","submitted_at":"2026-05-30T19:29:13Z","abstract_excerpt":"We study the generation problem in the Higman-Thompson groups $F_n$ via the core and closure of subgroups of $F_n$ and associated automata. We give sufficient conditions for a subset $X \\subseteq F_n$ to generate $F_n$, and provide an algorithm which verifies these conditions when $X$ is finite. As an application, we answer a question of Aiello and Nagnibeda, motivated by Savchuk's problem on maximal subgroups of Thompson's group $F$. Specifically, we show that for every $n\\geq 2$, the Higman-Thompson group $F_n$ contains a maximal subgroup of infinite index which fixes no point of $(0,1)$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00863","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/2606.00863/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":"2606.00863","created_at":"2026-06-02T01:04:08.234818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00863v1","created_at":"2026-06-02T01:04:08.234818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00863","created_at":"2026-06-02T01:04:08.234818+00:00"},{"alias_kind":"pith_short_12","alias_value":"RI25V3CXXURP","created_at":"2026-06-02T01:04:08.234818+00:00"},{"alias_kind":"pith_short_16","alias_value":"RI25V3CXXURPPYC4","created_at":"2026-06-02T01:04:08.234818+00:00"},{"alias_kind":"pith_short_8","alias_value":"RI25V3CX","created_at":"2026-06-02T01:04:08.234818+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/RI25V3CXXURPPYC45XTQHGQGOF","json":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF.json","graph_json":"https://pith.science/api/pith-number/RI25V3CXXURPPYC45XTQHGQGOF/graph.json","events_json":"https://pith.science/api/pith-number/RI25V3CXXURPPYC45XTQHGQGOF/events.json","paper":"https://pith.science/paper/RI25V3CX"},"agent_actions":{"view_html":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF","download_json":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF.json","view_paper":"https://pith.science/paper/RI25V3CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00863&json=true","fetch_graph":"https://pith.science/api/pith-number/RI25V3CXXURPPYC45XTQHGQGOF/graph.json","fetch_events":"https://pith.science/api/pith-number/RI25V3CXXURPPYC45XTQHGQGOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF/action/storage_attestation","attest_author":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF/action/author_attestation","sign_citation":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF/action/citation_signature","submit_replication":"https://pith.science/pith/RI25V3CXXURPPYC45XTQHGQGOF/action/replication_record"}},"created_at":"2026-06-02T01:04:08.234818+00:00","updated_at":"2026-06-02T01:04:08.234818+00:00"}