{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UE4ZW5P5IQRZ3UHB7YMJSGIN5M","short_pith_number":"pith:UE4ZW5P5","canonical_record":{"source":{"id":"1902.03858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-11T13:18:29Z","cross_cats_sorted":[],"title_canon_sha256":"6cdb313cfc5bba1f479221e5c7ec80d6675da58f7315c080ad4a484658964173","abstract_canon_sha256":"5205f0604412b244bf23111e6d363420449b95f42c11a9baa30594b2641d6ddb"},"schema_version":"1.0"},"canonical_sha256":"a1399b75fd44239dd0e1fe1899190deb187ab91b8de864d67709f532d47257a5","source":{"kind":"arxiv","id":"1902.03858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03858","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03858v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03858","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"UE4ZW5P5IQRZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UE4ZW5P5IQRZ3UHB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UE4ZW5P5","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UE4ZW5P5IQRZ3UHB7YMJSGIN5M","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-11T13:18:29Z","cross_cats_sorted":[],"title_canon_sha256":"6cdb313cfc5bba1f479221e5c7ec80d6675da58f7315c080ad4a484658964173","abstract_canon_sha256":"5205f0604412b244bf23111e6d363420449b95f42c11a9baa30594b2641d6ddb"},"schema_version":"1.0"},"canonical_sha256":"a1399b75fd44239dd0e1fe1899190deb187ab91b8de864d67709f532d47257a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:17.681220Z","signature_b64":"cuCSM5Es04nVNZi83kJI0V67BK151gMIU1ctxEUSg6PUHKNhjD9Jn83cYuJPcqwkHX7u73PC886EHKnge6yUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1399b75fd44239dd0e1fe1899190deb187ab91b8de864d67709f532d47257a5","last_reissued_at":"2026-05-17T23:54:17.680747Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:17.680747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03858","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-17T23:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4j1FrkjKkFMi4RK70Krx5XfocrQnOieUPChhiApDkND1VMev8q478JkZi8yKjTAC/+56T3k2GWm8KnqycqGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:57:48.797938Z"},"content_sha256":"a43fbcf961e075644b77bcca46640980dd6eaf2861af9f0296aef325beecf5d1","schema_version":"1.0","event_id":"sha256:a43fbcf961e075644b77bcca46640980dd6eaf2861af9f0296aef325beecf5d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UE4ZW5P5IQRZ3UHB7YMJSGIN5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Helmut Seidl, Raphaela Palenta, Sebastian Maneth","submitted_at":"2019-02-11T13:18:29Z","abstract_excerpt":"In 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total deterministic separated basic macro tree transducers. They also gave a procedure for deciding equivalence of transducer in the latter class. Here, we reconsider this equivalence problem. We present a new alternative decision procedure and prove that it runs in polynomial time. We also consider extensions of this result to partial transducers and to the case where parameters of transducers accumulate strings instead of trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03858","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-17T23:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qhd64FcgA1xXiOalIejILDvtrzi+ObfDdlp/im9lNoEz757RW6B6Ehln9/i9X551GoMKz6zdhZoATkdGQ0KpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:57:48.798286Z"},"content_sha256":"bd7b730369d08d6292a2aeb156f525005f44b15217a9dcfc9963d5e90f81425d","schema_version":"1.0","event_id":"sha256:bd7b730369d08d6292a2aeb156f525005f44b15217a9dcfc9963d5e90f81425d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/bundle.json","state_url":"https://pith.science/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/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-08T12:57:48Z","links":{"resolver":"https://pith.science/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M","bundle":"https://pith.science/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/bundle.json","state":"https://pith.science/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UE4ZW5P5IQRZ3UHB7YMJSGIN5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UE4ZW5P5IQRZ3UHB7YMJSGIN5M","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":"5205f0604412b244bf23111e6d363420449b95f42c11a9baa30594b2641d6ddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-11T13:18:29Z","title_canon_sha256":"6cdb313cfc5bba1f479221e5c7ec80d6675da58f7315c080ad4a484658964173"},"schema_version":"1.0","source":{"id":"1902.03858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03858","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03858v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03858","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"UE4ZW5P5IQRZ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UE4ZW5P5IQRZ3UHB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UE4ZW5P5","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:bd7b730369d08d6292a2aeb156f525005f44b15217a9dcfc9963d5e90f81425d","target":"graph","created_at":"2026-05-17T23:54:17Z","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 1982, Courcelle and Franchi-Zannettacci showed that the equivalence problem of separated non-nested attribute systems can be reduced to the equivalence problem of total deterministic separated basic macro tree transducers. They also gave a procedure for deciding equivalence of transducer in the latter class. Here, we reconsider this equivalence problem. We present a new alternative decision procedure and prove that it runs in polynomial time. We also consider extensions of this result to partial transducers and to the case where parameters of transducers accumulate strings instead of trees.","authors_text":"Helmut Seidl, Raphaela Palenta, Sebastian Maneth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-11T13:18:29Z","title":"Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03858","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:a43fbcf961e075644b77bcca46640980dd6eaf2861af9f0296aef325beecf5d1","target":"record","created_at":"2026-05-17T23:54:17Z","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":"5205f0604412b244bf23111e6d363420449b95f42c11a9baa30594b2641d6ddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-02-11T13:18:29Z","title_canon_sha256":"6cdb313cfc5bba1f479221e5c7ec80d6675da58f7315c080ad4a484658964173"},"schema_version":"1.0","source":{"id":"1902.03858","kind":"arxiv","version":1}},"canonical_sha256":"a1399b75fd44239dd0e1fe1899190deb187ab91b8de864d67709f532d47257a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1399b75fd44239dd0e1fe1899190deb187ab91b8de864d67709f532d47257a5","first_computed_at":"2026-05-17T23:54:17.680747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:17.680747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cuCSM5Es04nVNZi83kJI0V67BK151gMIU1ctxEUSg6PUHKNhjD9Jn83cYuJPcqwkHX7u73PC886EHKnge6yUAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:17.681220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a43fbcf961e075644b77bcca46640980dd6eaf2861af9f0296aef325beecf5d1","sha256:bd7b730369d08d6292a2aeb156f525005f44b15217a9dcfc9963d5e90f81425d"],"state_sha256":"13c363587734baad7a5cf8c9a956b8cbef202746a679af7f0514a30101634198"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krKryAVtdPkOCy1ADS0ibWXcNjcgfcC18A7QFzu2aNZhnNlGKNceAu2D7I3hR65wSgyqukblD0U/MLB6JUVZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:57:48.800406Z","bundle_sha256":"1c7817e69e4cc468ec21a65555fea37426c0f1de7a639a403ed45ffeb6b198ee"}}