On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness | Paper Citation Record

Observation 5edcf1cf-db42-4351-a3e3-45e0825691c3 · outbound

This paper cites Arvind and Piyush P.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Arvind and Piyush P

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.268416Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44d268d8-dea6-47ec-99ff-e0b88238938a · outbound

This paper cites Graph Isomorphism in Quasipolynomial Time.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Graph Isomorphism in Quasipolynomial Time

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.274314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 422c4c52-3e4c-4343-8014-4ae1cfbf5cdd · outbound

This paper cites Asymptotic improvements to provable algorithms for the code equivalence problem.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Asymptotic improvements to provable algorithms for the code equivalence problem

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.483621Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 92abbc6a-c001-48e5-a62a-f1ec44ac91b8 · outbound

This paper cites Grochow, and Youming Qiao.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Grochow, and Youming Qiao

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.285433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b60eadd-afa2-4809-8352-ee5a7e11eb56 · outbound

This paper cites Polynomial-time isomorphism test for groups with no abelian normal subgroups - (extended abstract).

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Polynomial-time isomorphism test for groups with no abelian normal subgroups - (extended abstract)

Reference 5

Resolution: verified exact; doi, observed 2026-08-16T05:57:52.088399Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e0f7b3d2-602d-446e-add3-a0219edb0710 · outbound

This paper cites Construction of finite groups.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Construction of finite groups

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.295743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6cd369ab-6ff4-4a23-a506-3f59c24209be · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.301053Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cf34cbe-a41f-4b72-8d40-e2eefded254c · outbound

This paper cites Superpolynomial circuits, almost sparse oracles and the exponential hierarchy.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Superpolynomial circuits, almost sparse oracles and the exponential hierarchy

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.305860Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ceabb8f7-b0ee-4230-a995-43eae86b8898 · outbound

This paper cites Babai, W.M.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Babai, W.M

Reference 9

Resolution: verified exact; doi, observed 2026-08-16T05:57:52.051859Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c0b7de02-d9c0-40e5-b661-8008762207e3 · outbound

This paper cites Mix Barrington, Peter Kadau, Klaus - J \" o rn Lange, and Pierre McKenzie.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Mix Barrington, Peter Kadau, Klaus - J \" o rn Lange, and Pierre McKenzie

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.314152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 851adfc0-d2ce-49d6-ba72-0ca3acf0dca7 · outbound

This paper cites Babai, E.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Babai, E

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.318514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76811fd3-fcc8-4cd4-8312-2889c01e44b6 · outbound

This paper cites Brooksbank, Joshua Maglione, and James B.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Brooksbank, Joshua Maglione, and James B

Reference 12

Resolution: verified exact; doi, observed 2026-08-16T05:57:52.036408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 44a96ecc-fffc-45a2-b5f9-bcdbc7108a60 · outbound

This paper cites Polynomial-time isomorphism test for groups with Abelian Sylow towers.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Polynomial-time isomorphism test for groups with Abelian Sylow towers

Reference 13

Resolution: verified exact; doi, observed 2026-08-16T05:57:52.020419Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1269ec7d-55b2-4f87-8774-fb4c61b45805 · outbound

This paper cites Combinatorial approaches to the group isomorphism problem.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Combinatorial approaches to the group isomorphism problem

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.466326Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 062f2f46-ae8e-4758-930a-8c1772ba861b · outbound

This paper cites On the complexity of matrix group problems I.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the complexity of matrix group problems I

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.334021Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 773dafb1-b231-422b-8732-80d5d7a8bc0c · outbound

This paper cites On the Weisfeiler--Leman dimension of finite groups.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the Weisfeiler--Leman dimension of finite groups

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.337950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ffa872b-5094-45c4-a49a-58eb9eb53cf4 · outbound

This paper cites Finite permutation groups and finite simple groups.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Finite permutation groups and finite simple groups

Reference 17

Resolution: verified exact; doi, observed 2026-08-16T05:57:52.005484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6d0a55e1-236a-4cf1-916b-8dc613b14431 · outbound

This paper cites An optimal lower bound on the number of variables for graph identification.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness An optimal lower bound on the number of variables for graph identification

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.346399Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 50893ad8-d783-4797-b88a-2786fbf35216 · outbound

This paper cites On the Constant-Depth Circuit Complexity of Generating Quasigroups.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the Constant-Depth Circuit Complexity of Generating Quasigroups

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.351372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ac1529e-a4b3-447f-8e37-3a7a07079ee4 · outbound

This paper cites Cannon and Derek F.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Cannon and Derek F

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.356869Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e01bbc5-59a6-46a0-8e5d-c442f5882098 · outbound

