{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R4TDYIHPRARJH2WI6KL6F7APHN","short_pith_number":"pith:R4TDYIHP","schema_version":"1.0","canonical_sha256":"8f263c20ef882293eac8f297e2fc0f3b5b4bbdc9e5336d11a2b669ac25a353cb","source":{"kind":"arxiv","id":"2506.04935","version":1},"attestation_state":"computed","paper":{"title":"Resilient Pattern Mining","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Loukides, Lorraine A. K. Ayad, Manal Mohamed, Panagiotis Charalampopoulos, Pengxin Bian, Solon P. Pissis","submitted_at":"2025-06-05T12:10:19Z","abstract_excerpt":"Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string $S$ of length $n$ that occur at least $\\tau$ times in $S$, for some integer $\\tau\\in[1,n]$. We introduce a resilient version of this classic problem, which we term the $(\\tau, k)$-Resilient Pattern Mining (RPM) problem. Given a string $S$ of length $n$ and two integers $\\tau, k\\in[1,n]$, RPM asks for the set of substrings of $S$ that occur at least $\\tau$ times in $S$, even when the letters at any $k$ positions of $S$ are substituted by other letters. Unlike"},"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":"2506.04935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T12:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"5f3e0774bbb04e6d43b826f21adc7b440fbae78d4c463ce27f08050ce906f098","abstract_canon_sha256":"aaa7195e77f346f8f05667b02346432cddb26d38946d01d694a0140c82279b54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:39.324340Z","signature_b64":"VjW4FCUWWzP8gKXQ8qlj4AcFBcIe46SqbNLhwY7zwpDDTKe9s8mCdOybdRn1O69qkpxgT0i3Ul6ZaRH1UQ/7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f263c20ef882293eac8f297e2fc0f3b5b4bbdc9e5336d11a2b669ac25a353cb","last_reissued_at":"2026-07-05T11:16:39.323804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:39.323804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resilient Pattern Mining","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Loukides, Lorraine A. K. Ayad, Manal Mohamed, Panagiotis Charalampopoulos, Pengxin Bian, Solon P. Pissis","submitted_at":"2025-06-05T12:10:19Z","abstract_excerpt":"Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string $S$ of length $n$ that occur at least $\\tau$ times in $S$, for some integer $\\tau\\in[1,n]$. We introduce a resilient version of this classic problem, which we term the $(\\tau, k)$-Resilient Pattern Mining (RPM) problem. Given a string $S$ of length $n$ and two integers $\\tau, k\\in[1,n]$, RPM asks for the set of substrings of $S$ that occur at least $\\tau$ times in $S$, even when the letters at any $k$ positions of $S$ are substituted by other letters. Unlike"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04935","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/2506.04935/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":"2506.04935","created_at":"2026-07-05T11:16:39.323871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04935v1","created_at":"2026-07-05T11:16:39.323871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04935","created_at":"2026-07-05T11:16:39.323871+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4TDYIHPRARJ","created_at":"2026-07-05T11:16:39.323871+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4TDYIHPRARJH2WI","created_at":"2026-07-05T11:16:39.323871+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4TDYIHP","created_at":"2026-07-05T11:16:39.323871+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/R4TDYIHPRARJH2WI6KL6F7APHN","json":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN.json","graph_json":"https://pith.science/api/pith-number/R4TDYIHPRARJH2WI6KL6F7APHN/graph.json","events_json":"https://pith.science/api/pith-number/R4TDYIHPRARJH2WI6KL6F7APHN/events.json","paper":"https://pith.science/paper/R4TDYIHP"},"agent_actions":{"view_html":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN","download_json":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN.json","view_paper":"https://pith.science/paper/R4TDYIHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04935&json=true","fetch_graph":"https://pith.science/api/pith-number/R4TDYIHPRARJH2WI6KL6F7APHN/graph.json","fetch_events":"https://pith.science/api/pith-number/R4TDYIHPRARJH2WI6KL6F7APHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN/action/storage_attestation","attest_author":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN/action/author_attestation","sign_citation":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN/action/citation_signature","submit_replication":"https://pith.science/pith/R4TDYIHPRARJH2WI6KL6F7APHN/action/replication_record"}},"created_at":"2026-07-05T11:16:39.323871+00:00","updated_at":"2026-07-05T11:16:39.323871+00:00"}