{"as_of":"2026-08-08T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d46bf9d8a6867cd868f1fee91f233cba32415eaa6effa64a65fa7505496f29ff","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:48:15.208322Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.04935/citation-record","integrity":"/paper/2506.04935/integrity","json":"/paper/2506.04935/citation-record.json","paper":"/paper/2506.04935"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:14.994658Z","title":"Resilient k-clustering","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:14.994658Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:464d42eec7ddc06fe7e5f5bea9841a65ad5111d81d29826cf991134aab511c36","observation_id":"1299522c-0b3b-41a8-b513-8423f4f0dfbe","resolution":{"observed_at":"2026-08-07T10:48:14.994658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:14.999020Z","title":"Center-based clustering under perturbation stability","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:14.999020Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:2a56dcbe65625de5723e2c437bd93a73f884c3295b61f2bf16baea790c5a3892","observation_id":"b979908e-1a1b-435b-bd13-fb2dbf743269","resolution":{"observed_at":"2026-08-07T10:48:14.999020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s1570-8667(03)00065-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.593093Z","title":"Replacing suffix trees with enhanced suffix arrays","venue":null,"work_id":"d117f59d-de9e-4863-9850-f143118b6255","year":2004},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.003058Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:3767a3eaf20c2b0bc39e595f440a79373e9002d360e5caf2c6dee26fb119f3ca","observation_id":"100b18e5-ac5f-48a9-86f6-80b308820953","resolution":{"observed_at":"2026-08-07T10:48:15.597557Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3418683","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.582634Z","title":"Pissis, Giovanna Rosone, and Michelle Sweering","venue":null,"work_id":"a74c1408-d99c-4369-9095-24ef84e9cf70","year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.007323Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:472388820fde91fd92dbf9f67b72428747690964adc67d7ba8d91faff50e00f9","observation_id":"ae117583-8029-43ac-ad31-8904a63b8f6b","resolution":{"observed_at":"2026-08-07T10:48:15.586100Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/c2015-0-04136-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.572564Z","title":"Big data: principles and paradigms","venue":null,"work_id":"b6e2a3d9-cdf0-4c48-a908-a09d11995bc1","year":2016},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.011183Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:158c17b6124eb794d1ac9dd9c2509886a76a3913242ead9ac1f3fb087360cb56","observation_id":"14760f30-0f58-43ae-8ad2-2e6bafc72775","resolution":{"observed_at":"2026-08-07T10:48:15.576160Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.015100Z","title":"Pissis, Giulia Punzi, Leen Stougie, and Michelle Sweering","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.015100Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:8bd9c6906a924431e93522202dec15e5800c736af828bbea7387f148bb9fb8a0","observation_id":"8669cf73-ce49-4316-91a7-15a49dc93463","resolution":{"observed_at":"2026-08-07T10:48:15.015100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.019107Z","title":"Phoni: Streamed matching statistics with multi-genome references","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.019107Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:4652fe89572a571b56bd16dadd7f5105a740a8dd49d86f1545fa069dc332c75c","observation_id":"767b9d2c-72f4-4d9c-8875-bdaa1336478e","resolution":{"observed_at":"2026-08-07T10:48:15.019107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.022712Z","title":"The \"runs\" theorem","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.022712Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:c527a293ac67e37cb71c2be9ad0b0033a39e06a946dad81ea1c8b44bbaf603ab","observation_id":"30aacd07-cac6-4b69-ac03-c66f346d3030","resolution":{"observed_at":"2026-08-07T10:48:15.022712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.025979Z","title":"Are stable instances easy? Comb","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.025979Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:904edfe1cfa8f76fc3782a6076220e6b0d31cac67957b91976c45843bf2a3ca8","observation_id":"9bf8afba-7a0a-4744-a3d8-ba968b5538ed","resolution":{"observed_at":"2026-08-07T10:48:15.025979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.029668Z","title":"Brown and Robert E","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.029668Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:9d442bbcf87f1e73414d2e661ff0714204a82b6e0f4a2aa9196f4fe751391c02","observation_id":"f77b1443-b857-43ba-ad89-5da46e31cec1","resolution":{"observed_at":"2026-08-07T10:48:15.029668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx-random.2018.9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.548761Z","title":"Perturbation resilient clustering for k-center and related problems via LP relaxations","venue":null,"work_id":"c4546cc2-4643-4cfc-af62-9cbb4683adc1","year":2018},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.033096Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:0df5f2e25049bf29946b02505864e544237a6c7ac48631deb373449630307de8","observation_id":"918256ff-f8f6-40f7-98ef-9915dd030c1e","resolution":{"observed_at":"2026-08-07T10:48:15.552941Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10951-021-00691-w","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.538936Z","title":"Golin, Tak Wah Lam, and Dorian Nogneng","venue":null,"work_id":"9ccd6f80-da60-4499-af5d-165c06262913","year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.037138Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:7d485ad797f67c7d805b3e47652d7a9d82a987fbc74bdbd14ff350d6efd8fe79","observation_id":"b534fdc1-352d-475b-9f88-10eb041b77cd","resolution":{"observed_at":"2026-08-07T10:48:15.542435Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.040565Z","title":"Algorithms on strings","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.040565Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:556a471ab8a644b422628a576e944a72f9c17ea254209b6989d093950997ae1f","observation_id":"e26389c9-e079-4436-b4ab-0ac60adff141","resolution":{"observed_at":"2026-08-07T10:48:15.040565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.044176Z","title":"Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, and Tomasz Walen","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.044176Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:998c103a43c5c567e5717d7c5bf93de7c3cd13b9191ed6928f7ca4e5277a0e7d","observation_id":"33947d25-9aa7-471a-8ba1-77a3df6c50ce","resolution":{"observed_at":"2026-08-07T10:48:15.044176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.597416Z","title":"Cormen, Charles E","venue":null,"work_id":"422e4b7a-bf7a-4f03-9797-c2d5769dbc57","year":2009},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.047886Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:611ed99fc9ff01f2c2dd7bf8fcd939c5e51b66405444ab95a2d49a9dbfca4c4d","observation_id":"477cfc0a-e17c-43fe-952d-4cafb28e50e8","resolution":{"observed_at":"2026-08-07T10:48:16.602057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.051559Z","title":"Computational pan-genomics: status, promises and challenges","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.051559Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:9b0ff74a951a08436fa745280aaa763172c08442babb3be8cb881c4b1b558ede","observation_id":"dc6bbece-d417-4765-8d4d-006c4b536127","resolution":{"observed_at":"2026-08-07T10:48:15.051559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/21092","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.509600Z","title":"Hiding messages in DNA microdots","venue":null,"work_id":"c69272fc-8e84-4ccd-9a35-daf7e80f71d2","year":1999},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.055091Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:2066e5d8b10d76350a7740b7928720aa6c1b22e346d4e12d68bc7a94d9797b65","observation_id":"56b3da91-bdf1-4c01-83c5-b4bfd9c5a8fd","resolution":{"observed_at":"2026-08-07T10:48:15.513351Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2016.11.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.498535Z","title":"Refined algorithms for hitting many intervals","venue":null,"work_id":"743d6933-6730-4cac-8cfe-e9ed8a1f9e3d","year":2017},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.058897Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:234fdc95bd2c02418d634ff709fcee51f724bea8364712df98a977ca56ded707","observation_id":"eccd4da9-ed7c-4be3-875f-b3d16d86bb44","resolution":{"observed_at":"2026-08-07T10:48:15.502102Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.062295Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.062295Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:969a6d22d0ff4e802f8feb4333c66c3b217a5d41dff1be0064e9aae784e9b036","observation_id":"c49b90a0-bbb2-4061-9459-c77649272fca","resolution":{"observed_at":"2026-08-07T10:48:15.062295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tkde.2010.242","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.482094Z","title":"Puglisi, and Andrew Turpin","venue":null,"work_id":"8821e421-8580-4fb5-b8c2-c49bc76c18ef","year":2012},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.067069Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:1e60ccb470f2b816f6f52b30f1f3b43f7817b8a97a864870230163a57a4d6213","observation_id":"bda6857e-04d2-4892-b5a6-47c3648df967","resolution":{"observed_at":"2026-08-07T10:48:15.485780Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.070515Z","title":"Linear time runs over general ordered alphabets","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.070515Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:e64a2494cf039afa42e399480332f8f10c29fb4824a7845cbe6f623195a920a6","observation_id":"cd93d71b-9c09-436b-b1d2-d1b517c4e7ff","resolution":{"observed_at":"2026-08-07T10:48:15.070515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0304-3975(03)00320-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.466184Z","title":"Evans, Andrew D","venue":null,"work_id":"f5474372-27a7-4935-af5d-47b7be9483e9","year":2003},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.074606Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:c02dd4db2010b8aced9a40054bc0353717f8c09de65184b7ba54fd88f17f6167","observation_id":"a9c6c8e7-c81f-4e6d-a25c-f882b2db1bd4","resolution":{"observed_at":"2026-08-07T10:48:15.469726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.078379Z","title":"Optimal suffix tree construction with large alphabets","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.078379Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:48049cec3f59baed75375ef365c521af8d5c7af8300a458ebe2b5f8399cca5da","observation_id":"384a3a1b-69e8-4a48-bcc2-4cd04f4f7435","resolution":{"observed_at":"2026-08-07T10:48:15.078379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.586341Z","title":"NCBI genome datasets, 2024","venue":null,"work_id":"6f811ddf-bcc3-48c1-934f-6841da781a40","year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.081906Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:0cbceda4a859cff79290d9089ab27356f437f11b0335dba78643868367f114b7","observation_id":"4e0c3bfd-7f5c-49ce-8c8a-c6e21c1bd0da","resolution":{"observed_at":"2026-08-07T10:48:16.590253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icdm.2005.62","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.455514Z","title":"Fast frequent string mining using suffix arrays","venue":null,"work_id":"35635349-5cbc-4f15-8d76-009dbdab3186","year":2005},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.085191Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:2062b307d25c23aaec7d8517d942580f0d287afde07f4c4e99e54f0c66623e48","observation_id":"d7411aac-56ee-43e5-b82f-044d2f21651d","resolution":{"observed_at":"2026-08-07T10:48:15.459252Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11871637","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Optimal string mining under frequency constraints","venue":"Lecture notes in computer science","work_id":"f361f598-9b9c-4f2d-8aa3-a9f2c3066622","year":2006},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.088520Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:46195b76c6fac79866e8b90e1b1658ce9722db9f85c6e3db4363cbe148963758","observation_id":"e320e611-0303-4627-8251-4f3f1d1bf33e","resolution":{"observed_at":"2026-08-07T10:48:15.448473Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.091839Z","title":"Optimal dynamic strings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.091839Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:5d445bed33080160cf7a0a6172205c9e853b02ce149e22c5d216f047cad8e2aa","observation_id":"6b2bc2a4-b392-4cfd-bb10-da5e19f6656a","resolution":{"observed_at":"2026-08-07T10:48:15.091839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.095298Z","title":"Fully functional suffix trees and optimal text searching in bwt-runs bounded space","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.095298Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:c68dc5c293d3a312afc6d9463b4dd0d2c32641831da97b9b72c69ec9ec9d17d2","observation_id":"f95fa236-830e-4032-999a-3138628c3f03","resolution":{"observed_at":"2026-08-07T10:48:15.095298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.098604Z","title":"Finding near-duplicate web pages: a large-scale evaluation of algorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.098604Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:f1796047b2727a614917a3d55f6d42c211973d0aa8c8a88f0fb96da07857244c","observation_id":"0d057514-3d50-4b13-924d-a75517a998b0","resolution":{"observed_at":"2026-08-07T10:48:15.098604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.101552Z","title":"Data Mining: Concepts and Techniques, 3rd edition","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.101552Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:8fee15b2351307e6565a79f5a4620ac800ac45f09979c2c93a9f2c199bf77391","observation_id":"688a2e20-8bf3-43b0-93b1-c0286cee6bbd","resolution":{"observed_at":"2026-08-07T10:48:15.101552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.575524Z","title":"Average sensitivity of decision tree learning","venue":null,"work_id":"e66149b6-c14c-47c7-9a69-16ac0a73d7e9","year":2023},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.104834Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:115654e5bbbf26d79eefe61ab7d452c039abb2559e8798f73cb0f5a46db7ff2e","observation_id":"ea0e74c1-c1a4-44d7-8d8b-f885fd2d6425","resolution":{"observed_at":"2026-08-07T10:48:16.579576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/nar/29.22.4633","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.412644Z","title":"Choudhuri, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, and Robert Giegerich","venue":null,"work_id":"5a3e6e61-18dc-443e-bb73-2e08a3a3bbc9","year":2001},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.107879Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:4c30413b80aa123b6a9786bb90f796984d0811e726475cd408fba29baebb6ee5","observation_id":"4bc6cb13-1d8a-44c1-85f7-faf07fc1b19e","resolution":{"observed_at":"2026-08-07T10:48:15.417102Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icsm.2005.52","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.402206Z","title":null,"venue":null,"work_id":"7f445d6c-a4cd-4aa5-92ba-57969883bbe7","year":2005},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.111095Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:6cccda8186d64fcef70f553d15177dd3fcdb56f585b0b64ff45a1c24fb3207b8","observation_id":"3df74346-ee62-4a9b-8612-e9846432e223","resolution":{"observed_at":"2026-08-07T10:48:15.405916Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.114352Z","title":"Knuth, James H","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.114352Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:6cd055a04c60b1f701ed7c1dcfc89b1778926d292d3a8839cf4b5f40f88c7937","observation_id":"64ac5c3c-06ae-4454-92eb-842d4b817c64","resolution":{"observed_at":"2026-08-07T10:48:15.114352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.117550Z","title":"Linear-time longest-common-prefix computation in suffix arrays and its applications","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.117550Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:7cf8954449643a3d1156a4cad6a2409e846ec66029b3e00897e8e23e0f425de6","observation_id":"e0a7158a-f820-466b-9324-c9da9fad870c","resolution":{"observed_at":"2026-08-07T10:48:15.117550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.120867Z","title":"Minimal suffix and rotation of a substring in optimal time","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.120867Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:78f60d581728207069c771f6248a5aae5b1cddfd886c4be0146df9a6f1f0d406","observation_id":"4b5cf41b-8c3a-4121-9544-fecc2c397820","resolution":{"observed_at":"2026-08-07T10:48:15.120867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.123982Z","title":"Internal pattern matching queries in a text and applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.123982Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:2e4d14e53a753478463694fff2f741fcae69b22fb916cbdfb9d2f94dbbfa4a59","observation_id":"19fd3252-ceff-43e7-958d-41baecbeb01c","resolution":{"observed_at":"2026-08-07T10:48:15.123982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/hmg/ddi226","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.364817Z","title":"Small fitness effect of mutations in highly conserved non-coding regions","venue":null,"work_id":"c7aac1d2-b5b2-4371-bfb5-23e56c27854b","year":2005},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.127066Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:784de24a99f9569366d0e2fc4fb4677f181866c53b7568be2ce9157a8be3e948","observation_id":"f0220c5c-b810-4270-ad57-3c0225fe2de5","resolution":{"observed_at":"2026-08-07T10:48:15.369716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41598-017-12493-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.352535Z","title":null,"venue":null,"work_id":"fea339df-ab34-4311-87c5-42090819cd5b","year":2017},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.130397Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:ca0856123142903705a896aaddd9e3ad8f05b0ecb9e61007ff4df8dc08579199","observation_id":"14700294-7997-4002-8e85-e3f5a8854bdc","resolution":{"observed_at":"2026-08-07T10:48:15.357230Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.71132","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.101753Z","title":"Efficient secure similarity computation on encrypted trajectory data","venue":null,"work_id":"6011449b-7beb-4819-8297-6c6bff843b38","year":2015},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.133676Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:58a53c272ab980cc59c5090b0cd7a1cf7e5fa8aaefe8eb914e61471e9e5fe27d","observation_id":"78a67893-2ce1-48fb-b85b-043fbe1ce0a0","resolution":{"observed_at":"2026-08-07T10:48:16.107464Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.136929Z","title":"Pissis, and Maria Matsangidou","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.136929Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:950a164dc2cca0c9a5a0774f8d6cc37bad8702346a16556a7c1969bb9d96dd49","observation_id":"c4e41283-3a9a-44be-92fc-b87b677dacfa","resolution":{"observed_at":"2026-08-07T10:48:15.136929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.140218Z","title":"McCreight","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.140218Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:c5f38d3cd878a300403776bdf7b84f7b338b9402b418d35c2b5bff43710eda6c","observation_id":"88583da4-43c8-462a-bbe4-2a11d013b60b","resolution":{"observed_at":"2026-08-07T10:48:15.140218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.143418Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.143418Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:047855836b3248975fbbad8cb484ffb0fa4a92c1b36d2d498144d1f72168444c","observation_id":"4e286fcb-a640-4867-826e-6f173df0a81e","resolution":{"observed_at":"2026-08-07T10:48:15.143418Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.147675Z","title":"Indexing highly repetitive string collections, part i: Repetitiveness measures","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.147675Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:f75ddf2e0282a6deee0edc44552f6791b71c4c44d0b8c6ee0701cb859ba74fb2","observation_id":"70f40912-94ce-41d1-852e-7acde46e7f67","resolution":{"observed_at":"2026-08-07T10:48:15.147675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.151199Z","title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.151199Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:ec55e6b7f5939c2a143ce3778aec2104fb4ca0a985bd957176f2e541759c8348","observation_id":"7fad485b-5da2-4c77-8c6e-124a468cf4fb","resolution":{"observed_at":"2026-08-07T10:48:15.151199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.564057Z","title":"The pizza and chili corpus - texts","venue":null,"work_id":"2421056d-a44b-4422-bda3-25ad04c4642a","year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.154454Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:afcb2ae3f3b309dcc3d99f0a053bab7570083c4f635f2d88c85bc56340c1c929","observation_id":"2aa930ca-dd3e-4110-a9ed-d600515af5af","resolution":{"observed_at":"2026-08-07T10:48:16.568170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.157690Z","title":"Carvalho, Laurent Marsan, and Marie - France Sagot","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.157690Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:f2b2a7120b7eb8e0388fa2a84ab1cad14095f5fa0b6f9ae15eaea8e6fec2c830","observation_id":"a37ad844-56c7-4073-a014-e3a94b9a518e","resolution":{"observed_at":"2026-08-07T10:48:15.157690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.161399Z","title":"Towards efficient mining of proportional fault-tolerant frequent itemsets","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.161399Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:c0d89baf272529d9210f62146d6c8d88023bb41cca9920db6230c71320ce9f01","observation_id":"df3d1417-86b9-432c-a065-e63983859f8f","resolution":{"observed_at":"2026-08-07T10:48:15.161399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0168-9525(00)02030-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.315250Z","title":"Hudson, and Anna Di Rienzo","venue":null,"work_id":"7a6d502c-83f9-4ac7-a963-c90c42a8c49d","year":2000},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.165619Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:25eba2c925b54cec1e706cf2fea8c1b5fa945a383734baa92c9f4976a97c4f94","observation_id":"e63ce110-ad5d-476c-a232-a849a7bb16ae","resolution":{"observed_at":"2026-08-07T10:48:15.318937Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.169599Z","title":"Objective criteria for the evaluation of clustering methods","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.169599Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:aa5e7832fa77fe40bc3b0d8d18f9b751317411b846d706cc7d45e745f8fa668d","observation_id":"79182f20-0c96-40e5-8aaa-d8b58b8d03d0","resolution":{"observed_at":"2026-08-07T10:48:15.169599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/nar/27.19.3899","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.304336Z","title":"Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions","venue":null,"work_id":"27aa9238-6ebb-45f1-b800-a8fc3b447308","year":1999},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.172819Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:75a17d8f3c3c7638039c98e7d8c0deb4b62eba49f8382e728efcfd7160ad75f7","observation_id":"ca08463f-c7ab-49ff-bbe2-76cd9e640d89","resolution":{"observed_at":"2026-08-07T10:48:15.308320Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974348.63","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.293414Z","title":"MACFP: maximal approximate consecutive frequent pattern mining under edit distance","venue":null,"work_id":"2662ed8b-13db-4f1f-8564-b3e3b7faae8f","year":2016},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.176071Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:f7ee102f3ae0fc62fba135a40245330b7ef2668a0ece5b1276584eded9e6ad12","observation_id":"2a00610d-3290-4373-9c4d-6cde7da3c727","resolution":{"observed_at":"2026-08-07T10:48:15.297696Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.179433Z","title":"Groundhog day: near-duplicate detection on twitter","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.179433Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:8ce063d66994cba6a62c1be962303346e85161ff2e11bfc884305654b1396730","observation_id":"43e11f7a-d4ee-425f-b5e0-f549192f3b98","resolution":{"observed_at":"2026-08-07T10:48:15.179433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.553928Z","title":"Repcorpus, 2024","venue":null,"work_id":"efd56b10-ec44-445d-b0e1-b6c54afc617c","year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.182517Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:e9a9e4b7a00a7d69bac7937ccc92577c678a7455af156f6092efd12f4581ec6d","observation_id":"95728de8-f2f9-49f2-a6d8-5a313654e653","resolution":{"observed_at":"2026-08-07T10:48:16.557395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978032.85","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.283158Z","title":"Towards more robust and accurate sequential recommendation with cascade-guided adversarial training","venue":null,"work_id":"ad5f1a14-eac1-43f6-9ff4-2fe76668de3f","year":2024},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.185527Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:83ed4abdeebc947befd307f63f22eb45a6632f77a45706627082d6331c9eeb73","observation_id":"7f3ce2d7-3890-4f47-96af-cdc0b5783c2e","resolution":{"observed_at":"2026-08-07T10:48:15.286658Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1136/bmj.k1952","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.271752Z","title":"The 100 000 genomes project: bringing whole genome sequencing to the nhs","venue":null,"work_id":"c7efd57a-3fc0-4398-9c56-c4bb71c65721","year":2018},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.188966Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:f4152b5ec3d33ad97556447bb405be01cc323725c286d10b87cf3502fa92b746","observation_id":"3e2132ef-b1bf-4dc1-a0d3-f817e90d8f88","resolution":{"observed_at":"2026-08-07T10:48:15.276550Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/bioinformatics/btg005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.261041Z","title":null,"venue":null,"work_id":"b7033b36-5a5a-47a5-86b4-5f8fa5d911d3","year":2003},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.192214Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:5f771ff5c727797cc14dc198a495f1813d5aeefa25b1a6a0d6064757c207033b","observation_id":"27be8be2-9be5-480a-a7ed-3871c3b4d3ca","resolution":{"observed_at":"2026-08-07T10:48:15.265018Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.195609Z","title":"Average sensitivity of graph algorithms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.195609Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:1df732075f65e0e081a97462c3fbbb31f7c45a8e902c86f24a9ac15975d12184","observation_id":"28987e0d-96ab-427c-98c6-9a2661d9762d","resolution":{"observed_at":"2026-08-07T10:48:15.195609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.198712Z","title":"Opr-miner: Order-preserving rule mining for time series","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.198712Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:a875c5fa196e3c82e0df70936a5553c4c89af6f8235c885625abbf980752c291","observation_id":"7dedf079-5c62-4af0-897d-c25202206e5f","resolution":{"observed_at":"2026-08-07T10:48:15.198712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:16.541281Z","title":"Average sensitivity of E uclidean k-clustering","venue":null,"work_id":"45a53348-822c-4f47-a593-0c21ca20d564","year":2022},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.201962Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:d6d4fbff2aee14252580198bdbf39d966ae145c4f2ccb8f1bd35337d3836f43d","observation_id":"19c27130-d91a-41b0-a503-5ab19f5d8806","resolution":{"observed_at":"2026-08-07T10:48:16.546308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.205209Z","title":"Sensitivity analysis of the maximum matching problem","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.205209Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:71359df8b081236f486ac22ed29af8865e2c47d4e72d85dfcb6eb090c5f64eec","observation_id":"595a48bb-ec35-491e-94c7-60e12986e6be","resolution":{"observed_at":"2026-08-07T10:48:15.205209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icdm.2007.75","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:48:15.235008Z","title":null,"venue":null,"work_id":"64872fdb-a465-4c45-a948-0e8b71b0b15b","year":2007},"citing_paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T10:48:15.208322Z"},"links":{"citing_paper":"/paper/2506.04935"},"observation_digest":"sha256:067a527f10613b5f6fa206bb57653f830d5ca605e746fe16f011b2ae950528cd","observation_id":"8ebadbfe-fd95-4616-a4c2-384bd538f6fd","resolution":{"observed_at":"2026-08-07T10:48:15.239850Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.04935","last_updated":"2025-06-05T12:10:19Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T10:27:56.976533Z","submitted_at":"2025-06-05T12:10:19Z","title":"Resilient Pattern Mining"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":33,"verified_exact":21,"verified_fuzzy":6},"total_outbound_references":62},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2506.04935."}