{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RHRG4O33SFUVVWESQA56E2LAIX","short_pith_number":"pith:RHRG4O33","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"},"canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","source":{"kind":"arxiv","id":"1204.5224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5224","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5224v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5224","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"RHRG4O33SFUV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RHRG4O33SFUVVWES","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RHRG4O33","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RHRG4O33SFUVVWESQA56E2LAIX","target":"record","payload":{"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"},"canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","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"},"source_kind":"arxiv","source_id":"1204.5224","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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5CqY9nofEC4qJ/uDOHOOBedEw3OZDa4prQSfcyGplXrLyoDU6M+JIj+X4XM/42pXFHAOKOa6vbEtp1r+/UhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:43.864172Z"},"content_sha256":"9992bfe12a04551c57de1bdb3321b0b8737fed1edd6f32aa968d618540b09c01","schema_version":"1.0","event_id":"sha256:9992bfe12a04551c57de1bdb3321b0b8737fed1edd6f32aa968d618540b09c01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RHRG4O33SFUVVWESQA56E2LAIX","target":"graph","payload":{"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"},"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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMIx+jXbCHog0JANAlgHocieuyYRJ2Xyl5+sGXZCH771QluzpSPFFnY6TfHpd7ssYVYvEHspxA0gJQIYqHHVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:16:43.864575Z"},"content_sha256":"616629b3b12bf9294e26cde86444be14b19438ae73b9e97662546114706addf7","schema_version":"1.0","event_id":"sha256:616629b3b12bf9294e26cde86444be14b19438ae73b9e97662546114706addf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/bundle.json","state_url":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHRG4O33SFUVVWESQA56E2LAIX/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-07T14:16:43Z","links":{"resolver":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX","bundle":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/bundle.json","state":"https://pith.science/pith/RHRG4O33SFUVVWESQA56E2LAIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHRG4O33SFUVVWESQA56E2LAIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RHRG4O33SFUVVWESQA56E2LAIX","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":"45406a3d3f847e85001e52252fe5afb7cb21465eb762d97e08ae3ff126d5c364","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T22:46:21Z","title_canon_sha256":"86b6a461808126edd7c90a2b02cdb85462b64a718da9e1d349177e97c8f351a2"},"schema_version":"1.0","source":{"id":"1204.5224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5224","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5224v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5224","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"RHRG4O33SFUV","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RHRG4O33SFUVVWES","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RHRG4O33","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:616629b3b12bf9294e26cde86444be14b19438ae73b9e97662546114706addf7","target":"graph","created_at":"2026-05-18T02:23:35Z","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":"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 ","authors_text":"Marie-Louise Bruner, Martin Lackner","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T22:46:21Z","title":"A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5224","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:9992bfe12a04551c57de1bdb3321b0b8737fed1edd6f32aa968d618540b09c01","target":"record","created_at":"2026-05-18T02:23:35Z","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":"45406a3d3f847e85001e52252fe5afb7cb21465eb762d97e08ae3ff126d5c364","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T22:46:21Z","title_canon_sha256":"86b6a461808126edd7c90a2b02cdb85462b64a718da9e1d349177e97c8f351a2"},"schema_version":"1.0","source":{"id":"1204.5224","kind":"arxiv","version":2}},"canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89e26e3b7b91695ad892803be2696045e1e2f89d98b7c43e90c568d403218925","first_computed_at":"2026-05-18T02:23:35.834950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:35.834950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IhqzN5hVPgYK1PLRBr/PZabtMt+eZ2ZjETu/NxdEsaL2oM+OG+qBwLk75ActTjoKwSITMv0fmVWBK1L71c1AAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:35.835634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9992bfe12a04551c57de1bdb3321b0b8737fed1edd6f32aa968d618540b09c01","sha256:616629b3b12bf9294e26cde86444be14b19438ae73b9e97662546114706addf7"],"state_sha256":"b41bb8203847d89ad59056f0c628db328dea1c03c4817099a855dce7012b2283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkO8fJntQEFeMEj1+Zosrs3uq3W8SRDcoJkFMvPVaM+H8pCXKEzKuyQQsO6MA/pVf7CApGnqFuKyxABuDEf/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:16:43.867295Z","bundle_sha256":"8e50acd917f2ef0b7e5882c5568461081acf08cc4474c0796f361fd02270a258"}}