{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4KK3RHWHCTDSB6FKCW2Y3C6FWI","short_pith_number":"pith:4KK3RHWH","schema_version":"1.0","canonical_sha256":"e295b89ec714c720f8aa15b58d8bc5b21cc99276238cc65a5be645efcc01ff0c","source":{"kind":"arxiv","id":"1407.4286","version":3},"attestation_state":"computed","paper":{"title":"Constructing small tree grammars and small circuits for formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.DS","authors_text":"Artur Jez, Danny Hucke, Eric Noeth, Markus Lohrey, Moses Ganardi","submitted_at":"2014-07-16T12:48:48Z","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"},"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":"1407.4286","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-16T12:48:48Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"4c47020c35a247a1b8e3d832ac30ea4f33f386cca1c596c463d91a2d10facc92","abstract_canon_sha256":"65e9794589523755a2853073702ccad5f1b10d47826b817f168130c7ddbfdc53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:41.839562Z","signature_b64":"OM9GekxUm2oMYf00RewY18u/s+iSAkJDgg+dQnWu2OC3bQPHBeUi/C8XHMVXoCwAF3CssORnhS6m9TnPL+ZKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e295b89ec714c720f8aa15b58d8bc5b21cc99276238cc65a5be645efcc01ff0c","last_reissued_at":"2026-05-18T01:32:41.839036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:41.839036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing small tree grammars and small circuits for formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.DS","authors_text":"Artur Jez, Danny Hucke, Eric Noeth, Markus Lohrey, Moses Ganardi","submitted_at":"2014-07-16T12:48:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4286","kind":"arxiv","version":3},"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":"1407.4286","created_at":"2026-05-18T01:32:41.839113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4286v3","created_at":"2026-05-18T01:32:41.839113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4286","created_at":"2026-05-18T01:32:41.839113+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KK3RHWHCTDS","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KK3RHWHCTDSB6FK","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KK3RHWH","created_at":"2026-05-18T12:28:14.216126+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/4KK3RHWHCTDSB6FKCW2Y3C6FWI","json":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI.json","graph_json":"https://pith.science/api/pith-number/4KK3RHWHCTDSB6FKCW2Y3C6FWI/graph.json","events_json":"https://pith.science/api/pith-number/4KK3RHWHCTDSB6FKCW2Y3C6FWI/events.json","paper":"https://pith.science/paper/4KK3RHWH"},"agent_actions":{"view_html":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI","download_json":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI.json","view_paper":"https://pith.science/paper/4KK3RHWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4286&json=true","fetch_graph":"https://pith.science/api/pith-number/4KK3RHWHCTDSB6FKCW2Y3C6FWI/graph.json","fetch_events":"https://pith.science/api/pith-number/4KK3RHWHCTDSB6FKCW2Y3C6FWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI/action/storage_attestation","attest_author":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI/action/author_attestation","sign_citation":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI/action/citation_signature","submit_replication":"https://pith.science/pith/4KK3RHWHCTDSB6FKCW2Y3C6FWI/action/replication_record"}},"created_at":"2026-05-18T01:32:41.839113+00:00","updated_at":"2026-05-18T01:32:41.839113+00:00"}