{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HHU5H7Q7SFIXEIEA5PZGYIXTKY","short_pith_number":"pith:HHU5H7Q7","canonical_record":{"source":{"id":"1712.03560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-10T17:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"ea96f80f56f89348c2e2b7544893470eb250187a31e103b083951864377e334d","abstract_canon_sha256":"1139ebaa524cd386b4d0ef8da7792929ef3781aa78da75bc10a3117af63cad9d"},"schema_version":"1.0"},"canonical_sha256":"39e9d3fe1f9151722080ebf26c22f35626b69b2a85113efb572244217dc15e21","source":{"kind":"arxiv","id":"1712.03560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03560","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03560v2","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03560","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"HHU5H7Q7SFIX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHU5H7Q7SFIXEIEA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHU5H7Q7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HHU5H7Q7SFIXEIEA5PZGYIXTKY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-10T17:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"ea96f80f56f89348c2e2b7544893470eb250187a31e103b083951864377e334d","abstract_canon_sha256":"1139ebaa524cd386b4d0ef8da7792929ef3781aa78da75bc10a3117af63cad9d"},"schema_version":"1.0"},"canonical_sha256":"39e9d3fe1f9151722080ebf26c22f35626b69b2a85113efb572244217dc15e21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:58.212675Z","signature_b64":"pCruJAtZuH5P/Z/y9gaFTep2dHPnuth0Rji9rglVcik+9CFb99Zko2RGB1hWa3VqtfFD/8Neo14DEsOpf0JaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39e9d3fe1f9151722080ebf26c22f35626b69b2a85113efb572244217dc15e21","last_reissued_at":"2026-05-17T23:59:58.212079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:58.212079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03560","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-17T23:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtuMMi5QYKHk4LDXKlg2/fuJBHWVHeiP3eDy4kWAr+DsES8TQ7H536PDqYmqUM2PU/WQ3bDq6+o4aTQulGeTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:05.570140Z"},"content_sha256":"da85efd63f66f4657b69fe3945f6b8055d0887aeb193f332eefdb69b02843297","schema_version":"1.0","event_id":"sha256:da85efd63f66f4657b69fe3945f6b8055d0887aeb193f332eefdb69b02843297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HHU5H7Q7SFIXEIEA5PZGYIXTKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A novel algorithm for online inexact string matching and its FPGA implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alessandro Cinti, Alessio Martino, Antonello Rizzi, Filippo Maria Bianchi","submitted_at":"2017-12-10T17:04:17Z","abstract_excerpt":"Accelerating inexact string matching procedures is of utmost importance when dealing with practical applications where huge amount of data must be processed in real time, as usual in bioinformatics or cybersecurity. Inexact matching procedures can yield multiple shadow hits, which must be filtered, according to some criterion, to obtain a concise and meaningful list of occurrences. The filtering procedures are often computationally demanding and are performed offline in a post-processing phase. This paper introduces a novel algorithm for Online Approximate String Matching (OASM) able to filter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03560","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-17T23:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bH+AB+saiEY6ymaCQUPFk/ztJM9h7P7U+E5sAWMPni6sWCMhr8BRW4PucQCwZK81JyAsYndBqeoYfQoYgujCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:05.570518Z"},"content_sha256":"9c8e809bd166c1ac320c962eda1fcda97d3b99371b31f8f46cf03635eb01c1b5","schema_version":"1.0","event_id":"sha256:9c8e809bd166c1ac320c962eda1fcda97d3b99371b31f8f46cf03635eb01c1b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/bundle.json","state_url":"https://pith.science/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/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-01T05:23:05Z","links":{"resolver":"https://pith.science/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY","bundle":"https://pith.science/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/bundle.json","state":"https://pith.science/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHU5H7Q7SFIXEIEA5PZGYIXTKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HHU5H7Q7SFIXEIEA5PZGYIXTKY","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":"1139ebaa524cd386b4d0ef8da7792929ef3781aa78da75bc10a3117af63cad9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-10T17:04:17Z","title_canon_sha256":"ea96f80f56f89348c2e2b7544893470eb250187a31e103b083951864377e334d"},"schema_version":"1.0","source":{"id":"1712.03560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03560","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03560v2","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03560","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"HHU5H7Q7SFIX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHU5H7Q7SFIXEIEA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHU5H7Q7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:9c8e809bd166c1ac320c962eda1fcda97d3b99371b31f8f46cf03635eb01c1b5","target":"graph","created_at":"2026-05-17T23:59:58Z","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":"Accelerating inexact string matching procedures is of utmost importance when dealing with practical applications where huge amount of data must be processed in real time, as usual in bioinformatics or cybersecurity. Inexact matching procedures can yield multiple shadow hits, which must be filtered, according to some criterion, to obtain a concise and meaningful list of occurrences. The filtering procedures are often computationally demanding and are performed offline in a post-processing phase. This paper introduces a novel algorithm for Online Approximate String Matching (OASM) able to filter","authors_text":"Alessandro Cinti, Alessio Martino, Antonello Rizzi, Filippo Maria Bianchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-10T17:04:17Z","title":"A novel algorithm for online inexact string matching and its FPGA implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03560","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:da85efd63f66f4657b69fe3945f6b8055d0887aeb193f332eefdb69b02843297","target":"record","created_at":"2026-05-17T23:59:58Z","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":"1139ebaa524cd386b4d0ef8da7792929ef3781aa78da75bc10a3117af63cad9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-12-10T17:04:17Z","title_canon_sha256":"ea96f80f56f89348c2e2b7544893470eb250187a31e103b083951864377e334d"},"schema_version":"1.0","source":{"id":"1712.03560","kind":"arxiv","version":2}},"canonical_sha256":"39e9d3fe1f9151722080ebf26c22f35626b69b2a85113efb572244217dc15e21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39e9d3fe1f9151722080ebf26c22f35626b69b2a85113efb572244217dc15e21","first_computed_at":"2026-05-17T23:59:58.212079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:58.212079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pCruJAtZuH5P/Z/y9gaFTep2dHPnuth0Rji9rglVcik+9CFb99Zko2RGB1hWa3VqtfFD/8Neo14DEsOpf0JaBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:58.212675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da85efd63f66f4657b69fe3945f6b8055d0887aeb193f332eefdb69b02843297","sha256:9c8e809bd166c1ac320c962eda1fcda97d3b99371b31f8f46cf03635eb01c1b5"],"state_sha256":"24ea55729ff5d5e65bf649e9d37114c0c8d3df1c7b8b71251ac7ab3446d31b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"347NdiLi9+IIsjbbBVOHjuV1P2LmEPNrbTSJrL0wIy7IphzkGghNz3HlMT53e2C3XvB6daO5U6N5o8Np8YMfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:23:05.573370Z","bundle_sha256":"0b6fbf241b65cbe6bbd8bb0cf54323f30c99d9bb30b8ea6ca360e73d6d0e9177"}}