{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R2SDLC5TAMZRFNUWJLYAQRT5L2","short_pith_number":"pith:R2SDLC5T","schema_version":"1.0","canonical_sha256":"8ea4358bb3033312b6964af008467d5eb9a93b88018626970eb8b5d187631abb","source":{"kind":"arxiv","id":"1706.01092","version":2},"attestation_state":"computed","paper":{"title":"Low-complexity computations for nilpotent subgroup problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexei Miasnikov, Denis Ovchinnikov, Jeremy Macdonald","submitted_at":"2017-06-04T15:21:57Z","abstract_excerpt":"We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and isolator of a subgroup, coset intersection, and computing the torsion subgroup. Additionally, if any input words are provided in compressed form as straight-line programs or in Mal'cev coordinates the algorithms run in quartic time."},"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":"1706.01092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-06-04T15:21:57Z","cross_cats_sorted":[],"title_canon_sha256":"ed4ac54d57599ef15fd3f0568863118e013271461fae1c8a9f983a65315405b9","abstract_canon_sha256":"d1a32c5dd65ca3e7477cd1cbaedd09d2445b36cf237abad06033f9e7fb5f31b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:57.429875Z","signature_b64":"NWy90VvKPatT3Mn9fDxII/13JO6QC5YHWu6o+11RX03KNCjpt4qweubHpvzpBCm2uZGUnS/4dJLU5iBG6LzLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea4358bb3033312b6964af008467d5eb9a93b88018626970eb8b5d187631abb","last_reissued_at":"2026-05-18T00:40:57.429238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:57.429238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity computations for nilpotent subgroup problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexei Miasnikov, Denis Ovchinnikov, Jeremy Macdonald","submitted_at":"2017-06-04T15:21:57Z","abstract_excerpt":"We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and rank: subgroup conjugacy, computing the normalizer and isolator of a subgroup, coset intersection, and computing the torsion subgroup. Additionally, if any input words are provided in compressed form as straight-line programs or in Mal'cev coordinates the algorithms run in quartic time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01092","kind":"arxiv","version":2},"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":"1706.01092","created_at":"2026-05-18T00:40:57.429368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01092v2","created_at":"2026-05-18T00:40:57.429368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01092","created_at":"2026-05-18T00:40:57.429368+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2SDLC5TAMZR","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2SDLC5TAMZRFNUW","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2SDLC5T","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2","json":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2.json","graph_json":"https://pith.science/api/pith-number/R2SDLC5TAMZRFNUWJLYAQRT5L2/graph.json","events_json":"https://pith.science/api/pith-number/R2SDLC5TAMZRFNUWJLYAQRT5L2/events.json","paper":"https://pith.science/paper/R2SDLC5T"},"agent_actions":{"view_html":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2","download_json":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2.json","view_paper":"https://pith.science/paper/R2SDLC5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01092&json=true","fetch_graph":"https://pith.science/api/pith-number/R2SDLC5TAMZRFNUWJLYAQRT5L2/graph.json","fetch_events":"https://pith.science/api/pith-number/R2SDLC5TAMZRFNUWJLYAQRT5L2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2/action/storage_attestation","attest_author":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2/action/author_attestation","sign_citation":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2/action/citation_signature","submit_replication":"https://pith.science/pith/R2SDLC5TAMZRFNUWJLYAQRT5L2/action/replication_record"}},"created_at":"2026-05-18T00:40:57.429368+00:00","updated_at":"2026-05-18T00:40:57.429368+00:00"}