{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HTLK5K4VPELF5ZIBCTYK6GWOGD","short_pith_number":"pith:HTLK5K4V","schema_version":"1.0","canonical_sha256":"3cd6aeab9579165ee50114f0af1ace30dbde6c1679704703aebfe18aa10341f2","source":{"kind":"arxiv","id":"1012.0280","version":1},"attestation_state":"computed","paper":{"title":"String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Simone Faro, Szymon Grabowski","submitted_at":"2010-12-01T19:53:05Z","abstract_excerpt":"We present an efficient algorithm for finding all approximate occurrences of a given pattern $p$ of length $m$ in a text $t$ of length $n$ allowing for translocations of equal length adjacent factors and inversions of factors. The algorithm is based on an efficient filtering method and has an $\\bigO(nm\\max(\\alpha, \\beta))$-time complexity in the worst case and $\\bigO(\\max(\\alpha, \\beta))$-space complexity, where $\\alpha$ and $\\beta$ are respectively the maximum length of the factors involved in any translocation and inversion. Moreover we show that under the assumptions of equiprobability and "},"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":"1012.0280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T19:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"dc6f3d433bb5a6d22a3718b7154b64cba50f25cb84fdc5990706a10113ec3496","abstract_canon_sha256":"8c6c073515eccc7db84811659ff27df6dc485bb93c44fae9c01d29dde23f8a5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:21.012987Z","signature_b64":"D65/F9rzxGHiDYOfpK86pjfM6PpApg/XEF1i8Uu3dBCB7k3BHZ46qCK24/2wIVg1wIYOMeAg+xswHRKcRFpXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cd6aeab9579165ee50114f0af1ace30dbde6c1679704703aebfe18aa10341f2","last_reissued_at":"2026-05-18T03:26:21.012337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:21.012337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Simone Faro, Szymon Grabowski","submitted_at":"2010-12-01T19:53:05Z","abstract_excerpt":"We present an efficient algorithm for finding all approximate occurrences of a given pattern $p$ of length $m$ in a text $t$ of length $n$ allowing for translocations of equal length adjacent factors and inversions of factors. The algorithm is based on an efficient filtering method and has an $\\bigO(nm\\max(\\alpha, \\beta))$-time complexity in the worst case and $\\bigO(\\max(\\alpha, \\beta))$-space complexity, where $\\alpha$ and $\\beta$ are respectively the maximum length of the factors involved in any translocation and inversion. Moreover we show that under the assumptions of equiprobability and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0280","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.0280","created_at":"2026-05-18T03:26:21.012445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0280v1","created_at":"2026-05-18T03:26:21.012445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0280","created_at":"2026-05-18T03:26:21.012445+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTLK5K4VPELF","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTLK5K4VPELF5ZIB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTLK5K4V","created_at":"2026-05-18T12:26:07.630475+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/HTLK5K4VPELF5ZIBCTYK6GWOGD","json":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD.json","graph_json":"https://pith.science/api/pith-number/HTLK5K4VPELF5ZIBCTYK6GWOGD/graph.json","events_json":"https://pith.science/api/pith-number/HTLK5K4VPELF5ZIBCTYK6GWOGD/events.json","paper":"https://pith.science/paper/HTLK5K4V"},"agent_actions":{"view_html":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD","download_json":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD.json","view_paper":"https://pith.science/paper/HTLK5K4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0280&json=true","fetch_graph":"https://pith.science/api/pith-number/HTLK5K4VPELF5ZIBCTYK6GWOGD/graph.json","fetch_events":"https://pith.science/api/pith-number/HTLK5K4VPELF5ZIBCTYK6GWOGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD/action/storage_attestation","attest_author":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD/action/author_attestation","sign_citation":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD/action/citation_signature","submit_replication":"https://pith.science/pith/HTLK5K4VPELF5ZIBCTYK6GWOGD/action/replication_record"}},"created_at":"2026-05-18T03:26:21.012445+00:00","updated_at":"2026-05-18T03:26:21.012445+00:00"}