{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4DBACYLM6IUUTRKTISRWHXT6WU","short_pith_number":"pith:4DBACYLM","schema_version":"1.0","canonical_sha256":"e0c201616cf22949c55344a363de7eb50ad4476a49def5e9d2a54b2653902be2","source":{"kind":"arxiv","id":"1704.08705","version":3},"attestation_state":"computed","paper":{"title":"A universal tree balancing theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Markus Lohrey, Moses Ganardi","submitted_at":"2017-04-27T18:15:50Z","abstract_excerpt":"We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC$^0$ a tree straight-line program of logarithmic depth and size $O(n/\\log n)$. This allows reducing the term evaluation problem over an arbitrary algebra $\\mathcal{A}$ to the term evaluation problem over a derived two-sorted algebra $\\mathcal{F}(\\mat"},"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":"1704.08705","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-04-27T18:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"11654b7bc813a2a259e3a02a9db38a951f29085f9e231385be630e898f5f70f6","abstract_canon_sha256":"e7c4ed79972aafaea7caf6fe036ff3908493f2151ac79d26b1686d256abf774c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:43.334490Z","signature_b64":"SewiyhAKoZ5i98U3KaF8YqTrvYqxuTWz1dp5ezHsQJ9/NpgfIDc3ndW4saDzNj00ycIbfZ0y0h1dOUcy4tAYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c201616cf22949c55344a363de7eb50ad4476a49def5e9d2a54b2653902be2","last_reissued_at":"2026-05-18T00:32:43.333646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:43.333646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A universal tree balancing theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Markus Lohrey, Moses Ganardi","submitted_at":"2017-04-27T18:15:50Z","abstract_excerpt":"We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC$^0$ a tree straight-line program of logarithmic depth and size $O(n/\\log n)$. This allows reducing the term evaluation problem over an arbitrary algebra $\\mathcal{A}$ to the term evaluation problem over a derived two-sorted algebra $\\mathcal{F}(\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08705","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":"1704.08705","created_at":"2026-05-18T00:32:43.333788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08705v3","created_at":"2026-05-18T00:32:43.333788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08705","created_at":"2026-05-18T00:32:43.333788+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DBACYLM6IUU","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DBACYLM6IUUTRKT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DBACYLM","created_at":"2026-05-18T12:30:58.224056+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/4DBACYLM6IUUTRKTISRWHXT6WU","json":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU.json","graph_json":"https://pith.science/api/pith-number/4DBACYLM6IUUTRKTISRWHXT6WU/graph.json","events_json":"https://pith.science/api/pith-number/4DBACYLM6IUUTRKTISRWHXT6WU/events.json","paper":"https://pith.science/paper/4DBACYLM"},"agent_actions":{"view_html":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU","download_json":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU.json","view_paper":"https://pith.science/paper/4DBACYLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08705&json=true","fetch_graph":"https://pith.science/api/pith-number/4DBACYLM6IUUTRKTISRWHXT6WU/graph.json","fetch_events":"https://pith.science/api/pith-number/4DBACYLM6IUUTRKTISRWHXT6WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU/action/storage_attestation","attest_author":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU/action/author_attestation","sign_citation":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU/action/citation_signature","submit_replication":"https://pith.science/pith/4DBACYLM6IUUTRKTISRWHXT6WU/action/replication_record"}},"created_at":"2026-05-18T00:32:43.333788+00:00","updated_at":"2026-05-18T00:32:43.333788+00:00"}