{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DLPFZ7E7ANRUT3L4WIWS44PNSR","short_pith_number":"pith:DLPFZ7E7","canonical_record":{"source":{"id":"1303.6704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-26T23:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"254dcecb3e9e45d8e2f59b92a606b95db4699230daea9dc267eb8fac3e0b5134","abstract_canon_sha256":"8f03b50791cb7dd9f46ee293f388cb6372f9a810de6027e49664a636aef03620"},"schema_version":"1.0"},"canonical_sha256":"1ade5cfc9f036349ed7cb22d2e71ed9453a473b6d591a351d24f7b7804248f9d","source":{"kind":"arxiv","id":"1303.6704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6704","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6704v2","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6704","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"DLPFZ7E7ANRU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DLPFZ7E7ANRUT3L4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DLPFZ7E7","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DLPFZ7E7ANRUT3L4WIWS44PNSR","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-26T23:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"254dcecb3e9e45d8e2f59b92a606b95db4699230daea9dc267eb8fac3e0b5134","abstract_canon_sha256":"8f03b50791cb7dd9f46ee293f388cb6372f9a810de6027e49664a636aef03620"},"schema_version":"1.0"},"canonical_sha256":"1ade5cfc9f036349ed7cb22d2e71ed9453a473b6d591a351d24f7b7804248f9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.425277Z","signature_b64":"n2aXGWQufHTdZMw5J5SdTUWFz8WvUzFRBjibUALMSdZsVO2DvwWiEDZILa+n0iZtESSMMn7qi6aPZV/s3uYVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ade5cfc9f036349ed7cb22d2e71ed9453a473b6d591a351d24f7b7804248f9d","last_reissued_at":"2026-05-18T03:26:33.424823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.424823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6704","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsX87Gi6iZz7Ej2FCL+8q1MRkUF57/JSkptULBdrRDGl3QxiqPjWjfsAPQFd92sAhBBk7sM6lEiPcBICkqLGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:24:26.843581Z"},"content_sha256":"a95d4702f9fe07c095ee5f0a44f097e928aae5c126a320260d4775943b9785ab","schema_version":"1.0","event_id":"sha256:a95d4702f9fe07c095ee5f0a44f097e928aae5c126a320260d4775943b9785ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DLPFZ7E7ANRUT3L4WIWS44PNSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Equivalence Problem for Finite Multitape Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"James Worrell","submitted_at":"2013-03-26T23:34:15Z","abstract_excerpt":"The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhum\\\"{a}ki in the early 1990s. Their proof of decidability yields a co_NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follows the basic strategy of Harju and Karhumaki but replaces their use of group theory with results on matrix algebras. From our proof we obtain a simple randomised algorithm for deciding language equiva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6704","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-18T03:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKk+oTp0bbQS+LxSAVEd/djI6QyPWmT/EodTGlhEMSpPF3Tk2mQz11cbYRpVzLQThAZDIbzyLfSVuH9l9NgOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:24:26.844228Z"},"content_sha256":"8595bc5d15a50f26f6cda1c08c06745155f25b1bcf0ab19989a1e27283e1234f","schema_version":"1.0","event_id":"sha256:8595bc5d15a50f26f6cda1c08c06745155f25b1bcf0ab19989a1e27283e1234f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/bundle.json","state_url":"https://pith.science/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/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-05-28T15:24:26Z","links":{"resolver":"https://pith.science/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR","bundle":"https://pith.science/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/bundle.json","state":"https://pith.science/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLPFZ7E7ANRUT3L4WIWS44PNSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DLPFZ7E7ANRUT3L4WIWS44PNSR","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":"8f03b50791cb7dd9f46ee293f388cb6372f9a810de6027e49664a636aef03620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-26T23:34:15Z","title_canon_sha256":"254dcecb3e9e45d8e2f59b92a606b95db4699230daea9dc267eb8fac3e0b5134"},"schema_version":"1.0","source":{"id":"1303.6704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6704","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6704v2","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6704","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"DLPFZ7E7ANRU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DLPFZ7E7ANRUT3L4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DLPFZ7E7","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8595bc5d15a50f26f6cda1c08c06745155f25b1bcf0ab19989a1e27283e1234f","target":"graph","created_at":"2026-05-18T03:26:33Z","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":"The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhum\\\"{a}ki in the early 1990s. Their proof of decidability yields a co_NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follows the basic strategy of Harju and Karhumaki but replaces their use of group theory with results on matrix algebras. From our proof we obtain a simple randomised algorithm for deciding language equiva","authors_text":"James Worrell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-26T23:34:15Z","title":"Revisiting the Equivalence Problem for Finite Multitape Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6704","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:a95d4702f9fe07c095ee5f0a44f097e928aae5c126a320260d4775943b9785ab","target":"record","created_at":"2026-05-18T03:26:33Z","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":"8f03b50791cb7dd9f46ee293f388cb6372f9a810de6027e49664a636aef03620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-26T23:34:15Z","title_canon_sha256":"254dcecb3e9e45d8e2f59b92a606b95db4699230daea9dc267eb8fac3e0b5134"},"schema_version":"1.0","source":{"id":"1303.6704","kind":"arxiv","version":2}},"canonical_sha256":"1ade5cfc9f036349ed7cb22d2e71ed9453a473b6d591a351d24f7b7804248f9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ade5cfc9f036349ed7cb22d2e71ed9453a473b6d591a351d24f7b7804248f9d","first_computed_at":"2026-05-18T03:26:33.424823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:33.424823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2aXGWQufHTdZMw5J5SdTUWFz8WvUzFRBjibUALMSdZsVO2DvwWiEDZILa+n0iZtESSMMn7qi6aPZV/s3uYVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:33.425277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a95d4702f9fe07c095ee5f0a44f097e928aae5c126a320260d4775943b9785ab","sha256:8595bc5d15a50f26f6cda1c08c06745155f25b1bcf0ab19989a1e27283e1234f"],"state_sha256":"8dd595b3acfdf0cfbf2af592b5dcc49f6ed7ac87188664c4cebe033ac6230c91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQxrhVpNAURYOvFigpCfjjtj6gNRwREiW8vO3bk87MqQacBHV+gwWFapj3unCit2mwCuMFHY+SUJzeMRU+LsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:24:26.846776Z","bundle_sha256":"91e186439c3f6f72b12a994452b0143681aeca447e50d0aab114ee9ff8aa5f12"}}