{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4LGUFGTO2OCUKD6QVU5UDXHGME","short_pith_number":"pith:4LGUFGTO","schema_version":"1.0","canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","source":{"kind":"arxiv","id":"1608.02572","version":2},"attestation_state":"computed","paper":{"title":"The generation problem in Thompson group $F$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Gili Golan","submitted_at":"2016-08-08T19:51:07Z","abstract_excerpt":"We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of $F$, which can be defined in an analogue way to the Stallings core of subgroups of a finitely generated free group. Further study of the Stallings $2$-core of subgroups of $F$ provides a solution to another algorithmic problem in $F$. Namely, given a finitely generated subgroup $H$ of $F$, it is decidable if $H$ acts transitively on the set of finite dyadic "},"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":"1608.02572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-08-08T19:51:07Z","cross_cats_sorted":[],"title_canon_sha256":"0838bdcc6a7117bc798fffd2a3737efb940799cce2017e29ed2961109719a59b","abstract_canon_sha256":"d5c8c3dee520943f0149e0e80d3aeabfc476debe47635d7c3cfb00404b6cc770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:41.716944Z","signature_b64":"iX19TMW35U/75VN/USlZKCTsSNStkipT7Ku24gmpzz8OlEGHR0VEjdbtiaF8zOULrXkPPSnDw1UmUbfAVVWwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","last_reissued_at":"2026-07-05T02:36:41.716288Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:41.716288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The generation problem in Thompson group $F$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Gili Golan","submitted_at":"2016-08-08T19:51:07Z","abstract_excerpt":"We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of $F$, which can be defined in an analogue way to the Stallings core of subgroups of a finitely generated free group. Further study of the Stallings $2$-core of subgroups of $F$ provides a solution to another algorithmic problem in $F$. Namely, given a finitely generated subgroup $H$ of $F$, it is decidable if $H$ acts transitively on the set of finite dyadic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02572","kind":"arxiv","version":2},"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/1608.02572/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":"1608.02572","created_at":"2026-07-05T02:36:41.716388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02572v2","created_at":"2026-07-05T02:36:41.716388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02572","created_at":"2026-07-05T02:36:41.716388+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LGUFGTO2OCU","created_at":"2026-07-05T02:36:41.716388+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LGUFGTO2OCUKD6Q","created_at":"2026-07-05T02:36:41.716388+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LGUFGTO","created_at":"2026-07-05T02:36:41.716388+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/4LGUFGTO2OCUKD6QVU5UDXHGME","json":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME.json","graph_json":"https://pith.science/api/pith-number/4LGUFGTO2OCUKD6QVU5UDXHGME/graph.json","events_json":"https://pith.science/api/pith-number/4LGUFGTO2OCUKD6QVU5UDXHGME/events.json","paper":"https://pith.science/paper/4LGUFGTO"},"agent_actions":{"view_html":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME","download_json":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME.json","view_paper":"https://pith.science/paper/4LGUFGTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02572&json=true","fetch_graph":"https://pith.science/api/pith-number/4LGUFGTO2OCUKD6QVU5UDXHGME/graph.json","fetch_events":"https://pith.science/api/pith-number/4LGUFGTO2OCUKD6QVU5UDXHGME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/action/storage_attestation","attest_author":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/action/author_attestation","sign_citation":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/action/citation_signature","submit_replication":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/action/replication_record"}},"created_at":"2026-07-05T02:36:41.716388+00:00","updated_at":"2026-07-05T02:36:41.716388+00:00"}