{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WEU3I2OLB37GF2OYCFBNDLHK2G","short_pith_number":"pith:WEU3I2OL","canonical_record":{"source":{"id":"1007.5406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T10:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"cdc21b11553c26e20b5599b75b7a6e8f2bd5e9202c69f310512baf47aad437a5","abstract_canon_sha256":"87d73d6ce5df2a50d52235720be8db5a8ae1b2a49a800ac5a736fd8364884e31"},"schema_version":"1.0"},"canonical_sha256":"b129b469cb0efe62e9d81142d1acead1b44a7257e6d94dd8188807840556dc32","source":{"kind":"arxiv","id":"1007.5406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5406","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5406v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5406","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"WEU3I2OLB37G","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WEU3I2OLB37GF2OY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WEU3I2OL","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WEU3I2OLB37GF2OYCFBNDLHK2G","target":"record","payload":{"canonical_record":{"source":{"id":"1007.5406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T10:14:21Z","cross_cats_sorted":[],"title_canon_sha256":"cdc21b11553c26e20b5599b75b7a6e8f2bd5e9202c69f310512baf47aad437a5","abstract_canon_sha256":"87d73d6ce5df2a50d52235720be8db5a8ae1b2a49a800ac5a736fd8364884e31"},"schema_version":"1.0"},"canonical_sha256":"b129b469cb0efe62e9d81142d1acead1b44a7257e6d94dd8188807840556dc32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:45.278716Z","signature_b64":"A42OT3QzRyyajq81SEeEqBjDiPYemTdk4X4usbi7dmMDdgbo1+4U13VWXIpZNvKBiqYqFVP+i3VF+p/0yaONDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b129b469cb0efe62e9d81142d1acead1b44a7257e6d94dd8188807840556dc32","last_reissued_at":"2026-05-18T04:42:45.278141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:45.278141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.5406","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-18T04:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Il3ksesoC9F57U0jXOKWyMCv+GLaVRKyiGhRxwA1UX4j1LkKTCWgi4moxGUgi1DL+gUJGfZak9/jVb47rsVWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:23.208280Z"},"content_sha256":"379aaf60cbae6dc764dd0e68b4993715ad9712d4d8d2d7500b41b8bdb9ab4b24","schema_version":"1.0","event_id":"sha256:379aaf60cbae6dc764dd0e68b4993715ad9712d4d8d2d7500b41b8bdb9ab4b24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WEU3I2OLB37GF2OYCFBNDLHK2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree structure compression with RePair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Lohrey, Roy Mennicke, Sebastian Maneth","submitted_at":"2010-07-30T10:14:21Z","abstract_excerpt":"In this work we introduce a new linear time compression algorithm, called \"Re-pair for Trees\", which compresses ranked ordered trees using linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars and allow basic tree operations, like traversal along edges, to be executed without prior decompression. Our algorithm can be considered as a generalization of the \"Re-pair\" algorithm developed by N. Jesper Larsson and Alistair Moffat in 2000. The latter algorithm is a dictionary-based compression algorithm for strings. We also introduce a su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5406","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-18T04:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oE2vOzhR0ZYwsjB6Fu+Ar7b4AQtnMJl0Limmqj1k5tXySLqZs1W93rcTocPPT2xab+gF2rSa4xWr0hT20cCTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:13:23.208957Z"},"content_sha256":"2c4692e5211b7c3f56c3395c83333eccfa00dbc996a545ff86c97dbb946e1b06","schema_version":"1.0","event_id":"sha256:2c4692e5211b7c3f56c3395c83333eccfa00dbc996a545ff86c97dbb946e1b06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/bundle.json","state_url":"https://pith.science/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/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-08T14:13:23Z","links":{"resolver":"https://pith.science/pith/WEU3I2OLB37GF2OYCFBNDLHK2G","bundle":"https://pith.science/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/bundle.json","state":"https://pith.science/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEU3I2OLB37GF2OYCFBNDLHK2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WEU3I2OLB37GF2OYCFBNDLHK2G","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":"87d73d6ce5df2a50d52235720be8db5a8ae1b2a49a800ac5a736fd8364884e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T10:14:21Z","title_canon_sha256":"cdc21b11553c26e20b5599b75b7a6e8f2bd5e9202c69f310512baf47aad437a5"},"schema_version":"1.0","source":{"id":"1007.5406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5406","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5406v1","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5406","created_at":"2026-05-18T04:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"WEU3I2OLB37G","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WEU3I2OLB37GF2OY","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WEU3I2OL","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:2c4692e5211b7c3f56c3395c83333eccfa00dbc996a545ff86c97dbb946e1b06","target":"graph","created_at":"2026-05-18T04:42:45Z","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 work we introduce a new linear time compression algorithm, called \"Re-pair for Trees\", which compresses ranked ordered trees using linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars and allow basic tree operations, like traversal along edges, to be executed without prior decompression. Our algorithm can be considered as a generalization of the \"Re-pair\" algorithm developed by N. Jesper Larsson and Alistair Moffat in 2000. The latter algorithm is a dictionary-based compression algorithm for strings. We also introduce a su","authors_text":"Markus Lohrey, Roy Mennicke, Sebastian Maneth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T10:14:21Z","title":"Tree structure compression with RePair"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5406","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:379aaf60cbae6dc764dd0e68b4993715ad9712d4d8d2d7500b41b8bdb9ab4b24","target":"record","created_at":"2026-05-18T04:42:45Z","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":"87d73d6ce5df2a50d52235720be8db5a8ae1b2a49a800ac5a736fd8364884e31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-30T10:14:21Z","title_canon_sha256":"cdc21b11553c26e20b5599b75b7a6e8f2bd5e9202c69f310512baf47aad437a5"},"schema_version":"1.0","source":{"id":"1007.5406","kind":"arxiv","version":1}},"canonical_sha256":"b129b469cb0efe62e9d81142d1acead1b44a7257e6d94dd8188807840556dc32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b129b469cb0efe62e9d81142d1acead1b44a7257e6d94dd8188807840556dc32","first_computed_at":"2026-05-18T04:42:45.278141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:45.278141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A42OT3QzRyyajq81SEeEqBjDiPYemTdk4X4usbi7dmMDdgbo1+4U13VWXIpZNvKBiqYqFVP+i3VF+p/0yaONDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:45.278716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.5406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379aaf60cbae6dc764dd0e68b4993715ad9712d4d8d2d7500b41b8bdb9ab4b24","sha256:2c4692e5211b7c3f56c3395c83333eccfa00dbc996a545ff86c97dbb946e1b06"],"state_sha256":"d074ee362584ad86da3bff409e2f146fb3a76ee41ae702bbc3ee37207b0032f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P71/TAzUYL8BIvE4xO8a5Kg4u1HIsp5g4JSGP2QyMYdcS3t/hOpvdtpaVVACKclg7BUNMipolGgkJ04NwsVbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:13:23.212307Z","bundle_sha256":"a5de528631b6cc6623a401289c353be646fe8411d033d38760f56dd18a9412d6"}}