{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XKQ3MIRCQ2CZBWJQKR3R6GZPGB","short_pith_number":"pith:XKQ3MIRC","schema_version":"1.0","canonical_sha256":"baa1b62222868590d93054771f1b2f305a8cddba0e31d9e4c45751a42c1d31d0","source":{"kind":"arxiv","id":"1608.02413","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.02413","created_at":"2026-05-18T00:58:03.864629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02413v2","created_at":"2026-05-18T00:58:03.864629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02413","created_at":"2026-05-18T00:58:03.864629+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKQ3MIRCQ2CZ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKQ3MIRCQ2CZBWJQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKQ3MIRC","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB","json":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB.json","graph_json":"https://pith.science/api/pith-number/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/graph.json","events_json":"https://pith.science/api/pith-number/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/events.json","paper":"https://pith.science/paper/XKQ3MIRC"},"agent_actions":{"view_html":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB","download_json":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB.json","view_paper":"https://pith.science/paper/XKQ3MIRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02413&json=true","fetch_graph":"https://pith.science/api/pith-number/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/graph.json","fetch_events":"https://pith.science/api/pith-number/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/action/storage_attestation","attest_author":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/action/author_attestation","sign_citation":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/action/citation_signature","submit_replication":"https://pith.science/pith/XKQ3MIRCQ2CZBWJQKR3R6GZPGB/action/replication_record"}},"created_at":"2026-05-18T00:58:03.864629+00:00","updated_at":"2026-05-18T00:58:03.864629+00:00"}