{"as_of":"2026-08-20T08:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a316f2de0fbdf06d66c5e064a5b09320ba6390f722e537f6bc1ab1490bac3e6e","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:45:39.808361Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2509.03265/citation-record","integrity":"/paper/2509.03265/integrity","json":"/paper/2509.03265/citation-record.json","paper":"/paper/2509.03265"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.859654Z","title":"Aho and Margaret J","venue":null,"work_id":"ba0f57bf-3f97-4ee0-be47-61e22fda9293","year":1975},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.507444Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:59574c63066d3defab05c6719b2a4c19adf44c43943f664ef49d366f862cfecc","observation_id":"0818ad48-cd4b-41bc-b75d-fd1d3fada86e","resolution":{"observed_at":"2026-08-15T16:45:40.865045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.842969Z","title":"Improved algorithms for finding level ancestors in dynamic trees","venue":null,"work_id":"ffd5e22d-c9eb-425b-8bbb-ddfc38b769b8","year":2000},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.515123Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:1a4390aacf597d02416edfe3ea3e88e9dace16426b4ed28e3569522b4b70a6fb","observation_id":"a998c88d-c3e9-4dae-9649-8b1e10f15a51","resolution":{"observed_at":"2026-08-15T16:45:40.847772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.823414Z","title":"Marked ancestor problems","venue":null,"work_id":"ba4b2b44-eac2-4e0b-8c72-53460c8ffe7b","year":1998},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.521644Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:cba4a54fd80e094606690758cd181c41388c71445137335c788b88f1d20843ba","observation_id":"c657aa7a-28b0-4511-9bec-9c45a993520a","resolution":{"observed_at":"2026-08-15T16:45:40.830292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.806336Z","title":"Efficient two-dimensional compressed matching","venue":null,"work_id":"a551137d-8bc3-43bd-b57a-201dea51d7ac","year":1992},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.527764Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:18d645483c15d838fd80a87ccb536a17c3f28b3676a44fcf80384972b67bfcdd","observation_id":"487b7e68-e9d5-4764-822b-f4edc2bc52bd","resolution":{"observed_at":"2026-08-15T16:45:40.811592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.783651Z","title":"Optimal two-dimensional compressed matching","venue":null,"work_id":"7e85563c-6ecd-4e48-bb6a-e0523f1095d5","year":1997},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.532935Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:1315225bef00fc4b2e9057e0ccc9bada392395908b75b377c898f2270f343462","observation_id":"58237f04-e2e1-441e-988e-d7372403f5a3","resolution":{"observed_at":"2026-08-15T16:45:40.791552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.767307Z","title":"Adaptive dictionary matching","venue":null,"work_id":"474d8247-4ea1-4de6-82b0-17b74b8f4d0b","year":1991},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.540212Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:f5c6a7014c5fa1ee8a4b914be0620dc2aed276d4a911e5332b9e62b5f62c5d3e","observation_id":"a21a3218-383e-4443-a47a-a932dd127020","resolution":{"observed_at":"2026-08-15T16:45:40.772515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.750090Z","title":"Dynamic dictionary matching","venue":null,"work_id":"3d6b0ed9-74be-485f-b5b5-441870d7cbe0","year":1994},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.551827Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:6457eb7fd48e59d9ecb343686fc338e825f74695225a72c286c3bfed61245457","observation_id":"7467b615-bc6d-4aab-8558-e371e614cdf2","resolution":{"observed_at":"2026-08-15T16:45:40.754901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.734616Z","title":"Idury, Johannes A","venue":null,"work_id":"335f3381-61e7-403d-a5d0-753f6e6163cb","year":1995},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.558052Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:bcdcc2652f5248c88f29f757e8b964c0cf8563416c99e55587c6f86543877746","observation_id":"fcd42ad1-8e1a-42fb-a772-f91d2766119d","resolution":{"observed_at":"2026-08-15T16:45:40.739409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.717778Z","title":"Riva Shalom","venue":null,"work_id":"6bebf4c2-ffad-4c7f-b9a6-4a26f450e089","year":2019},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.564505Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:f783fc7e6c131665a561580550a17f5fc42f3f4c3997a678ef4c509db48cd1b4","observation_id":"8fc6d8e8-e513-405f-93ef-cae9e41f1295","resolution":{"observed_at":"2026-08-15T16:45:40.722955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.700177Z","title":"Landau, and Dina Sokol","venue":null,"work_id":"eab30981-0a59-410d-877a-4f44bbc4ee51","year":2003},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.570155Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:3b41d4fa2a617cb4b1c3b87796ecff913e953d29b8b691799e2747e43ec8d2c9","observation_id":"e73b8c25-c461-4977-b8a0-c3ba312dd1a9","resolution":{"observed_at":"2026-08-15T16:45:40.705631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.683084Z","title":"Riva Shalom","venue":null,"work_id":"1e12bacd-2086-4399-9143-31b1b043c8de","year":2014},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.575354Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:c1392f164c429e5fc19883eafe3ec8c99f81f7c5302704ba35ee1b7ef755c4e2","observation_id":"294dcfbf-19c6-4c85-b051-295461a9f6ac","resolution":{"observed_at":"2026-08-15T16:45:40.688805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.665533Z","title":"Riva Shalom","venue":null,"work_id":"b8e254ce-3e24-4ef1-90da-f004588b7214","year":2015},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.580400Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:294c1a56af61ebddb8051f43067311b0a61e09ac6af941452b94fc73cbff7c35","observation_id":"fdc97099-d040-484e-a5e6-16eb26fa6efa","resolution":{"observed_at":"2026-08-15T16:45:40.671160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.649128Z","title":"Faster algorithms for string matching with k mismatches","venue":null,"work_id":"adcf4e39-7e08-4d5d-a04a-60af7c87a94a","year":2004},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.586058Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:b0f667b3130ffc53221c70dd1f2eed3f4f3e7e72ae89f3b6a7f5c86f1b6121a9","observation_id":"586eb483-e997-47d8-8825-7a080127b25b","resolution":{"observed_at":"2026-08-15T16:45:40.654776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.632970Z","title":"A new efficient radix sort","venue":null,"work_id":"86afb9dc-7cdf-42fa-ba4f-a1bb7696c123","year":1994},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.591112Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:63e290551d1f1b96a076d736ec0f8e7910895ffd457b4cb211f2354ff31a2cc0","observation_id":"1c439b88-7432-4c0d-bba5-787ec69df5af","resolution":{"observed_at":"2026-08-15T16:45:40.637847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.616220Z","title":"Landau, and Steven Skiena","venue":null,"work_id":"eaa6da57-a2d5-4846-bf14-b891d0a4d976","year":1999},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.596005Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:66eb2cdc9f2dcad4478c10a3c05dccc59c1c23925bab0b6d9065476a1b09d8a4","observation_id":"a78e1bb5-e887-48f4-832e-d6459627bc4d","resolution":{"observed_at":"2026-08-15T16:45:40.622285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.599483Z","title":"Iliopoulos, Chang Liu, and Solon P","venue":null,"work_id":"d9eb77b5-cad7-4d13-92fd-8ffbee986377","year":2017},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.601569Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:ba530f1e34e7fede6e2e05fcb12836c44339dcb1fef4aa103371235dc58e1241","observation_id":"fd1e1d03-e5c2-4e7f-b5e1-e20b64e3de65","resolution":{"observed_at":"2026-08-15T16:45:40.604247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.581003Z","title":"Which regular expression patterns are hard to match? In Proc","venue":null,"work_id":"7cce2bb7-a926-4d42-a6e7-aa8b11c5f31a","year":2016},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.608252Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:f3495f7fbffa67d4f573eac2146896abbfd378fe9a2137b4adaeef4c3c6b99da","observation_id":"4df9dffd-8a01-4da2-b67e-3f818fadbd95","resolution":{"observed_at":"2026-08-15T16:45:40.586854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.554607Z","title":"Succinct dictionary matching with no slowdown","venue":null,"work_id":"97622b6c-89f0-453c-a118-18f5f1f0ce8a","year":2010},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.614376Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:8b6fc5d21766ec2915ef5e9defda431ba7d538c852a940a86fb7d94795e5cd06","observation_id":"ba2ab923-a1b8-4859-bcb2-39de0f28fca6","resolution":{"observed_at":"2026-08-15T16:45:40.561124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.529159Z","title":"Worst-case efficient single and multiple string matching on packed texts in the word-ram model","venue":null,"work_id":"e43a85db-7e54-4ef2-aec3-843f1a946466","year":2012},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.620235Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:063db95d92a5f16d37342177e3f34993ec13745032e8bc8dd944f984cb1b1ab7","observation_id":"31823602-7ef5-499e-81c3-f94b06033b09","resolution":{"observed_at":"2026-08-15T16:45:40.537146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.507052Z","title":"Finding level-ancestors in trees","venue":null,"work_id":"41fa6aa1-fe03-4ded-9bbd-2d5924d79a8a","year":1994},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.625656Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:95d1ca5250989ad8e10a3d75222bfca07213703c959dd0f4e6ebb0fd1e339325","observation_id":"270f5943-0c01-4b96-97d0-7e460a10a1cf","resolution":{"observed_at":"2026-08-15T16:45:40.514163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.484641Z","title":"String matching with variable length gaps","venue":null,"work_id":"1c0f434c-5ebb-4ca5-a4ee-bf2dd407cfa9","year":2012},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.630754Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:4e877012237611fcfb2f42f19fda14c8d18b037b77e7460f65a96f5367126ab8","observation_id":"39183725-b56a-4970-a352-5555524864ee","resolution":{"observed_at":"2026-08-15T16:45:40.494348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.459733Z","title":"Regular expression matching with multi-strings and intervals","venue":null,"work_id":"1f6d7067-4fcf-461b-8cc0-58c26cca522a","year":2010},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.636854Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:2b64eaaa68a6c5ec71bcd0de0a0a66e47584bea36e1ef6fc1063e719005ed299","observation_id":"5c51735f-a2af-4209-8d49-3aeca1d7281d","resolution":{"observed_at":"2026-08-15T16:45:40.469317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.437649Z","title":"Chang and Eugene L","venue":null,"work_id":"a9c47cae-6153-4482-b208-2632809903d6","year":1994},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.642809Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:5e151d4e964efa31431c05a1c718f022498d04c5a94ce6062c037f2160382354","observation_id":"23dba48e-064c-46e7-9751-b72bb53d0cf6","resolution":{"observed_at":"2026-08-15T16:45:40.444561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.410063Z","title":"Computing on a free tree via complexity-preserving mappings","venue":null,"work_id":"38ee8f2e-3840-4410-93fb-06ff8002a0aa","year":1987},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.648066Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:dabe7d23dd9d93e5ea70c27f39580eb949151c0b8b20e67346dd2ba9274ea146","observation_id":"6bc81b21-9f51-467a-9658-efdb73507e0c","resolution":{"observed_at":"2026-08-15T16:45:40.417781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.384540Z","title":"Dictionary matching in a stream","venue":null,"work_id":"bd2381c9-b644-412c-a690-b74786e1d61a","year":2015},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.654445Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:0f7e7fade81e5286568a0c6566bc59b6de8e8d5383bd94ce32a771be694353fc","observation_id":"b83fdb88-8149-4479-b539-908f3f4b04c2","resolution":{"observed_at":"2026-08-15T16:45:40.390314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.361938Z","title":"Dictionary matching and indexing with errors and don’t cares","venue":null,"work_id":"9fa839c1-0f87-414a-912f-d32985bd9ec9","year":2004},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.659881Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:d834a29bad3cf768cdca4514b0fa7ecab2abc4ccfa3436a03ae42cf44bd13ebf","observation_id":"6994c54b-d465-4356-b7d8-1717a247c3f6","resolution":{"observed_at":"2026-08-15T16:45:40.367949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.336626Z","title":"A string matching algorithm fast on the average","venue":null,"work_id":"e32b5451-f0ea-4c96-928c-4cc6da7c2ea9","year":1979},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.665333Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:1fc6ea6b9324870ef9cf93714b50378544a0cf3b64de0501b00682cb68ad5afe","observation_id":"5cadcb28-101b-4440-a59b-d24cf9d73e46","resolution":{"observed_at":"2026-08-15T16:45:40.347432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.307696Z","title":null,"venue":null,"work_id":"ba83c3f0-c3db-42ae-9bff-873735723c8a","year":1989},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.671701Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:c9eeb472fd5123f0e5e0dbaec1a59f60356f456d0f0479bf930006339163d032","observation_id":"add7a558-4ba8-4380-b766-b02b2a9519ff","resolution":{"observed_at":"2026-08-15T16:45:40.317429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.282539Z","title":null,"venue":null,"work_id":"656aa3d2-ef92-473b-a757-2179e7be24a0","year":1991},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.678435Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:dd995ba437aaa4a01c38b18af3f4dff296d863608341d758127e3d9416ccd7ac","observation_id":"bd85c902-50b1-4509-b896-5bb3a1574374","resolution":{"observed_at":"2026-08-15T16:45:40.289071Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.254760Z","title":"Eltabakh, Wing-Kai Hon, Rahul Shah, Walid G","venue":null,"work_id":"fd64dc9c-90ad-45bb-a1f0-d5bdadfff410","year":2008},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.686689Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:7edab182e33f845259d8833826e38254ff6c91dbdba24a2fa19d215b52ab704b","observation_id":"d1eef7af-b037-4d11-b889-bb8b6e04adf8","resolution":{"observed_at":"2026-08-15T16:45:40.262733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.230762Z","title":"Dynamic dictionary matching in external memory","venue":null,"work_id":"2ca9b0e9-d26f-419a-8bac-1584d1669eb8","year":1998},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.693003Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:2dc704f9e075566095d892db46b2b78c152fa8251a10d488857c32de275e32f5","observation_id":"987ab3d0-a04e-42bf-addb-35088d349b2d","resolution":{"observed_at":"2026-08-15T16:45:40.236444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.209728Z","title":"Muthukrishnan","venue":null,"work_id":"943beb7b-7d4e-4e1d-a486-93dbca7ed14d","year":1996},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.700435Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:ba310df4c5fde5c1075ece9d9766edc30e330ada737de02e290a3ff4fe0ced71","observation_id":"439e02a5-cfb9-4032-a430-badbd6b1e5fa","resolution":{"observed_at":"2026-08-15T16:45:40.216896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.181790Z","title":"Approximating LZ77 via small-space multiple-pattern matching","venue":null,"work_id":"4a06d2b0-f72e-4af8-b489-810858439387","year":2015},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.707555Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:ee27431aeba47f8394d4d975cc090f6ced9ad51f76cc8189245cbe4c4ddfe898","observation_id":"29b4830c-9e8d-4a95-a890-4529eafd05c7","resolution":{"observed_at":"2026-08-15T16:45:40.188732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.156778Z","title":"Approximating lz77 via small-space multiple-pattern matching","venue":null,"work_id":"bbd24836-e78a-4344-8573-624fb506b322","year":2015},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.715247Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:1d9d6050ccac1c22bdf7bb2812e6af937ddbceb69810f4872c0b878c4cb66f7f","observation_id":"e0be501e-a892-450b-a518-28dcb2df405a","resolution":{"observed_at":"2026-08-15T16:45:40.166881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.136061Z","title":"Fredman, J´ anos Koml´ os, and Endre Szemer´ edi","venue":null,"work_id":"1e99b67e-d06f-4cc1-98d5-2582cf1c96eb","year":1982},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.721662Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:8da800acc60c4cb788cfdd65db64acdc21236980281c06d1e125fb2138c244ea","observation_id":"85b6085e-e952-4859-9dec-8f4cad8bfc29","resolution":{"observed_at":"2026-08-15T16:45:40.144367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.114636Z","title":"A framework for dynamic parameterized dictionary matching","venue":null,"work_id":"b2cbbb01-20a6-4d5c-8602-3022381f62a9","year":2016},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.727007Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:b5bae88a48a167e0d15a64526fe4b129e31ded60c53d70e51adf936036771300","observation_id":"615761a0-e9e1-49a6-81ef-640b8b25dc19","resolution":{"observed_at":"2026-08-15T16:45:40.120783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.093169Z","title":"Real-time streaming multi-pattern search for constant alphabet","venue":null,"work_id":"4dfdd140-03f0-46ed-90f1-1d2d32ce6a88","year":2017},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.733117Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:65769307b6411d62447af306d2272190a702268f3a35466dcd2abc7a6aac1629","observation_id":"d9fbc3a1-cffc-4420-b9db-b3eb07d341d7","resolution":{"observed_at":"2026-08-15T16:45:40.100003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.074196Z","title":"Deterministic sorting in o( nloglogn) time and linear space","venue":null,"work_id":"02d1d766-4563-4c46-a005-d8fddfe3166c","year":2004},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.740767Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:90ae295c1123542eb112507f53e714faa3c1dda6c23ba343e9c798b85d235749","observation_id":"f288aa7f-bc72-4907-bc36-e2f3975c370f","resolution":{"observed_at":"2026-08-15T16:45:40.080886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.054238Z","title":"Thankachan, and Jeffrey Scott Vitter","venue":null,"work_id":"ddc3ace8-5f26-47d1-882f-a989f8446f1a","year":2013},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.748391Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:1efe889b22051d44c0744b188e83de8a09127294eea154b719f6f68f6d0d8d5f","observation_id":"5491e192-674b-422b-ae5a-15f807e73b99","resolution":{"observed_at":"2026-08-15T16:45:40.060463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.037652Z","title":"Com- pressed automata for dictionary matching","venue":null,"work_id":"be164da4-409b-4ebd-bc30-8a7956dd2a8b","year":2015},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.754305Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:bc41d18c0cb855e32c5b3162ca1b42e2db7ae9b703ead94fd19eeaaec8270785","observation_id":"d6bc4c77-a8ea-45d5-9c2e-529e27f945b4","resolution":{"observed_at":"2026-08-15T16:45:40.042977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:40.017259Z","title":"Mul- tiple pattern matching in LZW compressed text","venue":null,"work_id":"af835891-9159-485b-8212-4b2ee047b9e2","year":1998},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.763630Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:6a9d0ff54f7586895e08ef748bac77fb5f4a34571b01bfeb5aac78124ef3049f","observation_id":"9951b7c8-d275-40b9-9ae2-952e6d32c12d","resolution":{"observed_at":"2026-08-15T16:45:40.024088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.997376Z","title":"Knuth, James H","venue":null,"work_id":"1f3a676a-91c1-47b8-a151-dd24a27ecaf5","year":1977},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.770986Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:3d8abc342f8b8ec62a4903b9baffb7906178ce2f42970b0d25f69d449512c770","observation_id":"bd7c5500-6294-4dcf-a15e-98a0fd80f4e7","resolution":{"observed_at":"2026-08-15T16:45:40.004534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.973406Z","title":"Succinct online dictionary matching with improved worst-case guarantees","venue":null,"work_id":"ed503f51-53bd-4be8-99fc-7fbecccfc7f4","year":2016},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.778205Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:3588be8d3a16cc5f1bbf430fed2aa487249d245032b1d434147dc9f77901a433","observation_id":"2139ebee-bb06-4415-8338-600ce448d34f","resolution":{"observed_at":"2026-08-15T16:45:39.982293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.947571Z","title":"Muthukrishnan and Martin M¨ uller","venue":null,"work_id":"d09c959b-38f8-43a7-bb59-1fd666806e3f","year":1996},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.784071Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:337266279299355b8fedaba0583cd7c401b420838565b999ff2ab9ce3423649b","observation_id":"f4e9fc7e-15e0-4269-956c-7d9f87ad484c","resolution":{"observed_at":"2026-08-15T16:45:39.955455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.924555Z","title":"A guided tour to approximate string matching","venue":null,"work_id":"5311dc39-831e-4c52-af9a-3fab5949b233","year":2001},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.790028Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:b918ff57081f83e0650141866802855b685a0609c040b8f45c67cff097d50ce4","observation_id":"0133de16-dba5-4d7f-954d-31f89c113920","resolution":{"observed_at":"2026-08-15T16:45:39.933448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.904120Z","title":"Constructing efficient dictionaries in close to sorting time","venue":null,"work_id":"f6c54f40-458b-4229-bf27-99d050c374ed","year":2008},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.796593Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:b07bfe48432fca961c19e802fbc97d9b28479c462ce96d8ae5f940f46179095c","observation_id":"d8172468-d5ba-4c51-af3a-3000fc31e0e6","resolution":{"observed_at":"2026-08-15T16:45:39.910880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.883967Z","title":"Computing the longest common subsequence of two run-length encoded strings","venue":null,"work_id":"85ead54f-67ec-4dfb-80da-7637b96269ea","year":2012},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.801770Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:c1187ad82b847036c17ef50e4d49dcda385aff307c6a503f28370c69e73d5e1a","observation_id":"2c3f0b19-95ea-4e68-bedc-e8ba01219b96","resolution":{"observed_at":"2026-08-15T16:45:39.891155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:45:39.862711Z","title":null,"venue":null,"work_id":"eda3c30d-8e19-4435-85e6-d908b21e4afc","year":1983},"citing_paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T16:45:39.808361Z"},"links":{"citing_paper":"/paper/2509.03265"},"observation_digest":"sha256:5b0f88fef6094a529f6da4b96e14b43207e57344f0512208d5a1ea9dea32aab0","observation_id":"47bfb01f-8694-489c-8084-1e005ea5dacc","resolution":{"observed_at":"2026-08-15T16:45:39.870350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.03265","last_updated":"2025-09-03T12:30:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T08:56:44.595220Z","submitted_at":"2025-09-03T12:30:08Z","title":"Compressed Dictionary Matching on Run-Length Encoded Strings"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":45},"total_outbound_references":48},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2509.03265."}