{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FUV6O5SJMEIADOCHTHNQS353O7","short_pith_number":"pith:FUV6O5SJ","schema_version":"1.0","canonical_sha256":"2d2be77649611001b84799db096fbb77ce3b42e7ef9061d18cccc3f0be60104b","source":{"kind":"arxiv","id":"1711.00046","version":2},"attestation_state":"computed","paper":{"title":"Replace or Retrieve Keywords In Documents at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vikash Singh","submitted_at":"2017-10-31T18:34:03Z","abstract_excerpt":"In this paper we introduce, the FlashText algorithm for replacing keywords or finding keywords in a given text. FlashText can search or replace keywords in one pass over a document. The time complexity of this algorithm is not dependent on the number of terms being searched or replaced. For a document of size N (characters) and a dictionary of M keywords, the time complexity will be O(N). This algorithm is much faster than Regex, because regex time complexity is O(MxN). It is also different from Aho Corasick Algorithm, as it doesn't match substrings. FlashText is designed to only match complet"},"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":"1711.00046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"3f1bc5ee35c2c6e55db8d9ce8d027d78e4a5de5a689680b46ed433bf2865e829","abstract_canon_sha256":"c475c0f8b5ea3d01ba2686647547756f8ca196504f98d578002eaa2885d21773"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.216235Z","signature_b64":"nJ+Tx9p7byHLmP3gBtt1Sq3wIrpdFYjE3AOG23s1BDvC2gqSh2863NwM2wxhBTDKtRaHLuSfqu8UVQ2afcwcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2be77649611001b84799db096fbb77ce3b42e7ef9061d18cccc3f0be60104b","last_reissued_at":"2026-05-18T00:30:57.215666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.215666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Replace or Retrieve Keywords In Documents at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vikash Singh","submitted_at":"2017-10-31T18:34:03Z","abstract_excerpt":"In this paper we introduce, the FlashText algorithm for replacing keywords or finding keywords in a given text. FlashText can search or replace keywords in one pass over a document. The time complexity of this algorithm is not dependent on the number of terms being searched or replaced. For a document of size N (characters) and a dictionary of M keywords, the time complexity will be O(N). This algorithm is much faster than Regex, because regex time complexity is O(MxN). It is also different from Aho Corasick Algorithm, as it doesn't match substrings. FlashText is designed to only match complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00046","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":"1711.00046","created_at":"2026-05-18T00:30:57.215742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00046v2","created_at":"2026-05-18T00:30:57.215742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00046","created_at":"2026-05-18T00:30:57.215742+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUV6O5SJMEIA","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUV6O5SJMEIADOCH","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUV6O5SJ","created_at":"2026-05-18T12:31:15.632608+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/FUV6O5SJMEIADOCHTHNQS353O7","json":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7.json","graph_json":"https://pith.science/api/pith-number/FUV6O5SJMEIADOCHTHNQS353O7/graph.json","events_json":"https://pith.science/api/pith-number/FUV6O5SJMEIADOCHTHNQS353O7/events.json","paper":"https://pith.science/paper/FUV6O5SJ"},"agent_actions":{"view_html":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7","download_json":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7.json","view_paper":"https://pith.science/paper/FUV6O5SJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00046&json=true","fetch_graph":"https://pith.science/api/pith-number/FUV6O5SJMEIADOCHTHNQS353O7/graph.json","fetch_events":"https://pith.science/api/pith-number/FUV6O5SJMEIADOCHTHNQS353O7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7/action/storage_attestation","attest_author":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7/action/author_attestation","sign_citation":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7/action/citation_signature","submit_replication":"https://pith.science/pith/FUV6O5SJMEIADOCHTHNQS353O7/action/replication_record"}},"created_at":"2026-05-18T00:30:57.215742+00:00","updated_at":"2026-05-18T00:30:57.215742+00:00"}