{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3AQTPS3K63ZP3SDLHUVFFDJO7H","short_pith_number":"pith:3AQTPS3K","canonical_record":{"source":{"id":"1502.04625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:57:17Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"880f6f1756e8f6bbd3f4211652d6785404c55be17db1497ca3be9cf5265b984c","abstract_canon_sha256":"1756b3dd70191f43bc394abcb77ea4698489352c71836899ba217479053703bb"},"schema_version":"1.0"},"canonical_sha256":"d82137cb6af6f2fdc86b3d2a528d2ef9c3e71435dd6f867c8e0724219064be99","source":{"kind":"arxiv","id":"1502.04625","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04625","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04625v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04625","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"3AQTPS3K63ZP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3AQTPS3K63ZP3SDL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3AQTPS3K","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3AQTPS3K63ZP3SDLHUVFFDJO7H","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:57:17Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"880f6f1756e8f6bbd3f4211652d6785404c55be17db1497ca3be9cf5265b984c","abstract_canon_sha256":"1756b3dd70191f43bc394abcb77ea4698489352c71836899ba217479053703bb"},"schema_version":"1.0"},"canonical_sha256":"d82137cb6af6f2fdc86b3d2a528d2ef9c3e71435dd6f867c8e0724219064be99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.468433Z","signature_b64":"8mSozIrrI4gMzxJ4EiaiLU4tS988RjBjErUsNGuHpNCn3TQKK+I8jelPwS8MsKtDQGdIqayDMjubPjskIMIoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82137cb6af6f2fdc86b3d2a528d2ef9c3e71435dd6f867c8e0724219064be99","last_reissued_at":"2026-05-18T02:26:59.468008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.468008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04625","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-18T02:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Y4s4m7nSshm637uzGtGxfSFFoEXmWqiFStfBntGJOS8SyTRk939dmsjkbNNAKLZC6Zwxueq+g60azszNUF7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:20:27.092349Z"},"content_sha256":"1efd2b7740601fc9b4033144ec88913b77de3a0451461fdbdde9d569ac16a15f","schema_version":"1.0","event_id":"sha256:1efd2b7740601fc9b4033144ec88913b77de3a0451461fdbdde9d569ac16a15f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3AQTPS3K63ZP3SDLHUVFFDJO7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Tree Canonization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Fabian Peternek, Markus Lohrey, Sebastian Maneth","submitted_at":"2015-02-16T16:57:17Z","abstract_excerpt":"Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. It is well known that equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The proof constructs a compressed version of the canonical form of the tree represented by the input SLT grammar. The result is generalized to unrooted trees by \"re-rooting\" the compressed trees in polynomial time. We further show that bisimulation equivalence of unrooted unordere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04625","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-18T02:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RsjHnEKjO6X9UNaBReyDCOgQ08cm7+emhp420ElIujuEST99fn/8CS1LmOsrqaVpyRZYizUvskMZ0mHXlLuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:20:27.092990Z"},"content_sha256":"5ac66b5a4abc692231bef1341cd58866c5b51e1fed8b999fc147a35a32ed40d3","schema_version":"1.0","event_id":"sha256:5ac66b5a4abc692231bef1341cd58866c5b51e1fed8b999fc147a35a32ed40d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/bundle.json","state_url":"https://pith.science/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/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-09T02:20:27Z","links":{"resolver":"https://pith.science/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H","bundle":"https://pith.science/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/bundle.json","state":"https://pith.science/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AQTPS3K63ZP3SDLHUVFFDJO7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3AQTPS3K63ZP3SDLHUVFFDJO7H","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":"1756b3dd70191f43bc394abcb77ea4698489352c71836899ba217479053703bb","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:57:17Z","title_canon_sha256":"880f6f1756e8f6bbd3f4211652d6785404c55be17db1497ca3be9cf5265b984c"},"schema_version":"1.0","source":{"id":"1502.04625","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04625","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04625v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04625","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"3AQTPS3K63ZP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3AQTPS3K63ZP3SDL","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3AQTPS3K","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:5ac66b5a4abc692231bef1341cd58866c5b51e1fed8b999fc147a35a32ed40d3","target":"graph","created_at":"2026-05-18T02:26:59Z","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":"Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. It is well known that equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The proof constructs a compressed version of the canonical form of the tree represented by the input SLT grammar. The result is generalized to unrooted trees by \"re-rooting\" the compressed trees in polynomial time. We further show that bisimulation equivalence of unrooted unordere","authors_text":"Fabian Peternek, Markus Lohrey, Sebastian Maneth","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:57:17Z","title":"Compressed Tree Canonization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04625","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:1efd2b7740601fc9b4033144ec88913b77de3a0451461fdbdde9d569ac16a15f","target":"record","created_at":"2026-05-18T02:26:59Z","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":"1756b3dd70191f43bc394abcb77ea4698489352c71836899ba217479053703bb","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T16:57:17Z","title_canon_sha256":"880f6f1756e8f6bbd3f4211652d6785404c55be17db1497ca3be9cf5265b984c"},"schema_version":"1.0","source":{"id":"1502.04625","kind":"arxiv","version":1}},"canonical_sha256":"d82137cb6af6f2fdc86b3d2a528d2ef9c3e71435dd6f867c8e0724219064be99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d82137cb6af6f2fdc86b3d2a528d2ef9c3e71435dd6f867c8e0724219064be99","first_computed_at":"2026-05-18T02:26:59.468008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:59.468008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8mSozIrrI4gMzxJ4EiaiLU4tS988RjBjErUsNGuHpNCn3TQKK+I8jelPwS8MsKtDQGdIqayDMjubPjskIMIoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:59.468433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04625","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1efd2b7740601fc9b4033144ec88913b77de3a0451461fdbdde9d569ac16a15f","sha256:5ac66b5a4abc692231bef1341cd58866c5b51e1fed8b999fc147a35a32ed40d3"],"state_sha256":"1dc716f740582c73277f0634b170591620910392acce8f04e8af3e959dc503c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Brt7zd8aMFZBHrfeNAygOOaVBz5lrWPJJka9SW+7ZEnvuSA9qn425+coiMX3j92HdCP7cbmUPik1ptV+ZsOSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:20:27.096519Z","bundle_sha256":"f9b6b8922500b133c92d90b09540183e8e0e3bb6fa263270ba5a59065a8e306a"}}