{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CDI7LXZ6ZK5HSMLNUFUUFOTQJG","short_pith_number":"pith:CDI7LXZ6","schema_version":"1.0","canonical_sha256":"10d1f5df3ecaba79316da16942ba70498005e59cf4d120ad8a770a02079dfa17","source":{"kind":"arxiv","id":"1409.2398","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.2398","created_at":"2026-05-18T02:43:17.007296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2398v1","created_at":"2026-05-18T02:43:17.007296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2398","created_at":"2026-05-18T02:43:17.007296+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDI7LXZ6ZK5H","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDI7LXZ6ZK5HSMLN","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDI7LXZ6","created_at":"2026-05-18T12:28:22.404517+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/CDI7LXZ6ZK5HSMLNUFUUFOTQJG","json":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG.json","graph_json":"https://pith.science/api/pith-number/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/graph.json","events_json":"https://pith.science/api/pith-number/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/events.json","paper":"https://pith.science/paper/CDI7LXZ6"},"agent_actions":{"view_html":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG","download_json":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG.json","view_paper":"https://pith.science/paper/CDI7LXZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2398&json=true","fetch_graph":"https://pith.science/api/pith-number/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/graph.json","fetch_events":"https://pith.science/api/pith-number/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/action/storage_attestation","attest_author":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/action/author_attestation","sign_citation":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/action/citation_signature","submit_replication":"https://pith.science/pith/CDI7LXZ6ZK5HSMLNUFUUFOTQJG/action/replication_record"}},"created_at":"2026-05-18T02:43:17.007296+00:00","updated_at":"2026-05-18T02:43:17.007296+00:00"}