{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A5I764B5QTDIV5OJVCC6LEWFFH","short_pith_number":"pith:A5I764B5","canonical_record":{"source":{"id":"1908.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-16T11:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"986071079b1acf9589012cbc5726e9b92418b8a786ce92cc0732fc9dec294ae8","abstract_canon_sha256":"7b3126cd75e23e5f1376ba5bced84d67e57f94b1bc1f34951b2d738c2dce223f"},"schema_version":"1.0"},"canonical_sha256":"0751ff703d84c68af5c9a885e592c529fc979f3f1f46de292224f6d01999bdea","source":{"kind":"arxiv","id":"1908.05930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05930","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05930v1","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05930","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"A5I764B5QTDI","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_16","alias_value":"A5I764B5QTDIV5OJ","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_8","alias_value":"A5I764B5","created_at":"2026-07-04T23:57:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A5I764B5QTDIV5OJVCC6LEWFFH","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-16T11:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"986071079b1acf9589012cbc5726e9b92418b8a786ce92cc0732fc9dec294ae8","abstract_canon_sha256":"7b3126cd75e23e5f1376ba5bced84d67e57f94b1bc1f34951b2d738c2dce223f"},"schema_version":"1.0"},"canonical_sha256":"0751ff703d84c68af5c9a885e592c529fc979f3f1f46de292224f6d01999bdea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:54.483519Z","signature_b64":"XEL1JE/xTs3MxF+8Ye6TbbCAPjRd1puuF+ppkd63fxPBJcX26wcF4rD2AHU+G9vB1OX/ZgDxp+jGj+pydqYlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0751ff703d84c68af5c9a885e592c529fc979f3f1f46de292224f6d01999bdea","last_reissued_at":"2026-07-04T23:57:54.483178Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:54.483178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05930","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-07-04T23:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWlhuZby19M5nNHqITXHLzrgp5D6Tkby1BJHJqUP7qaCKDxK9k4rT/WaWD2kQISftjxjQmDya7GLI/5tL6ZOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:48:48.422845Z"},"content_sha256":"6163eeb2754335979027fc53413b7a1d25a4ab9ad71e0aa6c5ed652e629c5c3b","schema_version":"1.0","event_id":"sha256:6163eeb2754335979027fc53413b7a1d25a4ab9ad71e0aa6c5ed652e629c5c3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A5I764B5QTDIV5OJVCC6LEWFFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Online String Matching Based on Characters Distance Text Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arianna Pavone, Francesco Pio Marino, Simone Faro","submitted_at":"2019-08-16T11:11:06Z","abstract_excerpt":"Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Sampled string matching is an efficient approach recently introduced in order to overcome the prohibitive space requirements of an index construction, on the one hand, and drastically reduce searching time for the online solutions, on the other hand. In this paper we present a new algorithm for the sampled string matching problem, based on a characters distance sampling approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05930","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05930/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGYoRLfN+D5pqpTXU2z3TQhzJFH/uBtUJPvVdasRiDtt9JIYuHSRoFsWLOkVFgA5Q0FrAGdoG4RhgFXuuU7pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:48:48.423713Z"},"content_sha256":"d42db3c41a8e9304d91b9967d31cce2c10fbe17f3e070e8e46b9335aa0073fd8","schema_version":"1.0","event_id":"sha256:d42db3c41a8e9304d91b9967d31cce2c10fbe17f3e070e8e46b9335aa0073fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5I764B5QTDIV5OJVCC6LEWFFH/bundle.json","state_url":"https://pith.science/pith/A5I764B5QTDIV5OJVCC6LEWFFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5I764B5QTDIV5OJVCC6LEWFFH/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-08-16T08:48:48Z","links":{"resolver":"https://pith.science/pith/A5I764B5QTDIV5OJVCC6LEWFFH","bundle":"https://pith.science/pith/A5I764B5QTDIV5OJVCC6LEWFFH/bundle.json","state":"https://pith.science/pith/A5I764B5QTDIV5OJVCC6LEWFFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5I764B5QTDIV5OJVCC6LEWFFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A5I764B5QTDIV5OJVCC6LEWFFH","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":"7b3126cd75e23e5f1376ba5bced84d67e57f94b1bc1f34951b2d738c2dce223f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-16T11:11:06Z","title_canon_sha256":"986071079b1acf9589012cbc5726e9b92418b8a786ce92cc0732fc9dec294ae8"},"schema_version":"1.0","source":{"id":"1908.05930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05930","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05930v1","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05930","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"A5I764B5QTDI","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_16","alias_value":"A5I764B5QTDIV5OJ","created_at":"2026-07-04T23:57:54Z"},{"alias_kind":"pith_short_8","alias_value":"A5I764B5","created_at":"2026-07-04T23:57:54Z"}],"graph_snapshots":[{"event_id":"sha256:d42db3c41a8e9304d91b9967d31cce2c10fbe17f3e070e8e46b9335aa0073fd8","target":"graph","created_at":"2026-07-04T23:57:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05930/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Sampled string matching is an efficient approach recently introduced in order to overcome the prohibitive space requirements of an index construction, on the one hand, and drastically reduce searching time for the online solutions, on the other hand. In this paper we present a new algorithm for the sampled string matching problem, based on a characters distance sampling approa","authors_text":"Arianna Pavone, Francesco Pio Marino, Simone Faro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-16T11:11:06Z","title":"Efficient Online String Matching Based on Characters Distance Text Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05930","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:6163eeb2754335979027fc53413b7a1d25a4ab9ad71e0aa6c5ed652e629c5c3b","target":"record","created_at":"2026-07-04T23:57:54Z","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":"7b3126cd75e23e5f1376ba5bced84d67e57f94b1bc1f34951b2d738c2dce223f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-16T11:11:06Z","title_canon_sha256":"986071079b1acf9589012cbc5726e9b92418b8a786ce92cc0732fc9dec294ae8"},"schema_version":"1.0","source":{"id":"1908.05930","kind":"arxiv","version":1}},"canonical_sha256":"0751ff703d84c68af5c9a885e592c529fc979f3f1f46de292224f6d01999bdea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0751ff703d84c68af5c9a885e592c529fc979f3f1f46de292224f6d01999bdea","first_computed_at":"2026-07-04T23:57:54.483178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:57:54.483178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XEL1JE/xTs3MxF+8Ye6TbbCAPjRd1puuF+ppkd63fxPBJcX26wcF4rD2AHU+G9vB1OX/ZgDxp+jGj+pydqYlAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:57:54.483519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6163eeb2754335979027fc53413b7a1d25a4ab9ad71e0aa6c5ed652e629c5c3b","sha256:d42db3c41a8e9304d91b9967d31cce2c10fbe17f3e070e8e46b9335aa0073fd8"],"state_sha256":"5e391935d408ccbe14eb8656fe0e80493ee284702c9b75e4d5d585068dd0cb12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FL3XK3/u6iDy9Rl9vrs3LKyYElfKpx2qRrtfbz674hcvB+tTYTkRB4fO4b2ESW1tyFEv/Fl+K8iPBvm3Fn3ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:48:48.430248Z","bundle_sha256":"ff4463b8df3388cd83b6ccb5d7bd232efff93c7e0815bdd861fc6f5f71e0eaa7"}}