{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HDV5AN5QUDA3GX7PGWG23HZFXP","short_pith_number":"pith:HDV5AN5Q","schema_version":"1.0","canonical_sha256":"38ebd037b0a0c1b35fef358dad9f25bbe63827e26da7cf47262e9e968e979f2e","source":{"kind":"arxiv","id":"1906.06965","version":2},"attestation_state":"computed","paper":{"title":"Matching Patterns with Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.DS","authors_text":"Florin Manea, Markus L. Schmid","submitted_at":"2019-06-17T11:38:42Z","abstract_excerpt":"A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with restricted structure. In this paper we overview a series of recent results related to efficient matching for patterns with variables, as well as a series of extensions of this problem."},"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":"1906.06965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-17T11:38:42Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"11db4705245e8f1de95f52af5bb8020a54bf4bb935ed38fcbea81333c10c220e","abstract_canon_sha256":"9f33b2e7b786131d268c97f355df1ce6d7ab37be4599a225288cb276706447a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:23.893506Z","signature_b64":"K+XaGwBtK2MzUnR6tehaADxbc+ZvtUF8nhD7TAnrNi/ZhQdosPG3moLe7vyA/v6G66pwuFW/0W+S2UhcLXVrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38ebd037b0a0c1b35fef358dad9f25bbe63827e26da7cf47262e9e968e979f2e","last_reissued_at":"2026-05-17T23:39:23.892696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:23.892696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching Patterns with Variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.DS","authors_text":"Florin Manea, Markus L. Schmid","submitted_at":"2019-06-17T11:38:42Z","abstract_excerpt":"A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a given word, is generally NP-complete, but can be solved in polynomial-time for classes of patterns with restricted structure. In this paper we overview a series of recent results related to efficient matching for patterns with variables, as well as a series of extensions of this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06965","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":"1906.06965","created_at":"2026-05-17T23:39:23.892830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06965v2","created_at":"2026-05-17T23:39:23.892830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06965","created_at":"2026-05-17T23:39:23.892830+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDV5AN5QUDA3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDV5AN5QUDA3GX7P","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDV5AN5Q","created_at":"2026-05-18T12:33:18.533446+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/HDV5AN5QUDA3GX7PGWG23HZFXP","json":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP.json","graph_json":"https://pith.science/api/pith-number/HDV5AN5QUDA3GX7PGWG23HZFXP/graph.json","events_json":"https://pith.science/api/pith-number/HDV5AN5QUDA3GX7PGWG23HZFXP/events.json","paper":"https://pith.science/paper/HDV5AN5Q"},"agent_actions":{"view_html":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP","download_json":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP.json","view_paper":"https://pith.science/paper/HDV5AN5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06965&json=true","fetch_graph":"https://pith.science/api/pith-number/HDV5AN5QUDA3GX7PGWG23HZFXP/graph.json","fetch_events":"https://pith.science/api/pith-number/HDV5AN5QUDA3GX7PGWG23HZFXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP/action/storage_attestation","attest_author":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP/action/author_attestation","sign_citation":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP/action/citation_signature","submit_replication":"https://pith.science/pith/HDV5AN5QUDA3GX7PGWG23HZFXP/action/replication_record"}},"created_at":"2026-05-17T23:39:23.892830+00:00","updated_at":"2026-05-17T23:39:23.892830+00:00"}