{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MA6QHJ4L37DTOBMT6ZCOJH6XD4","short_pith_number":"pith:MA6QHJ4L","canonical_record":{"source":{"id":"1109.1951","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T10:01:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ba4a6490416482a487f6ec2b7c422ce2b96fd14eb41d80b1f3bfdf312ddca2fe","abstract_canon_sha256":"9a776f7c43f51813785b43afa80f401923bdde7c915fc01f34a0322525ca5754"},"schema_version":"1.0"},"canonical_sha256":"603d03a78bdfc7370593f644e49fd71f3fa45f6757ab0426091dcbf05debdbcc","source":{"kind":"arxiv","id":"1109.1951","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1951","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1951v4","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1951","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"MA6QHJ4L37DT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MA6QHJ4L37DTOBMT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MA6QHJ4L","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MA6QHJ4L37DTOBMT6ZCOJH6XD4","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1951","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T10:01:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ba4a6490416482a487f6ec2b7c422ce2b96fd14eb41d80b1f3bfdf312ddca2fe","abstract_canon_sha256":"9a776f7c43f51813785b43afa80f401923bdde7c915fc01f34a0322525ca5754"},"schema_version":"1.0"},"canonical_sha256":"603d03a78bdfc7370593f644e49fd71f3fa45f6757ab0426091dcbf05debdbcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.120782Z","signature_b64":"+R5HCuOcnmTiV1Oky2HG/11oDyzCTFcudji6BV6+8oVavsXO6JCKfmfPixlgUeKXtI6YSUmcJusL5aaLCLP/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"603d03a78bdfc7370593f644e49fd71f3fa45f6757ab0426091dcbf05debdbcc","last_reissued_at":"2026-05-18T03:36:37.120015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.120015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1951","source_version":4,"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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JNZkx62dpWfOJvVo8dik3zQvb73QrTnxrwkbw4e/Dy5gai8eLwK/tcK1d+D13zVVKOyo/lSlCsecLCBO27PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:38:02.159426Z"},"content_sha256":"c62c4b92fe337b45f9bdef4425d96e18fec8123cc1a17d69b9690701242f307a","schema_version":"1.0","event_id":"sha256:c62c4b92fe337b45f9bdef4425d96e18fec8123cc1a17d69b9690701242f307a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MA6QHJ4L37DTOBMT6ZCOJH6XD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A W[1]-Completeness Result for Generalized Permutation Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Marie-Louise Bruner, Martin Lackner","submitted_at":"2011-09-09T10:01:18Z","abstract_excerpt":"The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern Matching problem one can additionally enforce that certain adjacent elements in the pattern must be mapped to adjacent elements in the text. This paper studies the parameterized complexity of this more general problem. We show W[1]-completeness with respect to the length of the pattern P. Under standard complexity theoretic assumptions this implies that no f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1951","kind":"arxiv","version":4},"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:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYKJik7pVfYg4KzcEJXNl9PUa7NY50Nq7PaVZl7nFzAixsKZuTQz1GQJOP9OooKPJlrTH4E5s3Gh8PGtciSXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:38:02.160091Z"},"content_sha256":"4e852bc2b8a4b4d50aa188c1847f880021402871462a957e23e6dc97d52dfca4","schema_version":"1.0","event_id":"sha256:4e852bc2b8a4b4d50aa188c1847f880021402871462a957e23e6dc97d52dfca4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/bundle.json","state_url":"https://pith.science/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/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-07T17:38:02Z","links":{"resolver":"https://pith.science/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4","bundle":"https://pith.science/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/bundle.json","state":"https://pith.science/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MA6QHJ4L37DTOBMT6ZCOJH6XD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MA6QHJ4L37DTOBMT6ZCOJH6XD4","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":"9a776f7c43f51813785b43afa80f401923bdde7c915fc01f34a0322525ca5754","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T10:01:18Z","title_canon_sha256":"ba4a6490416482a487f6ec2b7c422ce2b96fd14eb41d80b1f3bfdf312ddca2fe"},"schema_version":"1.0","source":{"id":"1109.1951","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1951","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1951v4","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1951","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"MA6QHJ4L37DT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MA6QHJ4L37DTOBMT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MA6QHJ4L","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:4e852bc2b8a4b4d50aa188c1847f880021402871462a957e23e6dc97d52dfca4","target":"graph","created_at":"2026-05-18T03:36:37Z","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 permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern Matching problem one can additionally enforce that certain adjacent elements in the pattern must be mapped to adjacent elements in the text. This paper studies the parameterized complexity of this more general problem. We show W[1]-completeness with respect to the length of the pattern P. Under standard complexity theoretic assumptions this implies that no f","authors_text":"Marie-Louise Bruner, Martin Lackner","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T10:01:18Z","title":"A W[1]-Completeness Result for Generalized Permutation Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1951","kind":"arxiv","version":4},"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:c62c4b92fe337b45f9bdef4425d96e18fec8123cc1a17d69b9690701242f307a","target":"record","created_at":"2026-05-18T03:36:37Z","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":"9a776f7c43f51813785b43afa80f401923bdde7c915fc01f34a0322525ca5754","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-09T10:01:18Z","title_canon_sha256":"ba4a6490416482a487f6ec2b7c422ce2b96fd14eb41d80b1f3bfdf312ddca2fe"},"schema_version":"1.0","source":{"id":"1109.1951","kind":"arxiv","version":4}},"canonical_sha256":"603d03a78bdfc7370593f644e49fd71f3fa45f6757ab0426091dcbf05debdbcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"603d03a78bdfc7370593f644e49fd71f3fa45f6757ab0426091dcbf05debdbcc","first_computed_at":"2026-05-18T03:36:37.120015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.120015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+R5HCuOcnmTiV1Oky2HG/11oDyzCTFcudji6BV6+8oVavsXO6JCKfmfPixlgUeKXtI6YSUmcJusL5aaLCLP/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.120782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1951","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62c4b92fe337b45f9bdef4425d96e18fec8123cc1a17d69b9690701242f307a","sha256:4e852bc2b8a4b4d50aa188c1847f880021402871462a957e23e6dc97d52dfca4"],"state_sha256":"1ff73ba30523e5ec8157001e4c3e6ed174065f54463dd15f0e71020d55aa3115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwma+cBz8DzFM4WfEr8DO7D1tjepyHBKX8UMdquLkFdhRmWEZqjiMJCgS00bSx2+8S8eaGonnX+YMq3M9xrzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:38:02.163601Z","bundle_sha256":"af271b3f8fa138d6e09bcdfa5cb408c6f5c5aa0019757e8b9b7fa58f839dcea8"}}