{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EFODEKVGA6NPB7MPKKR2WAOMWY","short_pith_number":"pith:EFODEKVG","canonical_record":{"source":{"id":"1309.1981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-08T17:15:21Z","cross_cats_sorted":[],"title_canon_sha256":"f189fda5ee5bee2f6f9a4130afe982d3231f3472cfd8cae1cf40fa73732ca584","abstract_canon_sha256":"7c1442e722220faad218de590dd50e7a7adb217a97e168b4499d7aa8cca90f46"},"schema_version":"1.0"},"canonical_sha256":"215c322aa6079af0fd8f52a3ab01ccb6356ba5beb309daa045c1d44411dbc678","source":{"kind":"arxiv","id":"1309.1981","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1981","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1981v2","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1981","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"EFODEKVGA6NP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EFODEKVGA6NPB7MP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EFODEKVG","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EFODEKVGA6NPB7MPKKR2WAOMWY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-08T17:15:21Z","cross_cats_sorted":[],"title_canon_sha256":"f189fda5ee5bee2f6f9a4130afe982d3231f3472cfd8cae1cf40fa73732ca584","abstract_canon_sha256":"7c1442e722220faad218de590dd50e7a7adb217a97e168b4499d7aa8cca90f46"},"schema_version":"1.0"},"canonical_sha256":"215c322aa6079af0fd8f52a3ab01ccb6356ba5beb309daa045c1d44411dbc678","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:59.540049Z","signature_b64":"fZMl9JTknyy8SwLMDP33+AvFKYdO+wj5z5xt8NSj+5oX46opWJAK/vNibZkrMXneFl0raLEXxxw2ilA8rRYdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215c322aa6079af0fd8f52a3ab01ccb6356ba5beb309daa045c1d44411dbc678","last_reissued_at":"2026-05-18T03:12:59.539269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:59.539269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1981","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-18T03:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98sCy65O4/j50xGbF8+MS45LQSeEWxoXsWYEUbpt5obh07NLw/Y7BYgpaq36Wjl+YE5DGJ0j58amIKosQKE+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:53:43.208174Z"},"content_sha256":"4b49c966dfd38eff00a57800d07dcaa95f144230be89786df17d2565ad0597e2","schema_version":"1.0","event_id":"sha256:4b49c966dfd38eff00a57800d07dcaa95f144230be89786df17d2565ad0597e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EFODEKVGA6NPB7MPKKR2WAOMWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Swap Matching Problem Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A.S.M. Sohidull Islam, Costas S. Iliopoulos, M. Sohel Rahman, Pritom Ahmed","submitted_at":"2013-09-08T17:15:21Z","abstract_excerpt":"In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, both the algorithms run in linear time considering a fixed alphabet."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1981","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-18T03:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBhj+rI+YoTsgmJCuDXKFQr9D2Mf2p/KL8pmn042Piz3JzgWfJBH/pcBdzQtJO3IDc7WEVIwuqQQisFqAjWVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:53:43.208539Z"},"content_sha256":"1be3eaaacdf5ba44a903e94eea90124bb2f79224850719efa682a36a7418a30a","schema_version":"1.0","event_id":"sha256:1be3eaaacdf5ba44a903e94eea90124bb2f79224850719efa682a36a7418a30a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/bundle.json","state_url":"https://pith.science/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/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-05T13:53:43Z","links":{"resolver":"https://pith.science/pith/EFODEKVGA6NPB7MPKKR2WAOMWY","bundle":"https://pith.science/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/bundle.json","state":"https://pith.science/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFODEKVGA6NPB7MPKKR2WAOMWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EFODEKVGA6NPB7MPKKR2WAOMWY","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":"7c1442e722220faad218de590dd50e7a7adb217a97e168b4499d7aa8cca90f46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-08T17:15:21Z","title_canon_sha256":"f189fda5ee5bee2f6f9a4130afe982d3231f3472cfd8cae1cf40fa73732ca584"},"schema_version":"1.0","source":{"id":"1309.1981","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1981","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1981v2","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1981","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"EFODEKVGA6NP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EFODEKVGA6NPB7MP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EFODEKVG","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:1be3eaaacdf5ba44a903e94eea90124bb2f79224850719efa682a36a7418a30a","target":"graph","created_at":"2026-05-18T03:12:59Z","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":"In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, both the algorithms run in linear time considering a fixed alphabet.","authors_text":"A.S.M. Sohidull Islam, Costas S. Iliopoulos, M. Sohel Rahman, Pritom Ahmed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-08T17:15:21Z","title":"The Swap Matching Problem Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1981","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:4b49c966dfd38eff00a57800d07dcaa95f144230be89786df17d2565ad0597e2","target":"record","created_at":"2026-05-18T03:12:59Z","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":"7c1442e722220faad218de590dd50e7a7adb217a97e168b4499d7aa8cca90f46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-08T17:15:21Z","title_canon_sha256":"f189fda5ee5bee2f6f9a4130afe982d3231f3472cfd8cae1cf40fa73732ca584"},"schema_version":"1.0","source":{"id":"1309.1981","kind":"arxiv","version":2}},"canonical_sha256":"215c322aa6079af0fd8f52a3ab01ccb6356ba5beb309daa045c1d44411dbc678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215c322aa6079af0fd8f52a3ab01ccb6356ba5beb309daa045c1d44411dbc678","first_computed_at":"2026-05-18T03:12:59.539269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:59.539269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZMl9JTknyy8SwLMDP33+AvFKYdO+wj5z5xt8NSj+5oX46opWJAK/vNibZkrMXneFl0raLEXxxw2ilA8rRYdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:59.540049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1981","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b49c966dfd38eff00a57800d07dcaa95f144230be89786df17d2565ad0597e2","sha256:1be3eaaacdf5ba44a903e94eea90124bb2f79224850719efa682a36a7418a30a"],"state_sha256":"a63fd4b984135f54c37771801a0178806f4011f8ecbcc60225b15ae3699c9ed1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KuC3zU8nzEc65xpoDbGayOBa50UwexO2Xs6p3yNe+t8jaP0qbavzyNTSq8yXXT9stKY7j5HrDwZnAeCAJTrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:53:43.210466Z","bundle_sha256":"fdc847a35f84b9c4e73eca1ebc7197229a7beff356acfa42e3362946494b593f"}}