{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HWFARIHXN4IEEKSFMIDBXPF45X","short_pith_number":"pith:HWFARIHX","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"},"canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","source":{"kind":"arxiv","id":"1304.7392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7392","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7392v1","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7392","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"HWFARIHXN4IE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HWFARIHXN4IEEKSF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HWFARIHX","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HWFARIHXN4IEEKSFMIDBXPF45X","target":"record","payload":{"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"},"canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","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"},"source_kind":"arxiv","source_id":"1304.7392","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ns/eayppNlfF9MTo3tDLmVE9/6rZuApPkNgJOMhK1e3J/6O/8LC0Ca/vwlTS+192cw6EhUmftyinORQLOI2aBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:24:30.265666Z"},"content_sha256":"ba495fbf71c0a9cddeb234ca02f1016bc7d7fa90c3ccfb32d625897aeefa1d8c","schema_version":"1.0","event_id":"sha256:ba495fbf71c0a9cddeb234ca02f1016bc7d7fa90c3ccfb32d625897aeefa1d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HWFARIHXN4IEEKSFMIDBXPF45X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFbuI1b6oZbnMtugdzZ4deCIYyCZpu94g8M47ZEXQhuirqDspIsImkp2SM3Ij313yU59Oz2Wwf9fHqpuU5RKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:24:30.266426Z"},"content_sha256":"a322f2b202e4042a7766fe6763d60c47b4ccc121d72f7227d491b6f26dcf3cba","schema_version":"1.0","event_id":"sha256:a322f2b202e4042a7766fe6763d60c47b4ccc121d72f7227d491b6f26dcf3cba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/bundle.json","state_url":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWFARIHXN4IEEKSFMIDBXPF45X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T19:24:30Z","links":{"resolver":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X","bundle":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/bundle.json","state":"https://pith.science/pith/HWFARIHXN4IEEKSFMIDBXPF45X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWFARIHXN4IEEKSFMIDBXPF45X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HWFARIHXN4IEEKSFMIDBXPF45X","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":"e959aa516bc0bc84634095777ba4fa978b81e2673a8b19853cb90d8ee2a3baf3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T18:02:53Z","title_canon_sha256":"7bd184d06a735bd50a25572ca65d570483e67017d5326c84b11a0a5ebe0b8636"},"schema_version":"1.0","source":{"id":"1304.7392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7392","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7392v1","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7392","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"HWFARIHXN4IE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HWFARIHXN4IEEKSF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HWFARIHX","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:a322f2b202e4042a7766fe6763d60c47b4ccc121d72f7227d491b6f26dcf3cba","target":"graph","created_at":"2026-05-18T03:26:54Z","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":"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","authors_text":"En-hui Yang, Jie Zhang, John C. Kieffer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T18:02:53Z","title":"A Universal Grammar-Based Code For Lossless Compression of Binary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7392","kind":"arxiv","version":1},"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:ba495fbf71c0a9cddeb234ca02f1016bc7d7fa90c3ccfb32d625897aeefa1d8c","target":"record","created_at":"2026-05-18T03:26:54Z","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":"e959aa516bc0bc84634095777ba4fa978b81e2673a8b19853cb90d8ee2a3baf3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T18:02:53Z","title_canon_sha256":"7bd184d06a735bd50a25572ca65d570483e67017d5326c84b11a0a5ebe0b8636"},"schema_version":"1.0","source":{"id":"1304.7392","kind":"arxiv","version":1}},"canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d8a08a0f76f10422a4562061bbcbcedcbedf0a4c07e0f74731b2671d9ceb3eb","first_computed_at":"2026-05-18T03:26:54.132698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:54.132698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yqmYmhFRvp7GLHheuprQ78VCumjutAYZ4Rs8Qe+xc206kizuB9JeIY4R3br2fQNptoX8h+35QemKE5pV94DDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:54.133626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba495fbf71c0a9cddeb234ca02f1016bc7d7fa90c3ccfb32d625897aeefa1d8c","sha256:a322f2b202e4042a7766fe6763d60c47b4ccc121d72f7227d491b6f26dcf3cba"],"state_sha256":"6c5b59a58759f03dbe323f7d3419948ec1e31871011d2da95033bcb561ba8a84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F599kMmLlSw/n+aV7ysXadh7Jm3kBbhleauYn898UwCa5IbjbGZ/SMCnpK0jDIcEGyE/foC7qtNGzY+WWASMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:24:30.270679Z","bundle_sha256":"5c5febb3076d2b89259e9b448926eb8a6bfe6822f6a7487ae4ae8e17fc71e60b"}}