This paper cites Collins and Michael Levet.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Collins and Michael Levet

Reference 21

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.969918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f00efe64-c01b-4c7a-8a71-efee237280cf · outbound

This paper cites Problems complete for deterministic logarithmic space.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Problems complete for deterministic logarithmic space

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.366500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01ec5580-732c-45ac-98fd-5fbbf0ae7c95 · outbound

This paper cites Testing Isomorphism of Combinatorial and Algebraic Structures.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Testing Isomorphism of Combinatorial and Algebraic Structures

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.449467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2b937d0e-6e77-4041-bdf3-0987ba742bc9 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 24

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:57:53.432340Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 085f6995-4a09-4834-a8a5-db9517d4ec9e · outbound

This paper cites Graph isomorphism is not AC^0 -reducible to group isomorphism.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Graph isomorphism is not AC^0 -reducible to group isomorphism

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.380444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 390b3e37-729b-4710-9e64-6545afe4f771 · outbound

This paper cites Dixon and Brian Mortimer.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Dixon and Brian Mortimer

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.385199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9bcc85f2-5874-403c-9d97-94ad74420686 · outbound

This paper cites The minimal faithful permutation degree of groups without abelian normal subgroups.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness The minimal faithful permutation degree of groups without abelian normal subgroups

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.390136Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1608dd4-6a08-4eec-be64-4f6b30995bda · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.394476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d2d0d1f-5fca-40f6-bccd-51ea6c7b6256 · outbound

This paper cites Embedding and canonizing graphs of bounded genus in logspace.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Embedding and canonizing graphs of bounded genus in logspace

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.398609Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0715b1a2-c066-42a5-bf72-3631f3ce334e · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.402833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9e8677c-39bd-4025-8445-5b089a1d27ab · outbound

This paper cites Canonizing graphs of bounded tree width in logspace.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Canonizing graphs of bounded tree width in logspace

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.407228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc575dda-84e7-4472-b0b3-1e79ad6a8c3a · outbound

This paper cites Felsch and J.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Felsch and J

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.416220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6c4e8c3e-0394-43be-b6b3-ba668c3cde31 · outbound

This paper cites Furst, James B.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Furst, James B

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.416417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e53bf46-959c-4470-a3f4-d7c953a66854 · outbound

This paper cites Grochow and Michael Levet.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Grochow and Michael Levet

Reference 34

Resolution: verified exact; raw_fallback, observed 2026-08-16T05:57:52.767457Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 09482651-e898-4477-aeac-cce241b10d90 · outbound

This paper cites On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman

Reference 35

Resolution: metadata mismatch; local_arxiv, observed 2026-08-16T05:57:52.691684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 04d828f7-3bf2-4bbd-b51b-2197b0a24923 · outbound

This paper cites Grochow and Youming Qiao.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Grochow and Youming Qiao

Reference 36

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.893142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5b0e1fdd-3bfc-4124-a986-e9759976e9ba · outbound

This paper cites Algorithms for group isomorphism via group extensions and cohomology.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Algorithms for group isomorphism via group extensions and cohomology

Reference 37

Resolution: metadata mismatch; local_arxiv, observed 2026-08-16T05:57:52.668891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fb9d6078-6f1a-49de-8d91-4279bc356c0b · outbound

This paper cites Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions

Reference 38

Resolution: metadata mismatch; local_arxiv, observed 2026-08-16T05:57:52.644108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c5842cc1-8172-4125-83d0-b83c90a5922b · outbound

This paper cites Testing graph isomorphism in parallel by playing a game.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Testing graph isomorphism in parallel by playing a game

Reference 39

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.877103Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation dad91bd0-e9b4-41ee-b915-85e83b08c118 · outbound

This paper cites Definability hierarchies of generalized quantifiers.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Definability hierarchies of generalized quantifiers

Reference 40

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.861150Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a0f0aec7-ef15-4d24-82d6-7227602c3878 · outbound

This paper cites Logical hierarchies in PTIME.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Logical hierarchies in PTIME

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.454191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0ff4674-36d8-420f-8228-35cd4bb1a4c8 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 42

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:57:53.399618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cbed08c9-d06a-45ec-a052-f910401af462 · outbound

This paper cites Describing graphs: A first-order approach to graph canonization.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Describing graphs: A first-order approach to graph canonization

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.463152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34f3925b-2226-4826-978e-63554c71b6cb · outbound

This paper cites Which problems have strongly exponential complexity? Journal of Computer and System Sciences , 63(4):512--530, 2001.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Which problems have strongly exponential complexity? Journal of Computer and System Sciences , 63(4):512--530, 2001

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.467271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e009c3d-0bb7-4298-be2e-be1bff76f8e8 · outbound

