{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y6BGMZ2ZR2BZQJX6YEWXYGWOVB","short_pith_number":"pith:Y6BGMZ2Z","canonical_record":{"source":{"id":"1803.01362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T14:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"b96659ebaa4209e6daa379d5b6a2d523e2c01b664427e26912e5ef36130ee3cc","abstract_canon_sha256":"b7bedda32e960fce15e279f8aa9447b67618d8058e8a518120c981230e4d8bef"},"schema_version":"1.0"},"canonical_sha256":"c7826667598e839826fec12d7c1acea86d6934d63f27939ae632f91203a01aa1","source":{"kind":"arxiv","id":"1803.01362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01362","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01362v1","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01362","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y6BGMZ2ZR2BZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6BGMZ2ZR2BZQJX6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6BGMZ2Z","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y6BGMZ2ZR2BZQJX6YEWXYGWOVB","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T14:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"b96659ebaa4209e6daa379d5b6a2d523e2c01b664427e26912e5ef36130ee3cc","abstract_canon_sha256":"b7bedda32e960fce15e279f8aa9447b67618d8058e8a518120c981230e4d8bef"},"schema_version":"1.0"},"canonical_sha256":"c7826667598e839826fec12d7c1acea86d6934d63f27939ae632f91203a01aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:00.907343Z","signature_b64":"XbaXHB+8w4YeLgciit5YGO3Ws8kPocfTL00kFmiP8FvnzII4jpbQJVxqwk7u/R69TjIgB39JOe5lPUHJTlMRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7826667598e839826fec12d7c1acea86d6934d63f27939ae632f91203a01aa1","last_reissued_at":"2026-05-18T00:22:00.906745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:00.906745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01362","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-18T00:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaMdlTD3zAh92MMjOLnyg0Y2+CGC6Ap0INC9WclmpVmuM6pBvLc+KOKBO46JwI6MkkAhefyc7KolxKYJ+Dz+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:22.617655Z"},"content_sha256":"2a1fadaaf98278cf2c4654709f4ca80695b14e8a251354c3dbba3e9ffe627657","schema_version":"1.0","event_id":"sha256:2a1fadaaf98278cf2c4654709f4ca80695b14e8a251354c3dbba3e9ffe627657"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y6BGMZ2ZR2BZQJX6YEWXYGWOVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Dimensional Block Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adri\\'an G\\'omez-Brand\\'on, Gonzalo Navarro, Nieves R. Brisaboa, Travis Gagie","submitted_at":"2018-03-04T14:46:32Z","abstract_excerpt":"The Block Tree (BT) is a novel compact data structure designed to compress sequence collections. It obtains compression ratios close to Lempel-Ziv and supports efficient direct access to any substring. The BT divides the text recursively into fixed-size blocks and those appearing earlier are represented with pointers. On repetitive collections, a few blocks can represent all the others, and thus the BT reduces the size by orders of magnitude. In this paper we extend the BT to two dimensions, to exploit repetitiveness in collections of images, graphs, and maps. This two-dimensional Block Tree d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01362","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-18T00:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fcWKkmbOdWTt1XsZGcFoTcp2xjwCAzqEIf/s7wckg/nXIYUl1weLXFlvXRkqheQMqQU6ho5ozwvokQSslCuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:22.618355Z"},"content_sha256":"c2c137064bda32747aa5cdb58c7dc845a3a40b754f6567941bd60d2d9b975954","schema_version":"1.0","event_id":"sha256:c2c137064bda32747aa5cdb58c7dc845a3a40b754f6567941bd60d2d9b975954"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/bundle.json","state_url":"https://pith.science/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/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-27T19:53:22Z","links":{"resolver":"https://pith.science/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB","bundle":"https://pith.science/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/bundle.json","state":"https://pith.science/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6BGMZ2ZR2BZQJX6YEWXYGWOVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y6BGMZ2ZR2BZQJX6YEWXYGWOVB","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":"b7bedda32e960fce15e279f8aa9447b67618d8058e8a518120c981230e4d8bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T14:46:32Z","title_canon_sha256":"b96659ebaa4209e6daa379d5b6a2d523e2c01b664427e26912e5ef36130ee3cc"},"schema_version":"1.0","source":{"id":"1803.01362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01362","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01362v1","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01362","created_at":"2026-05-18T00:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"Y6BGMZ2ZR2BZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6BGMZ2ZR2BZQJX6","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6BGMZ2Z","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:c2c137064bda32747aa5cdb58c7dc845a3a40b754f6567941bd60d2d9b975954","target":"graph","created_at":"2026-05-18T00:22:00Z","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":"The Block Tree (BT) is a novel compact data structure designed to compress sequence collections. It obtains compression ratios close to Lempel-Ziv and supports efficient direct access to any substring. The BT divides the text recursively into fixed-size blocks and those appearing earlier are represented with pointers. On repetitive collections, a few blocks can represent all the others, and thus the BT reduces the size by orders of magnitude. In this paper we extend the BT to two dimensions, to exploit repetitiveness in collections of images, graphs, and maps. This two-dimensional Block Tree d","authors_text":"Adri\\'an G\\'omez-Brand\\'on, Gonzalo Navarro, Nieves R. Brisaboa, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T14:46:32Z","title":"Two-Dimensional Block Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01362","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:2a1fadaaf98278cf2c4654709f4ca80695b14e8a251354c3dbba3e9ffe627657","target":"record","created_at":"2026-05-18T00:22:00Z","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":"b7bedda32e960fce15e279f8aa9447b67618d8058e8a518120c981230e4d8bef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T14:46:32Z","title_canon_sha256":"b96659ebaa4209e6daa379d5b6a2d523e2c01b664427e26912e5ef36130ee3cc"},"schema_version":"1.0","source":{"id":"1803.01362","kind":"arxiv","version":1}},"canonical_sha256":"c7826667598e839826fec12d7c1acea86d6934d63f27939ae632f91203a01aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7826667598e839826fec12d7c1acea86d6934d63f27939ae632f91203a01aa1","first_computed_at":"2026-05-18T00:22:00.906745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:00.906745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbaXHB+8w4YeLgciit5YGO3Ws8kPocfTL00kFmiP8FvnzII4jpbQJVxqwk7u/R69TjIgB39JOe5lPUHJTlMRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:00.907343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a1fadaaf98278cf2c4654709f4ca80695b14e8a251354c3dbba3e9ffe627657","sha256:c2c137064bda32747aa5cdb58c7dc845a3a40b754f6567941bd60d2d9b975954"],"state_sha256":"cae32631369a4edeaa07d19f324874c5c7b17051120fe69d3b21bfd365210ac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FZp8zl5+ywcs6KhZj8FznjggL2ZisUXk4AQnf5TxF9EsSPwkLTqqdSl/EqGE6SbMaJUVV8QcxzRk6C72iwPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:53:22.622121Z","bundle_sha256":"989a95217000f92a0038aeefa93245b0c58eb124d3702e37e5bed3e47a8e0881"}}