{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NZRTBOQOJTLXOL4FTZKTUD5T6C","short_pith_number":"pith:NZRTBOQO","canonical_record":{"source":{"id":"1312.4678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"86d4c19aa226d9dbc6098bcae7135856115b040beb3161ee748d484636fe0cf5","abstract_canon_sha256":"5d3353627463d213fe818b517fac96c5d7476c8c0af6b8c012c46aad91b3fd3e"},"schema_version":"1.0"},"canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","source":{"kind":"arxiv","id":"1312.4678","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4678","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4678v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4678","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"NZRTBOQOJTLX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZRTBOQOJTLXOL4F","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZRTBOQO","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NZRTBOQOJTLXOL4FTZKTUD5T6C","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"86d4c19aa226d9dbc6098bcae7135856115b040beb3161ee748d484636fe0cf5","abstract_canon_sha256":"5d3353627463d213fe818b517fac96c5d7476c8c0af6b8c012c46aad91b3fd3e"},"schema_version":"1.0"},"canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.600338Z","signature_b64":"gB8PFWzeyLqdRLyJhjyIHXU1f30Ai/gIbFDQYG/r6nUNyvlKDMoA9xHHjPUZ4sBknwnKnHs3s0X146FosVnlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","last_reissued_at":"2026-05-18T02:44:31.599743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.599743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4678","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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MX1rQ5H7xlA1eheaOtS5sHz0CBxZ62fDCDBoD6hup4HpZF2nKoOA6/8PEwFoFeilL5zYSmnT20I4wjYKc9crCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:17.927658Z"},"content_sha256":"514ceba5ae8f75972e2296fcf36f7467af074dcb1ac69efc5c8f94b08b7df2fe","schema_version":"1.0","event_id":"sha256:514ceba5ae8f75972e2296fcf36f7467af074dcb1ac69efc5c8f94b08b7df2fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NZRTBOQOJTLXOL4FTZKTUD5T6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple, compact and robust approximate string dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Ibrahim Chegrane","submitted_at":"2013-12-17T07:54:49Z","abstract_excerpt":"This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\\sigma$. Given a bound $k$ and a pattern $x$ of length $m$, a query has to return all the strings of the dictionary which are at edit distance at most $k$ from $x$, where the edit distance between two strings $x$ and $y$ is defined as the minimum-cost sequence of edit operations that transform $x$ into $y$. The cost of a sequence of operations is defined as the sum of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4678","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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9GAmY817LryZ0cLx75CZlCAtkuH//ExXRrfiWYREbWcenZTKYKnSk/i6kcUfv2z9r+2dG1ko60MIDEdyH6zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:17.928006Z"},"content_sha256":"a2aa50a9966e3ede2039a9ddcefae721d6e9ac52c1e5c790e407834845bbf8c5","schema_version":"1.0","event_id":"sha256:a2aa50a9966e3ede2039a9ddcefae721d6e9ac52c1e5c790e407834845bbf8c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/bundle.json","state_url":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/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-02T07:50:17Z","links":{"resolver":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C","bundle":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/bundle.json","state":"https://pith.science/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZRTBOQOJTLXOL4FTZKTUD5T6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NZRTBOQOJTLXOL4FTZKTUD5T6C","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":"5d3353627463d213fe818b517fac96c5d7476c8c0af6b8c012c46aad91b3fd3e","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","title_canon_sha256":"86d4c19aa226d9dbc6098bcae7135856115b040beb3161ee748d484636fe0cf5"},"schema_version":"1.0","source":{"id":"1312.4678","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4678","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4678v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4678","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"NZRTBOQOJTLX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZRTBOQOJTLXOL4F","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZRTBOQO","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a2aa50a9966e3ede2039a9ddcefae721d6e9ac52c1e5c790e407834845bbf8c5","target":"graph","created_at":"2026-05-18T02:44:31Z","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":"This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\\sigma$. Given a bound $k$ and a pattern $x$ of length $m$, a query has to return all the strings of the dictionary which are at edit distance at most $k$ from $x$, where the edit distance between two strings $x$ and $y$ is defined as the minimum-cost sequence of edit operations that transform $x$ into $y$. The cost of a sequence of operations is defined as the sum of the","authors_text":"Djamal Belazzougui, Ibrahim Chegrane","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","title":"Simple, compact and robust approximate string dictionary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4678","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:514ceba5ae8f75972e2296fcf36f7467af074dcb1ac69efc5c8f94b08b7df2fe","target":"record","created_at":"2026-05-18T02:44:31Z","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":"5d3353627463d213fe818b517fac96c5d7476c8c0af6b8c012c46aad91b3fd3e","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-17T07:54:49Z","title_canon_sha256":"86d4c19aa226d9dbc6098bcae7135856115b040beb3161ee748d484636fe0cf5"},"schema_version":"1.0","source":{"id":"1312.4678","kind":"arxiv","version":2}},"canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e6330ba0e4cd7772f859e553a0fb3f0b093961ad7497e855f737700e8e5af1a","first_computed_at":"2026-05-18T02:44:31.599743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.599743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gB8PFWzeyLqdRLyJhjyIHXU1f30Ai/gIbFDQYG/r6nUNyvlKDMoA9xHHjPUZ4sBknwnKnHs3s0X146FosVnlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.600338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4678","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:514ceba5ae8f75972e2296fcf36f7467af074dcb1ac69efc5c8f94b08b7df2fe","sha256:a2aa50a9966e3ede2039a9ddcefae721d6e9ac52c1e5c790e407834845bbf8c5"],"state_sha256":"fbef054fbe11b8fe63435f73aa43844c99419c43be0ccc6c0efc979f6e102e77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5f5M0VxlsC1ABZbbrSN6dZD4syknMpKBV2qaBk2jvEpYVAX4I24Xk5RociDG5B1FoUeId0aXCsFGmINK1asyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:50:17.929976Z","bundle_sha256":"94c7d7ae0f65e97d565c71ecd340b063713cd8e293777add02ead6944f790b4d"}}