{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:K47SYQA2KOVOA2OR2GSNP3B45W","short_pith_number":"pith:K47SYQA2","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"},"canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","source":{"kind":"arxiv","id":"1907.01631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01631","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01631v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01631","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"K47SYQA2KOVO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K47SYQA2KOVOA2OR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K47SYQA2","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:K47SYQA2KOVOA2OR2GSNP3B45W","target":"record","payload":{"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"},"canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","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"},"source_kind":"arxiv","source_id":"1907.01631","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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ei5mlDdf70eGZHKPwCd5djlYcS8SMp2n/K1a0okRbOXloMK/OqNwcvfxS6TkzQGNVAdGuVE5mNUjuzOFNWZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:06.128729Z"},"content_sha256":"1322724e2beb5e32984db4a6485358aa802cb259d51f03d1ff4d9cdcd06695af","schema_version":"1.0","event_id":"sha256:1322724e2beb5e32984db4a6485358aa802cb259d51f03d1ff4d9cdcd06695af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:K47SYQA2KOVOA2OR2GSNP3B45W","target":"graph","payload":{"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"},"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:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3HEFHF56KTEsxKd3Deh7252n1qxlz20kGA4WhFnYERaEKzc3Oxu49mjt6EU1ZGI9oX6LrWnE3vOxW6jVWxmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:06.129469Z"},"content_sha256":"b05666f312853f86f4bfa61c0a0acaa2748349bc56a2a142c3860f8e57232294","schema_version":"1.0","event_id":"sha256:b05666f312853f86f4bfa61c0a0acaa2748349bc56a2a142c3860f8e57232294"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/bundle.json","state_url":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K47SYQA2KOVOA2OR2GSNP3B45W/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-05-27T16:50:06Z","links":{"resolver":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W","bundle":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/bundle.json","state":"https://pith.science/pith/K47SYQA2KOVOA2OR2GSNP3B45W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K47SYQA2KOVOA2OR2GSNP3B45W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:K47SYQA2KOVOA2OR2GSNP3B45W","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":"843f5ed4451bcb02b3e9ffceb21659e84c4b63baf36d9d98785dbcb213bcd699","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-02T20:55:47Z","title_canon_sha256":"004dbf0e2be11d78ffc30a9a2eaf7e20ef09895f6b147a6ab5a971defa9bdcc2"},"schema_version":"1.0","source":{"id":"1907.01631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01631","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01631v1","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01631","created_at":"2026-05-17T23:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"K47SYQA2KOVO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"K47SYQA2KOVOA2OR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"K47SYQA2","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:b05666f312853f86f4bfa61c0a0acaa2748349bc56a2a142c3860f8e57232294","target":"graph","created_at":"2026-05-17T23:41:35Z","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":"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-","authors_text":"Brian Zhang, Jeffrey Barratt","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-02T20:55:47Z","title":"Cache-Friendly Search Trees; or, In Which Everything Beats std::set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01631","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:1322724e2beb5e32984db4a6485358aa802cb259d51f03d1ff4d9cdcd06695af","target":"record","created_at":"2026-05-17T23:41:35Z","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":"843f5ed4451bcb02b3e9ffceb21659e84c4b63baf36d9d98785dbcb213bcd699","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-02T20:55:47Z","title_canon_sha256":"004dbf0e2be11d78ffc30a9a2eaf7e20ef09895f6b147a6ab5a971defa9bdcc2"},"schema_version":"1.0","source":{"id":"1907.01631","kind":"arxiv","version":1}},"canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"573f2c401a53aae069d1d1a4d7ec3ced8fda69f5a1ac1c7008f50b6100e5b615","first_computed_at":"2026-05-17T23:41:35.705052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:35.705052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OW9VdAJyWB1AOQgs2cq0QnXnuan36slPztTjifIrP8KXn4cR4ovP3ueKrHdwU+ZJrAI1tZhdPU61V2BsJmBfAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:35.705726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1322724e2beb5e32984db4a6485358aa802cb259d51f03d1ff4d9cdcd06695af","sha256:b05666f312853f86f4bfa61c0a0acaa2748349bc56a2a142c3860f8e57232294"],"state_sha256":"889f81d85c35f77f35bead996c680889b09e6829c3ef5d77383279ef9bdb9b7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27EZvZhvoO4Z6aKqiOxJh0D6y+1k6DS/Hr6ACkyQn6Zu0HaTUXRS3gnCP513wNSVbAdAFWFe2IUFHX5CfilHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:50:06.133176Z","bundle_sha256":"3312f1df8ec04a5873b6c3b1804e23f002a04311ce47b64aeab63cded350ec4a"}}