{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4KK3RHWHCTDSB6FKCW2Y3C6FWI","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":"65e9794589523755a2853073702ccad5f1b10d47826b817f168130c7ddbfdc53","cross_cats_sorted":["cs.CC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T12:48:48Z","title_canon_sha256":"4c47020c35a247a1b8e3d832ac30ea4f33f386cca1c596c463d91a2d10facc92"},"schema_version":"1.0","source":{"id":"1407.4286","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4286","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4286v3","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4286","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"4KK3RHWHCTDS","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4KK3RHWHCTDSB6FK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4KK3RHWH","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:61997aa0251acdfe8ee015a7f941af64a8e427b2b490fca72e05ac955cea7f69","target":"graph","created_at":"2026-05-18T01:32:41Z","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":"It is shown that every tree of size $n$ over a fixed set of $\\sigma$ different ranked symbols can be decomposed (in linear time as well as in logspace) into $O\\big(\\frac{n}{\\log_\\sigma n}\\big) = O\\big(\\frac{n \\log \\sigma}{\\log n}\\big)$ many hierarchically defined pieces. Formally, such a hierarchical decomposition has the form of a straight-line linear context-free tree grammar of size $O\\big(\\frac{n}{\\log_\\sigma n}\\big)$, which can be used as a compressed representation of the input tree. This generalizes an analogous result for strings. Previous grammar-based tree compressors were not analyz","authors_text":"Artur Jez, Danny Hucke, Eric Noeth, Markus Lohrey, Moses Ganardi","cross_cats":["cs.CC","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T12:48:48Z","title":"Constructing small tree grammars and small circuits for formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4286","kind":"arxiv","version":3},"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:2c609a32aa1fe524cef985c3c5d50d4d8cc81604f5296cff0aee634710722b73","target":"record","created_at":"2026-05-18T01:32:41Z","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":"65e9794589523755a2853073702ccad5f1b10d47826b817f168130c7ddbfdc53","cross_cats_sorted":["cs.CC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T12:48:48Z","title_canon_sha256":"4c47020c35a247a1b8e3d832ac30ea4f33f386cca1c596c463d91a2d10facc92"},"schema_version":"1.0","source":{"id":"1407.4286","kind":"arxiv","version":3}},"canonical_sha256":"e295b89ec714c720f8aa15b58d8bc5b21cc99276238cc65a5be645efcc01ff0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e295b89ec714c720f8aa15b58d8bc5b21cc99276238cc65a5be645efcc01ff0c","first_computed_at":"2026-05-18T01:32:41.839036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:41.839036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OM9GekxUm2oMYf00RewY18u/s+iSAkJDgg+dQnWu2OC3bQPHBeUi/C8XHMVXoCwAF3CssORnhS6m9TnPL+ZKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:41.839562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4286","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c609a32aa1fe524cef985c3c5d50d4d8cc81604f5296cff0aee634710722b73","sha256:61997aa0251acdfe8ee015a7f941af64a8e427b2b490fca72e05ac955cea7f69"],"state_sha256":"bb8051e64ef0c118c2de4af2593231618fe80cd5e55e8bb2756d7ba05987274b"}