{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RXFTSKAEC6WD3NP2YOZEC4OJQ4","short_pith_number":"pith:RXFTSKAE","canonical_record":{"source":{"id":"1602.08565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-27T07:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"b1287f33f77f1f5cf4e619ccf8dbd73f82f16ec57d887480ec631eddb558b7ec","abstract_canon_sha256":"e7aaf24df30169d795206463780aae1a76aa23d69fadb029ca3bf981202b0688"},"schema_version":"1.0"},"canonical_sha256":"8dcb39280417ac3db5fac3b24171c987226cd3d6b64eb1f7115ab975a5e73a8d","source":{"kind":"arxiv","id":"1602.08565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08565","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08565v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08565","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"RXFTSKAEC6WD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXFTSKAEC6WD3NP2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXFTSKAE","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RXFTSKAEC6WD3NP2YOZEC4OJQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-27T07:57:22Z","cross_cats_sorted":[],"title_canon_sha256":"b1287f33f77f1f5cf4e619ccf8dbd73f82f16ec57d887480ec631eddb558b7ec","abstract_canon_sha256":"e7aaf24df30169d795206463780aae1a76aa23d69fadb029ca3bf981202b0688"},"schema_version":"1.0"},"canonical_sha256":"8dcb39280417ac3db5fac3b24171c987226cd3d6b64eb1f7115ab975a5e73a8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.491672Z","signature_b64":"fMWXv5Zndyf4GSiOMCB6bemrVbfSj28aIvXtO/+gNigGsTlB3sNwk7lILmxbAA17SHxKK0QMTw12p3gP+zvNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dcb39280417ac3db5fac3b24171c987226cd3d6b64eb1f7115ab975a5e73a8d","last_reissued_at":"2026-05-18T01:19:52.491043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.491043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08565","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KIOVgPpqZgDDGDkljxN7qXbBEbLn9I4v3O3qQPa3MBji3sLleXdweqBabXrxmeLxL090Uus11BxQBV/q6vLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:03:07.272119Z"},"content_sha256":"2a3121b8f6fe52db4049a4977c8f4b8746a23530fdc3ca0f68248f14123712e8","schema_version":"1.0","event_id":"sha256:2a3121b8f6fe52db4049a4977c8f4b8746a23530fdc3ca0f68248f14123712e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RXFTSKAEC6WD3NP2YOZEC4OJQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Equivalence and Uniformisation Problems for Finite Transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Christof L\\\"oding, Emmanuel Filiot, Isma\\\"el Jecker, Sarah Winter","submitted_at":"2016-02-27T07:57:22Z","abstract_excerpt":"Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper, we investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and show their decidability. We also investigate the classes of finite-valued rational transductions and deterministic rational transductions, which are known to have a decidable equivalence problem. We show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08565","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-18T01:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzvCcff7B+mqskeXGY44hH8ph/jC9vDojyom3QcBgFP1bOTEUIwNnLcfsMcraIY41I/LLDNckTk6sXycier/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:03:07.272819Z"},"content_sha256":"dc779b64ce5c9b0fc5e30cd12b6948bf0a36d37191a4d23755d3bd8b680a6dad","schema_version":"1.0","event_id":"sha256:dc779b64ce5c9b0fc5e30cd12b6948bf0a36d37191a4d23755d3bd8b680a6dad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/bundle.json","state_url":"https://pith.science/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/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-27T13:03:07Z","links":{"resolver":"https://pith.science/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4","bundle":"https://pith.science/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/bundle.json","state":"https://pith.science/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXFTSKAEC6WD3NP2YOZEC4OJQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RXFTSKAEC6WD3NP2YOZEC4OJQ4","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":"e7aaf24df30169d795206463780aae1a76aa23d69fadb029ca3bf981202b0688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-27T07:57:22Z","title_canon_sha256":"b1287f33f77f1f5cf4e619ccf8dbd73f82f16ec57d887480ec631eddb558b7ec"},"schema_version":"1.0","source":{"id":"1602.08565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08565","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08565v1","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08565","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"RXFTSKAEC6WD","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXFTSKAEC6WD3NP2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXFTSKAE","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:dc779b64ce5c9b0fc5e30cd12b6948bf0a36d37191a4d23755d3bd8b680a6dad","target":"graph","created_at":"2026-05-18T01:19:52Z","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":"Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper, we investigate stronger variants of inclusion, equivalence and sequential uniformisation, based on a general notion of transducer resynchronisation, and show their decidability. We also investigate the classes of finite-valued rational transductions and deterministic rational transductions, which are known to have a decidable equivalence problem. We show th","authors_text":"Christof L\\\"oding, Emmanuel Filiot, Isma\\\"el Jecker, Sarah Winter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-27T07:57:22Z","title":"On Equivalence and Uniformisation Problems for Finite Transducers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08565","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:2a3121b8f6fe52db4049a4977c8f4b8746a23530fdc3ca0f68248f14123712e8","target":"record","created_at":"2026-05-18T01:19:52Z","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":"e7aaf24df30169d795206463780aae1a76aa23d69fadb029ca3bf981202b0688","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-27T07:57:22Z","title_canon_sha256":"b1287f33f77f1f5cf4e619ccf8dbd73f82f16ec57d887480ec631eddb558b7ec"},"schema_version":"1.0","source":{"id":"1602.08565","kind":"arxiv","version":1}},"canonical_sha256":"8dcb39280417ac3db5fac3b24171c987226cd3d6b64eb1f7115ab975a5e73a8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dcb39280417ac3db5fac3b24171c987226cd3d6b64eb1f7115ab975a5e73a8d","first_computed_at":"2026-05-18T01:19:52.491043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:52.491043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fMWXv5Zndyf4GSiOMCB6bemrVbfSj28aIvXtO/+gNigGsTlB3sNwk7lILmxbAA17SHxKK0QMTw12p3gP+zvNDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:52.491672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a3121b8f6fe52db4049a4977c8f4b8746a23530fdc3ca0f68248f14123712e8","sha256:dc779b64ce5c9b0fc5e30cd12b6948bf0a36d37191a4d23755d3bd8b680a6dad"],"state_sha256":"1c4a5ed566585bcc8c3bf58f1ae3fd5bd84371f376bef838b8d09402757c6d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuG/xanx6Ke/KOIIEQqrmI28/8RKgaR7962Vi29JcYf6A2nwf3wVj7KtZ1Dca40pZvD0j8+5mfKvd2j1ds5LDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:03:07.276700Z","bundle_sha256":"30a8ac995acc20fa0dd7e9ea5a0ca2ee5ed392e3e0a438e3250e8aaf030f5bed"}}