{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RRD7T5UJMXP53J5JFFD6OVYPAT","short_pith_number":"pith:RRD7T5UJ","canonical_record":{"source":{"id":"1810.01051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T03:21:28Z","cross_cats_sorted":[],"title_canon_sha256":"50fe75d8c9474ac7845df2d2d6dcc1819d2a3b55986dd52a2752e134b2caa346","abstract_canon_sha256":"4f5266ed22263071ff9dbf81ca3b92151f95f8e02c0da1af1a7d55fda5ec70fb"},"schema_version":"1.0"},"canonical_sha256":"8c47f9f68965dfdda7a92947e7570f04e892cae579d4b291e0d385cca0ce1ba4","source":{"kind":"arxiv","id":"1810.01051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01051","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01051v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01051","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"RRD7T5UJMXP5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRD7T5UJMXP53J5J","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRD7T5UJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RRD7T5UJMXP53J5JFFD6OVYPAT","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T03:21:28Z","cross_cats_sorted":[],"title_canon_sha256":"50fe75d8c9474ac7845df2d2d6dcc1819d2a3b55986dd52a2752e134b2caa346","abstract_canon_sha256":"4f5266ed22263071ff9dbf81ca3b92151f95f8e02c0da1af1a7d55fda5ec70fb"},"schema_version":"1.0"},"canonical_sha256":"8c47f9f68965dfdda7a92947e7570f04e892cae579d4b291e0d385cca0ce1ba4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.031136Z","signature_b64":"3HjYEUqmjnK3wiGrrwdSiOolSdZdH/RJ7jsFOXTlnu8MKSUtUMmRqPdOuGwa6K2GsJvOTJ7d84CXt61KO3OADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c47f9f68965dfdda7a92947e7570f04e892cae579d4b291e0d385cca0ce1ba4","last_reissued_at":"2026-05-18T00:04:19.030416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.030416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01051","source_version":1,"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:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTJhyFSU/P5UqoPVTFsuDXQY7bjC92xfd+X+4mhIFQrzNnrEXrluh0WeWKI+jAVTX5MJNOa7v04RrZLVTk8aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:08:44.077449Z"},"content_sha256":"d6fb1fb8c5cb508240b1c9e8a51e5d81b0a1a2e8e22df020fd8392e508797413","schema_version":"1.0","event_id":"sha256:d6fb1fb8c5cb508240b1c9e8a51e5d81b0a1a2e8e22df020fd8392e508797413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RRD7T5UJMXP53J5JFFD6OVYPAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Parth Shah, Rachana Oza","submitted_at":"2018-10-02T03:21:28Z","abstract_excerpt":"String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent years, Graphics processing units are emerged as highly parallel processor. They out perform best of the central processing units in scientific computation power. By combining recent advancement in graphics processing units with string matching algorithms will allows to speed up process of string matching. In this paper we proposed modified par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01051","kind":"arxiv","version":1},"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:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GpiaqHK4k+MMQrf3DaXkdf2PJLU91A1RKslli5kNKO3t0AGWGlmojtpt30PgTT2B0kOH9EOGFdkCn/Zp+hQUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:08:44.077797Z"},"content_sha256":"d516e021e57cc6874a4d6de2d370836b25c2fcc2a7d021a15fc54770d71975e0","schema_version":"1.0","event_id":"sha256:d516e021e57cc6874a4d6de2d370836b25c2fcc2a7d021a15fc54770d71975e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/bundle.json","state_url":"https://pith.science/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/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-28T12:08:44Z","links":{"resolver":"https://pith.science/pith/RRD7T5UJMXP53J5JFFD6OVYPAT","bundle":"https://pith.science/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/bundle.json","state":"https://pith.science/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRD7T5UJMXP53J5JFFD6OVYPAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RRD7T5UJMXP53J5JFFD6OVYPAT","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":"4f5266ed22263071ff9dbf81ca3b92151f95f8e02c0da1af1a7d55fda5ec70fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T03:21:28Z","title_canon_sha256":"50fe75d8c9474ac7845df2d2d6dcc1819d2a3b55986dd52a2752e134b2caa346"},"schema_version":"1.0","source":{"id":"1810.01051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01051","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01051v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01051","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"RRD7T5UJMXP5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRD7T5UJMXP53J5J","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRD7T5UJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:d516e021e57cc6874a4d6de2d370836b25c2fcc2a7d021a15fc54770d71975e0","target":"graph","created_at":"2026-05-18T00:04:19Z","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":"String matching algorithms are among one of the most widely used algorithms in computer science. Traditional string matching algorithms efficiency of underlaying string matching algorithm will greatly increase the efficiency of any application. In recent years, Graphics processing units are emerged as highly parallel processor. They out perform best of the central processing units in scientific computation power. By combining recent advancement in graphics processing units with string matching algorithms will allows to speed up process of string matching. In this paper we proposed modified par","authors_text":"Parth Shah, Rachana Oza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T03:21:28Z","title":"Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device Architecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01051","kind":"arxiv","version":1},"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:d6fb1fb8c5cb508240b1c9e8a51e5d81b0a1a2e8e22df020fd8392e508797413","target":"record","created_at":"2026-05-18T00:04:19Z","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":"4f5266ed22263071ff9dbf81ca3b92151f95f8e02c0da1af1a7d55fda5ec70fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T03:21:28Z","title_canon_sha256":"50fe75d8c9474ac7845df2d2d6dcc1819d2a3b55986dd52a2752e134b2caa346"},"schema_version":"1.0","source":{"id":"1810.01051","kind":"arxiv","version":1}},"canonical_sha256":"8c47f9f68965dfdda7a92947e7570f04e892cae579d4b291e0d385cca0ce1ba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c47f9f68965dfdda7a92947e7570f04e892cae579d4b291e0d385cca0ce1ba4","first_computed_at":"2026-05-18T00:04:19.030416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:19.030416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3HjYEUqmjnK3wiGrrwdSiOolSdZdH/RJ7jsFOXTlnu8MKSUtUMmRqPdOuGwa6K2GsJvOTJ7d84CXt61KO3OADg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:19.031136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6fb1fb8c5cb508240b1c9e8a51e5d81b0a1a2e8e22df020fd8392e508797413","sha256:d516e021e57cc6874a4d6de2d370836b25c2fcc2a7d021a15fc54770d71975e0"],"state_sha256":"58c440264154a39849befb5c51ae1a9836c862362c9eb720a0e3bca4d437f742"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLv3plMilQAgAzbmWxCjzqF1648LqHy2A6yiMRHg8Cf5T/XKYoI5sMdL04CdaE/epGmuSXE44Re3WTVR1/QGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:08:44.079803Z","bundle_sha256":"4b2e5c9196b8e4bc7a44cd7950166c622a2a3511045e23158d784cfd6ad14642"}}