{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JI4C6XBGQ4BH2UAITFONKJW7WC","short_pith_number":"pith:JI4C6XBG","canonical_record":{"source":{"id":"1710.07183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-19T15:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"e70b12cafad2798eb267d10b3f9787120da6dd331a5dce0b07b83f5a8252d1e1","abstract_canon_sha256":"fe875449a8a49550fbba4e39a10bc49787ec94642b45a20dfc03f3da4707000b"},"schema_version":"1.0"},"canonical_sha256":"4a382f5c2687027d5008995cd526dfb0bf712c3747281ea51eeb16ed4522007d","source":{"kind":"arxiv","id":"1710.07183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07183","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07183v1","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07183","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"JI4C6XBGQ4BH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JI4C6XBGQ4BH2UAI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JI4C6XBG","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JI4C6XBGQ4BH2UAITFONKJW7WC","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-19T15:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"e70b12cafad2798eb267d10b3f9787120da6dd331a5dce0b07b83f5a8252d1e1","abstract_canon_sha256":"fe875449a8a49550fbba4e39a10bc49787ec94642b45a20dfc03f3da4707000b"},"schema_version":"1.0"},"canonical_sha256":"4a382f5c2687027d5008995cd526dfb0bf712c3747281ea51eeb16ed4522007d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:26.717290Z","signature_b64":"EwSeLjCrbOwCFYwAOXrLX1f9ajT/Sg73f97qS5pJwC5jAK2QMyZ83BJxzvy3jMkhxzYD7WR/oL1+eij5VgdgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a382f5c2687027d5008995cd526dfb0bf712c3747281ea51eeb16ed4522007d","last_reissued_at":"2026-05-18T00:32:26.716645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:26.716645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07183","source_version":1,"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-05-18T00:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0NSlb/I02VSWrf/tocoev9l7pMKJLV9W9zoNnPCNK9H3LllNhkKacwvDWXcuhHXE98A2qEpAzsUfzg0DUQRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:41:01.829875Z"},"content_sha256":"95b2741fb38eda2b57de4ba3073311a0dae17574020499313b1040d6c6f3cdb9","schema_version":"1.0","event_id":"sha256:95b2741fb38eda2b57de4ba3073311a0dae17574020499313b1040d6c6f3cdb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JI4C6XBGQ4BH2UAITFONKJW7WC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms determining finite simple images of finitely presented groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Dan Segal, David M. Evans, Martin R. Bridson, Martin W. Liebeck","submitted_at":"2017-10-19T15:27:23Z","abstract_excerpt":"We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains infinitely many alternating groups, or contains classical groups of unbounded dimensions, we prove that there is no such algorithm. On the other hand, for families of simple groups of Lie type of bounded rank, we obtain positive results. For example, given any fixed untwisted Lie type $X$ there is an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07183","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":""},"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-05-18T00:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DseIg5GkdVuFR4vuoIRct7p7D4IEl8iV5GsjrYAuCjVPy2jhyCKsWKWkeOwtpSSSCvZKJiifcvMv1H3KYqZ8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:41:01.830227Z"},"content_sha256":"6c6727a7553e986f7412369aef4d5b66d15ecf87b5513fbfdda8f3923a434acb","schema_version":"1.0","event_id":"sha256:6c6727a7553e986f7412369aef4d5b66d15ecf87b5513fbfdda8f3923a434acb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/bundle.json","state_url":"https://pith.science/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/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-06-03T06:41:01Z","links":{"resolver":"https://pith.science/pith/JI4C6XBGQ4BH2UAITFONKJW7WC","bundle":"https://pith.science/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/bundle.json","state":"https://pith.science/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI4C6XBGQ4BH2UAITFONKJW7WC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JI4C6XBGQ4BH2UAITFONKJW7WC","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":"fe875449a8a49550fbba4e39a10bc49787ec94642b45a20dfc03f3da4707000b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-19T15:27:23Z","title_canon_sha256":"e70b12cafad2798eb267d10b3f9787120da6dd331a5dce0b07b83f5a8252d1e1"},"schema_version":"1.0","source":{"id":"1710.07183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07183","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07183v1","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07183","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"JI4C6XBGQ4BH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JI4C6XBGQ4BH2UAI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JI4C6XBG","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6c6727a7553e986f7412369aef4d5b66d15ecf87b5513fbfdda8f3923a434acb","target":"graph","created_at":"2026-05-18T00:32:26Z","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"},"paper":{"abstract_excerpt":"We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains infinitely many alternating groups, or contains classical groups of unbounded dimensions, we prove that there is no such algorithm. On the other hand, for families of simple groups of Lie type of bounded rank, we obtain positive results. For example, given any fixed untwisted Lie type $X$ there is an a","authors_text":"Dan Segal, David M. Evans, Martin R. Bridson, Martin W. Liebeck","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-19T15:27:23Z","title":"Algorithms determining finite simple images of finitely presented groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07183","kind":"arxiv","version":1},"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:95b2741fb38eda2b57de4ba3073311a0dae17574020499313b1040d6c6f3cdb9","target":"record","created_at":"2026-05-18T00:32:26Z","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":"fe875449a8a49550fbba4e39a10bc49787ec94642b45a20dfc03f3da4707000b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-19T15:27:23Z","title_canon_sha256":"e70b12cafad2798eb267d10b3f9787120da6dd331a5dce0b07b83f5a8252d1e1"},"schema_version":"1.0","source":{"id":"1710.07183","kind":"arxiv","version":1}},"canonical_sha256":"4a382f5c2687027d5008995cd526dfb0bf712c3747281ea51eeb16ed4522007d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a382f5c2687027d5008995cd526dfb0bf712c3747281ea51eeb16ed4522007d","first_computed_at":"2026-05-18T00:32:26.716645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:26.716645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EwSeLjCrbOwCFYwAOXrLX1f9ajT/Sg73f97qS5pJwC5jAK2QMyZ83BJxzvy3jMkhxzYD7WR/oL1+eij5VgdgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:26.717290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95b2741fb38eda2b57de4ba3073311a0dae17574020499313b1040d6c6f3cdb9","sha256:6c6727a7553e986f7412369aef4d5b66d15ecf87b5513fbfdda8f3923a434acb"],"state_sha256":"2d7c8d84b722d825bc06ef81b23162432767824b932df1872563d44b47ecc538"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55Cv4WA8p9lhAzskhO80oT8uBdURO186S5eM9oaTL/wZSonfVW4Acwq/PxtljAad71YhZ4Wb5hSn9LqOOo5xAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:41:01.832123Z","bundle_sha256":"19fe6575c24d281b1655d83ab58b5d0faaf8912e10d3125476e80fe036e701c9"}}