{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P3FXQZMCZBL264A2UEX6PJAZNZ","short_pith_number":"pith:P3FXQZMC","canonical_record":{"source":{"id":"1707.00469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-03T10:03:35Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"de56ca39ce276023212b3b78e4b9410b7dd6720d5a8e6ef545c400fc1aa1c659","abstract_canon_sha256":"3f1bb8df5a7e7e3d5b0cd15f410419f5d62c11cd0613607500cb95155e30cecb"},"schema_version":"1.0"},"canonical_sha256":"7ecb786582c857af701aa12fe7a4196e4c36b778ba12fd875c42eac98f0a16cc","source":{"kind":"arxiv","id":"1707.00469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00469","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00469v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00469","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"P3FXQZMCZBL2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P3FXQZMCZBL264A2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P3FXQZMC","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P3FXQZMCZBL264A2UEX6PJAZNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-03T10:03:35Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"de56ca39ce276023212b3b78e4b9410b7dd6720d5a8e6ef545c400fc1aa1c659","abstract_canon_sha256":"3f1bb8df5a7e7e3d5b0cd15f410419f5d62c11cd0613607500cb95155e30cecb"},"schema_version":"1.0"},"canonical_sha256":"7ecb786582c857af701aa12fe7a4196e4c36b778ba12fd875c42eac98f0a16cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.269766Z","signature_b64":"v2BwkAdm7HYZAMn1W3i/YFSqv3/7UlBZm9XUQKoCeq1A85h2FEMGpYXLiJS3D2U7oLkgD0zIs6ztzemCIoeYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ecb786582c857af701aa12fe7a4196e4c36b778ba12fd875c42eac98f0a16cc","last_reissued_at":"2026-05-18T00:41:03.269188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.269188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00469","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0f26wygI+DYusay64BDfNygNjZCYaD5OiP59/X2dD4rJy73M7nJghoI4LsmbnJyXwmZyvW2CnntX6QAPui+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:36:16.811148Z"},"content_sha256":"3cfb0b47e4e15722f1136722a6ba13dfb64277f7bf1824ec76b8035d78b8b132","schema_version":"1.0","event_id":"sha256:3cfb0b47e4e15722f1136722a6ba13dfb64277f7bf1824ec76b8035d78b8b132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P3FXQZMCZBL264A2UEX6PJAZNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up String Matching by Weak Factor Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Arianna Pavone, Domenico Cantone, Simone Faro","submitted_at":"2017-07-03T10:03:35Z","abstract_excerpt":"String matching is the problem of finding all the substrings of a text which match a given pattern. It is one of the most investigated problems in computer science, mainly due to its very diverse applications in several fields. Recently, much research in the string matching field has focused on the efficiency and flexibility of the searching procedure and quite effective techniques have been proposed for speeding up the existing solutions. In this context, algorithms based on factors recognition are among the best solutions. In this paper, we present a simple and very efficient algorithm for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00469","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:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Hs24kihx/4aqh8rx6mO+LgSHXLZScrX+mff+0wCereYK5HRBa37yLnMcdD8754Epd0oogdQ4IJ5JKE8lgwcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:36:16.811502Z"},"content_sha256":"3d90321d60069af6c2339d05c8165607d88d7d2a0a6950a870ab094223d82d94","schema_version":"1.0","event_id":"sha256:3d90321d60069af6c2339d05c8165607d88d7d2a0a6950a870ab094223d82d94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/bundle.json","state_url":"https://pith.science/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/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-21T23:36:16Z","links":{"resolver":"https://pith.science/pith/P3FXQZMCZBL264A2UEX6PJAZNZ","bundle":"https://pith.science/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/bundle.json","state":"https://pith.science/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3FXQZMCZBL264A2UEX6PJAZNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P3FXQZMCZBL264A2UEX6PJAZNZ","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":"3f1bb8df5a7e7e3d5b0cd15f410419f5d62c11cd0613607500cb95155e30cecb","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-03T10:03:35Z","title_canon_sha256":"de56ca39ce276023212b3b78e4b9410b7dd6720d5a8e6ef545c400fc1aa1c659"},"schema_version":"1.0","source":{"id":"1707.00469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00469","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00469v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00469","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"P3FXQZMCZBL2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P3FXQZMCZBL264A2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P3FXQZMC","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:3d90321d60069af6c2339d05c8165607d88d7d2a0a6950a870ab094223d82d94","target":"graph","created_at":"2026-05-18T00:41:03Z","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 is the problem of finding all the substrings of a text which match a given pattern. It is one of the most investigated problems in computer science, mainly due to its very diverse applications in several fields. Recently, much research in the string matching field has focused on the efficiency and flexibility of the searching procedure and quite effective techniques have been proposed for speeding up the existing solutions. In this context, algorithms based on factors recognition are among the best solutions. In this paper, we present a simple and very efficient algorithm for s","authors_text":"Arianna Pavone, Domenico Cantone, Simone Faro","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-03T10:03:35Z","title":"Speeding Up String Matching by Weak Factor Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00469","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:3cfb0b47e4e15722f1136722a6ba13dfb64277f7bf1824ec76b8035d78b8b132","target":"record","created_at":"2026-05-18T00:41:03Z","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":"3f1bb8df5a7e7e3d5b0cd15f410419f5d62c11cd0613607500cb95155e30cecb","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-03T10:03:35Z","title_canon_sha256":"de56ca39ce276023212b3b78e4b9410b7dd6720d5a8e6ef545c400fc1aa1c659"},"schema_version":"1.0","source":{"id":"1707.00469","kind":"arxiv","version":1}},"canonical_sha256":"7ecb786582c857af701aa12fe7a4196e4c36b778ba12fd875c42eac98f0a16cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ecb786582c857af701aa12fe7a4196e4c36b778ba12fd875c42eac98f0a16cc","first_computed_at":"2026-05-18T00:41:03.269188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:03.269188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2BwkAdm7HYZAMn1W3i/YFSqv3/7UlBZm9XUQKoCeq1A85h2FEMGpYXLiJS3D2U7oLkgD0zIs6ztzemCIoeYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:03.269766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cfb0b47e4e15722f1136722a6ba13dfb64277f7bf1824ec76b8035d78b8b132","sha256:3d90321d60069af6c2339d05c8165607d88d7d2a0a6950a870ab094223d82d94"],"state_sha256":"1370bf1608bb3f503f99b2f1c61daf25f4d007e0c80dbcb0085b816715306b53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MTVWIMq86JDoNO6sGXOwz/hLr3F52EbV/liJu38FnxU6YGEOJ10pEsL1Qf9MOqQLE3WmJS+B9drYe3NrAMDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:36:16.813387Z","bundle_sha256":"61b10c52f439d957805e907f3c4125520fe4dc35fdfb65423eee27d3913f454c"}}