{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HTLK5K4VPELF5ZIBCTYK6GWOGD","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":"8c6c073515eccc7db84811659ff27df6dc485bb93c44fae9c01d29dde23f8a5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T19:53:05Z","title_canon_sha256":"dc6f3d433bb5a6d22a3718b7154b64cba50f25cb84fdc5990706a10113ec3496"},"schema_version":"1.0","source":{"id":"1012.0280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0280","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0280v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0280","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"HTLK5K4VPELF","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HTLK5K4VPELF5ZIB","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HTLK5K4V","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:5b47072f9baf5197216813348e294ae323549b52c5f773579c865639d7e7d7d1","target":"graph","created_at":"2026-05-18T03:26:21Z","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":"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 ","authors_text":"Emanuele Giaquinta, Simone Faro, Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T19:53:05Z","title":"String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0280","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:6c5c9e287cd217b05509d98ab528a0be4c40f1450ea02f2d66d46c3e90b8f0a5","target":"record","created_at":"2026-05-18T03:26:21Z","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":"8c6c073515eccc7db84811659ff27df6dc485bb93c44fae9c01d29dde23f8a5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-01T19:53:05Z","title_canon_sha256":"dc6f3d433bb5a6d22a3718b7154b64cba50f25cb84fdc5990706a10113ec3496"},"schema_version":"1.0","source":{"id":"1012.0280","kind":"arxiv","version":1}},"canonical_sha256":"3cd6aeab9579165ee50114f0af1ace30dbde6c1679704703aebfe18aa10341f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cd6aeab9579165ee50114f0af1ace30dbde6c1679704703aebfe18aa10341f2","first_computed_at":"2026-05-18T03:26:21.012337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:21.012337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D65/F9rzxGHiDYOfpK86pjfM6PpApg/XEF1i8Uu3dBCB7k3BHZ46qCK24/2wIVg1wIYOMeAg+xswHRKcRFpXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:21.012987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c5c9e287cd217b05509d98ab528a0be4c40f1450ea02f2d66d46c3e90b8f0a5","sha256:5b47072f9baf5197216813348e294ae323549b52c5f773579c865639d7e7d7d1"],"state_sha256":"9a8b417e3ce9c7efe2c0134a8d234a1e8f7f59ead4cc3c45178a49faa590877e"}