{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4ZCADAR2XYAO674RXYPLWD6ZYP","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":"0dcebd04c434e5dc1b06837da1b134584c176c4d8df9f7f5e4e74e8272424357","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-10T15:20:18Z","title_canon_sha256":"521929465455ac7c3cf933f3d4982518acb077008b5ec4a8b9db2fdf25a2ac06"},"schema_version":"1.0","source":{"id":"2406.06359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.06359","created_at":"2026-07-05T08:29:41Z"},{"alias_kind":"arxiv_version","alias_value":"2406.06359v1","created_at":"2026-07-05T08:29:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06359","created_at":"2026-07-05T08:29:41Z"},{"alias_kind":"pith_short_12","alias_value":"4ZCADAR2XYAO","created_at":"2026-07-05T08:29:41Z"},{"alias_kind":"pith_short_16","alias_value":"4ZCADAR2XYAO674R","created_at":"2026-07-05T08:29:41Z"},{"alias_kind":"pith_short_8","alias_value":"4ZCADAR2","created_at":"2026-07-05T08:29:41Z"}],"graph_snapshots":[{"event_id":"sha256:0da9e710f39b2916dcd776b03718307c1e698cc96ff78cff86134a1a512bf2d3","target":"graph","created_at":"2026-07-05T08:29:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.06359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that can arise from successively inserting keys, and in particular present a bijection between such sequences (which we call histories) and a special type of increasing trees. We describe the set of permutations for the keys that belong to a given history, and also show how to use this bijection to analyse statistics associated with $B$-trees.","authors_text":"Fabian Burghart, Stephan Wagner","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-10T15:20:18Z","title":"A bijection for the evolution of $B$-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06359","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:70bd9eb9e4f0436960d6791f7171f0d9783dbc404b5a8b9f53221877ac542861","target":"record","created_at":"2026-07-05T08:29:41Z","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":"0dcebd04c434e5dc1b06837da1b134584c176c4d8df9f7f5e4e74e8272424357","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-10T15:20:18Z","title_canon_sha256":"521929465455ac7c3cf933f3d4982518acb077008b5ec4a8b9db2fdf25a2ac06"},"schema_version":"1.0","source":{"id":"2406.06359","kind":"arxiv","version":1}},"canonical_sha256":"e64401823abe00ef7f91be1ebb0fd9c3e75f08a7895ce7ad0912b9decc1c73be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e64401823abe00ef7f91be1ebb0fd9c3e75f08a7895ce7ad0912b9decc1c73be","first_computed_at":"2026-07-05T08:29:41.306441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:41.306441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UypcnowC1YXmmQV9DA2cO6O9LQdsu5YlXKPsfT+JxUAYVkjXoqDlbzgGs/r2auJjT7WeFTcSAMfciVwYTgprBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:41.307064Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.06359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70bd9eb9e4f0436960d6791f7171f0d9783dbc404b5a8b9f53221877ac542861","sha256:0da9e710f39b2916dcd776b03718307c1e698cc96ff78cff86134a1a512bf2d3"],"state_sha256":"6ecb18b57b8b4d9f5af439362c424d762cf0304747957be057a472884c379dc2"}