{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:27PUACF63JR3RGGLNW4HPE4IBL","short_pith_number":"pith:27PUACF6","canonical_record":{"source":{"id":"1903.03560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T17:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"70529cfae9b00b0bb722e7fd42c4f226bb1cf37de20d3ecd67465930cb33a006","abstract_canon_sha256":"79f2fa4008716af7031faa91d97610d0e2d0e687f30df8b9e2ddfe435a925b73"},"schema_version":"1.0"},"canonical_sha256":"d7df4008beda63b898cb6db87793880aec2583508b0797780da5d1ea4ad1a2a6","source":{"kind":"arxiv","id":"1903.03560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03560","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03560v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03560","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"27PUACF63JR3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"27PUACF63JR3RGGL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"27PUACF6","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:27PUACF63JR3RGGLNW4HPE4IBL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T17:16:26Z","cross_cats_sorted":[],"title_canon_sha256":"70529cfae9b00b0bb722e7fd42c4f226bb1cf37de20d3ecd67465930cb33a006","abstract_canon_sha256":"79f2fa4008716af7031faa91d97610d0e2d0e687f30df8b9e2ddfe435a925b73"},"schema_version":"1.0"},"canonical_sha256":"d7df4008beda63b898cb6db87793880aec2583508b0797780da5d1ea4ad1a2a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.175800Z","signature_b64":"l9V3byBoN3RTYFHNxp7GCojfwKjaco/TxU1PkkLo+dzJFKv5KOCe55hIiizXmKa9b/SIjo2Ap3Dc/C9l8yhuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7df4008beda63b898cb6db87793880aec2583508b0797780da5d1ea4ad1a2a6","last_reissued_at":"2026-05-17T23:51:45.175221Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.175221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03560","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-17T23:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"surIFlkOgxN7XlMqTRKWPm0Ibdcoyz9JBZqynnW32UGlbJLDoF4y/FC7/aeyagGnSiX9wgO3f4tN7kY7ndtHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:05:38.452802Z"},"content_sha256":"45a40995da6b0c75493fded920031924ec1bb05e8caad246caf0f033f6e0ecd6","schema_version":"1.0","event_id":"sha256:45a40995da6b0c75493fded920031924ec1bb05e8caad246caf0f033f6e0ecd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:27PUACF63JR3RGGLNW4HPE4IBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Belga B-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik D.Demaine, Grigorios Koumoutsos, John Iacono, Stefan Langerman","submitted_at":"2019-03-08T17:16:26Z","abstract_excerpt":"We revisit self-adjusting external memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distribution of queries. Our approach is analogous to undergoing efforts in the BST model, where Tango Trees (Demaine et al. 2007) were shown to be $O(\\log\\log N)$-competitive with the runtime of the best offline binary search tree on every sequence of searches. Here we formalize the B-Tree model as a natural generalization of the BST model. We prove lower bounds for the B-Tree model, and introduce a B-Tree model data str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03560","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-17T23:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hbhn5S6u1rFI5nFTysLPllhNz1WODOe6KlbpiNqWiZExvso70cjCB/Kwt89ofsrdpfCqnGwoScQFbQs/hTqFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:05:38.453355Z"},"content_sha256":"26796f06343cee9160ef14907a438a3fb387978d8f2fbf10b8fe42741474c3f3","schema_version":"1.0","event_id":"sha256:26796f06343cee9160ef14907a438a3fb387978d8f2fbf10b8fe42741474c3f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27PUACF63JR3RGGLNW4HPE4IBL/bundle.json","state_url":"https://pith.science/pith/27PUACF63JR3RGGLNW4HPE4IBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27PUACF63JR3RGGLNW4HPE4IBL/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-23T15:05:38Z","links":{"resolver":"https://pith.science/pith/27PUACF63JR3RGGLNW4HPE4IBL","bundle":"https://pith.science/pith/27PUACF63JR3RGGLNW4HPE4IBL/bundle.json","state":"https://pith.science/pith/27PUACF63JR3RGGLNW4HPE4IBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27PUACF63JR3RGGLNW4HPE4IBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:27PUACF63JR3RGGLNW4HPE4IBL","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":"79f2fa4008716af7031faa91d97610d0e2d0e687f30df8b9e2ddfe435a925b73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T17:16:26Z","title_canon_sha256":"70529cfae9b00b0bb722e7fd42c4f226bb1cf37de20d3ecd67465930cb33a006"},"schema_version":"1.0","source":{"id":"1903.03560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03560","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03560v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03560","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"27PUACF63JR3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"27PUACF63JR3RGGL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"27PUACF6","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:26796f06343cee9160ef14907a438a3fb387978d8f2fbf10b8fe42741474c3f3","target":"graph","created_at":"2026-05-17T23:51:45Z","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 revisit self-adjusting external memory tree data structures, which combine the optimal (and practical) worst-case I/O performances of B-trees, while adapting to the online distribution of queries. Our approach is analogous to undergoing efforts in the BST model, where Tango Trees (Demaine et al. 2007) were shown to be $O(\\log\\log N)$-competitive with the runtime of the best offline binary search tree on every sequence of searches. Here we formalize the B-Tree model as a natural generalization of the BST model. We prove lower bounds for the B-Tree model, and introduce a B-Tree model data str","authors_text":"Erik D.Demaine, Grigorios Koumoutsos, John Iacono, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T17:16:26Z","title":"Belga B-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03560","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:45a40995da6b0c75493fded920031924ec1bb05e8caad246caf0f033f6e0ecd6","target":"record","created_at":"2026-05-17T23:51:45Z","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":"79f2fa4008716af7031faa91d97610d0e2d0e687f30df8b9e2ddfe435a925b73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-08T17:16:26Z","title_canon_sha256":"70529cfae9b00b0bb722e7fd42c4f226bb1cf37de20d3ecd67465930cb33a006"},"schema_version":"1.0","source":{"id":"1903.03560","kind":"arxiv","version":1}},"canonical_sha256":"d7df4008beda63b898cb6db87793880aec2583508b0797780da5d1ea4ad1a2a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7df4008beda63b898cb6db87793880aec2583508b0797780da5d1ea4ad1a2a6","first_computed_at":"2026-05-17T23:51:45.175221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:45.175221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l9V3byBoN3RTYFHNxp7GCojfwKjaco/TxU1PkkLo+dzJFKv5KOCe55hIiizXmKa9b/SIjo2Ap3Dc/C9l8yhuCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:45.175800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45a40995da6b0c75493fded920031924ec1bb05e8caad246caf0f033f6e0ecd6","sha256:26796f06343cee9160ef14907a438a3fb387978d8f2fbf10b8fe42741474c3f3"],"state_sha256":"f5e9fb6bf699cedff67358f19912b6c9f047d78c8404ec631857549603d6f29e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6It/so9ZJ+fTmZB5xwyRh/PWh8KZ3PNQ8bobTT7nfve3KGqt0V252dkXxJ5vA/hgz9X/cuQqO+lOWrajOUsCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:05:38.456047Z","bundle_sha256":"fb8dd1d064e50146b38536e48eaad80958eff42cc4c7957415ff1d3277234d40"}}