{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RHRG4O33SFUVVWESQA56E2LAIX","short_pith_number":"pith:RHRG4O33","schema_version":"1.0","canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","source":{"kind":"arxiv","id":"1204.5224","version":2},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Marie-Louise Bruner, Martin Lackner","submitted_at":"2012-04-23T22:46:21Z","abstract_excerpt":"The NP-complete Permutation Pattern Matching problem asks whether a $k$-permutation $P$ is contained in a $n$-permutation $T$ as a pattern. This is the case if there exists an order-preserving embedding of $P$ into $T$. In this paper, we present a fixed-parameter algorithm solving this problem with a worst-case runtime of $\\mathcal{O}(1.79^{\\mathsf{run}(T)}\\cdot n\\cdot k)$, where $\\mathsf{run}(T)$ denotes the number of alternating runs of $T$. This algorithm is particularly well-suited for instances where $T$ has few runs, i.e., few ups and downs. Moreover, since $\\mathsf{run}(T)<n$, this can "},"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":"1204.5224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T22:46:21Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"86b6a461808126edd7c90a2b02cdb85462b64a718da9e1d349177e97c8f351a2","abstract_canon_sha256":"45406a3d3f847e85001e52252fe5afb7cb21465eb762d97e08ae3ff126d5c364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:35.835634Z","signature_b64":"IhqzN5hVPgYK1PLRBr/PZabtMt+eZ2ZjETu/NxdEsaL2oM+OG+qBwLk75ActTjoKwSITMv0fmVWBK1L71c1AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","last_reissued_at":"2026-05-18T02:23:35.834950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:35.834950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Marie-Louise Bruner, Martin Lackner","submitted_at":"2012-04-23T22:46:21Z","abstract_excerpt":"The NP-complete Permutation Pattern Matching problem asks whether a $k$-permutation $P$ is contained in a $n$-permutation $T$ as a pattern. This is the case if there exists an order-preserving embedding of $P$ into $T$. In this paper, we present a fixed-parameter algorithm solving this problem with a worst-case runtime of $\\mathcal{O}(1.79^{\\mathsf{run}(T)}\\cdot n\\cdot k)$, where $\\mathsf{run}(T)$ denotes the number of alternating runs of $T$. This algorithm is particularly well-suited for instances where $T$ has few runs, i.e., few ups and downs. Moreover, since $\\mathsf{run}(T)<n$, this can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5224","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.5224","created_at":"2026-05-18T02:23:35.835073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5224v2","created_at":"2026-05-18T02:23:35.835073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5224","created_at":"2026-05-18T02:23:35.835073+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHRG4O33SFUV","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHRG4O33SFUVVWES","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHRG4O33","created_at":"2026-05-18T12:27:20.899486+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/RHRG4O33SFUVVWESQA56E2LAIX","json":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX.json","graph_json":"https://pith.science/api/pith-number/RHRG4O33SFUVVWESQA56E2LAIX/graph.json","events_json":"https://pith.science/api/pith-number/RHRG4O33SFUVVWESQA56E2LAIX/events.json","paper":"https://pith.science/paper/RHRG4O33"},"agent_actions":{"view_html":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX","download_json":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX.json","view_paper":"https://pith.science/paper/RHRG4O33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5224&json=true","fetch_graph":"https://pith.science/api/pith-number/RHRG4O33SFUVVWESQA56E2LAIX/graph.json","fetch_events":"https://pith.science/api/pith-number/RHRG4O33SFUVVWESQA56E2LAIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/action/storage_attestation","attest_author":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/action/author_attestation","sign_citation":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/action/citation_signature","submit_replication":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/action/replication_record"}},"created_at":"2026-05-18T02:23:35.835073+00:00","updated_at":"2026-05-18T02:23:35.835073+00:00"}