{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SGVZ5HMTS4WROZESOFWKUZPB4C","short_pith_number":"pith:SGVZ5HMT","schema_version":"1.0","canonical_sha256":"91ab9e9d93972d176492716caa65e1e0a6a2909a6a828257ab5a686373093ed8","source":{"kind":"arxiv","id":"1111.1458","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.1458","created_at":"2026-05-18T04:09:26.103294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1458v1","created_at":"2026-05-18T04:09:26.103294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1458","created_at":"2026-05-18T04:09:26.103294+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGVZ5HMTS4WR","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGVZ5HMTS4WROZES","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGVZ5HMT","created_at":"2026-05-18T12:26:41.206345+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/SGVZ5HMTS4WROZESOFWKUZPB4C","json":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C.json","graph_json":"https://pith.science/api/pith-number/SGVZ5HMTS4WROZESOFWKUZPB4C/graph.json","events_json":"https://pith.science/api/pith-number/SGVZ5HMTS4WROZESOFWKUZPB4C/events.json","paper":"https://pith.science/paper/SGVZ5HMT"},"agent_actions":{"view_html":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C","download_json":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C.json","view_paper":"https://pith.science/paper/SGVZ5HMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1458&json=true","fetch_graph":"https://pith.science/api/pith-number/SGVZ5HMTS4WROZESOFWKUZPB4C/graph.json","fetch_events":"https://pith.science/api/pith-number/SGVZ5HMTS4WROZESOFWKUZPB4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/action/storage_attestation","attest_author":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/action/author_attestation","sign_citation":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/action/citation_signature","submit_replication":"https://pith.science/pith/SGVZ5HMTS4WROZESOFWKUZPB4C/action/replication_record"}},"created_at":"2026-05-18T04:09:26.103294+00:00","updated_at":"2026-05-18T04:09:26.103294+00:00"}