{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WAAIYMNYV4P5T3REBCYZ2XFSDT","short_pith_number":"pith:WAAIYMNY","canonical_record":{"source":{"id":"1304.5702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-21T07:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"4fa4e39bdbe12e074a7ff827004135d6bcb9fae7e1dca97efc206dde4396fbe6","abstract_canon_sha256":"a04076e0282a9ccd34f99189eaebf03eb729ab33cc6820159704bcb61a0ba1b9"},"schema_version":"1.0"},"canonical_sha256":"b0008c31b8af1fd9ee2408b19d5cb21ccc84b07e7d9103dbbba0395369ea6529","source":{"kind":"arxiv","id":"1304.5702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5702","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5702v2","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5702","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"WAAIYMNYV4P5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WAAIYMNYV4P5T3RE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WAAIYMNY","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WAAIYMNYV4P5T3REBCYZ2XFSDT","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-21T07:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"4fa4e39bdbe12e074a7ff827004135d6bcb9fae7e1dca97efc206dde4396fbe6","abstract_canon_sha256":"a04076e0282a9ccd34f99189eaebf03eb729ab33cc6820159704bcb61a0ba1b9"},"schema_version":"1.0"},"canonical_sha256":"b0008c31b8af1fd9ee2408b19d5cb21ccc84b07e7d9103dbbba0395369ea6529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:12.681441Z","signature_b64":"dzEu3IwIGYogPvs637MGeeFKh1tTMaIVrV2PaPO2mfszHFfti8MEeIbRIyQ/Da0RX9mY0ERyAqDelkK39ogpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0008c31b8af1fd9ee2408b19d5cb21ccc84b07e7d9103dbbba0395369ea6529","last_reissued_at":"2026-05-18T02:52:12.680862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:12.680862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5702","source_version":2,"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-18T02:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vN41b0N1VRa5WI8AmP1wOi+lvUwzoAhNCZfGH/BEjajXHbROTntU1nyTulhzmO3AsI1fH1eU/la2g40ZNrF9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:57:44.270481Z"},"content_sha256":"a9043640d78c237e4983761289264e687f10d6676fa8753c142b65eb74816346","schema_version":"1.0","event_id":"sha256:a9043640d78c237e4983761289264e687f10d6676fa8753c142b65eb74816346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WAAIYMNYV4P5T3REBCYZ2XFSDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Compression with Top Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Inge Li Goertz, Oren Weimann, Philip Bille","submitted_at":"2013-04-21T07:38:50Z","abstract_excerpt":"We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5702","kind":"arxiv","version":2},"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-18T02:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rhopzYI/DGo1XIuXJvBd7y8cTLsd5jS//FBSRcvFK7NfK0WpJYNgqIzPro7ZoqxFYK7xtBs9l18Ml2VmwLoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:57:44.270866Z"},"content_sha256":"78652f6a84bd0bbdb0d4b40b1decb60b3c9a2131876c98b766414ae01039d3e9","schema_version":"1.0","event_id":"sha256:78652f6a84bd0bbdb0d4b40b1decb60b3c9a2131876c98b766414ae01039d3e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/bundle.json","state_url":"https://pith.science/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/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-05-30T18:57:44Z","links":{"resolver":"https://pith.science/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT","bundle":"https://pith.science/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/bundle.json","state":"https://pith.science/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAAIYMNYV4P5T3REBCYZ2XFSDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WAAIYMNYV4P5T3REBCYZ2XFSDT","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":"a04076e0282a9ccd34f99189eaebf03eb729ab33cc6820159704bcb61a0ba1b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-21T07:38:50Z","title_canon_sha256":"4fa4e39bdbe12e074a7ff827004135d6bcb9fae7e1dca97efc206dde4396fbe6"},"schema_version":"1.0","source":{"id":"1304.5702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5702","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5702v2","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5702","created_at":"2026-05-18T02:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"WAAIYMNYV4P5","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WAAIYMNYV4P5T3RE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WAAIYMNY","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:78652f6a84bd0bbdb0d4b40b1decb60b3c9a2131876c98b766414ae01039d3e9","target":"graph","created_at":"2026-05-18T02:52:12Z","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 introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.","authors_text":"Gad M. Landau, Inge Li Goertz, Oren Weimann, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-21T07:38:50Z","title":"Tree Compression with Top Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5702","kind":"arxiv","version":2},"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:a9043640d78c237e4983761289264e687f10d6676fa8753c142b65eb74816346","target":"record","created_at":"2026-05-18T02:52:12Z","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":"a04076e0282a9ccd34f99189eaebf03eb729ab33cc6820159704bcb61a0ba1b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-21T07:38:50Z","title_canon_sha256":"4fa4e39bdbe12e074a7ff827004135d6bcb9fae7e1dca97efc206dde4396fbe6"},"schema_version":"1.0","source":{"id":"1304.5702","kind":"arxiv","version":2}},"canonical_sha256":"b0008c31b8af1fd9ee2408b19d5cb21ccc84b07e7d9103dbbba0395369ea6529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0008c31b8af1fd9ee2408b19d5cb21ccc84b07e7d9103dbbba0395369ea6529","first_computed_at":"2026-05-18T02:52:12.680862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:12.680862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzEu3IwIGYogPvs637MGeeFKh1tTMaIVrV2PaPO2mfszHFfti8MEeIbRIyQ/Da0RX9mY0ERyAqDelkK39ogpAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:12.681441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9043640d78c237e4983761289264e687f10d6676fa8753c142b65eb74816346","sha256:78652f6a84bd0bbdb0d4b40b1decb60b3c9a2131876c98b766414ae01039d3e9"],"state_sha256":"802f21386667cbf97fac4ec1ef46579cf669910db8a8accd6f87c37e5e822c50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1xmZY/UV+1mmNfv7gQvN9T/aXUefWMyxbqN7UoTDv9RmWGmsgOqUF8DPEcmf7z+oX1+gJ+fQtsbb2Td2ISsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:57:44.274044Z","bundle_sha256":"9f1f06c04d70b28cbc55d4f96295e07b62d9055f3e26b2b44425e759878b5ca4"}}