{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:H45QAKTRXLB2FULTR7V6DSAS7W","short_pith_number":"pith:H45QAKTR","schema_version":"1.0","canonical_sha256":"3f3b002a71bac3a2d1738febe1c812fd8471737bc9f75ae8797089003095334c","source":{"kind":"arxiv","id":"0807.4368","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0807.4368","created_at":"2026-07-04T15:13:13.996735+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.4368v1","created_at":"2026-07-04T15:13:13.996735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4368","created_at":"2026-07-04T15:13:13.996735+00:00"},{"alias_kind":"pith_short_12","alias_value":"H45QAKTRXLB2","created_at":"2026-07-04T15:13:13.996735+00:00"},{"alias_kind":"pith_short_16","alias_value":"H45QAKTRXLB2FULT","created_at":"2026-07-04T15:13:13.996735+00:00"},{"alias_kind":"pith_short_8","alias_value":"H45QAKTR","created_at":"2026-07-04T15:13:13.996735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W","json":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W.json","graph_json":"https://pith.science/api/pith-number/H45QAKTRXLB2FULTR7V6DSAS7W/graph.json","events_json":"https://pith.science/api/pith-number/H45QAKTRXLB2FULTR7V6DSAS7W/events.json","paper":"https://pith.science/paper/H45QAKTR"},"agent_actions":{"view_html":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W","download_json":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W.json","view_paper":"https://pith.science/paper/H45QAKTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.4368&json=true","fetch_graph":"https://pith.science/api/pith-number/H45QAKTRXLB2FULTR7V6DSAS7W/graph.json","fetch_events":"https://pith.science/api/pith-number/H45QAKTRXLB2FULTR7V6DSAS7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/action/storage_attestation","attest_author":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/action/author_attestation","sign_citation":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/action/citation_signature","submit_replication":"https://pith.science/pith/H45QAKTRXLB2FULTR7V6DSAS7W/action/replication_record"}},"created_at":"2026-07-04T15:13:13.996735+00:00","updated_at":"2026-07-04T15:13:13.996735+00:00"}