{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RN45F3BAJOV542DZD66Z6PL5AC","short_pith_number":"pith:RN45F3BA","schema_version":"1.0","canonical_sha256":"8b79d2ec204babde68791fbd9f3d7d0087978dead91773d7c86f469d484217fb","source":{"kind":"arxiv","id":"1906.05486","version":1},"attestation_state":"computed","paper":{"title":"On Longest Common Property Preserved Substring Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Kazuki Kai, Masayuki Takeda, Shunsuke Inenaga, Tomasz Kociumaka, Yuto Nakashima","submitted_at":"2019-06-13T05:24:44Z","abstract_excerpt":"We revisit the problem of longest common property preserving substring queries introduced by~Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set $X$ of $k$ strings of total length $n$ that can be pre-processed so that, given a query string $y$ and a positive integer $k'\\leq k$, we can determine the longest substring of $y$ that satisfies some specific property and is common to at least $k'$ strings in $X$. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic subs"},"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.05486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-13T05:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"2ab1939c99ebd923ded47c4390468a884c3424e9c9dc8afc34c727a5276f6160","abstract_canon_sha256":"0c5439720d9393f65a18c068e0b63f8248e683ef69d6829a304bafd3cd75b3cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:25.246335Z","signature_b64":"rTsPDmqovbogNsH3SQjGKNWehEsbmA6C+Nut7hJDZPY0Ve2TucX57r/oEAQvj4sB+xbIIEjhQJstiScH+9njBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b79d2ec204babde68791fbd9f3d7d0087978dead91773d7c86f469d484217fb","last_reissued_at":"2026-05-17T23:43:25.245939Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:25.245939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Longest Common Property Preserved Substring Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Kazuki Kai, Masayuki Takeda, Shunsuke Inenaga, Tomasz Kociumaka, Yuto Nakashima","submitted_at":"2019-06-13T05:24:44Z","abstract_excerpt":"We revisit the problem of longest common property preserving substring queries introduced by~Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set $X$ of $k$ strings of total length $n$ that can be pre-processed so that, given a query string $y$ and a positive integer $k'\\leq k$, we can determine the longest substring of $y$ that satisfies some specific property and is common to at least $k'$ strings in $X$. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic subs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05486","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":"1906.05486","created_at":"2026-05-17T23:43:25.245996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05486v1","created_at":"2026-05-17T23:43:25.245996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05486","created_at":"2026-05-17T23:43:25.245996+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN45F3BAJOV5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN45F3BAJOV542DZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN45F3BA","created_at":"2026-05-18T12:33:27.125529+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/RN45F3BAJOV542DZD66Z6PL5AC","json":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC.json","graph_json":"https://pith.science/api/pith-number/RN45F3BAJOV542DZD66Z6PL5AC/graph.json","events_json":"https://pith.science/api/pith-number/RN45F3BAJOV542DZD66Z6PL5AC/events.json","paper":"https://pith.science/paper/RN45F3BA"},"agent_actions":{"view_html":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC","download_json":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC.json","view_paper":"https://pith.science/paper/RN45F3BA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05486&json=true","fetch_graph":"https://pith.science/api/pith-number/RN45F3BAJOV542DZD66Z6PL5AC/graph.json","fetch_events":"https://pith.science/api/pith-number/RN45F3BAJOV542DZD66Z6PL5AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC/action/storage_attestation","attest_author":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC/action/author_attestation","sign_citation":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC/action/citation_signature","submit_replication":"https://pith.science/pith/RN45F3BAJOV542DZD66Z6PL5AC/action/replication_record"}},"created_at":"2026-05-17T23:43:25.245996+00:00","updated_at":"2026-05-17T23:43:25.245996+00:00"}