{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CJC7YF7AKFJJAIK53L53LBALWJ","short_pith_number":"pith:CJC7YF7A","canonical_record":{"source":{"id":"1208.0290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"58a0eed9c23a38a8b7ee354aee451c28a7d922ffdf37c01960d1cfa7b12ae3a7","abstract_canon_sha256":"31cda8be8b00a2d1e8304865ef8102e61e635ee654435c64755b17ecda3f278e"},"schema_version":"1.0"},"canonical_sha256":"1245fc17e0515290215ddafbb5840bb240ef54e41655318dd900684033258ce6","source":{"kind":"arxiv","id":"1208.0290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0290","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0290v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0290","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"CJC7YF7AKFJJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJC7YF7AKFJJAIK5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJC7YF7A","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CJC7YF7AKFJJAIK53L53LBALWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:23Z","cross_cats_sorted":[],"title_canon_sha256":"58a0eed9c23a38a8b7ee354aee451c28a7d922ffdf37c01960d1cfa7b12ae3a7","abstract_canon_sha256":"31cda8be8b00a2d1e8304865ef8102e61e635ee654435c64755b17ecda3f278e"},"schema_version":"1.0"},"canonical_sha256":"1245fc17e0515290215ddafbb5840bb240ef54e41655318dd900684033258ce6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:35.451310Z","signature_b64":"JZoV/nTk94SFuz7gf+r1jBHhkEnTaEx+7iOm3QDTPFEPXMvyn2nWDTEKSOCtl5zXUbf8xZ3qXevEfSlr9sebAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1245fc17e0515290215ddafbb5840bb240ef54e41655318dd900684033258ce6","last_reissued_at":"2026-05-18T03:49:35.450769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:35.450769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0290","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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qqsxp8oVJMnNFxyWlTBKefpyVDAhNZqYIUh05DZeOA239SDnaknFvlf/TPg3L/r6x1Gg3uYFDkJlNuyRZE+RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:12:57.478864Z"},"content_sha256":"f3e3ba1a6343c453532f8961267dcdc339a7072dd17682e9914c5659969f89c7","schema_version":"1.0","event_id":"sha256:f3e3ba1a6343c453532f8961267dcdc339a7072dd17682e9914c5659969f89c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CJC7YF7AKFJJAIK53L53LBALWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Don't Thrash: How to Cache Your Hash on Flash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bradley C. Kuszmaul, Dzejla Medjedovic, Erez Zadok, Martin Farach-Colton, Michael A. Bender, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Rob Johnson, Russell Kraner","submitted_at":"2012-08-01T17:21:23Z","abstract_excerpt":"This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has found wide application in databases, storage systems, and networks. Because the Bloom filter performs frequent random reads and writes, it is used almost exclusively in RAM, limiting the size of the sets it can represent. This paper first describes the quotient filter, which supports the basic operations of the Bloom filter, achieving roughly comparable performance in terms of space and time, but with better data loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0290","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-18T03:49:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBq6A9jgtLzy6HIcUja2lOLBynsNeTcJH3AlMAnPrQmrM+N2VhzZbeAwsnEMk/velVjjRg2NkSoB0eo7+y6SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:12:57.479625Z"},"content_sha256":"b4b2dfcc0300c32a804de49283275dc43ce97b99fea6547d44316fc173b12df6","schema_version":"1.0","event_id":"sha256:b4b2dfcc0300c32a804de49283275dc43ce97b99fea6547d44316fc173b12df6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJC7YF7AKFJJAIK53L53LBALWJ/bundle.json","state_url":"https://pith.science/pith/CJC7YF7AKFJJAIK53L53LBALWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJC7YF7AKFJJAIK53L53LBALWJ/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-30T04:12:57Z","links":{"resolver":"https://pith.science/pith/CJC7YF7AKFJJAIK53L53LBALWJ","bundle":"https://pith.science/pith/CJC7YF7AKFJJAIK53L53LBALWJ/bundle.json","state":"https://pith.science/pith/CJC7YF7AKFJJAIK53L53LBALWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJC7YF7AKFJJAIK53L53LBALWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CJC7YF7AKFJJAIK53L53LBALWJ","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":"31cda8be8b00a2d1e8304865ef8102e61e635ee654435c64755b17ecda3f278e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:23Z","title_canon_sha256":"58a0eed9c23a38a8b7ee354aee451c28a7d922ffdf37c01960d1cfa7b12ae3a7"},"schema_version":"1.0","source":{"id":"1208.0290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0290","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0290v1","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0290","created_at":"2026-05-18T03:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"CJC7YF7AKFJJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CJC7YF7AKFJJAIK5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CJC7YF7A","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:b4b2dfcc0300c32a804de49283275dc43ce97b99fea6547d44316fc173b12df6","target":"graph","created_at":"2026-05-18T03:49: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":"This paper presents new alternatives to the well-known Bloom filter data structure. The Bloom filter, a compact data structure supporting set insertion and membership queries, has found wide application in databases, storage systems, and networks. Because the Bloom filter performs frequent random reads and writes, it is used almost exclusively in RAM, limiting the size of the sets it can represent. This paper first describes the quotient filter, which supports the basic operations of the Bloom filter, achieving roughly comparable performance in terms of space and time, but with better data loc","authors_text":"Bradley C. Kuszmaul, Dzejla Medjedovic, Erez Zadok, Martin Farach-Colton, Michael A. Bender, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Rob Johnson, Russell Kraner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:23Z","title":"Don't Thrash: How to Cache Your Hash on Flash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0290","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:f3e3ba1a6343c453532f8961267dcdc339a7072dd17682e9914c5659969f89c7","target":"record","created_at":"2026-05-18T03:49: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":"31cda8be8b00a2d1e8304865ef8102e61e635ee654435c64755b17ecda3f278e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T17:21:23Z","title_canon_sha256":"58a0eed9c23a38a8b7ee354aee451c28a7d922ffdf37c01960d1cfa7b12ae3a7"},"schema_version":"1.0","source":{"id":"1208.0290","kind":"arxiv","version":1}},"canonical_sha256":"1245fc17e0515290215ddafbb5840bb240ef54e41655318dd900684033258ce6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1245fc17e0515290215ddafbb5840bb240ef54e41655318dd900684033258ce6","first_computed_at":"2026-05-18T03:49:35.450769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:35.450769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JZoV/nTk94SFuz7gf+r1jBHhkEnTaEx+7iOm3QDTPFEPXMvyn2nWDTEKSOCtl5zXUbf8xZ3qXevEfSlr9sebAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:35.451310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e3ba1a6343c453532f8961267dcdc339a7072dd17682e9914c5659969f89c7","sha256:b4b2dfcc0300c32a804de49283275dc43ce97b99fea6547d44316fc173b12df6"],"state_sha256":"69fe57ff6e33c8f43b9268f60ecb91fc3915a22c10dc523b6c9f4b1a8ad058b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIpX2LyPaT/PDal4Ay2CkbaW3soQKjd8CO/bRSMTHMz/gd2RrgYoyFHBxFVKHnEM2PjYBJBM5zD7h6/vgIQjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:12:57.483713Z","bundle_sha256":"5ddc32f5aa24e6c8ee19298ec3486331ca9d9461fdd1fe22d8f949f8f856f868"}}