{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZGMWTVOFJBIX35KI7FZG2UHY7R","short_pith_number":"pith:ZGMWTVOF","schema_version":"1.0","canonical_sha256":"c99969d5c548517df548f9726d50f8fc45625a9d7c73c7adfa6751b65f8e1f8b","source":{"kind":"arxiv","id":"1808.01071","version":1},"attestation_state":"computed","paper":{"title":"Right-to-left online construction of parameterized position heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Noriki Fujisato, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2018-08-03T02:24:26Z","abstract_excerpt":"Two strings of equal length are said to parameterized match if there is a bijection that maps the characters of one string to those of the other string, so that two strings become identical. The parameterized pattern matching problem is, given two strings $T$ and $P$, to find the occurrences of substrings in $T$ that parameterized match $P$. Diptarama et al. [Position Heaps for Parameterized Strings, CPM 2017] proposed an indexing data structure called parameterized position heaps, and gave a left-to-right online construction algorithm. In this paper, we present a right-to-left online construc"},"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":"1808.01071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-03T02:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"536a804349d3789679b36c3b86a948d58c12bebc4b6d556402561dc576a848e9","abstract_canon_sha256":"eaefe7e1308d0fb806b2eece72f11c78860a5ef08da621731023d8285c148a42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:59.137112Z","signature_b64":"cUhsEKSBmd8NJxXWGoR3YzqxZIwlKUpbk/jCmspXM3pmUjtyPIzuhVHcC4X9tAPCGLbK1IBfveKHehYY80xPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c99969d5c548517df548f9726d50f8fc45625a9d7c73c7adfa6751b65f8e1f8b","last_reissued_at":"2026-05-18T00:08:59.136485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:59.136485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Right-to-left online construction of parameterized position heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Masayuki Takeda, Noriki Fujisato, Shunsuke Inenaga, Yuto Nakashima","submitted_at":"2018-08-03T02:24:26Z","abstract_excerpt":"Two strings of equal length are said to parameterized match if there is a bijection that maps the characters of one string to those of the other string, so that two strings become identical. The parameterized pattern matching problem is, given two strings $T$ and $P$, to find the occurrences of substrings in $T$ that parameterized match $P$. Diptarama et al. [Position Heaps for Parameterized Strings, CPM 2017] proposed an indexing data structure called parameterized position heaps, and gave a left-to-right online construction algorithm. In this paper, we present a right-to-left online construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01071","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":"1808.01071","created_at":"2026-05-18T00:08:59.136573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01071v1","created_at":"2026-05-18T00:08:59.136573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01071","created_at":"2026-05-18T00:08:59.136573+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGMWTVOFJBIX","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGMWTVOFJBIX35KI","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGMWTVOF","created_at":"2026-05-18T12:33:07.085635+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/ZGMWTVOFJBIX35KI7FZG2UHY7R","json":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R.json","graph_json":"https://pith.science/api/pith-number/ZGMWTVOFJBIX35KI7FZG2UHY7R/graph.json","events_json":"https://pith.science/api/pith-number/ZGMWTVOFJBIX35KI7FZG2UHY7R/events.json","paper":"https://pith.science/paper/ZGMWTVOF"},"agent_actions":{"view_html":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R","download_json":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R.json","view_paper":"https://pith.science/paper/ZGMWTVOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01071&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGMWTVOFJBIX35KI7FZG2UHY7R/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGMWTVOFJBIX35KI7FZG2UHY7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R/action/storage_attestation","attest_author":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R/action/author_attestation","sign_citation":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R/action/citation_signature","submit_replication":"https://pith.science/pith/ZGMWTVOFJBIX35KI7FZG2UHY7R/action/replication_record"}},"created_at":"2026-05-18T00:08:59.136573+00:00","updated_at":"2026-05-18T00:08:59.136573+00:00"}