{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K47SYQA2KOVOA2OR2GSNP3B45W","short_pith_number":"pith:K47SYQA2","schema_version":"1.0","canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","source":{"kind":"arxiv","id":"1907.01631","version":1},"attestation_state":"computed","paper":{"title":"Cache-Friendly Search Trees; or, In Which Everything Beats std::set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Brian Zhang, Jeffrey Barratt","submitted_at":"2019-07-02T20:55:47Z","abstract_excerpt":"While a lot of work in theoretical computer science has gone into optimizing the runtime and space usage of data structures, such work very often neglects a very important component of modern computers: the cache. In doing so, very often, data structures are developed that achieve theoretically-good runtimes but are slow in practice due to a large number of cache misses. In 1999, Frigo et al. introduced the notion of a cache-oblivious algorithm: an algorithm that uses the cache to its advantage, regardless of the size or structure of said cache. Since then, various authors have designed cache-"},"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":"1907.01631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-02T20:55:47Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"004dbf0e2be11d78ffc30a9a2eaf7e20ef09895f6b147a6ab5a971defa9bdcc2","abstract_canon_sha256":"843f5ed4451bcb02b3e9ffceb21659e84c4b63baf36d9d98785dbcb213bcd699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:35.705726Z","signature_b64":"OW9VdAJyWB1AOQgs2cq0QnXnuan36slPztTjifIrP8KXn4cR4ovP3ueKrHdwU+ZJrAI1tZhdPU61V2BsJmBfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","last_reissued_at":"2026-05-17T23:41:35.705052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:35.705052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Friendly Search Trees; or, In Which Everything Beats std::set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Brian Zhang, Jeffrey Barratt","submitted_at":"2019-07-02T20:55:47Z","abstract_excerpt":"While a lot of work in theoretical computer science has gone into optimizing the runtime and space usage of data structures, such work very often neglects a very important component of modern computers: the cache. In doing so, very often, data structures are developed that achieve theoretically-good runtimes but are slow in practice due to a large number of cache misses. In 1999, Frigo et al. introduced the notion of a cache-oblivious algorithm: an algorithm that uses the cache to its advantage, regardless of the size or structure of said cache. Since then, various authors have designed cache-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01631","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.01631","created_at":"2026-05-17T23:41:35.705160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01631v1","created_at":"2026-05-17T23:41:35.705160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01631","created_at":"2026-05-17T23:41:35.705160+00:00"},{"alias_kind":"pith_short_12","alias_value":"K47SYQA2KOVO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K47SYQA2KOVOA2OR","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K47SYQA2","created_at":"2026-05-18T12:33:21.387695+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/K47SYQA2KOVOA2OR2GSNP3B45W","json":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W.json","graph_json":"https://pith.science/api/pith-number/K47SYQA2KOVOA2OR2GSNP3B45W/graph.json","events_json":"https://pith.science/api/pith-number/K47SYQA2KOVOA2OR2GSNP3B45W/events.json","paper":"https://pith.science/paper/K47SYQA2"},"agent_actions":{"view_html":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W","download_json":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W.json","view_paper":"https://pith.science/paper/K47SYQA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01631&json=true","fetch_graph":"https://pith.science/api/pith-number/K47SYQA2KOVOA2OR2GSNP3B45W/graph.json","fetch_events":"https://pith.science/api/pith-number/K47SYQA2KOVOA2OR2GSNP3B45W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/action/storage_attestation","attest_author":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/action/author_attestation","sign_citation":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/action/citation_signature","submit_replication":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/action/replication_record"}},"created_at":"2026-05-17T23:41:35.705160+00:00","updated_at":"2026-05-17T23:41:35.705160+00:00"}