{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HWFARIHXN4IEEKSFMIDBXPF45X","short_pith_number":"pith:HWFARIHX","schema_version":"1.0","canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","source":{"kind":"arxiv","id":"1304.7392","version":1},"attestation_state":"computed","paper":{"title":"A Universal Grammar-Based Code For Lossless Compression of Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yang, Jie Zhang, John C. Kieffer","submitted_at":"2013-04-27T18:02:53Z","abstract_excerpt":"We consider the problem of lossless compression of binary trees, with the aim of reducing the number of code bits needed to store or transmit such trees. A lossless grammar-based code is presented which encodes each binary tree into a binary codeword in two steps. In the first step, the tree is transformed into a context-free grammar from which the tree can be reconstructed. In the second step, the context-free grammar is encoded into a binary codeword. The decoder of the grammar-based code decodes the original tree from its codeword by reversing the two encoding steps. It is shown that the re"},"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":"1304.7392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T18:02:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7bd184d06a735bd50a25572ca65d570483e67017d5326c84b11a0a5ebe0b8636","abstract_canon_sha256":"e959aa516bc0bc84634095777ba4fa978b81e2673a8b19853cb90d8ee2a3baf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:54.133626Z","signature_b64":"yqmYmhFRvp7GLHheuprQ78VCumjutAYZ4Rs8Qe+xc206kizuB9JeIY4R3br2fQNptoX8h+35QemKE5pV94DDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","last_reissued_at":"2026-05-18T03:26:54.132698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:54.132698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Universal Grammar-Based Code For Lossless Compression of Binary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yang, Jie Zhang, John C. Kieffer","submitted_at":"2013-04-27T18:02:53Z","abstract_excerpt":"We consider the problem of lossless compression of binary trees, with the aim of reducing the number of code bits needed to store or transmit such trees. A lossless grammar-based code is presented which encodes each binary tree into a binary codeword in two steps. In the first step, the tree is transformed into a context-free grammar from which the tree can be reconstructed. In the second step, the context-free grammar is encoded into a binary codeword. The decoder of the grammar-based code decodes the original tree from its codeword by reversing the two encoding steps. It is shown that the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7392","kind":"arxiv","version":1},"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":"1304.7392","created_at":"2026-05-18T03:26:54.132856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7392v1","created_at":"2026-05-18T03:26:54.132856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7392","created_at":"2026-05-18T03:26:54.132856+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWFARIHXN4IE","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWFARIHXN4IEEKSF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWFARIHX","created_at":"2026-05-18T12:27:46.883200+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/HWFARIHXN4IEEKSFMIDBXPF45X","json":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X.json","graph_json":"https://pith.science/api/pith-number/HWFARIHXN4IEEKSFMIDBXPF45X/graph.json","events_json":"https://pith.science/api/pith-number/HWFARIHXN4IEEKSFMIDBXPF45X/events.json","paper":"https://pith.science/paper/HWFARIHX"},"agent_actions":{"view_html":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X","download_json":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X.json","view_paper":"https://pith.science/paper/HWFARIHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7392&json=true","fetch_graph":"https://pith.science/api/pith-number/HWFARIHXN4IEEKSFMIDBXPF45X/graph.json","fetch_events":"https://pith.science/api/pith-number/HWFARIHXN4IEEKSFMIDBXPF45X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/action/storage_attestation","attest_author":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/action/author_attestation","sign_citation":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/action/citation_signature","submit_replication":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/action/replication_record"}},"created_at":"2026-05-18T03:26:54.132856+00:00","updated_at":"2026-05-18T03:26:54.132856+00:00"}