{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4LGUFGTO2OCUKD6QVU5UDXHGME","short_pith_number":"pith:4LGUFGTO","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"},"canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","source":{"kind":"arxiv","id":"1608.02572","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02572","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02572v2","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02572","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"4LGUFGTO2OCU","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_16","alias_value":"4LGUFGTO2OCUKD6Q","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_8","alias_value":"4LGUFGTO","created_at":"2026-07-05T02:36:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4LGUFGTO2OCUKD6QVU5UDXHGME","target":"record","payload":{"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"},"canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","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"},"source_kind":"arxiv","source_id":"1608.02572","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHSc0WNkbJs9VQVC9OvtwFAw3/G0pAlkzkOGi3bRfieXbV9IsPQpCTSBeXzG3gEXcbpyR3PSASF4FSdqGPFTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:18:45.534456Z"},"content_sha256":"9b9e65decc3028072e36243f7eb84ce6df5ad02113559af6af2cade858eb31b1","schema_version":"1.0","event_id":"sha256:9b9e65decc3028072e36243f7eb84ce6df5ad02113559af6af2cade858eb31b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4LGUFGTO2OCUKD6QVU5UDXHGME","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6Ie92J1aRt0hZg4QIszX8PCApKbp/VRB4Ly6I3yQhiqVgQTJQUM1hewkr3rwQOXJU7Lie7Xx/roahj9kr+mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:18:45.534957Z"},"content_sha256":"60e5faf4be9c1a72206be3e10c5043f37e36787dab0fcaf2288bdcd855c7a1bf","schema_version":"1.0","event_id":"sha256:60e5faf4be9c1a72206be3e10c5043f37e36787dab0fcaf2288bdcd855c7a1bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/bundle.json","state_url":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T12:18:45Z","links":{"resolver":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME","bundle":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/bundle.json","state":"https://pith.science/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LGUFGTO2OCUKD6QVU5UDXHGME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4LGUFGTO2OCUKD6QVU5UDXHGME","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d5c8c3dee520943f0149e0e80d3aeabfc476debe47635d7c3cfb00404b6cc770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-08-08T19:51:07Z","title_canon_sha256":"0838bdcc6a7117bc798fffd2a3737efb940799cce2017e29ed2961109719a59b"},"schema_version":"1.0","source":{"id":"1608.02572","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02572","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02572v2","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02572","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"4LGUFGTO2OCU","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_16","alias_value":"4LGUFGTO2OCUKD6Q","created_at":"2026-07-05T02:36:41Z"},{"alias_kind":"pith_short_8","alias_value":"4LGUFGTO","created_at":"2026-07-05T02:36:41Z"}],"graph_snapshots":[{"event_id":"sha256:60e5faf4be9c1a72206be3e10c5043f37e36787dab0fcaf2288bdcd855c7a1bf","target":"graph","created_at":"2026-07-05T02:36:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1608.02572/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Gili Golan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-08-08T19:51:07Z","title":"The generation problem in Thompson group $F$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02572","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b9e65decc3028072e36243f7eb84ce6df5ad02113559af6af2cade858eb31b1","target":"record","created_at":"2026-07-05T02:36:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d5c8c3dee520943f0149e0e80d3aeabfc476debe47635d7c3cfb00404b6cc770","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-08-08T19:51:07Z","title_canon_sha256":"0838bdcc6a7117bc798fffd2a3737efb940799cce2017e29ed2961109719a59b"},"schema_version":"1.0","source":{"id":"1608.02572","kind":"arxiv","version":2}},"canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2cd429a6ed385450fd0ad3b41dce6610c12cd16534f7fce516dcca676e10d50","first_computed_at":"2026-07-05T02:36:41.716288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:41.716288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iX19TMW35U/75VN/USlZKCTsSNStkipT7Ku24gmpzz8OlEGHR0VEjdbtiaF8zOULrXkPPSnDw1UmUbfAVVWwDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:41.716944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02572","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9e65decc3028072e36243f7eb84ce6df5ad02113559af6af2cade858eb31b1","sha256:60e5faf4be9c1a72206be3e10c5043f37e36787dab0fcaf2288bdcd855c7a1bf"],"state_sha256":"ae1a768823355fe5692b392bd7af5348f21bb6a505ed51640593c176fa76a618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QatDrXo+uybSvUe79pp+Q/UYKdHVK4fpSh2v+NkiUCNFuACxqAnwpwiCWrfvgijL7Yoc83KnTyy28j0mjVfYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T12:18:45.539521Z","bundle_sha256":"205651beb37533f8def606733b4940e3c1a6d0f31230e642c075414309dedd66"}}