{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SGVZ5HMTS4WROZESOFWKUZPB4C","short_pith_number":"pith:SGVZ5HMT","canonical_record":{"source":{"id":"1111.1458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-11-06T22:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"662f504a8865c390cb98592b9340355960a408619e37746438425630a02df012","abstract_canon_sha256":"33ae2074d3c8ae46e97b7b289cfd9d5c7be6d073b8f7d6d3919ffbbdc763d8d0"},"schema_version":"1.0"},"canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","source":{"kind":"arxiv","id":"1111.1458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1458","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1458v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1458","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"SGVZ5HMTS4WR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SGVZ5HMTS4WROZES","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SGVZ5HMT","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SGVZ5HMTS4WROZESOFWKUZPB4C","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-11-06T22:43:10Z","cross_cats_sorted":[],"title_canon_sha256":"662f504a8865c390cb98592b9340355960a408619e37746438425630a02df012","abstract_canon_sha256":"33ae2074d3c8ae46e97b7b289cfd9d5c7be6d073b8f7d6d3919ffbbdc763d8d0"},"schema_version":"1.0"},"canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.103824Z","signature_b64":"5iXB6EZ88kexzhcpHMb1SFjwzyjwsgKQQHPP90nt/K1yQehcAHkV2l/20pMP89wAGKfWYivPAsig+TU7jFGUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","last_reissued_at":"2026-05-18T04:09:26.103227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.103227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1458","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-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FE8UXU/pnbaCKu8iRrV9gYGRv3xny7HLNWy1YZvqMrZ2vEXM3vnyq7Ovizncj9NpQkS7NoJDx4s8coniLVIbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:09:28.209073Z"},"content_sha256":"361cdfd3619d54d1e757cdf2da69d78e9096f0ffeb9a9023a1a6a3755504cf52","schema_version":"1.0","event_id":"sha256:361cdfd3619d54d1e757cdf2da69d78e9096f0ffeb9a9023a1a6a3755504cf52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SGVZ5HMTS4WROZESOFWKUZPB4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space functions and complexity of the word problem in semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Olshanskii","submitted_at":"2011-11-06T22:43:10Z","abstract_excerpt":"We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations $w=w_0\\to...\\to w_t= w'$; $s(n)$ bounds from above the tape space (or computer memory) sufficient to implement all such transitions $w\\to...\\to w'.$ One of the results obtained is the following criterion: A finitely generated semigroup $S$ has decidable word problem of polynomial space complexity if and only if $S$ is a subsemigroup of a finitely presented semigr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1458","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-18T04:09:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taabtKxcTb5Rr/BCnEF6yLe7L7oXpUHFluraFCeDIE2thrZX8N99WsdAS5HF6fbSZNuNF3qXHuvpK2tX9euECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:09:28.209451Z"},"content_sha256":"14183ebb4ac922063b6190067e246e38eacc54b3aa42ad23eacf6c4b0008766c","schema_version":"1.0","event_id":"sha256:14183ebb4ac922063b6190067e246e38eacc54b3aa42ad23eacf6c4b0008766c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/bundle.json","state_url":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/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-26T08:09:28Z","links":{"resolver":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C","bundle":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/bundle.json","state":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SGVZ5HMTS4WROZESOFWKUZPB4C","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":"33ae2074d3c8ae46e97b7b289cfd9d5c7be6d073b8f7d6d3919ffbbdc763d8d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-11-06T22:43:10Z","title_canon_sha256":"662f504a8865c390cb98592b9340355960a408619e37746438425630a02df012"},"schema_version":"1.0","source":{"id":"1111.1458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1458","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1458v1","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1458","created_at":"2026-05-18T04:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"SGVZ5HMTS4WR","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SGVZ5HMTS4WROZES","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SGVZ5HMT","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:14183ebb4ac922063b6190067e246e38eacc54b3aa42ad23eacf6c4b0008766c","target":"graph","created_at":"2026-05-18T04:09:26Z","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":"We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations $w=w_0\\to...\\to w_t= w'$; $s(n)$ bounds from above the tape space (or computer memory) sufficient to implement all such transitions $w\\to...\\to w'.$ One of the results obtained is the following criterion: A finitely generated semigroup $S$ has decidable word problem of polynomial space complexity if and only if $S$ is a subsemigroup of a finitely presented semigr","authors_text":"Alexander Olshanskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-11-06T22:43:10Z","title":"Space functions and complexity of the word problem in semigroups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1458","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:361cdfd3619d54d1e757cdf2da69d78e9096f0ffeb9a9023a1a6a3755504cf52","target":"record","created_at":"2026-05-18T04:09:26Z","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":"33ae2074d3c8ae46e97b7b289cfd9d5c7be6d073b8f7d6d3919ffbbdc763d8d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-11-06T22:43:10Z","title_canon_sha256":"662f504a8865c390cb98592b9340355960a408619e37746438425630a02df012"},"schema_version":"1.0","source":{"id":"1111.1458","kind":"arxiv","version":1}},"canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","first_computed_at":"2026-05-18T04:09:26.103227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:26.103227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5iXB6EZ88kexzhcpHMb1SFjwzyjwsgKQQHPP90nt/K1yQehcAHkV2l/20pMP89wAGKfWYivPAsig+TU7jFGUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:26.103824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:361cdfd3619d54d1e757cdf2da69d78e9096f0ffeb9a9023a1a6a3755504cf52","sha256:14183ebb4ac922063b6190067e246e38eacc54b3aa42ad23eacf6c4b0008766c"],"state_sha256":"37d7df5f8d049a445804f8b1e03973e7585274eb9834b1a41813716e669ba7b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5Cy8Ned5hTySssl/soOfHR1ZtNN5OBrmRWu+hWRrGVdvRSevetOs99MBlIX3YR7KGJn7Y/uUcT1136v8SnlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:09:28.211449Z","bundle_sha256":"ef6dcf4cae5d8305e6627c2a032b9fe8223978b2d163819e6c9968083c45d7e8"}}