This paper cites Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

Reference 45

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.835255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2e23ca14-d489-497c-8db4-f8d507873beb · outbound

This paper cites o bler, Uwe Sch \.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness o bler, Uwe Sch \

Reference 46

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.818676Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cf729df0-01f9-4ede-be72-c070f1e1626a · outbound

This paper cites On the Group and Color Isomorphism Problems.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the Group and Color Isomorphism Problems

Reference 47

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:57:52.494773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 416dfb94-d7e6-4672-a468-a0cd85f42aec · outbound

This paper cites Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.486142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0eafb0f3-ec8c-4a07-b0e6-82457a276b32 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 49

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:57:53.384367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 157fd000-f9f7-419c-bbbc-536edb4c9887 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.495295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d6bacee-bbc7-4153-8eab-4d8002ca8704 · outbound

This paper cites Permutation groups and polynomial-time computation.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Permutation groups and polynomial-time computation

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.500072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed8af78d-b82a-4fa8-b3d5-263f753057cd · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 52

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:57:52.473821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 8d3ca30f-c26f-443e-b759-4402c8abe3f7 · outbound

This paper cites Group Isomorphism with Fixed Subnormal Chains.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Group Isomorphism with Fixed Subnormal Chains

Reference 53

Resolution: verified exact; local_arxiv, observed 2026-08-16T05:57:52.402374Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b420052e-cde7-430f-9216-322934968507 · outbound

This paper cites Lewis and James B.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Lewis and James B

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.513918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02d68ae4-b527-45f8-848e-094c11185b8f · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 55

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:57:52.379075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0f3246f1-9e98-4a7e-b62c-b167b620df2c · outbound

This paper cites Message to sci.math.research google group.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Message to sci.math.research google group

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.366526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 916880ce-ff38-4fe4-bcca-6d2652ec9e52 · outbound

This paper cites Petrank and R.M.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Petrank and R.M

Reference 57

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.757006Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation aaea255d-48b3-4fb5-8edb-8c4ab94037bd · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 58

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.740218Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation dc080a37-3c58-4a67-be7e-fd062072e2fb · outbound

This paper cites Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.536948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cd84378-9471-42f9-be7a-5fde17e78f10 · outbound

This paper cites Graph isomorphism is in the low hierarchy.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Graph isomorphism is in the low hierarchy

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.542099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a2a8104-f5d3-4514-9917-73a90f6832f1 · outbound

This paper cites Permutation group algorithms , volume 152 of Cambridge Tracts in Mathematics.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Permutation group algorithms , volume 152 of Cambridge Tracts in Mathematics

Reference 61

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.713876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f6b35ece-8949-4722-ab45-1199589983a1 · outbound

This paper cites Borel sets and circuit complexity.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Borel sets and circuit complexity

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.551414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 428ce96e-c05a-48ab-b610-84101a73961c · outbound

This paper cites Towards Understanding Satisfiability, Group Isomorphism and Their Connections.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Towards Understanding Satisfiability, Group Isomorphism and Their Connections

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:53.349775Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5c4d5aae-410a-4df6-b8d4-e5ea55533b07 · outbound

This paper cites Maximal subgroups of direct products.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Maximal subgroups of direct products

Reference 64

Resolution: verified exact; raw_fallback, observed 2026-08-16T05:57:52.225064Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0b5fc415-5a51-4905-98c1-dff886f24be0 · outbound

This paper cites On the hardness of graph isomorphism.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness On the hardness of graph isomorphism

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.565576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a24ce9c-770d-4aab-96a5-08bb6ceff4d8 · outbound

This paper cites Introduction to Circuit Complexity - A Uniform Approach.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Introduction to Circuit Complexity - A Uniform Approach

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.570470Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d2b52cb7-1f88-4cde-b376-a827f2d3d7aa · outbound

This paper cites Growth sequences of finite groups III.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Growth sequences of finite groups III

Reference 67

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.677068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f9b78742-7573-4580-911e-7ed40d2d7754 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:51.581082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ca855d4-aa52-4f77-bf3b-4ad3f89662ad · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 69

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:57:53.333512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7e07d390-7830-4cef-888f-db5acd411e67 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 70

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.648514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9d5e07c6-346c-4e2d-963c-ed960cd07b45 · outbound

This paper cites an unresolved cited work.

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness Unresolved cited work

Reference 71

Resolution: verified exact; doi, observed 2026-08-16T05:57:51.634165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers