{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XKQ3MIRCQ2CZBWJQKR3R6GZPGB","short_pith_number":"pith:XKQ3MIRC","canonical_record":{"source":{"id":"1608.02413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-08T12:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"60482d25a8402bfdc5fa83a63e33dd93a45be814a573ee719d045e6e4e1c3eb9","abstract_canon_sha256":"283d12dab40983631d24ed5c2c36592ff67cd384433ee78fafae6382b332f045"},"schema_version":"1.0"},"canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","source":{"kind":"arxiv","id":"1608.02413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02413","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02413v2","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02413","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"XKQ3MIRCQ2CZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKQ3MIRCQ2CZBWJQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKQ3MIRC","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XKQ3MIRCQ2CZBWJQKR3R6GZPGB","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-08T12:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"60482d25a8402bfdc5fa83a63e33dd93a45be814a573ee719d045e6e4e1c3eb9","abstract_canon_sha256":"283d12dab40983631d24ed5c2c36592ff67cd384433ee78fafae6382b332f045"},"schema_version":"1.0"},"canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:03.865030Z","signature_b64":"GjbVj9x3vZWi5nxcjBKz7to/8QU9dbNA5+rWOMofnT6TYVqJnf350DZsGkNv0pspk9XYAT1KTgD9AE4gQZDHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","last_reissued_at":"2026-05-18T00:58:03.864540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:03.864540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02413","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1HZFXpSKAwC/C7FttHwTARViyJkL5EJdwkFAA2OqejuMVXyVk6nOx0ENeV7hbyGfadUa6CKXUQf2TeWsJhJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:55.566854Z"},"content_sha256":"368b33205b4a245bd0da1d7eb3caf340e91b04bb45f3e7f85d5dfed9c45d35b2","schema_version":"1.0","event_id":"sha256:368b33205b4a245bd0da1d7eb3caf340e91b04bb45f3e7f85d5dfed9c45d35b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XKQ3MIRCQ2CZBWJQKR3R6GZPGB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EPR-dictionaries: A practical and fast data structure for constant time searches in unidirectional and bidirectional FM-indices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Pockrandt, Knut Reinert, Marcel Ehrhardt","submitted_at":"2016-08-08T12:47:27Z","abstract_excerpt":"We introduce a new, practical method for conducting an exact search in a uni- and bidirectional FM index in $O(1)$ time per step while using $O(\\log \\sigma * n) + o(\\log \\sigma * \\sigma * n)$ bits of space. This is done by replacing the binary wavelet tree by a new data structure, the Enhanced Prefixsum Rank dictionary (EPR-dictionary). We implemented this method in the SeqAn C++ library and experimentally validated our theoretical results. In addition we compared our implementation with other freely available implementations of bidirectional indices and show that we are between $\\approx 2.6-4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02413","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJZB6iVbibrxoWoofjknjV3YzOkBrbmAvQuUkYSuecKHnlLWdfi8FyOmdH+fbGqxu2SnUHbA/ttWh5gbBk33Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:55.567551Z"},"content_sha256":"c8c0f8526666bb7affea8606eea00b998770be7802e69e75686078decb11df9d","schema_version":"1.0","event_id":"sha256:c8c0f8526666bb7affea8606eea00b998770be7802e69e75686078decb11df9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/bundle.json","state_url":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/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-27T07:31:55Z","links":{"resolver":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB","bundle":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/bundle.json","state":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XKQ3MIRCQ2CZBWJQKR3R6GZPGB","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":"283d12dab40983631d24ed5c2c36592ff67cd384433ee78fafae6382b332f045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-08T12:47:27Z","title_canon_sha256":"60482d25a8402bfdc5fa83a63e33dd93a45be814a573ee719d045e6e4e1c3eb9"},"schema_version":"1.0","source":{"id":"1608.02413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02413","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02413v2","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02413","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"XKQ3MIRCQ2CZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XKQ3MIRCQ2CZBWJQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XKQ3MIRC","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c8c0f8526666bb7affea8606eea00b998770be7802e69e75686078decb11df9d","target":"graph","created_at":"2026-05-18T00:58:03Z","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":"We introduce a new, practical method for conducting an exact search in a uni- and bidirectional FM index in $O(1)$ time per step while using $O(\\log \\sigma * n) + o(\\log \\sigma * \\sigma * n)$ bits of space. This is done by replacing the binary wavelet tree by a new data structure, the Enhanced Prefixsum Rank dictionary (EPR-dictionary). We implemented this method in the SeqAn C++ library and experimentally validated our theoretical results. In addition we compared our implementation with other freely available implementations of bidirectional indices and show that we are between $\\approx 2.6-4","authors_text":"Christopher Pockrandt, Knut Reinert, Marcel Ehrhardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-08T12:47:27Z","title":"EPR-dictionaries: A practical and fast data structure for constant time searches in unidirectional and bidirectional FM-indices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02413","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:368b33205b4a245bd0da1d7eb3caf340e91b04bb45f3e7f85d5dfed9c45d35b2","target":"record","created_at":"2026-05-18T00:58:03Z","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":"283d12dab40983631d24ed5c2c36592ff67cd384433ee78fafae6382b332f045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-08T12:47:27Z","title_canon_sha256":"60482d25a8402bfdc5fa83a63e33dd93a45be814a573ee719d045e6e4e1c3eb9"},"schema_version":"1.0","source":{"id":"1608.02413","kind":"arxiv","version":2}},"canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","first_computed_at":"2026-05-18T00:58:03.864540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:03.864540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjbVj9x3vZWi5nxcjBKz7to/8QU9dbNA5+rWOMofnT6TYVqJnf350DZsGkNv0pspk9XYAT1KTgD9AE4gQZDHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:03.865030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:368b33205b4a245bd0da1d7eb3caf340e91b04bb45f3e7f85d5dfed9c45d35b2","sha256:c8c0f8526666bb7affea8606eea00b998770be7802e69e75686078decb11df9d"],"state_sha256":"60790e7b802e4366b00b7342a110493504990fdaef003b88bb8f11efb03d2aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuUu4C7IfdjV88SOJv0RuLv/+hlSPPJzV/SNTRsbGKi2dXeMKFixCmmEek06KQH/A6VpL/p/A5pjvVL3H2EECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:31:55.571490Z","bundle_sha256":"88a2a45a5dd86ef30c736b57d8a626075b8518e375d8a346303b609e478f0e06"}}