{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6TYIHVCPJX3B2ZY3RKQYTUEYWU","short_pith_number":"pith:6TYIHVCP","schema_version":"1.0","canonical_sha256":"f4f083d44f4df61d671b8aa189d098b5082b2ffd23607205ce7aa541b4a5c072","source":{"kind":"arxiv","id":"1908.01562","version":1},"attestation_state":"computed","paper":{"title":"Heuristic Algorithm for Generalized Function Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Radu Stefan Mincu","submitted_at":"2019-08-05T11:24:11Z","abstract_excerpt":"The problem of generalized function matching can be defined as follows: given a pattern $p=p_1 \\cdots p_m$ and a text $t=t_1 \\cdots t_n$, find a mapping $f:\\Sigma_p\\rightarrow\\Sigma_t^{*}$ and all text locations $i$ such that $f(p_1) f(p_2) \\cdots f(p_m) = t_i \\cdots t_j$, a substring of $t$.\n  By modifying the restrictions of the matching function $f$, one can obtain different matching problems, many of which have important applications. When $f:\\Sigma_p\\rightarrow\\Sigma_t$ we are faced with problems found in the well-established field of combinatorial pattern matching. If the single characte"},"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":"1908.01562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-08-05T11:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"6dd8e55fac58ec157ae6229d4e659a0e3def4558afaa2db0d559e52252fabc0c","abstract_canon_sha256":"c1f8c0d7af0bdb27b0e812c288f19cae89126850e96021e97d014b18e653e585"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:31.648941Z","signature_b64":"/5iqgNhVQWXqvSPAdefwEpd0N5jiAa+oey/Xr028biNFQa54yw4whXb+4UV0Qk+atOsvC4n1HFEdRhSylqSPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f083d44f4df61d671b8aa189d098b5082b2ffd23607205ce7aa541b4a5c072","last_reissued_at":"2026-07-04T23:51:31.648401Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:31.648401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristic Algorithm for Generalized Function Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Radu Stefan Mincu","submitted_at":"2019-08-05T11:24:11Z","abstract_excerpt":"The problem of generalized function matching can be defined as follows: given a pattern $p=p_1 \\cdots p_m$ and a text $t=t_1 \\cdots t_n$, find a mapping $f:\\Sigma_p\\rightarrow\\Sigma_t^{*}$ and all text locations $i$ such that $f(p_1) f(p_2) \\cdots f(p_m) = t_i \\cdots t_j$, a substring of $t$.\n  By modifying the restrictions of the matching function $f$, one can obtain different matching problems, many of which have important applications. When $f:\\Sigma_p\\rightarrow\\Sigma_t$ we are faced with problems found in the well-established field of combinatorial pattern matching. If the single characte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01562","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01562/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01562","created_at":"2026-07-04T23:51:31.648460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01562v1","created_at":"2026-07-04T23:51:31.648460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01562","created_at":"2026-07-04T23:51:31.648460+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TYIHVCPJX3B","created_at":"2026-07-04T23:51:31.648460+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TYIHVCPJX3B2ZY3","created_at":"2026-07-04T23:51:31.648460+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TYIHVCP","created_at":"2026-07-04T23:51:31.648460+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/6TYIHVCPJX3B2ZY3RKQYTUEYWU","json":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU.json","graph_json":"https://pith.science/api/pith-number/6TYIHVCPJX3B2ZY3RKQYTUEYWU/graph.json","events_json":"https://pith.science/api/pith-number/6TYIHVCPJX3B2ZY3RKQYTUEYWU/events.json","paper":"https://pith.science/paper/6TYIHVCP"},"agent_actions":{"view_html":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU","download_json":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU.json","view_paper":"https://pith.science/paper/6TYIHVCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01562&json=true","fetch_graph":"https://pith.science/api/pith-number/6TYIHVCPJX3B2ZY3RKQYTUEYWU/graph.json","fetch_events":"https://pith.science/api/pith-number/6TYIHVCPJX3B2ZY3RKQYTUEYWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU/action/storage_attestation","attest_author":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU/action/author_attestation","sign_citation":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU/action/citation_signature","submit_replication":"https://pith.science/pith/6TYIHVCPJX3B2ZY3RKQYTUEYWU/action/replication_record"}},"created_at":"2026-07-04T23:51:31.648460+00:00","updated_at":"2026-07-04T23:51:31.648460+00:00"}