{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5JJQEUYT3W6RMQQFZOGGIX3EV2","short_pith_number":"pith:5JJQEUYT","canonical_record":{"source":{"id":"1611.09541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-29T09:52:40Z","cross_cats_sorted":["cs.CC","math.GR"],"title_canon_sha256":"f38305289925d3bfd10ca728e64bba7ddd2065e13400747e4ad6258ee2b2de41","abstract_canon_sha256":"2dc005f57a7096d3568f12aa09769507f61c9c727b7b57c81f319470548243e7"},"schema_version":"1.0"},"canonical_sha256":"ea53025313ddbd164205cb8c645f64aea6704d35bfe6e6a14e0a3e9e4a48eb9e","source":{"kind":"arxiv","id":"1611.09541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09541","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09541v2","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09541","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"5JJQEUYT3W6R","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5JJQEUYT3W6RMQQF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5JJQEUYT","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5JJQEUYT3W6RMQQFZOGGIX3EV2","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-29T09:52:40Z","cross_cats_sorted":["cs.CC","math.GR"],"title_canon_sha256":"f38305289925d3bfd10ca728e64bba7ddd2065e13400747e4ad6258ee2b2de41","abstract_canon_sha256":"2dc005f57a7096d3568f12aa09769507f61c9c727b7b57c81f319470548243e7"},"schema_version":"1.0"},"canonical_sha256":"ea53025313ddbd164205cb8c645f64aea6704d35bfe6e6a14e0a3e9e4a48eb9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:20.935892Z","signature_b64":"wr+Wu62R/xvK+K87haw5rFlqA4GPGIXiM364yM1qtp3XjjjluwMQIdfRNT9P73kOu2S92q4HSyCLmxXSeVWQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea53025313ddbd164205cb8c645f64aea6704d35bfe6e6a14e0a3e9e4a48eb9e","last_reissued_at":"2026-05-18T00:41:20.935121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:20.935121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09541","source_version":2,"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-18T00:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB2kEcyApzfKqkOwtIuPFjRw/uKgc/c+G/aFuN+EzGqZ8TVgzQy1BHHArd3eOPUKv1a9WoNIW8tuVcBQeVJdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:31:17.006374Z"},"content_sha256":"67dc200612488aaf721d43b77741cb73329b87fc1761100ad7694e2fecf59bb7","schema_version":"1.0","event_id":"sha256:67dc200612488aaf721d43b77741cb73329b87fc1761100ad7694e2fecf59bb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5JJQEUYT3W6RMQQFZOGGIX3EV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.GR"],"primary_cat":"cs.FL","authors_text":"Daniele D'Angeli, Emanuele Rodaro, Jan Philipp W\\\"achter","submitted_at":"2016-11-29T09:52:40Z","abstract_excerpt":"In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSPACE-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSPACE-complete. Additionally, we provide simpler constructions for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09541","kind":"arxiv","version":2},"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-18T00:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnfb2ZiWckJKBbNuzbIgTLA8d9kYXYXen/5BIIm9BdMzRlk643FUwKZt6Ctb6Wj8wiD1Xkvv5yey4Cec36noCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:31:17.006728Z"},"content_sha256":"2acab9babc36ba9b93728e315e0586f84bf99cdc7977da562338273e31eda16f","schema_version":"1.0","event_id":"sha256:2acab9babc36ba9b93728e315e0586f84bf99cdc7977da562338273e31eda16f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/bundle.json","state_url":"https://pith.science/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/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-04T20:31:17Z","links":{"resolver":"https://pith.science/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2","bundle":"https://pith.science/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/bundle.json","state":"https://pith.science/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JJQEUYT3W6RMQQFZOGGIX3EV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5JJQEUYT3W6RMQQFZOGGIX3EV2","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":"2dc005f57a7096d3568f12aa09769507f61c9c727b7b57c81f319470548243e7","cross_cats_sorted":["cs.CC","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-29T09:52:40Z","title_canon_sha256":"f38305289925d3bfd10ca728e64bba7ddd2065e13400747e4ad6258ee2b2de41"},"schema_version":"1.0","source":{"id":"1611.09541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09541","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09541v2","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09541","created_at":"2026-05-18T00:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"5JJQEUYT3W6R","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5JJQEUYT3W6RMQQF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5JJQEUYT","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2acab9babc36ba9b93728e315e0586f84bf99cdc7977da562338273e31eda16f","target":"graph","created_at":"2026-05-18T00:41:20Z","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":"In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSPACE-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSPACE-complete. Additionally, we provide simpler constructions for ","authors_text":"Daniele D'Angeli, Emanuele Rodaro, Jan Philipp W\\\"achter","cross_cats":["cs.CC","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-29T09:52:40Z","title":"On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09541","kind":"arxiv","version":2},"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:67dc200612488aaf721d43b77741cb73329b87fc1761100ad7694e2fecf59bb7","target":"record","created_at":"2026-05-18T00:41:20Z","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":"2dc005f57a7096d3568f12aa09769507f61c9c727b7b57c81f319470548243e7","cross_cats_sorted":["cs.CC","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-29T09:52:40Z","title_canon_sha256":"f38305289925d3bfd10ca728e64bba7ddd2065e13400747e4ad6258ee2b2de41"},"schema_version":"1.0","source":{"id":"1611.09541","kind":"arxiv","version":2}},"canonical_sha256":"ea53025313ddbd164205cb8c645f64aea6704d35bfe6e6a14e0a3e9e4a48eb9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea53025313ddbd164205cb8c645f64aea6704d35bfe6e6a14e0a3e9e4a48eb9e","first_computed_at":"2026-05-18T00:41:20.935121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:20.935121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wr+Wu62R/xvK+K87haw5rFlqA4GPGIXiM364yM1qtp3XjjjluwMQIdfRNT9P73kOu2S92q4HSyCLmxXSeVWQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:20.935892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67dc200612488aaf721d43b77741cb73329b87fc1761100ad7694e2fecf59bb7","sha256:2acab9babc36ba9b93728e315e0586f84bf99cdc7977da562338273e31eda16f"],"state_sha256":"134a1d250c6d97ad6b53d88777369c0444962ff5385d8cdbfe53655ea9c395ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgrBtS85OqkPa2FjgCmICbr/J8pPx9ICsxRu6irg3hoMozzrPnHCw/iCArE6Ok1UJFMOuD0UtswEjEZVthqFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:31:17.008733Z","bundle_sha256":"d7e0e010ae32d851857d8b6b3c2768751ef9bb6af0ef274b3111ad4b228bce60"}}