{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CDI7LXZ6ZK5HSMLNUFUUFOTQJG","short_pith_number":"pith:CDI7LXZ6","canonical_record":{"source":{"id":"1409.2398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-08T15:34:32Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"1d24d74487b714a3d4babc35bec2b7e956f57fe6fe084cd90b90b46ad50b7919","abstract_canon_sha256":"6895a79fcddbd4957783fb7570f15252920683189f4d8e705732c3f815fd1694"},"schema_version":"1.0"},"canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","source":{"kind":"arxiv","id":"1409.2398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2398","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2398v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2398","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"CDI7LXZ6ZK5H","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDI7LXZ6ZK5HSMLN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDI7LXZ6","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CDI7LXZ6ZK5HSMLNUFUUFOTQJG","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-08T15:34:32Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"1d24d74487b714a3d4babc35bec2b7e956f57fe6fe084cd90b90b46ad50b7919","abstract_canon_sha256":"6895a79fcddbd4957783fb7570f15252920683189f4d8e705732c3f815fd1694"},"schema_version":"1.0"},"canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:17.007807Z","signature_b64":"AXfa8sxJYbclPKrXLKFvDqIBRXyOOmQAm6Ckuwic4ZhJ2KAZhWK5zKyFwLL/+MVFap6xWsJFHT+DQgfbYksvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","last_reissued_at":"2026-05-18T02:43:17.007204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:17.007204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2398","source_version":1,"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:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgF9Ww9dzkL7L21pc/2bI+tN/NeQoFsLA9NTl8xoeFzj2U61GafcaWyVOYNeUHFsuxoEl3WM1gCiaVJobmzCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:01:13.454033Z"},"content_sha256":"a1b7b313f16efc0b23b8db2628b5639bb4c34d6319ffd86e930df8a37df3a304","schema_version":"1.0","event_id":"sha256:a1b7b313f16efc0b23b8db2628b5639bb4c34d6319ffd86e930df8a37df3a304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CDI7LXZ6ZK5HSMLNUFUUFOTQJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Study of Maximum Generalized Pattern Matching Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.CC","authors_text":"Alexandru Popa, Sebastian Ordyniak","submitted_at":"2014-09-08T15:34:32Z","abstract_excerpt":"The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979]. Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that applying the mapping to p results in t. Very recently, the problem has been investigated within the framework of parameterized complexity [Fernau, Schmid, and Villanger, 2013].\n  In this paper we study the parameterized complexity of the optimization variant of GFM (called Max-GFM), which has been introduced in [Amir and Nor, 2007]. Here, one is al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2398","kind":"arxiv","version":1},"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:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Prw4Gm9tQ3Op1+R18m5t3GZtDhdp4vMFKQOutlOseK0EWAUZ9KdN2PODzpcbfOdr0ZFYu5hFpU8ESoImAW3XAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:01:13.454388Z"},"content_sha256":"8bb4208c150ec8fcadca6589895711a6119c0e1f4e7dd67b1b8dc99f18d0b8ca","schema_version":"1.0","event_id":"sha256:8bb4208c150ec8fcadca6589895711a6119c0e1f4e7dd67b1b8dc99f18d0b8ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/bundle.json","state_url":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/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-07-03T10:01:13Z","links":{"resolver":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG","bundle":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/bundle.json","state":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDI7LXZ6ZK5HSMLNUFUUFOTQJG","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":"6895a79fcddbd4957783fb7570f15252920683189f4d8e705732c3f815fd1694","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-08T15:34:32Z","title_canon_sha256":"1d24d74487b714a3d4babc35bec2b7e956f57fe6fe084cd90b90b46ad50b7919"},"schema_version":"1.0","source":{"id":"1409.2398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2398","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2398v1","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2398","created_at":"2026-05-18T02:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"CDI7LXZ6ZK5H","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDI7LXZ6ZK5HSMLN","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDI7LXZ6","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:8bb4208c150ec8fcadca6589895711a6119c0e1f4e7dd67b1b8dc99f18d0b8ca","target":"graph","created_at":"2026-05-18T02:43:17Z","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 generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979]. Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that applying the mapping to p results in t. Very recently, the problem has been investigated within the framework of parameterized complexity [Fernau, Schmid, and Villanger, 2013].\n  In this paper we study the parameterized complexity of the optimization variant of GFM (called Max-GFM), which has been introduced in [Amir and Nor, 2007]. Here, one is al","authors_text":"Alexandru Popa, Sebastian Ordyniak","cross_cats":["cs.DS","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-08T15:34:32Z","title":"A Parameterized Study of Maximum Generalized Pattern Matching Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2398","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:a1b7b313f16efc0b23b8db2628b5639bb4c34d6319ffd86e930df8a37df3a304","target":"record","created_at":"2026-05-18T02:43:17Z","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":"6895a79fcddbd4957783fb7570f15252920683189f4d8e705732c3f815fd1694","cross_cats_sorted":["cs.DS","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-08T15:34:32Z","title_canon_sha256":"1d24d74487b714a3d4babc35bec2b7e956f57fe6fe084cd90b90b46ad50b7919"},"schema_version":"1.0","source":{"id":"1409.2398","kind":"arxiv","version":1}},"canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","first_computed_at":"2026-05-18T02:43:17.007204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:17.007204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXfa8sxJYbclPKrXLKFvDqIBRXyOOmQAm6Ckuwic4ZhJ2KAZhWK5zKyFwLL/+MVFap6xWsJFHT+DQgfbYksvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:17.007807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1b7b313f16efc0b23b8db2628b5639bb4c34d6319ffd86e930df8a37df3a304","sha256:8bb4208c150ec8fcadca6589895711a6119c0e1f4e7dd67b1b8dc99f18d0b8ca"],"state_sha256":"f36707e7e32298bdf402bb5643d2bc4de613a0571d64fd51ce03c2b3d8405341"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRF5fogF1DX8o5UbTLTrkrw9Zfzylg40N3UjKv9uSFpwlwG8UCLd2e3YX8yCxz0HLZFBF6VVS3gPq6oStLeiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T10:01:13.456482Z","bundle_sha256":"3f8c5d73f8f2ee20be42dc41d0db3c6e032f54babc0c83339d9eeeb27b81aefe"}}