{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AKJ32JD422RGLDOOOVTQ4P3V6S","short_pith_number":"pith:AKJ32JD4","schema_version":"1.0","canonical_sha256":"0293bd247cd6a2658dce75670e3f75f49783c41c365ddf8ba56aa5042c826c1c","source":{"kind":"arxiv","id":"1307.5899","version":2},"attestation_state":"computed","paper":{"title":"Optimal Hierarchical Layouts for Cache-Oblivious Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deepak Rajan, Peter Lindstrom","submitted_at":"2013-07-22T21:41:44Z","abstract_excerpt":"This paper proposes a general framework for generating cache-oblivious layouts for binary search trees. A cache-oblivious layout attempts to minimize cache misses on any hierarchical memory, independent of the number of memory levels and attributes at each level such as cache size, line size, and replacement policy. Recursively partitioning a tree into contiguous subtrees and prescribing an ordering amongst the subtrees, Hierarchical Layouts generalize many commonly used layouts for trees such as in-order, pre-order and breadth-first. They also generalize the various flavors of the van Emde Bo"},"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":"1307.5899","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-22T21:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"69c8e3e61ace8fac903f38ef531533ea5740f3309ffb40ffeb35264b6e28e12d","abstract_canon_sha256":"749f6337e5e94b7524b7fa21cd862f21645755975323292e316bd9485bf20393"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:33.620158Z","signature_b64":"liU8wkr+eoqNPwDCNS89GzdqGEVOOorBj8dV7pnngulcTu2IPS1C2QNC2V1jJNKNFjje05txdNatD1it5YocAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0293bd247cd6a2658dce75670e3f75f49783c41c365ddf8ba56aa5042c826c1c","last_reissued_at":"2026-05-18T03:17:33.619725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:33.619725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Hierarchical Layouts for Cache-Oblivious Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deepak Rajan, Peter Lindstrom","submitted_at":"2013-07-22T21:41:44Z","abstract_excerpt":"This paper proposes a general framework for generating cache-oblivious layouts for binary search trees. A cache-oblivious layout attempts to minimize cache misses on any hierarchical memory, independent of the number of memory levels and attributes at each level such as cache size, line size, and replacement policy. Recursively partitioning a tree into contiguous subtrees and prescribing an ordering amongst the subtrees, Hierarchical Layouts generalize many commonly used layouts for trees such as in-order, pre-order and breadth-first. They also generalize the various flavors of the van Emde Bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5899","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":"1307.5899","created_at":"2026-05-18T03:17:33.619789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5899v2","created_at":"2026-05-18T03:17:33.619789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5899","created_at":"2026-05-18T03:17:33.619789+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKJ32JD422RG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKJ32JD422RGLDOO","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKJ32JD4","created_at":"2026-05-18T12:27:38.830355+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/AKJ32JD422RGLDOOOVTQ4P3V6S","json":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S.json","graph_json":"https://pith.science/api/pith-number/AKJ32JD422RGLDOOOVTQ4P3V6S/graph.json","events_json":"https://pith.science/api/pith-number/AKJ32JD422RGLDOOOVTQ4P3V6S/events.json","paper":"https://pith.science/paper/AKJ32JD4"},"agent_actions":{"view_html":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S","download_json":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S.json","view_paper":"https://pith.science/paper/AKJ32JD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5899&json=true","fetch_graph":"https://pith.science/api/pith-number/AKJ32JD422RGLDOOOVTQ4P3V6S/graph.json","fetch_events":"https://pith.science/api/pith-number/AKJ32JD422RGLDOOOVTQ4P3V6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S/action/storage_attestation","attest_author":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S/action/author_attestation","sign_citation":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S/action/citation_signature","submit_replication":"https://pith.science/pith/AKJ32JD422RGLDOOOVTQ4P3V6S/action/replication_record"}},"created_at":"2026-05-18T03:17:33.619789+00:00","updated_at":"2026-05-18T03:17:33.619789+00:00"}