{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:XT7TNVFF7LLVQRE6C3O2CO3XJ2","short_pith_number":"pith:XT7TNVFF","schema_version":"1.0","canonical_sha256":"bcff36d4a5fad758449e16dda13b774eb2ae53406466e310f2990eac90ca746e","source":{"kind":"arxiv","id":"math/9809154","version":1},"attestation_state":"computed","paper":{"title":"On Complexity of the Word Problem in Braid Groups and Mapping Class Groups","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hessam Hamidi-Tehrani","submitted_at":"1998-09-28T01:31:17Z","abstract_excerpt":"We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w|^2 g^2). We also carry out the same methods for the braid groups, and show that this gives a bound which improves the best known bound in this case; namely, the complexity of the word problem in the n-braid group is O(|w|^2 n), for |w| > log n.\n We state a similar result for mapping class groups of surfaces with several "},"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":"math/9809154","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"1998-09-28T01:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"53e82825e8f846178520f18d41612a0d677dcd8568e312a256db0c3f33edfa88","abstract_canon_sha256":"1ce71fc8e96a06d4f3125d2fe85a12b3500632523de5f9ba1817e4fb0e08d68c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:33.769819Z","signature_b64":"fpLirXIfVv/WJL4hY2kt1b+TO18uzWXGZKSeoQ9an0+wibgtKspP2nBkVU/OkG990JjM1YR4TOxuK2bhixrGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcff36d4a5fad758449e16dda13b774eb2ae53406466e310f2990eac90ca746e","last_reissued_at":"2026-05-18T01:05:33.768992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:33.768992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Complexity of the Word Problem in Braid Groups and Mapping Class Groups","license":"","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hessam Hamidi-Tehrani","submitted_at":"1998-09-28T01:31:17Z","abstract_excerpt":"We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in the case of the closed surface is O(|w|^2 g^2). We also carry out the same methods for the braid groups, and show that this gives a bound which improves the best known bound in this case; namely, the complexity of the word problem in the n-braid group is O(|w|^2 n), for |w| > log n.\n We state a similar result for mapping class groups of surfaces with several "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9809154","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":"math/9809154","created_at":"2026-05-18T01:05:33.769113+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9809154v1","created_at":"2026-05-18T01:05:33.769113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9809154","created_at":"2026-05-18T01:05:33.769113+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT7TNVFF7LLV","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT7TNVFF7LLVQRE6","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT7TNVFF","created_at":"2026-05-18T12:25:49.038998+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/XT7TNVFF7LLVQRE6C3O2CO3XJ2","json":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2.json","graph_json":"https://pith.science/api/pith-number/XT7TNVFF7LLVQRE6C3O2CO3XJ2/graph.json","events_json":"https://pith.science/api/pith-number/XT7TNVFF7LLVQRE6C3O2CO3XJ2/events.json","paper":"https://pith.science/paper/XT7TNVFF"},"agent_actions":{"view_html":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2","download_json":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2.json","view_paper":"https://pith.science/paper/XT7TNVFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9809154&json=true","fetch_graph":"https://pith.science/api/pith-number/XT7TNVFF7LLVQRE6C3O2CO3XJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/XT7TNVFF7LLVQRE6C3O2CO3XJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2/action/storage_attestation","attest_author":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2/action/author_attestation","sign_citation":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2/action/citation_signature","submit_replication":"https://pith.science/pith/XT7TNVFF7LLVQRE6C3O2CO3XJ2/action/replication_record"}},"created_at":"2026-05-18T01:05:33.769113+00:00","updated_at":"2026-05-18T01:05:33.769113+00:00"}