{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O2FMI7P3NQKDIUZD6U7OABWFVD","short_pith_number":"pith:O2FMI7P3","schema_version":"1.0","canonical_sha256":"768ac47dfb6c14345323f53ee006c5a8ea44e7ea38f7f072382b8b3edd76478a","source":{"kind":"arxiv","id":"1603.07457","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Pattern Matching -- Succinctly","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnab Ganguly, Rahul Shah, Sharma V. Thankachan","submitted_at":"2016-03-24T07:38:18Z","abstract_excerpt":"We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\\mathsf{T}$ contains $n$ characters from a static alphabet $\\Sigma_s$ and a parameterized alphabet $\\Sigma_p$, where $\\Sigma_s \\cap \\Sigma_p = \\varnothing$ and $|\\Sigma_s \\cup \\Sigma_p|=\\sigma$. A pattern $P$ matches a substring $S$ of $\\mathsf{T}$ iff the static characters match exactly, and there exists a one-to-one funct"},"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":"1603.07457","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-24T07:38:18Z","cross_cats_sorted":[],"title_canon_sha256":"48ba8f45317691ebd125b19c9f4983fb432e9eb4ab3bfdff74c88897ccf3bb5f","abstract_canon_sha256":"256a37cd053aa631f03499bb5340683e52e030d2d36d554cbfca91d2bf853f5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.599472Z","signature_b64":"645N3oeelf5/m/7+78Dv3iiCKH4yttXrYtx4YpzceIQHthrqOop0fzFzokjstCb0Uc/angSLwnQlLNBF3eJAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"768ac47dfb6c14345323f53ee006c5a8ea44e7ea38f7f072382b8b3edd76478a","last_reissued_at":"2026-05-18T01:17:36.598728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.598728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Pattern Matching -- Succinctly","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnab Ganguly, Rahul Shah, Sharma V. Thankachan","submitted_at":"2016-03-24T07:38:18Z","abstract_excerpt":"We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\\mathsf{T}$ contains $n$ characters from a static alphabet $\\Sigma_s$ and a parameterized alphabet $\\Sigma_p$, where $\\Sigma_s \\cap \\Sigma_p = \\varnothing$ and $|\\Sigma_s \\cup \\Sigma_p|=\\sigma$. A pattern $P$ matches a substring $S$ of $\\mathsf{T}$ iff the static characters match exactly, and there exists a one-to-one funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07457","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":"1603.07457","created_at":"2026-05-18T01:17:36.598844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07457v2","created_at":"2026-05-18T01:17:36.598844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07457","created_at":"2026-05-18T01:17:36.598844+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2FMI7P3NQKD","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2FMI7P3NQKDIUZD","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2FMI7P3","created_at":"2026-05-18T12:30:36.002864+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/O2FMI7P3NQKDIUZD6U7OABWFVD","json":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD.json","graph_json":"https://pith.science/api/pith-number/O2FMI7P3NQKDIUZD6U7OABWFVD/graph.json","events_json":"https://pith.science/api/pith-number/O2FMI7P3NQKDIUZD6U7OABWFVD/events.json","paper":"https://pith.science/paper/O2FMI7P3"},"agent_actions":{"view_html":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD","download_json":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD.json","view_paper":"https://pith.science/paper/O2FMI7P3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07457&json=true","fetch_graph":"https://pith.science/api/pith-number/O2FMI7P3NQKDIUZD6U7OABWFVD/graph.json","fetch_events":"https://pith.science/api/pith-number/O2FMI7P3NQKDIUZD6U7OABWFVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD/action/storage_attestation","attest_author":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD/action/author_attestation","sign_citation":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD/action/citation_signature","submit_replication":"https://pith.science/pith/O2FMI7P3NQKDIUZD6U7OABWFVD/action/replication_record"}},"created_at":"2026-05-18T01:17:36.598844+00:00","updated_at":"2026-05-18T01:17:36.598844+00:00"}