{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ODJAZ6WLLJ4JIU47JLET2LU7XN","short_pith_number":"pith:ODJAZ6WL","schema_version":"1.0","canonical_sha256":"70d20cfacb5a7894539f4ac93d2e9fbb7a3dfb60db983a35e7dfd6a9efdd9616","source":{"kind":"arxiv","id":"1511.00151","version":1},"attestation_state":"computed","paper":{"title":"Group Isomorphism with Fixed Subnormal Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.CC","authors_text":"Eugene M. Luks","submitted_at":"2015-10-31T17:06:21Z","abstract_excerpt":"In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\\frac{1}{2}\\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely due to an $n^{O(p)}$ cost of testing for isomorphisms that match fixed composition series in the two groups. We focus here on the fixed-composition-series subproblem and exhibit a polynomial-time algorithm that is valid for general groups. A subsequent paper will construct canonical forms within the same time bound."},"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":"1511.00151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-31T17:06:21Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"5f120efd4a78c2ba4dcbd740c99ac7acc5810672ba1817c5f21e94924f227487","abstract_canon_sha256":"870211cd88cbf3adff531930e88c27fe885d2ee3d3039e1142000edbc27f41a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:13.128448Z","signature_b64":"0oETeIEosjnBSSrpbJeOF54XI9ilNfDMDR/yhmzJFGZgkpWWlD1LFWW5Yvlq7E+ULMDcN9tLN0aqbmzMDrTXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d20cfacb5a7894539f4ac93d2e9fbb7a3dfb60db983a35e7dfd6a9efdd9616","last_reissued_at":"2026-05-18T01:28:13.127772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:13.127772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Isomorphism with Fixed Subnormal Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.CC","authors_text":"Eugene M. Luks","submitted_at":"2015-10-31T17:06:21Z","abstract_excerpt":"In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\\frac{1}{2}\\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely due to an $n^{O(p)}$ cost of testing for isomorphisms that match fixed composition series in the two groups. We focus here on the fixed-composition-series subproblem and exhibit a polynomial-time algorithm that is valid for general groups. A subsequent paper will construct canonical forms within the same time bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00151","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.00151","created_at":"2026-05-18T01:28:13.127853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00151v1","created_at":"2026-05-18T01:28:13.127853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00151","created_at":"2026-05-18T01:28:13.127853+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODJAZ6WLLJ4J","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODJAZ6WLLJ4JIU47","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODJAZ6WL","created_at":"2026-05-18T12:29:34.919912+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":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN","json":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN.json","graph_json":"https://pith.science/api/pith-number/ODJAZ6WLLJ4JIU47JLET2LU7XN/graph.json","events_json":"https://pith.science/api/pith-number/ODJAZ6WLLJ4JIU47JLET2LU7XN/events.json","paper":"https://pith.science/paper/ODJAZ6WL"},"agent_actions":{"view_html":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN","download_json":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN.json","view_paper":"https://pith.science/paper/ODJAZ6WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00151&json=true","fetch_graph":"https://pith.science/api/pith-number/ODJAZ6WLLJ4JIU47JLET2LU7XN/graph.json","fetch_events":"https://pith.science/api/pith-number/ODJAZ6WLLJ4JIU47JLET2LU7XN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN/action/storage_attestation","attest_author":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN/action/author_attestation","sign_citation":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN/action/citation_signature","submit_replication":"https://pith.science/pith/ODJAZ6WLLJ4JIU47JLET2LU7XN/action/replication_record"}},"created_at":"2026-05-18T01:28:13.127853+00:00","updated_at":"2026-05-18T01:28:13.127853+00:00"}