{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OKQSYOWN2D4STXGW7TNHRSPXDZ","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":"18d24ad118c617a80aa82f772419d518113e2240054dfd2c008ef9e33aef45f7","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T13:04:49Z","title_canon_sha256":"71f69319e75c8b86eaf39e0988edc779995c348bc040dcaebcf8c9f86463e423"},"schema_version":"1.0","source":{"id":"1309.4958","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4958","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4958v4","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4958","created_at":"2026-05-18T00:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"OKQSYOWN2D4S","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OKQSYOWN2D4STXGW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OKQSYOWN","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:e2ae2611b9109c3cf66ae67ff668ec3765c44fdb4dd1d5765798ea9c0990e454","target":"graph","created_at":"2026-05-18T00:03: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":"A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(rg + r g log (n/r g))for a given input tree T of size n is presented, where g is the size of a minimal linear context-free tree grammar for T, and r is the maximal rank of symbols in T (which is a constant in many applications). This is the first example of a grammar-based tree compression algorithm with a good, i.e. logarithmic in terms of the size of the input tree, approximation ratio. The analysis of the algorithm uses an extension of the recompression technique from strings to trees.","authors_text":"Artur Je\\.z, Markus Lohrey","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T13:04:49Z","title":"Approximation of smallest linear tree grammar"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4958","kind":"arxiv","version":4},"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:54663aefdcc7953964b66e0414bd710b533070c79ccc7ea10fb9724241dfccd0","target":"record","created_at":"2026-05-18T00:03: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":"18d24ad118c617a80aa82f772419d518113e2240054dfd2c008ef9e33aef45f7","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T13:04:49Z","title_canon_sha256":"71f69319e75c8b86eaf39e0988edc779995c348bc040dcaebcf8c9f86463e423"},"schema_version":"1.0","source":{"id":"1309.4958","kind":"arxiv","version":4}},"canonical_sha256":"72a12c3acdd0f929dcd6fcda78c9f71e64fe16fbbec3ea9b1ce19c57039a5f5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72a12c3acdd0f929dcd6fcda78c9f71e64fe16fbbec3ea9b1ce19c57039a5f5e","first_computed_at":"2026-05-18T00:03:59.766484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:59.766484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TEIP01nYl0pIS7F8vOx+Yim5qq18XKBEypXHdOfhz4Xle92OYVABXc+hOFmt871DCiMDs0EQLpR1or9mwVacBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:59.767022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4958","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54663aefdcc7953964b66e0414bd710b533070c79ccc7ea10fb9724241dfccd0","sha256:e2ae2611b9109c3cf66ae67ff668ec3765c44fdb4dd1d5765798ea9c0990e454"],"state_sha256":"7ccfbc9ac12b3bd2d1918e4da50c58de98dee07d386e5783d8274b70e6abeee1"}