{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:H45QAKTRXLB2FULTR7V6DSAS7W","short_pith_number":"pith:H45QAKTR","canonical_record":{"source":{"id":"0807.4368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2008-07-28T07:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"d42aea8db19b3aa64744d481c5d87a69d57b39d96f2f6acbcbaa8debd87c124d","abstract_canon_sha256":"47eabe27e03a8aa63471c367a3303d7c67d8c27ac5243b5bd8eea3a6453bd359"},"schema_version":"1.0"},"canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","source":{"kind":"arxiv","id":"0807.4368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.4368","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"0807.4368v1","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4368","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"H45QAKTRXLB2","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"H45QAKTRXLB2FULT","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"H45QAKTR","created_at":"2026-07-04T15:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:H45QAKTRXLB2FULTR7V6DSAS7W","target":"record","payload":{"canonical_record":{"source":{"id":"0807.4368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2008-07-28T07:17:57Z","cross_cats_sorted":[],"title_canon_sha256":"d42aea8db19b3aa64744d481c5d87a69d57b39d96f2f6acbcbaa8debd87c124d","abstract_canon_sha256":"47eabe27e03a8aa63471c367a3303d7c67d8c27ac5243b5bd8eea3a6453bd359"},"schema_version":"1.0"},"canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:13:13.997074Z","signature_b64":"Ru+era8Tf8eH7rBl8AaY+G9+RRDNEGvIuo0A/Qvp9Ii7nzUPa3G4YZDHMMgGOZQawhUbMfmsX/aD5zflv75fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","last_reissued_at":"2026-07-04T15:13:13.996673Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:13:13.996673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.4368","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-04T15:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZiSK/lfGRdc53OBkbTspmhgapdFvilRa+7m0DA7qUaHQNpM5htD0mDXe/uSaAjPVdvknvzAhFMnWPABpjAncDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:39:25.169150Z"},"content_sha256":"014dc8200241a8cb79963570f713f210160424d908fc6f20f3554825efb7af6c","schema_version":"1.0","event_id":"sha256:014dc8200241a8cb79963570f713f210160424d908fc6f20f3554825efb7af6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:H45QAKTRXLB2FULTR7V6DSAS7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Approximate String Matching (Extended Abstract)","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris Papamichail, Georgios Papamichail","submitted_at":"2008-07-28T07:17:57Z","abstract_excerpt":"The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share.\n  We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.4368","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/0807.4368/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-04T15:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dw6ZBuAx0GtUK+vo1xN5mMWsi60Qv9VUZHY1pRoLa6GfFiExzRs1j2EpjSmhPXJbNwTYRVOSXt/wOLs2NTS+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:39:25.169536Z"},"content_sha256":"d3106507fc75eddc9e0a50fcc0e2e0a11c09aee099be1598fa0096cec62b4af5","schema_version":"1.0","event_id":"sha256:d3106507fc75eddc9e0a50fcc0e2e0a11c09aee099be1598fa0096cec62b4af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/bundle.json","state_url":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H45QAKTRXLB2FULTR7V6DSAS7W/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-07-05T04:39:25Z","links":{"resolver":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W","bundle":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/bundle.json","state":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H45QAKTRXLB2FULTR7V6DSAS7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:H45QAKTRXLB2FULTR7V6DSAS7W","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":"47eabe27e03a8aa63471c367a3303d7c67d8c27ac5243b5bd8eea3a6453bd359","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2008-07-28T07:17:57Z","title_canon_sha256":"d42aea8db19b3aa64744d481c5d87a69d57b39d96f2f6acbcbaa8debd87c124d"},"schema_version":"1.0","source":{"id":"0807.4368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.4368","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"0807.4368v1","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4368","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"H45QAKTRXLB2","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"H45QAKTRXLB2FULT","created_at":"2026-07-04T15:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"H45QAKTR","created_at":"2026-07-04T15:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:d3106507fc75eddc9e0a50fcc0e2e0a11c09aee099be1598fa0096cec62b4af5","target":"graph","created_at":"2026-07-04T15:13:13Z","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/0807.4368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share.\n  We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, wher","authors_text":"Dimitris Papamichail, Georgios Papamichail","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2008-07-28T07:17:57Z","title":"Improved Algorithms for Approximate String Matching (Extended Abstract)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.4368","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:014dc8200241a8cb79963570f713f210160424d908fc6f20f3554825efb7af6c","target":"record","created_at":"2026-07-04T15:13:13Z","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":"47eabe27e03a8aa63471c367a3303d7c67d8c27ac5243b5bd8eea3a6453bd359","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2008-07-28T07:17:57Z","title_canon_sha256":"d42aea8db19b3aa64744d481c5d87a69d57b39d96f2f6acbcbaa8debd87c124d"},"schema_version":"1.0","source":{"id":"0807.4368","kind":"arxiv","version":1}},"canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","first_computed_at":"2026-07-04T15:13:13.996673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:13:13.996673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ru+era8Tf8eH7rBl8AaY+G9+RRDNEGvIuo0A/Qvp9Ii7nzUPa3G4YZDHMMgGOZQawhUbMfmsX/aD5zflv75fCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:13:13.997074Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.4368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:014dc8200241a8cb79963570f713f210160424d908fc6f20f3554825efb7af6c","sha256:d3106507fc75eddc9e0a50fcc0e2e0a11c09aee099be1598fa0096cec62b4af5"],"state_sha256":"24d737124af68c4ceea461d172e0132d7be7a0820b9c127df327fc37fd9fd86a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMKyjqp1mj/UlLqLb2oEgAnGrOYs+PFwfCs8CYR87MRlNRL27/DwfBcbKhKpcJwB/t5lHgpFW08IVJRMvGh0Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T04:39:25.171571Z","bundle_sha256":"2198c27c352cfe070996f5802c971ddecc1a2a3d3cdce830f922f2c5fda8ab50"}}