{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4GQJMETRTXRLRD256MKTBGYDIQ","short_pith_number":"pith:4GQJMETR","canonical_record":{"source":{"id":"1703.00667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T08:37:37Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"9187fd4e37e539dec086d1d9031d6b720b33caf581cf834a9e15b4e03461e74a","abstract_canon_sha256":"a836d879b5ab3e08f53d0cde4a0da8f00e000e1c61e07320285988eb509dc6f8"},"schema_version":"1.0"},"canonical_sha256":"e1a09612719de2b88f5df315309b03440851d7b030a4e4e6425d245e7d18399b","source":{"kind":"arxiv","id":"1703.00667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00667","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00667v2","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00667","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"4GQJMETRTXRL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GQJMETRTXRLRD25","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GQJMETR","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4GQJMETRTXRLRD256MKTBGYDIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T08:37:37Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"9187fd4e37e539dec086d1d9031d6b720b33caf581cf834a9e15b4e03461e74a","abstract_canon_sha256":"a836d879b5ab3e08f53d0cde4a0da8f00e000e1c61e07320285988eb509dc6f8"},"schema_version":"1.0"},"canonical_sha256":"e1a09612719de2b88f5df315309b03440851d7b030a4e4e6425d245e7d18399b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:00.602269Z","signature_b64":"3LxxcRcTn79tf5JR5xkI3nqxwLNH/aUqqrqLWpVLH03bvp/QL/FV3cWICX4UeNdDfI/xzaoIiqz8yeNZUKyVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1a09612719de2b88f5df315309b03440851d7b030a4e4e6425d245e7d18399b","last_reissued_at":"2026-05-18T00:48:00.601698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:00.601698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00667","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:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjUHSxC9Drd4R/1TkQs9gDKCykzQxuYVKs9OJBnh1114hOkTdDVJqLU9pMUBr8pmNWWMMK01Yjn40w9PpbHICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:49:53.792767Z"},"content_sha256":"dc7d68e07cfb773a401a2734b92bcf963da29dac40499d86aa9c3b4507eef5c7","schema_version":"1.0","event_id":"sha256:dc7d68e07cfb773a401a2734b92bcf963da29dac40499d86aa9c3b4507eef5c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4GQJMETRTXRLRD256MKTBGYDIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A resource-frugal probabilistic dictionary and applications in bioinformatics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Antoine Limasset, Camille Marchet, Lolita Lecompte, Lucie Bittner, Pierre Peterlongo","submitted_at":"2017-03-02T08:37:37Z","abstract_excerpt":"Indexing massive data sets is extremely expensive for large scale problems. In many fields, huge amounts of data are currently generated, however extracting meaningful information from voluminous data sets, such as computing similarity between elements, is far from being trivial. It remains nonetheless a fundamental need. This work proposes a probabilistic data structure based on a minimal perfect hash function for indexing large sets of keys. Our structure out-compete the hash table for construction, query times and for memory usage, in the case of the indexation of a static set. To illustrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00667","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:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdiZtaRDQJk09vZgi2Y/N4irwLYG0phb45L9j7mF50gtf+zIiYp/qm0+8YD4bdsi+YJr3xpsuqiRAc2rSh82Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:49:53.793512Z"},"content_sha256":"1a9636d017617e2f09296c685e4d00217564abadb8b6a1ee7122bbbbfff99891","schema_version":"1.0","event_id":"sha256:1a9636d017617e2f09296c685e4d00217564abadb8b6a1ee7122bbbbfff99891"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GQJMETRTXRLRD256MKTBGYDIQ/bundle.json","state_url":"https://pith.science/pith/4GQJMETRTXRLRD256MKTBGYDIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GQJMETRTXRLRD256MKTBGYDIQ/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-27T20:49:53Z","links":{"resolver":"https://pith.science/pith/4GQJMETRTXRLRD256MKTBGYDIQ","bundle":"https://pith.science/pith/4GQJMETRTXRLRD256MKTBGYDIQ/bundle.json","state":"https://pith.science/pith/4GQJMETRTXRLRD256MKTBGYDIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GQJMETRTXRLRD256MKTBGYDIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4GQJMETRTXRLRD256MKTBGYDIQ","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":"a836d879b5ab3e08f53d0cde4a0da8f00e000e1c61e07320285988eb509dc6f8","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T08:37:37Z","title_canon_sha256":"9187fd4e37e539dec086d1d9031d6b720b33caf581cf834a9e15b4e03461e74a"},"schema_version":"1.0","source":{"id":"1703.00667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00667","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00667v2","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00667","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"4GQJMETRTXRL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4GQJMETRTXRLRD25","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4GQJMETR","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:1a9636d017617e2f09296c685e4d00217564abadb8b6a1ee7122bbbbfff99891","target":"graph","created_at":"2026-05-18T00:48:00Z","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":"Indexing massive data sets is extremely expensive for large scale problems. In many fields, huge amounts of data are currently generated, however extracting meaningful information from voluminous data sets, such as computing similarity between elements, is far from being trivial. It remains nonetheless a fundamental need. This work proposes a probabilistic data structure based on a minimal perfect hash function for indexing large sets of keys. Our structure out-compete the hash table for construction, query times and for memory usage, in the case of the indexation of a static set. To illustrat","authors_text":"Antoine Limasset, Camille Marchet, Lolita Lecompte, Lucie Bittner, Pierre Peterlongo","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T08:37:37Z","title":"A resource-frugal probabilistic dictionary and applications in bioinformatics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00667","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:dc7d68e07cfb773a401a2734b92bcf963da29dac40499d86aa9c3b4507eef5c7","target":"record","created_at":"2026-05-18T00:48:00Z","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":"a836d879b5ab3e08f53d0cde4a0da8f00e000e1c61e07320285988eb509dc6f8","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T08:37:37Z","title_canon_sha256":"9187fd4e37e539dec086d1d9031d6b720b33caf581cf834a9e15b4e03461e74a"},"schema_version":"1.0","source":{"id":"1703.00667","kind":"arxiv","version":2}},"canonical_sha256":"e1a09612719de2b88f5df315309b03440851d7b030a4e4e6425d245e7d18399b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1a09612719de2b88f5df315309b03440851d7b030a4e4e6425d245e7d18399b","first_computed_at":"2026-05-18T00:48:00.601698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:00.601698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3LxxcRcTn79tf5JR5xkI3nqxwLNH/aUqqrqLWpVLH03bvp/QL/FV3cWICX4UeNdDfI/xzaoIiqz8yeNZUKyVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:00.602269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc7d68e07cfb773a401a2734b92bcf963da29dac40499d86aa9c3b4507eef5c7","sha256:1a9636d017617e2f09296c685e4d00217564abadb8b6a1ee7122bbbbfff99891"],"state_sha256":"37faa477825be532753e9e68a2054d9ebce7cd774a7037ddf57232b9ec4be6bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHWjkypibXo54V+uEzNuPri92CWOID8GnxhE/AT8ZAlMOk083/HGTpVJgS+qPWLGXVDld2iMyOmX+9+O78ywCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:49:53.796783Z","bundle_sha256":"640941f64404dafa5bf83123534b80d8dadc7a96721dfe95e95e98dd890ebd59"}}