{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BYJPWPBVIHPTJAPP3PG6MNUYOD","short_pith_number":"pith:BYJPWPBV","canonical_record":{"source":{"id":"1201.3174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-16T08:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"316d5b07a25ccd1c650c063605efd767d97e0286afc61ae42afaf2514b2da99e","abstract_canon_sha256":"30804e2bd4a16b9a65adbd3162d6cdb8f2fdacb0a59a4430678ca29d972eba2d"},"schema_version":"1.0"},"canonical_sha256":"0e12fb3c3541df3481efdbcde6369870c219adce30be3d03ffcc1ea387f2a363","source":{"kind":"arxiv","id":"1201.3174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3174","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3174v1","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3174","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"BYJPWPBVIHPT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYJPWPBVIHPTJAPP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYJPWPBV","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BYJPWPBVIHPTJAPP3PG6MNUYOD","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-16T08:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"316d5b07a25ccd1c650c063605efd767d97e0286afc61ae42afaf2514b2da99e","abstract_canon_sha256":"30804e2bd4a16b9a65adbd3162d6cdb8f2fdacb0a59a4430678ca29d972eba2d"},"schema_version":"1.0"},"canonical_sha256":"0e12fb3c3541df3481efdbcde6369870c219adce30be3d03ffcc1ea387f2a363","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:32.003625Z","signature_b64":"RBHi+hIoCB6juGcENoDmS8p1DC2qoH5gvg4FyXsU4eXr/TdKMasLd0XO0ewyn+9rZa9j68H6sGg/9kB8Bvs2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e12fb3c3541df3481efdbcde6369870c219adce30be3d03ffcc1ea387f2a363","last_reissued_at":"2026-05-18T04:04:32.003046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:32.003046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3174","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:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKj04ZN3IsJ+jXlfd8dapmj75QdZHSHuiEiv7Cf4mB3nH/bMyhg/JoEE/oRXVxp1TEAdD2P2hipiN6/+rt6WBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:43:51.140178Z"},"content_sha256":"9f07bd70bd7bc11f1d374604ba1e8ab6794df50337ad3cd92a78311cd8535e8a","schema_version":"1.0","event_id":"sha256:9f07bd70bd7bc11f1d374604ba1e8ab6794df50337ad3cd92a78311cd8535e8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BYJPWPBVIHPTJAPP3PG6MNUYOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logspace Computations in Coxeter Groups and Graph Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Jonathan Kausch, Markus Lohrey, Volker Diekert","submitted_at":"2012-01-16T08:29:09Z","abstract_excerpt":"Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the complexity of computing normal forms for important classes of groups.\n  For Coxeter groups we show that the following algorithmic tasks can be solved by a deterministic Turing machine using logarithmic work space, only: 1. Compute the length of any geodesic normal form. 2. Compute the set of letters occurring in any geodesic normal form. 3. Compute the Parikh-i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3174","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:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"js7DxCuPeyKKYarPrRR/pefTKhSfO6CC81jVeBZTnAQQEnbRRKdw2h0Vpoo1TBMe9DmZbyCU+3JaTU6R9H1oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:43:51.140536Z"},"content_sha256":"500bb501268c5492e87e421b40644082bf37405eb31fec5a48902a825e1545fb","schema_version":"1.0","event_id":"sha256:500bb501268c5492e87e421b40644082bf37405eb31fec5a48902a825e1545fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/bundle.json","state_url":"https://pith.science/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/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-01T18:43:51Z","links":{"resolver":"https://pith.science/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD","bundle":"https://pith.science/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/bundle.json","state":"https://pith.science/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYJPWPBVIHPTJAPP3PG6MNUYOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BYJPWPBVIHPTJAPP3PG6MNUYOD","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":"30804e2bd4a16b9a65adbd3162d6cdb8f2fdacb0a59a4430678ca29d972eba2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-16T08:29:09Z","title_canon_sha256":"316d5b07a25ccd1c650c063605efd767d97e0286afc61ae42afaf2514b2da99e"},"schema_version":"1.0","source":{"id":"1201.3174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3174","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3174v1","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3174","created_at":"2026-05-18T04:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"BYJPWPBVIHPT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BYJPWPBVIHPTJAPP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BYJPWPBV","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:500bb501268c5492e87e421b40644082bf37405eb31fec5a48902a825e1545fb","target":"graph","created_at":"2026-05-18T04:04:32Z","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":"Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the complexity of computing normal forms for important classes of groups.\n  For Coxeter groups we show that the following algorithmic tasks can be solved by a deterministic Turing machine using logarithmic work space, only: 1. Compute the length of any geodesic normal form. 2. Compute the set of letters occurring in any geodesic normal form. 3. Compute the Parikh-i","authors_text":"Jonathan Kausch, Markus Lohrey, Volker Diekert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-16T08:29:09Z","title":"Logspace Computations in Coxeter Groups and Graph Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3174","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:9f07bd70bd7bc11f1d374604ba1e8ab6794df50337ad3cd92a78311cd8535e8a","target":"record","created_at":"2026-05-18T04:04:32Z","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":"30804e2bd4a16b9a65adbd3162d6cdb8f2fdacb0a59a4430678ca29d972eba2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-16T08:29:09Z","title_canon_sha256":"316d5b07a25ccd1c650c063605efd767d97e0286afc61ae42afaf2514b2da99e"},"schema_version":"1.0","source":{"id":"1201.3174","kind":"arxiv","version":1}},"canonical_sha256":"0e12fb3c3541df3481efdbcde6369870c219adce30be3d03ffcc1ea387f2a363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e12fb3c3541df3481efdbcde6369870c219adce30be3d03ffcc1ea387f2a363","first_computed_at":"2026-05-18T04:04:32.003046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:32.003046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBHi+hIoCB6juGcENoDmS8p1DC2qoH5gvg4FyXsU4eXr/TdKMasLd0XO0ewyn+9rZa9j68H6sGg/9kB8Bvs2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:32.003625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f07bd70bd7bc11f1d374604ba1e8ab6794df50337ad3cd92a78311cd8535e8a","sha256:500bb501268c5492e87e421b40644082bf37405eb31fec5a48902a825e1545fb"],"state_sha256":"eff52c07f4b51b3b8835d7592e8af10de037b6fb7ef792822ccc20767e7c2e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uknbUYkFvyi3FsEjKxVT4dGowNtWE7PvD7rkXjB/HINfMXuBcrydRZ1FYQ+fs311MZSMvVI48THDuhbZEXRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:43:51.142468Z","bundle_sha256":"61509b9d9bba2e35ecfd39ad84e993debbe072a4ea1e65845db9570989952d87"}}