{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MSKVOQJHK3CUMXHSCLQTKXCRPK","short_pith_number":"pith:MSKVOQJH","canonical_record":{"source":{"id":"1702.03154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T12:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"d66c51f994d9cc793abce54734455836418ee455133fec168dbc32381b8a3559","abstract_canon_sha256":"fdae7dcef4ef9ed74d0ef27fdaa1e710d1402770f547e505f6b35b32359716ed"},"schema_version":"1.0"},"canonical_sha256":"649557412756c5465cf212e1355c517aa6940796bc0f4b1c8653d1eb4ee85383","source":{"kind":"arxiv","id":"1702.03154","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03154","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03154v2","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03154","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"MSKVOQJHK3CU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MSKVOQJHK3CUMXHS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MSKVOQJH","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MSKVOQJHK3CUMXHSCLQTKXCRPK","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03154","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T12:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"d66c51f994d9cc793abce54734455836418ee455133fec168dbc32381b8a3559","abstract_canon_sha256":"fdae7dcef4ef9ed74d0ef27fdaa1e710d1402770f547e505f6b35b32359716ed"},"schema_version":"1.0"},"canonical_sha256":"649557412756c5465cf212e1355c517aa6940796bc0f4b1c8653d1eb4ee85383","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.219628Z","signature_b64":"cg7oqykeymDIKH0WCZV8uqj/mmCiZOKm5mvv1JEYe7kgUQLuQ9wT7ksLF9KzJfL7dl11VzJQhY66xqnCMPU5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"649557412756c5465cf212e1355c517aa6940796bc0f4b1c8653d1eb4ee85383","last_reissued_at":"2026-05-18T00:01:39.219202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.219202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03154","source_version":2,"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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsQAiGRt/NXV/0CiQTF2SrcqUMs15SuGu25AFFCSxVJZSHS03w3GD5Jo8y1TDZ3w/m8jDKg1g4poglEujuN3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:50:12.272898Z"},"content_sha256":"67809a7494b3d3301ee854183df680312e39f32c06c683dfe6f5f18c34a82f03","schema_version":"1.0","event_id":"sha256:67809a7494b3d3301ee854183df680312e39f32c06c683dfe6f5f18c34a82f03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MSKVOQJHK3CUMXHSCLQTKXCRPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and scalable minimal perfect hashing for massive key sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antoine Limasset, Guillaume Rizk, Pierre Peterlongo, Rayan Chikhi","submitted_at":"2017-02-10T12:51:54Z","abstract_excerpt":"Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art, especially in terms of construction time and memory usage. We provide a parallel C++ implementation called BBhash. It is capable of creating a minimal perfect hash function of $10^{10}$ elements in less"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03154","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"},"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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGhFID3pfkV0xl4s62pJIkRQtMZ0gqrl1cq9QU9aD7aHpYIHF76GEALleVVPOPML6wO1T4D/oqDSozrmpW9VAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:50:12.273539Z"},"content_sha256":"c9a036718bc174003462a018f743c267704b77c516e47c4fe66f2b3435fa4d5e","schema_version":"1.0","event_id":"sha256:c9a036718bc174003462a018f743c267704b77c516e47c4fe66f2b3435fa4d5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/bundle.json","state_url":"https://pith.science/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/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-24T14:50:12Z","links":{"resolver":"https://pith.science/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK","bundle":"https://pith.science/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/bundle.json","state":"https://pith.science/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSKVOQJHK3CUMXHSCLQTKXCRPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MSKVOQJHK3CUMXHSCLQTKXCRPK","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":"fdae7dcef4ef9ed74d0ef27fdaa1e710d1402770f547e505f6b35b32359716ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T12:51:54Z","title_canon_sha256":"d66c51f994d9cc793abce54734455836418ee455133fec168dbc32381b8a3559"},"schema_version":"1.0","source":{"id":"1702.03154","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03154","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03154v2","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03154","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"MSKVOQJHK3CU","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MSKVOQJHK3CUMXHS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MSKVOQJH","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:c9a036718bc174003462a018f743c267704b77c516e47c4fe66f2b3435fa4d5e","target":"graph","created_at":"2026-05-18T00:01:39Z","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":"Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art, especially in terms of construction time and memory usage. We provide a parallel C++ implementation called BBhash. It is capable of creating a minimal perfect hash function of $10^{10}$ elements in less","authors_text":"Antoine Limasset, Guillaume Rizk, Pierre Peterlongo, Rayan Chikhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T12:51:54Z","title":"Fast and scalable minimal perfect hashing for massive key sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03154","kind":"arxiv","version":2},"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:67809a7494b3d3301ee854183df680312e39f32c06c683dfe6f5f18c34a82f03","target":"record","created_at":"2026-05-18T00:01:39Z","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":"fdae7dcef4ef9ed74d0ef27fdaa1e710d1402770f547e505f6b35b32359716ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-10T12:51:54Z","title_canon_sha256":"d66c51f994d9cc793abce54734455836418ee455133fec168dbc32381b8a3559"},"schema_version":"1.0","source":{"id":"1702.03154","kind":"arxiv","version":2}},"canonical_sha256":"649557412756c5465cf212e1355c517aa6940796bc0f4b1c8653d1eb4ee85383","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"649557412756c5465cf212e1355c517aa6940796bc0f4b1c8653d1eb4ee85383","first_computed_at":"2026-05-18T00:01:39.219202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.219202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cg7oqykeymDIKH0WCZV8uqj/mmCiZOKm5mvv1JEYe7kgUQLuQ9wT7ksLF9KzJfL7dl11VzJQhY66xqnCMPU5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.219628Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03154","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67809a7494b3d3301ee854183df680312e39f32c06c683dfe6f5f18c34a82f03","sha256:c9a036718bc174003462a018f743c267704b77c516e47c4fe66f2b3435fa4d5e"],"state_sha256":"76b82c3cb5b3cadfc18c2d8697f3394e944685a75f72629327541230b538ded2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVCeQ4DAPaz9N1StmJYgzxNGrFeQq72ToTx017CjyrqanHjH7Qv1//lSs3MMyCpLeIU0WOedSyBFx8+0G5qNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:50:12.276205Z","bundle_sha256":"62f742b590de2f63809f3f08618c2133b94158799cc7273e7a4b8a646480ac92"}}