{"as_of":"2026-08-19T01:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec6992eeea46fcbb1ffe5d473616952fb456ed1656fd0ca726e36eaef6835b52","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:57:51.594349Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.19777/citation-record","integrity":"/paper/2504.19777/integrity","json":"/paper/2504.19777/citation-record.json","paper":"/paper/2504.19777"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.268416Z","title":"Arvind and Piyush P","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.268416Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:8b00f431f63be0468124a9330b727db3750f844dde74e8faf0d04396e39674c1","observation_id":"5edcf1cf-db42-4351-a3e3-45e0825691c3","resolution":{"observed_at":"2026-08-16T05:57:51.268416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1512.03547","last_updated":"2016-01-19T08:55:28Z","snapshot_observed_at":"2026-08-14T22:19:00.886032Z","submitted_at":"2015-12-11T08:04:26Z","title":"Graph Isomorphism in Quasipolynomial Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1512.03547","snapshot_observed_at":"2026-08-16T05:57:51.274314Z","title":"Graph isomorphism in quasipolynomial time [extended abstract]","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.274314Z"},"links":{"cited_paper":"/paper/1512.03547","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:46524c0e74ee0effbd09a709a21df972b424f86d1d3218a1a4817003ec2e8fde","observation_id":"44d268d8-dea6-47ec-99ff-e0b88238938a","resolution":{"observed_at":"2026-08-16T05:57:51.274314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.478183Z","title":"Asymptotic improvements to provable algorithms for the code equivalence problem","venue":null,"work_id":"37d7df25-f0cd-40d7-b8f3-b2c97e5c1bfb","year":2025},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.280149Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:6295f6d49793c36d922974516fdffad0ad2edf57f76f1f7ccce23e8c984727c2","observation_id":"422c4c52-3e4c-4343-8014-4ae1cfbf5cdd","resolution":{"observed_at":"2026-08-16T05:57:53.483621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.285433Z","title":"Grochow, and Youming Qiao","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.285433Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:27f7fdd7e789e57f2c3f8b9f788fc0ef5a432485d1cbb03cd33686f8f5fce62b","observation_id":"92abbc6a-c001-48e5-a62a-f1ec44ac91b8","resolution":{"observed_at":"2026-08-16T05:57:51.285433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-31594-7_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"Polynomial-time isomorphism test for groups with no abelian normal subgroups - (extended abstract)","venue":"Lecture notes in computer science","work_id":"51ae55d3-dd97-43db-acda-78da90bfd91f","year":2012},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.290498Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:e9a48a1e85b12c24c044515bd069148aa03f21cc83d3f032cabdec3854a4419f","observation_id":"6b60eadd-afa2-4809-8352-ee5a7e11eb56","resolution":{"observed_at":"2026-08-16T05:57:52.088399Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.295743Z","title":"Construction of finite groups","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.295743Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:23d967e9ad73ab7f1eeeca3533cbc2c397e975af32bd54d8245b92ba4c1a2be8","observation_id":"e0f7b3d2-602d-446e-add3-a0219edb0710","resolution":{"observed_at":"2026-08-16T05:57:51.295743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.301053Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.301053Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:abb76d0b0ec6624c8dfd83e57aadabf9537370632a727fba38130c5ab101e544","observation_id":"6cd369ab-6ff4-4a23-a506-3f59c24209be","resolution":{"observed_at":"2026-08-16T05:57:51.301053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.305860Z","title":"Superpolynomial circuits, almost sparse oracles and the exponential hierarchy","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.305860Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:cb0983881f790acfaa0758e6750bd8a6b0d2ed2f791d6e59b7d081964e81ab9d","observation_id":"7cf34cbe-a41f-4b72-8d40-e2eefded254c","resolution":{"observed_at":"2026-08-16T05:57:51.305860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0195-6698(89)80067-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.046690Z","title":"Babai, W.M","venue":null,"work_id":"b189bb69-8865-4c02-83f5-27f3a3b13c9e","year":1989},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.309873Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:027e0b095d6b52249b60083e82bbe7caa9cfbd5ddf794da1f63813c13f33a05e","observation_id":"ceabb8f7-b0ee-4230-a995-43eae86b8898","resolution":{"observed_at":"2026-08-16T05:57:52.051859Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.314152Z","title":"Mix Barrington, Peter Kadau, Klaus - J \\\" o rn Lange, and Pierre McKenzie","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.314152Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:a5a16a3f4514db6f32c06da90268c6965b9341a1b3292f86fe1dcc9bf02df52b","observation_id":"c0b7de02-d9c0-40e5-b661-8008762207e3","resolution":{"observed_at":"2026-08-16T05:57:51.314152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.318514Z","title":"Babai, E","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.318514Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:4e7723019d595ff38f0c5164955d28f1b6c874a31f8bcc740a8348f3819912e3","observation_id":"851adfc0-d2ce-49d6-ba72-0ca3acf0dca7","resolution":{"observed_at":"2026-08-16T05:57:51.318514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jalgebra.2016.12.007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.030990Z","title":"Brooksbank, Joshua Maglione, and James B","venue":null,"work_id":"d5c8498c-9977-4c25-abf0-7ddb6cec49dd","year":2017},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.322258Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:05965252374981af38b3975f5c4850e81c05c5f09c2f69ca85805fc8191a1d50","observation_id":"76811fd3-fcc8-4cd4-8312-2889c01e44b6","resolution":{"observed_at":"2026-08-16T05:57:52.036408Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2012.453","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.015879Z","title":"Polynomial-time isomorphism test for groups with Abelian Sylow towers","venue":null,"work_id":"f79fea23-c114-4895-bf85-ff65cd01c64b","year":2012},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.326187Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:49aacf5b795c0bc4800509833438f5766a746883840eca93f377a8e3ab4c668e","observation_id":"44a96ecc-fffc-45a2-b5f9-bcdbc7108a60","resolution":{"observed_at":"2026-08-16T05:57:52.020419Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.460622Z","title":"Combinatorial approaches to the group isomorphism problem","venue":null,"work_id":"7116bc15-0d97-4bce-80e4-697856051fbb","year":2023},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.330263Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b337bb8ddc8cce3f20aa91d34b06df6a42f43d20129dc886f03141b564fedb6a","observation_id":"1269ec7d-55b2-4f87-8774-fb4c61b45805","resolution":{"observed_at":"2026-08-16T05:57:53.466326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.334021Z","title":"On the complexity of matrix group problems I","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.334021Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:799ed1577170b10163ee9659159400b778ea08f52298f40bbdd3fee196530a63","observation_id":"062f2f46-ae8e-4758-930a-8c1772ba861b","resolution":{"observed_at":"2026-08-16T05:57:51.334021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.337950Z","title":"On the Weisfeiler--Leman dimension of finite groups","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.337950Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:128bddd2b29c58ddad2988a5d1c22157a8ce2949bb0f0318ef8be60f5a2be4e3","observation_id":"773dafb1-b231-422b-8732-80d5d7a8bc0c","resolution":{"observed_at":"2026-08-16T05:57:51.337950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1112/blms/13.1.1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.000941Z","title":"Finite permutation groups and finite simple groups","venue":null,"work_id":"63bdfce4-f192-4ee5-aefa-0a88977638de","year":1981},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.342251Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:ed8662de45b41fc6149976e4606bef8173038e0c7fc0e480c9eeb40e066336a9","observation_id":"0ffa872b-5094-45c4-a49a-58eb9eb53cf4","resolution":{"observed_at":"2026-08-16T05:57:52.005484Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.346399Z","title":"An optimal lower bound on the number of variables for graph identification","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.346399Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0019f43379ac59d4979502d8eae5f8605d778d20b317cfdfdd15665928ce5f3a","observation_id":"6d0a55e1-236a-4cf1-916b-8dc613b14431","resolution":{"observed_at":"2026-08-16T05:57:51.346399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00133","last_updated":"2025-08-21T09:37:56Z","snapshot_observed_at":"2026-08-16T14:22:44.603196Z","submitted_at":"2024-01-31T19:17:52Z","title":"On the Constant-Depth Circuit Complexity of Generating Quasigroups","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00133","snapshot_observed_at":"2026-08-16T05:57:51.351372Z","title":"Collins, Joshua A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.351372Z"},"links":{"cited_paper":"/paper/2402.00133","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:1ff873344f5d8e695b3356ac844fd619c93f2166f2f552fea6564c8c5a3eb92e","observation_id":"50893ad8-d783-4797-b88a-2786fbf35216","resolution":{"observed_at":"2026-08-16T05:57:51.351372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.356869Z","title":"Cannon and Derek F","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.356869Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:60662c78b396f3ab4d44dc4c875583e2b38fcccc58e502a424156276235dc44d","observation_id":"2ac1529e-a4b3-447f-8e37-3a7a07079ee4","resolution":{"observed_at":"2026-08-16T05:57:51.356869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0218196724500103","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.965542Z","title":"Collins and Michael Levet","venue":null,"work_id":"e13724e8-5e69-45f2-97f6-7363d15601ca","year":2024},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.361652Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:c512c13cbdcfa0f6281ae4140f8121ef3c2c932b6187fa8e7c4492f157c62515","observation_id":"0e01bbc5-59a6-46a0-8e5d-c442f5882098","resolution":{"observed_at":"2026-08-16T05:57:51.969918Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.366500Z","title":"Problems complete for deterministic logarithmic space","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.366500Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:e14eafe8fb764957ea1684b66923bdb977b263c7b5f228e7be514c220fbbe115","observation_id":"f00efe64-c01b-4c7a-8a71-efee237280cf","resolution":{"observed_at":"2026-08-16T05:57:51.366500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.444193Z","title":"Testing Isomorphism of Combinatorial and Algebraic Structures","venue":null,"work_id":"cf3f252e-0316-4650-b8a3-8d19c9bd4ac4","year":2011},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.371236Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:fa97ac9059ec9f716f62f5c8cfa4332d16e05fd6c772b399a45734fc78f50b37","observation_id":"01ec5580-732c-45ac-98fd-5fbbf0ae7c95","resolution":{"observed_at":"2026-08-16T05:57:53.449467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.426913Z","title":null,"venue":null,"work_id":"f670874f-61f1-4fa0-9ef2-812aab978f22","year":2023},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.375829Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:816afce401107c863dea067fdbe522b369848f9406bd704c090d151804ee5945","observation_id":"2b937d0e-6e77-4041-bdf3-0987ba742bc9","resolution":{"observed_at":"2026-08-16T05:57:53.432340Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.380444Z","title":"Graph isomorphism is not AC^0 -reducible to group isomorphism","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.380444Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:63c2962401506f2a668ae829cbfdcf2f94e009017ed931a5754d64ae5cdf3701","observation_id":"085f6995-4a09-4834-a8a5-db9517d4ec9e","resolution":{"observed_at":"2026-08-16T05:57:51.380444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.385199Z","title":"Dixon and Brian Mortimer","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.385199Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:10497c299e8faa6793af0b6569b3e8c7e375266df0383b13eeb7e8740315477b","observation_id":"390b3e37-729b-4710-9e64-6545afe4f771","resolution":{"observed_at":"2026-08-16T05:57:51.385199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.390136Z","title":"The minimal faithful permutation degree of groups without abelian normal subgroups","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.390136Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:04967b5779022303dcf2e1b1c847f311a4fe9e2cf6f076c168b9b01c9e70dfbc","observation_id":"9bcc85f2-5874-403c-9d97-94ad74420686","resolution":{"observed_at":"2026-08-16T05:57:51.390136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.394476Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.394476Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:8badc93fb0cfeaf8dcb89f3af1f151dde86b6390e89e526d39a54bdcff56f713","observation_id":"b1608dd4-6a08-4eec-be64-4f6b30995bda","resolution":{"observed_at":"2026-08-16T05:57:51.394476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.398609Z","title":"Embedding and canonizing graphs of bounded genus in logspace","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.398609Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:842f2d31b80ca3580a0997c2a84d69b748df611ac57df314c6b3caa0574ae14c","observation_id":"5d2d0d1f-5fca-40f6-bccd-51ea6c7b6256","resolution":{"observed_at":"2026-08-16T05:57:51.398609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.402833Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.402833Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:9aff287f1005bea36cb97e470e09ba00069fe1ceed6fd894e36523fb91cb3d84","observation_id":"0715b1a2-c066-42a5-bf72-3631f3ce334e","resolution":{"observed_at":"2026-08-16T05:57:51.402833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.407228Z","title":"Canonizing graphs of bounded tree width in logspace","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.407228Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:23836522d372d23dd331b6db54c94cf4326acb39b0d11ae87c53b756797905f4","observation_id":"f9e8677c-39bd-4025-8445-5b089a1d27ab","resolution":{"observed_at":"2026-08-16T05:57:51.407228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.410752Z","title":"Felsch and J","venue":null,"work_id":"83200808-68a0-4da1-be34-95e6aeb7b9cf","year":1967},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.411963Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:29eb25414faa74dddb6b00b63426c915ccb0c1d8d80b6d5ee5b8b7bdd5c604d7","observation_id":"dc575dda-84e7-4472-b0b3-1e79ad6a8c3a","resolution":{"observed_at":"2026-08-16T05:57:53.416220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.416417Z","title":"Furst, James B","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.416417Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b8fd0706c2de7880e6487b56f9194ee5d4767ca6d849d8d60568e0ffa4454b69","observation_id":"6c4e8c3e-0394-43be-b6b3-ba668c3cde31","resolution":{"observed_at":"2026-08-16T05:57:51.416417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2209.13725","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.757693Z","title":"Grochow and Michael Levet","venue":null,"work_id":"7ed98797-0671-4030-bcf3-1110cf283d3b","year":2023},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.421036Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b1b86b95b0cede263e6ce083fb0d72486634aaa44d3e44eb7c526a1e74f58a9c","observation_id":"2e53bf46-959c-4470-a3f4-d7c953a66854","resolution":{"observed_at":"2026-08-16T05:57:52.767457Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.11487","last_updated":"2025-09-07T22:21:25Z","snapshot_observed_at":"2026-08-18T19:54:41.280685Z","submitted_at":"2021-12-21T19:05:40Z","title":"On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman","version":7},"cited_work":{"arxiv_id":"2112.11487","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.11487","snapshot_observed_at":"2026-08-16T05:57:52.686558Z","title":"On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman","venue":"cs.DS","work_id":"6fbc548e-e58a-4179-8111-c738ea6d7682","year":2021},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.425715Z"},"links":{"cited_paper":"/paper/2112.11487","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:dbc995df142e869466e37618ea762bc08f8c95853e4bdccbaf7a7be66f597558","observation_id":"09482651-e898-4477-aeac-cce241b10d90","resolution":{"observed_at":"2026-08-16T05:57:52.691684Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-48971-0_49","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"Grochow and Youming Qiao","venue":"Lecture notes in computer science","work_id":"42456685-84ee-4901-9e13-bcef36277155","year":2015},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.430452Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:c1ade1e65b3c9592ef96e9479404d500694c6a0904f1020394cea50eb08b746d","observation_id":"04d828f7-3bf2-4bbd-b51b-2197b0a24923","resolution":{"observed_at":"2026-08-16T05:57:51.893142Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1309.1776","last_updated":"2017-04-11T13:54:31Z","snapshot_observed_at":"2026-08-15T00:04:04.335503Z","submitted_at":"2013-09-06T20:52:49Z","title":"Algorithms for group isomorphism via group extensions and cohomology","version":2},"cited_work":{"arxiv_id":"1309.1776","doi":null,"metadata_source":"pith","pith_arxiv_id":"1309.1776","snapshot_observed_at":"2026-08-16T05:57:52.663495Z","title":"Algorithms for group isomorphism via group extensions and cohomology","venue":"cs.DS","work_id":"583eb011-f128-435a-8cc2-b55768cf9017","year":2013},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.435099Z"},"links":{"cited_paper":"/paper/1309.1776","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:997a4d3ea15c6e0afd5529f9914e53ac5a29992f6762ff6f919b26948b97e159","observation_id":"5b0e1fdd-3bfc-4124-a986-e9759976e9ba","resolution":{"observed_at":"2026-08-16T05:57:52.668891Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.00309","last_updated":"2019-06-30T03:08:38Z","snapshot_observed_at":"2026-08-14T16:10:13.094579Z","submitted_at":"2019-06-30T03:08:38Z","title":"Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions","version":1},"cited_work":{"arxiv_id":"1907.00309","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.00309","snapshot_observed_at":"2026-08-16T05:57:52.639298Z","title":"Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions","venue":"cs.CC","work_id":"b3bb0080-04d9-4ff2-81d5-35d30a77573d","year":2019},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.440470Z"},"links":{"cited_paper":"/paper/1907.00309","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:7ee11e11281a82516252304b1466320ac06f99b44cd078ab7567a93745c4c6ba","observation_id":"fb9d6078-6f1a-49de-8d91-4279bc356c0b","resolution":{"observed_at":"2026-08-16T05:57:52.644108Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11786986_2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"Testing graph isomorphism in parallel by playing a game","venue":"Lecture notes in computer science","work_id":"262f75f7-42bf-4be4-8c14-59e676b05080","year":2006},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.445645Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:5ca94176c4588ffba90567c3e5aa97c5a11bc9f7c08170b4785d7ae262e051d0","observation_id":"c5842cc1-8172-4125-83d0-b83c90a5922b","resolution":{"observed_at":"2026-08-16T05:57:51.877103Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0168-0072(89)90070-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.855794Z","title":"Definability hierarchies of generalized quantifiers","venue":null,"work_id":"bb8d9122-7150-4108-8572-586708378b42","year":1989},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.449891Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:38cf5cf5b65f432c81e218b0113ad522bbd059b9fb31c118de4d8b58c366f4ab","observation_id":"dad91bd0-e9b4-41ee-b915-85e83b08c118","resolution":{"observed_at":"2026-08-16T05:57:51.861150Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.454191Z","title":"Logical hierarchies in PTIME","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.454191Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:7abdd5f529f000d3001f7a525d676d93498a20a2bbbefecfc28b36b407f5423e","observation_id":"a0f0aec7-ef15-4d24-82d6-7227602c3878","resolution":{"observed_at":"2026-08-16T05:57:51.454191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.395016Z","title":null,"venue":null,"work_id":"858876c9-2c32-4504-8c21-126d1bd71a90","year":2005},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.458332Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:059cd11d183586b20fdb2b3543b082ba570272d86ec9c97600e346c9fcb4a70b","observation_id":"f0ff4674-36d8-420f-8228-35cd4bb1a4c8","resolution":{"observed_at":"2026-08-16T05:57:53.399618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.463152Z","title":"Describing graphs: A first-order approach to graph canonization","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.463152Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:50a55da2226a871cf70fdb2802ed2f63d862db6b0bb9e1fdee388c29a90f7fd2","observation_id":"cbed08c9-d06a-45ec-a052-f910401af462","resolution":{"observed_at":"2026-08-16T05:57:51.463152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.467271Z","title":"Which problems have strongly exponential complexity? Journal of Computer and System Sciences , 63(4):512--530, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.467271Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:284ce400f3ae8da7bebd4a1eb59f26e8031359ad15539020ce0d01c0cf4c46ae","observation_id":"34f3925b-2226-4826-978e-63554c71b6cb","resolution":{"observed_at":"2026-08-16T05:57:51.467271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/18m1165682","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.829515Z","title":"Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing","venue":null,"work_id":"cd0df877-0e30-417a-8460-bc78bb5b7468","year":2019},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.471970Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0d9d20f0acd4199aea5ae9d7fa23485b73a5096a3eb9e01cbf2e4bdfeb28718f","observation_id":"1e009c3d-0bb7-4298-be2e-be1bff76f8e8","resolution":{"observed_at":"2026-08-16T05:57:51.835255Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01200427","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"o bler, Uwe Sch \\","venue":"Computational Complexity","work_id":"7be0df5f-957d-4dc4-8078-fa8388cabba3","year":1992},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.476559Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:40fae739a45708e2426e374521a5a3818487ba0ccb94e5cee281d0b2980df266","observation_id":"2e23ca14-d489-497c-8db4-f8d507873beb","resolution":{"observed_at":"2026-08-16T05:57:51.818676Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.08253","last_updated":"2016-09-27T04:10:44Z","snapshot_observed_at":"2026-08-14T21:38:05.555931Z","submitted_at":"2016-09-27T04:10:44Z","title":"On the Group and Color Isomorphism Problems","version":1},"cited_work":{"arxiv_id":"1609.08253","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.08253","snapshot_observed_at":"2026-08-16T05:57:52.489932Z","title":"On the Group and Color Isomorphism Problems","venue":"cs.CC","work_id":"a0caaa86-ea3c-4098-bdf9-144ee2115621","year":2016},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.481342Z"},"links":{"cited_paper":"/paper/1609.08253","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:ce9f1aacd87a2ec7e022a04ae6afbbd3a9cf0b4813c0baea9adbae887c758df4","observation_id":"cf729df0-01f9-4ede-be72-c070f1e1626a","resolution":{"observed_at":"2026-08-16T05:57:52.494773Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.486142Z","title":"Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.486142Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:3ddaa5f52a58bce7138452fa5eeb25c62774e38a28ed24ed09d7b599185951e0","observation_id":"416dfb94-d7e6-4672-a468-a0cd85f42aec","resolution":{"observed_at":"2026-08-16T05:57:51.486142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.379062Z","title":null,"venue":null,"work_id":"25099492-35ab-478f-b35c-d0767c560044","year":1977},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.490713Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:cdfe23340a6e84298f8b0a74df66a9f5e8ed9552fd58b7b6e694a36e39975038","observation_id":"0eafb0f3-ec8c-4a07-b0e6-82457a276b32","resolution":{"observed_at":"2026-08-16T05:57:53.384367Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.495295Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.495295Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:6fc855aa85fdb8c02d290a1962866de54399f121e70c819f60e3517eff347bfb","observation_id":"157fd000-f9f7-419c-bbbc-536edb4c9887","resolution":{"observed_at":"2026-08-16T05:57:51.495295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.500072Z","title":"Permutation groups and polynomial-time computation","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.500072Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0546ce4e601ce857037ae96f76742b0e7d165b0e4d7e459403636fbf375143d6","observation_id":"9d6bacee-bbc7-4153-8eab-4d8002ca8704","resolution":{"observed_at":"2026-08-16T05:57:51.500072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1250.30142","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.463326Z","title":null,"venue":null,"work_id":"f0ce4ddb-b35b-43d7-a009-f7d4653dffc0","year":1999},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.504852Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b2d0f93ad21e9527ef09977e01ea67e08f71dac591536b457f110d63390fbf31","observation_id":"ed8af78d-b82a-4fa8-b3d5-263f753057cd","resolution":{"observed_at":"2026-08-16T05:57:52.473821Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.00151","last_updated":"2015-10-31T17:06:21Z","snapshot_observed_at":"2026-08-14T22:25:25.342761Z","submitted_at":"2015-10-31T17:06:21Z","title":"Group Isomorphism with Fixed Subnormal Chains","version":1},"cited_work":{"arxiv_id":"1511.00151","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.00151","snapshot_observed_at":"2026-08-16T05:57:52.397294Z","title":"Group Isomorphism with Fixed Subnormal Chains","venue":"cs.CC","work_id":"a15bff82-81fe-41d9-8d11-99c95d01548d","year":2015},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.509300Z"},"links":{"cited_paper":"/paper/1511.00151","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:6ef05d6e370e4914d3d73d46354a336fc7e3edba605ddfbe44dbc4a4888beab1","observation_id":"8d3ca30f-c26f-443e-b759-4402c8abe3f7","resolution":{"observed_at":"2026-08-16T05:57:52.402374Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.513918Z","title":"Lewis and James B","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.513918Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:a9ef87956269266e386b8530599ff1872a7b2527d01d77f86e0e5cb4c32bc1f1","observation_id":"b420052e-cde7-430f-9216-322934968507","resolution":{"observed_at":"2026-08-16T05:57:51.513918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0133.80433","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.368462Z","title":null,"venue":null,"work_id":"2b40c365-00ed-4d79-8731-28294b0f2685","year":1978},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.518479Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:36f4accdf157ea9ccec4c04b117d23c83ddafbe1e2143067331d8691a51236f4","observation_id":"02d68ae4-b527-45f8-848e-094c11185b8f","resolution":{"observed_at":"2026-08-16T05:57:52.379075Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.360981Z","title":"Message to sci.math.research google group","venue":null,"work_id":"259d593d-5f14-445c-add4-881c210f6419","year":1996},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.523130Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:6e6b2e953707fbd532a6b2b387457eab4fc195b3d51909c29e0903df931f9a8a","observation_id":"0f3246f1-9e98-4a7e-b62c-b167b620df2c","resolution":{"observed_at":"2026-08-16T05:57:53.366526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/18.623157","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.751845Z","title":"Petrank and R.M","venue":null,"work_id":"2f6d4fed-0f9c-4ab5-8aae-45d7ee0ce9f7","year":1997},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.527595Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:219e738ba4f067ec9db33497597d59780859729c339c4ffe9d8d52a248b68fd5","observation_id":"916880ce-ff38-4fe4-bcca-6d2652ec9e52","resolution":{"observed_at":"2026-08-16T05:57:51.757006Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2011.567","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.735380Z","title":null,"venue":null,"work_id":"d9df51b0-8ae6-4532-87fd-2f6112b91f3d","year":2011},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.532252Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:d740a12024da70b11035c93b8d2efc0c053a1c549788a7366c8eb7597b304795","observation_id":"aaea255d-48b3-4fb5-8edb-8c4ab94037bd","resolution":{"observed_at":"2026-08-16T05:57:51.740218Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.3935","last_updated":"2013-05-16T04:37:28Z","snapshot_observed_at":"2026-08-15T00:21:32.882007Z","submitted_at":"2013-04-14T19:21:14Z","title":"Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.3935","snapshot_observed_at":"2026-08-16T05:57:51.536948Z","title":"Rosenbaum","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.536948Z"},"links":{"cited_paper":"/paper/1304.3935","citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0c6d110c08f5cf727e9b58c2b06c9cfca0101c14d92983e988316bd07181a92e","observation_id":"dc080a37-3c58-4a67-be7e-fd062072e2fb","resolution":{"observed_at":"2026-08-16T05:57:51.536948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.542099Z","title":"Graph isomorphism is in the low hierarchy","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.542099Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:88b4db772fa26282dd84906d438c549f627e7926ef387161f68ad7654c80e223","observation_id":"7cd84378-9471-42f9-be7a-5fde17e78f10","resolution":{"observed_at":"2026-08-16T05:57:51.542099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511546549","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.708541Z","title":"Permutation group algorithms , volume 152 of Cambridge Tracts in Mathematics","venue":null,"work_id":"1eb06dfd-5023-4b06-bc9e-d9398d4cf010","year":2003},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.546712Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:7c951a0f3894b50f59f2c2c1aa668a47ebfb0a4dc12ede4da2729b7c9b310fbb","observation_id":"9a2a8104-f5d3-4514-9917-73a90f6832f1","resolution":{"observed_at":"2026-08-16T05:57:51.713876Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.551414Z","title":"Borel sets and circuit complexity","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.551414Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:e8e860c8772f50fa7ff17620c1f2a3868dd3f353a328ececa33c8d4b4978c03d","observation_id":"f6b35ece-8949-4722-ab45-1199589983a1","resolution":{"observed_at":"2026-08-16T05:57:51.551414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.344459Z","title":"Towards Understanding Satisfiability, Group Isomorphism and Their Connections","venue":null,"work_id":"52313cc8-0705-49a0-a5ef-ae065138e06d","year":2013},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.556054Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:3ed5d23bf6a71af05882009b3a0dc877053af031508deb4dfa83dbc4bee8f6f8","observation_id":"428ce96e-c05a-48ab-b610-84101a73961c","resolution":{"observed_at":"2026-08-16T05:57:53.349775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.7095","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:52.217115Z","title":"Maximal subgroups of direct products","venue":null,"work_id":"603ac5b8-b2d6-411d-a487-bf62b6a59ad3","year":1997},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.560555Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:9f936611a9b5956a9b4ef10429108f2175b2d198531e61c69996907102fad60d","observation_id":"5c4d5aae-410a-4df6-b8d4-e5ea55533b07","resolution":{"observed_at":"2026-08-16T05:57:52.225064Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.565576Z","title":"On the hardness of graph isomorphism","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.565576Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:c43d9ea792fe6c7d3a1182270805a702838ca57f57fe335c4ee130426039819a","observation_id":"0b5fc415-5a51-4905-98c1-dff886f24be0","resolution":{"observed_at":"2026-08-16T05:57:51.565576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.570470Z","title":"Introduction to Circuit Complexity - A Uniform Approach","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.570470Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:c03f666e7976319615d13e9b1c9d11d61f2532d33b0b817a56d50bfc4dd3ca16","observation_id":"5a24ce9c-770d-4aab-96a5-08bb6ceff4d8","resolution":{"observed_at":"2026-08-16T05:57:51.570470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s1446788700038726","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.671092Z","title":"Growth sequences of finite groups III","venue":null,"work_id":"dc036a25-cc7a-4835-b0a8-a01677ea7154","year":1978},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.575718Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:af286c0fee2c5c47f08cb6be1392aac18753b42c73b7b94e743c710f304a5d71","observation_id":"d2b52cb7-1f88-4cde-b376-a827f2d3d7aa","resolution":{"observed_at":"2026-08-16T05:57:51.677068Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.581082Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.581082Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b1854149ec96b70b6563d09437de4e3b65bd764cde81197505152a1f795201c5","observation_id":"f9b78742-7573-4580-911e-7ed40d2d7754","resolution":{"observed_at":"2026-08-16T05:57:51.581082Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:53.328466Z","title":null,"venue":null,"work_id":"56618a61-8d86-449b-8897-51547157a9bf","year":2024},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.585810Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:0f0b721ab8f50c2685cff3761fdd2ce68b3a223be4186497ab5b38ce915607c7","observation_id":"5ca855d4-aa52-4f77-bf3b-4ad3f89662ad","resolution":{"observed_at":"2026-08-16T05:57:53.333512Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(92)00014-i","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:57:51.644372Z","title":null,"venue":null,"work_id":"9924dbdb-9eb2-4c9c-b247-465acb205ccd","year":1994},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.590026Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:b57031c3ab8e84d5ea8fc31e8129d225cda53e8a50557509a23bff2cd3dd2eae","observation_id":"7e07d390-7830-4cef-888f-db5acd411e67","resolution":{"observed_at":"2026-08-16T05:57:51.648514Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02104746","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":null,"venue":"Journal of Mathematical Sciences","work_id":"4360d592-d45c-4b49-8222-0625328c86c9","year":1985},"citing_paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-16T05:57:51.594349Z"},"links":{"citing_paper":"/paper/2504.19777"},"observation_digest":"sha256:179455fa73d850974a274c018637f1817b35bf1633d79b9e7cd699596da3f758","observation_id":"9d5e07c6-346c-4e2d-963c-ed960cd07b45","resolution":{"observed_at":"2026-08-16T05:57:51.634165Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.19777","last_updated":"2025-04-28T13:23:46Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-18T17:00:19.888521Z","submitted_at":"2025-04-28T13:23:46Z","title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":39,"verified_exact":21,"verified_fuzzy":6},"total_outbound_references":71},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2504.19777."}