{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OKQSYOWN2D4STXGW7TNHRSPXDZ","short_pith_number":"pith:OKQSYOWN","schema_version":"1.0","canonical_sha256":"72a12c3acdd0f929dcd6fcda78c9f71e64fe16fbbec3ea9b1ce19c57039a5f5e","source":{"kind":"arxiv","id":"1309.4958","version":4},"attestation_state":"computed","paper":{"title":"Approximation of smallest linear tree grammar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Artur Je\\.z, Markus Lohrey","submitted_at":"2013-09-19T13:04:49Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.4958","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-19T13:04:49Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"71f69319e75c8b86eaf39e0988edc779995c348bc040dcaebcf8c9f86463e423","abstract_canon_sha256":"18d24ad118c617a80aa82f772419d518113e2240054dfd2c008ef9e33aef45f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:59.767022Z","signature_b64":"TEIP01nYl0pIS7F8vOx+Yim5qq18XKBEypXHdOfhz4Xle92OYVABXc+hOFmt871DCiMDs0EQLpR1or9mwVacBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a12c3acdd0f929dcd6fcda78c9f71e64fe16fbbec3ea9b1ce19c57039a5f5e","last_reissued_at":"2026-05-18T00:03:59.766484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:59.766484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation of smallest linear tree grammar","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Artur Je\\.z, Markus Lohrey","submitted_at":"2013-09-19T13:04:49Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4958","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.4958","created_at":"2026-05-18T00:03:59.766579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4958v4","created_at":"2026-05-18T00:03:59.766579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4958","created_at":"2026-05-18T00:03:59.766579+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKQSYOWN2D4S","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKQSYOWN2D4STXGW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKQSYOWN","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ","json":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ.json","graph_json":"https://pith.science/api/pith-number/OKQSYOWN2D4STXGW7TNHRSPXDZ/graph.json","events_json":"https://pith.science/api/pith-number/OKQSYOWN2D4STXGW7TNHRSPXDZ/events.json","paper":"https://pith.science/paper/OKQSYOWN"},"agent_actions":{"view_html":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ","download_json":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ.json","view_paper":"https://pith.science/paper/OKQSYOWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4958&json=true","fetch_graph":"https://pith.science/api/pith-number/OKQSYOWN2D4STXGW7TNHRSPXDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OKQSYOWN2D4STXGW7TNHRSPXDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ/action/storage_attestation","attest_author":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ/action/author_attestation","sign_citation":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ/action/citation_signature","submit_replication":"https://pith.science/pith/OKQSYOWN2D4STXGW7TNHRSPXDZ/action/replication_record"}},"created_at":"2026-05-18T00:03:59.766579+00:00","updated_at":"2026-05-18T00:03:59.766579+00:00"}