{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HS4NJUGBM4GTDYIJGSCGOURLCV","short_pith_number":"pith:HS4NJUGB","canonical_record":{"source":{"id":"1302.3059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-02-13T12:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"986925c74e42d91eab528811108125fbdbd1fa3997b4019d01d90e226ca5214e","abstract_canon_sha256":"664f847d51ae5be1745b2f0cfb0ec7501d9641fa7eec26cfb9ff52286a3e08b6"},"schema_version":"1.0"},"canonical_sha256":"3cb8d4d0c1670d31e109348467522b15519020619802f5e475a1c6c9f2876960","source":{"kind":"arxiv","id":"1302.3059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3059","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3059v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3059","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"HS4NJUGBM4GT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HS4NJUGBM4GTDYIJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HS4NJUGB","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HS4NJUGBM4GTDYIJGSCGOURLCV","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-02-13T12:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"986925c74e42d91eab528811108125fbdbd1fa3997b4019d01d90e226ca5214e","abstract_canon_sha256":"664f847d51ae5be1745b2f0cfb0ec7501d9641fa7eec26cfb9ff52286a3e08b6"},"schema_version":"1.0"},"canonical_sha256":"3cb8d4d0c1670d31e109348467522b15519020619802f5e475a1c6c9f2876960","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.879863Z","signature_b64":"ieIqvgnlQUncL6kHw6QmhLLy2mBBc8V8rZ34ACpGGGI2KFJKBzHGFLs9Pmvgu1NyEXcQzX7xwdBVkzFuISB5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb8d4d0c1670d31e109348467522b15519020619802f5e475a1c6c9f2876960","last_reissued_at":"2026-05-18T03:33:48.878943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.878943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpDlYJ+YKczFh8q+qyNeDgfv07HFOjoF3tN9nCFcPf/IvrZDp//TlfxJCNCW+R3WQDdWI+aB0PRNdywRxjKCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:30:59.219950Z"},"content_sha256":"446e139fd1fd5ce8023c355fcd9e18f7d225947f29116302e2660d14bf69a939","schema_version":"1.0","event_id":"sha256:446e139fd1fd5ce8023c355fcd9e18f7d225947f29116302e2660d14bf69a939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HS4NJUGBM4GTDYIJGSCGOURLCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steinberg presentations of black box classical groups in small characteristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexandre Borovik, Sukru Yalcinkaya","submitted_at":"2013-02-13T12:04:21Z","abstract_excerpt":"The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search and therefore the running time of these algorithms is polynomial in the underlying field size $q$ which makes them unfeasible for most practical applications \\cite{guralnick01.169}. Meanwhile, the input size of recognition algorithms involves only $\\log q$. The present paper introduces a new approach to construction of unipotent elements in which the running "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3059","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+BduC2qX28jqoPsdUg8phf0QUCzMNqTqauLaFre6t5wc+GF924ALS0G26dE+lZQ39kueTSgHISWTcr8SAimCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:30:59.220344Z"},"content_sha256":"8fc442d4fe466cef242828b8f86bf15286e6e1852db9c2cac8668254d5cc0cad","schema_version":"1.0","event_id":"sha256:8fc442d4fe466cef242828b8f86bf15286e6e1852db9c2cac8668254d5cc0cad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/bundle.json","state_url":"https://pith.science/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T21:30:59Z","links":{"resolver":"https://pith.science/pith/HS4NJUGBM4GTDYIJGSCGOURLCV","bundle":"https://pith.science/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/bundle.json","state":"https://pith.science/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HS4NJUGBM4GTDYIJGSCGOURLCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HS4NJUGBM4GTDYIJGSCGOURLCV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"664f847d51ae5be1745b2f0cfb0ec7501d9641fa7eec26cfb9ff52286a3e08b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-02-13T12:04:21Z","title_canon_sha256":"986925c74e42d91eab528811108125fbdbd1fa3997b4019d01d90e226ca5214e"},"schema_version":"1.0","source":{"id":"1302.3059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3059","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3059v1","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3059","created_at":"2026-05-18T03:33:48Z"},{"alias_kind":"pith_short_12","alias_value":"HS4NJUGBM4GT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HS4NJUGBM4GTDYIJ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HS4NJUGB","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:8fc442d4fe466cef242828b8f86bf15286e6e1852db9c2cac8668254d5cc0cad","target":"graph","created_at":"2026-05-18T03:33:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search and therefore the running time of these algorithms is polynomial in the underlying field size $q$ which makes them unfeasible for most practical applications \\cite{guralnick01.169}. Meanwhile, the input size of recognition algorithms involves only $\\log q$. The present paper introduces a new approach to construction of unipotent elements in which the running ","authors_text":"Alexandre Borovik, Sukru Yalcinkaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-02-13T12:04:21Z","title":"Steinberg presentations of black box classical groups in small characteristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3059","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:446e139fd1fd5ce8023c355fcd9e18f7d225947f29116302e2660d14bf69a939","target":"record","created_at":"2026-05-18T03:33:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"664f847d51ae5be1745b2f0cfb0ec7501d9641fa7eec26cfb9ff52286a3e08b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-02-13T12:04:21Z","title_canon_sha256":"986925c74e42d91eab528811108125fbdbd1fa3997b4019d01d90e226ca5214e"},"schema_version":"1.0","source":{"id":"1302.3059","kind":"arxiv","version":1}},"canonical_sha256":"3cb8d4d0c1670d31e109348467522b15519020619802f5e475a1c6c9f2876960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cb8d4d0c1670d31e109348467522b15519020619802f5e475a1c6c9f2876960","first_computed_at":"2026-05-18T03:33:48.878943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:48.878943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ieIqvgnlQUncL6kHw6QmhLLy2mBBc8V8rZ34ACpGGGI2KFJKBzHGFLs9Pmvgu1NyEXcQzX7xwdBVkzFuISB5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:48.879863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:446e139fd1fd5ce8023c355fcd9e18f7d225947f29116302e2660d14bf69a939","sha256:8fc442d4fe466cef242828b8f86bf15286e6e1852db9c2cac8668254d5cc0cad"],"state_sha256":"3f567d6f08cca955e0fb904ba4be749f80465470cbc0bec4c2ceeea8036fa70a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZciVbTea0HNEQ0W4d6x43y9alnKevDbiGzgaSUkEfqFRnDduhAkKKE1ATiDsS3rkY+PqN+SYTBNQ7D0BdMRuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:30:59.222266Z","bundle_sha256":"d55abfe290d40851bf9ec0a41979eecb09971ab406fe21622c77498c6f5f01cd"}}