{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JDBK36CABJ4ICLUF6JVOXBNFRF","short_pith_number":"pith:JDBK36CA","schema_version":"1.0","canonical_sha256":"48c2adf8400a78812e85f26aeb85a58955dae8e1d3ffcac969b9ba51bbc1ea82","source":{"kind":"arxiv","id":"2112.11487","version":7},"attestation_state":"computed","paper":{"title":"On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.GR"],"primary_cat":"cs.DS","authors_text":"Joshua A. Grochow, Michael Levet","submitted_at":"2021-12-21T19:05:40Z","abstract_excerpt":"In this paper, we show that the constant-dimensional Weisfeiler-Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity upper bounds on isomorphism testing for several families of groups. In particular, we show:\n  - Groups with an Abelian normal Hall subgroup whose complement is $O(1)$-generated are identified by constant-dimensional Weisfeiler-Leman using only a constant number of rounds. This places isomorphism testing for this family of groups into $\\textsf{L}$; the previous upper bound for isomorphism testing was $\\textsf{P}$ (Qia"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2112.11487","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-21T19:05:40Z","cross_cats_sorted":["cs.CC","cs.LO","math.GR"],"title_canon_sha256":"e26460a0af779cb4c76dade157d59f3eb5b245de6348c59a83402ced91aa5e54","abstract_canon_sha256":"804a755f71688fd782b5ed529e99d420027ea542824deef6248ade8dc6360be5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:55.704833Z","signature_b64":"xhWpS44X5yZqhiEylFfSRuzaK7haUHo/o+uflA+iRBrLwJYCne8XAMpAqLiVzxgo9aTAifTAg+JqUGg+zQzPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c2adf8400a78812e85f26aeb85a58955dae8e1d3ffcac969b9ba51bbc1ea82","last_reissued_at":"2026-07-05T12:05:55.704139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:55.704139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.GR"],"primary_cat":"cs.DS","authors_text":"Joshua A. Grochow, Michael Levet","submitted_at":"2021-12-21T19:05:40Z","abstract_excerpt":"In this paper, we show that the constant-dimensional Weisfeiler-Leman algorithm for groups (Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity upper bounds on isomorphism testing for several families of groups. In particular, we show:\n  - Groups with an Abelian normal Hall subgroup whose complement is $O(1)$-generated are identified by constant-dimensional Weisfeiler-Leman using only a constant number of rounds. This places isomorphism testing for this family of groups into $\\textsf{L}$; the previous upper bound for isomorphism testing was $\\textsf{P}$ (Qia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11487","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.11487/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.11487","created_at":"2026-07-05T12:05:55.704215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.11487v7","created_at":"2026-07-05T12:05:55.704215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11487","created_at":"2026-07-05T12:05:55.704215+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDBK36CABJ4I","created_at":"2026-07-05T12:05:55.704215+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDBK36CABJ4ICLUF","created_at":"2026-07-05T12:05:55.704215+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDBK36CA","created_at":"2026-07-05T12:05:55.704215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19777","citing_title":"On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF","json":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF.json","graph_json":"https://pith.science/api/pith-number/JDBK36CABJ4ICLUF6JVOXBNFRF/graph.json","events_json":"https://pith.science/api/pith-number/JDBK36CABJ4ICLUF6JVOXBNFRF/events.json","paper":"https://pith.science/paper/JDBK36CA"},"agent_actions":{"view_html":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF","download_json":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF.json","view_paper":"https://pith.science/paper/JDBK36CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.11487&json=true","fetch_graph":"https://pith.science/api/pith-number/JDBK36CABJ4ICLUF6JVOXBNFRF/graph.json","fetch_events":"https://pith.science/api/pith-number/JDBK36CABJ4ICLUF6JVOXBNFRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF/action/storage_attestation","attest_author":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF/action/author_attestation","sign_citation":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF/action/citation_signature","submit_replication":"https://pith.science/pith/JDBK36CABJ4ICLUF6JVOXBNFRF/action/replication_record"}},"created_at":"2026-07-05T12:05:55.704215+00:00","updated_at":"2026-07-05T12:05:55.704215+00:00"}