{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CYJ7OEPW2QLW4QCRUSABXM6U5D","short_pith_number":"pith:CYJ7OEPW","schema_version":"1.0","canonical_sha256":"1613f711f6d4176e4051a4801bb3d4e8de03cfe8329358499571c7ed0846ef51","source":{"kind":"arxiv","id":"1712.05020","version":2},"attestation_state":"computed","paper":{"title":"B-slack trees: Highly Space Efficient B-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Trevor Brown","submitted_at":"2017-12-13T21:51:02Z","abstract_excerpt":"B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store $n$ keys in height $O(\\log_b n)$, where $b$ is the maximum node degree. Updates can be performed in $O(\\log_{\\frac b 2} n)$ amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.05020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-13T21:51:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"5cf9d4b0b664082e9094652ec6a814ac2e1e24375b7d244d063b9f22ae162b6d","abstract_canon_sha256":"436b3d9cb9bc6bb800ea3d89272cbb438235d6d7f5266276dadb8817b317dd13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.610174Z","signature_b64":"6fpsvC6qHa7fjpiQVVuq3OWydlohMKKjzNjESYD8Lc41tku4tE2PTfQ0IQZJHnsjd1h+V3zxNR1ilG3Q8nvHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1613f711f6d4176e4051a4801bb3d4e8de03cfe8329358499571c7ed0846ef51","last_reissued_at":"2026-05-18T00:27:56.609559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.609559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"B-slack trees: Highly Space Efficient B-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Trevor Brown","submitted_at":"2017-12-13T21:51:02Z","abstract_excerpt":"B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store $n$ keys in height $O(\\log_b n)$, where $b$ is the maximum node degree. Updates can be performed in $O(\\log_{\\frac b 2} n)$ amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05020","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.05020","created_at":"2026-05-18T00:27:56.609657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05020v2","created_at":"2026-05-18T00:27:56.609657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05020","created_at":"2026-05-18T00:27:56.609657+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYJ7OEPW2QLW","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYJ7OEPW2QLW4QCR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYJ7OEPW","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D","json":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D.json","graph_json":"https://pith.science/api/pith-number/CYJ7OEPW2QLW4QCRUSABXM6U5D/graph.json","events_json":"https://pith.science/api/pith-number/CYJ7OEPW2QLW4QCRUSABXM6U5D/events.json","paper":"https://pith.science/paper/CYJ7OEPW"},"agent_actions":{"view_html":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D","download_json":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D.json","view_paper":"https://pith.science/paper/CYJ7OEPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05020&json=true","fetch_graph":"https://pith.science/api/pith-number/CYJ7OEPW2QLW4QCRUSABXM6U5D/graph.json","fetch_events":"https://pith.science/api/pith-number/CYJ7OEPW2QLW4QCRUSABXM6U5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D/action/storage_attestation","attest_author":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D/action/author_attestation","sign_citation":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D/action/citation_signature","submit_replication":"https://pith.science/pith/CYJ7OEPW2QLW4QCRUSABXM6U5D/action/replication_record"}},"created_at":"2026-05-18T00:27:56.609657+00:00","updated_at":"2026-05-18T00:27:56.609657+00:00"}