{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NBBSS45COCJ6DX6QBXCWSG3DJL","short_pith_number":"pith:NBBSS45C","canonical_record":{"source":{"id":"1603.04330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T16:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"5bda01b6103a100fc421bbf87850b598d099f21fea022faa614b02784083678e","abstract_canon_sha256":"08599117af1d1541e76e342b2967b4384801f20e9a58070dfd8e03d1de06ef66"},"schema_version":"1.0"},"canonical_sha256":"68432973a27093e1dfd00dc5691b634afbffca864ad736d1772bd9cfa5899384","source":{"kind":"arxiv","id":"1603.04330","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04330","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04330v2","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04330","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"NBBSS45COCJ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBBSS45COCJ6DX6Q","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBBSS45C","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NBBSS45COCJ6DX6QBXCWSG3DJL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T16:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"5bda01b6103a100fc421bbf87850b598d099f21fea022faa614b02784083678e","abstract_canon_sha256":"08599117af1d1541e76e342b2967b4384801f20e9a58070dfd8e03d1de06ef66"},"schema_version":"1.0"},"canonical_sha256":"68432973a27093e1dfd00dc5691b634afbffca864ad736d1772bd9cfa5899384","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:24.887719Z","signature_b64":"enEeDaeJyTrlg23PGVHJJrZBDiSitCOTNmB4BFcDHbexCZCPUwM8xlrp03hgTLrJJL3lFoO8EDJV/5s1mj8aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68432973a27093e1dfd00dc5691b634afbffca864ad736d1772bd9cfa5899384","last_reissued_at":"2026-05-18T01:18:24.887126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:24.887126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04330","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMkEruF7TyCe8db3ZFXeJrGshk1xF+cMA67Qzk2u0RA2DVESNtG/IOmmDEXvM639Daa3SeoZj+RyGZhD9yU8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:30:36.628521Z"},"content_sha256":"dc133f29dc5d58717bbdf991442dc29239c9a09d7d2fcb63615a8fbf53c04e63","schema_version":"1.0","event_id":"sha256:dc133f29dc5d58717bbdf991442dc29239c9a09d7d2fcb63615a8fbf53c04e63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NBBSS45COCJ6DX6QBXCWSG3DJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Scalable Construction of (Minimal Perfect Hash) Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe Ottaviano, Marco Genuzio, Sebastiano Vigna","submitted_at":"2016-03-14T16:28:06Z","abstract_excerpt":"Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques. The main obstruction for any practical application of these results is the cubic-time Gaussian elimination required to solve these linear systems: despite they can be made very small, the computation is still too slow to be feasible.\n  In this paper we describe in detail a number of heuristics and programming techniques to speed up the resolution o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04330","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-18T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+NlSNbi1f08ADWUJLj+z10uKKh52NjxPkREA+L0IAiybj6R3hJLJr8Ea6Vwgrdljnsyg3Qw8rD122DqvZ+IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:30:36.629171Z"},"content_sha256":"8a17cb9be3cae3217c56ef7546c3e10bf52083c68929967ccf43a14da20e2941","schema_version":"1.0","event_id":"sha256:8a17cb9be3cae3217c56ef7546c3e10bf52083c68929967ccf43a14da20e2941"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/bundle.json","state_url":"https://pith.science/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/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-06-10T22:30:36Z","links":{"resolver":"https://pith.science/pith/NBBSS45COCJ6DX6QBXCWSG3DJL","bundle":"https://pith.science/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/bundle.json","state":"https://pith.science/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBBSS45COCJ6DX6QBXCWSG3DJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NBBSS45COCJ6DX6QBXCWSG3DJL","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":"08599117af1d1541e76e342b2967b4384801f20e9a58070dfd8e03d1de06ef66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T16:28:06Z","title_canon_sha256":"5bda01b6103a100fc421bbf87850b598d099f21fea022faa614b02784083678e"},"schema_version":"1.0","source":{"id":"1603.04330","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04330","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04330v2","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04330","created_at":"2026-05-18T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"NBBSS45COCJ6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBBSS45COCJ6DX6Q","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBBSS45C","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8a17cb9be3cae3217c56ef7546c3e10bf52083c68929967ccf43a14da20e2941","target":"graph","created_at":"2026-05-18T01:18:24Z","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":"Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques. The main obstruction for any practical application of these results is the cubic-time Gaussian elimination required to solve these linear systems: despite they can be made very small, the computation is still too slow to be feasible.\n  In this paper we describe in detail a number of heuristics and programming techniques to speed up the resolution o","authors_text":"Giuseppe Ottaviano, Marco Genuzio, Sebastiano Vigna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T16:28:06Z","title":"Fast Scalable Construction of (Minimal Perfect Hash) Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04330","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:dc133f29dc5d58717bbdf991442dc29239c9a09d7d2fcb63615a8fbf53c04e63","target":"record","created_at":"2026-05-18T01:18:24Z","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":"08599117af1d1541e76e342b2967b4384801f20e9a58070dfd8e03d1de06ef66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T16:28:06Z","title_canon_sha256":"5bda01b6103a100fc421bbf87850b598d099f21fea022faa614b02784083678e"},"schema_version":"1.0","source":{"id":"1603.04330","kind":"arxiv","version":2}},"canonical_sha256":"68432973a27093e1dfd00dc5691b634afbffca864ad736d1772bd9cfa5899384","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68432973a27093e1dfd00dc5691b634afbffca864ad736d1772bd9cfa5899384","first_computed_at":"2026-05-18T01:18:24.887126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:24.887126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"enEeDaeJyTrlg23PGVHJJrZBDiSitCOTNmB4BFcDHbexCZCPUwM8xlrp03hgTLrJJL3lFoO8EDJV/5s1mj8aAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:24.887719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04330","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc133f29dc5d58717bbdf991442dc29239c9a09d7d2fcb63615a8fbf53c04e63","sha256:8a17cb9be3cae3217c56ef7546c3e10bf52083c68929967ccf43a14da20e2941"],"state_sha256":"31f696e7cf450d8ecf42b85891a6eed348ea94590d91acec1a171e60bad48ec2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQXnDf6o3LvzvNKrXUL/YyjCRTvugkMrCadnQGGH+nE0zylZtgwpS0wjrk911cijB6RsyN+mq4uXVkFPgyhsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:30:36.633334Z","bundle_sha256":"8ff25cf8d7f239cecc3248dc181e04387d06eedfedc41a01ec7a4c960829ea8d"}}