{"as_of":"2026-08-16T19:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0876911c2a5d3bfcb4516128787467af939dcf459dd5b526fd10ea263ac52dd4","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:01:56.298719Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.04686/citation-record","integrity":"/paper/1908.04686/integrity","json":"/paper/1908.04686/citation-record.json","paper":"/paper/1908.04686"},"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-14T14:01:57.017164Z","title":"Bauer, A.J","venue":null,"work_id":"56b88ced-67eb-43e1-baf4-f1f525063bc1","year":2013},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.090235Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:dde8ea991ede1d353c32d8a4cec90e937807930df3085e2a0b33695ffbefe8d4","observation_id":"3eb6a82d-731c-4f66-a873-635199162332","resolution":{"observed_at":"2026-08-14T14:01:57.021962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:57.002760Z","title":"Belazzougui","venue":null,"work_id":"7d4cd46a-1290-4c1b-b212-fddc992a6631","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.095870Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:047d0de05230e3839b4a67dedf77acd7816067935299ee35a729a3f24af7a8b9","observation_id":"5dc0b0ac-f86a-4943-a302-d41ac0cb10d9","resolution":{"observed_at":"2026-08-14T14:01:57.007667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.06378","last_updated":"2016-09-20T22:51:19Z","snapshot_observed_at":"2026-08-14T21:38:56.011802Z","submitted_at":"2016-09-20T22:51:19Z","title":"Linear-time string indexing and analysis in small space","version":1},"cited_work":{"arxiv_id":"1609.06378","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.06378","snapshot_observed_at":"2026-08-14T14:01:56.336508Z","title":"Linear-time string indexing and analysis in small space","venue":"cs.DS","work_id":"b75fb6d9-4514-42e9-90a8-842050b466fc","year":2016},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.100606Z"},"links":{"cited_paper":"/paper/1609.06378","citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:94b8c3cb15e4e1dcaab6033ce76ece96060d64595791620580259d0b842ae715","observation_id":"450d24d6-7f9a-4511-b2f6-a6ba107afd21","resolution":{"observed_at":"2026-08-14T14:01:56.344180Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.986457Z","title":"Belazzougui and G","venue":null,"work_id":"84fad031-1a14-4900-8dfb-84f76fe8d266","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.105788Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:1faa1d39ba5064f232895da39a1045288842d5e5571cbbd009d46c75b809f11d","observation_id":"4b5d1e56-6188-4e18-a3a0-ceaf21fa5ee7","resolution":{"observed_at":"2026-08-14T14:01:56.992181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.971448Z","title":"Beller, S","venue":null,"work_id":"63579d5d-761a-409d-8a00-163818c17009","year":2013},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.110694Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:c5144cede0699d17014b05295ed206b6dd98e7363496b71a3c433d9471645f3d","observation_id":"96e123b6-c74d-4d4d-8b8e-51bb40f49f33","resolution":{"observed_at":"2026-08-14T14:01:56.976322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.956804Z","title":"Beller, M","venue":null,"work_id":"81a2c931-e287-41c1-a3d1-806c64d7ff15","year":2013},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.115290Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:2747b39c669dc5f6415a5f1e79645d71f33467a071966239f55069eb5fbb8a52","observation_id":"eba35716-d94c-4c61-827c-b2373456d991","resolution":{"observed_at":"2026-08-14T14:01:56.962024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.942859Z","title":"Benoit, E","venue":null,"work_id":"1e88fa8c-51fc-43b5-8aef-074735615133","year":2005},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.120431Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:3fec7e19e7b0e648b174938aa201188e416403f638dacc644575c49822510eaf","observation_id":"c781f223-134e-40e1-adad-5d2505cdeaed","resolution":{"observed_at":"2026-08-14T14:01:56.947118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.929316Z","title":"Bonizzoni, G","venue":null,"work_id":"8293a253-3fa2-43d5-b907-1dba60966c04","year":2018},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.125252Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:37c0dbae665430a1b4eb9f11fd446a34719ccd9738ab939be4dba650525a9752","observation_id":"9f608d08-556a-4d8e-b2ca-92df2e6b136b","resolution":{"observed_at":"2026-08-14T14:01:56.933842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.913917Z","title":"Burrows and D.J","venue":null,"work_id":"8c45a5c2-7b97-4e24-aed7-e9af3fefac76","year":1994},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.130015Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:4c12289d75b97ebafde5cc6708da4b0434263155faf7451c7080597b7152a209","observation_id":"96e0c7bc-3b8a-49bc-802d-0a46503cecdc","resolution":{"observed_at":"2026-08-14T14:01:56.918486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.900342Z","title":"Claude, G","venue":null,"work_id":"54c70161-3426-45d3-8e30-f12e28a31004","year":2015},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.134658Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:e8afdee25d277e19a1a86ca3cd199ee0436752f23bd2e1f3336925def7b92cca","observation_id":"d17396fd-18f3-44b7-8d92-0b931e9d5b71","resolution":{"observed_at":"2026-08-14T14:01:56.904737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.886622Z","title":null,"venue":null,"work_id":"fbcf39a2-c194-4b25-a8f3-bb7216793178","year":2016},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.139653Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:20f5b8087658cec5a2f0184373da2c8915c244c06009b2b7afa99d438f904f6d","observation_id":"3c2d8234-6f53-4e52-915b-52854c78d342","resolution":{"observed_at":"2026-08-14T14:01:56.891014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.872647Z","title":"Egidi, F.A","venue":null,"work_id":"0c64294c-e90b-46fd-88e3-62841a1cc381","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.144920Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:f2a06c29121f2bf92d8ed9a43180b7fbf1c21688a516640f7a2e2e04bcdb3ecd","observation_id":"41735ce0-b0b6-4b19-b146-da6b5dfa03b2","resolution":{"observed_at":"2026-08-14T14:01:56.877282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.858234Z","title":"Egidi and G","venue":null,"work_id":"9f3cd02d-2018-43d7-b228-27ad0113926e","year":2017},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.149927Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:65ac0a507a43a0ea39613bb0a96f3dd4b2a1700bc67be47b4be620e8df4d60f9","observation_id":"b393b4a1-ac8b-4275-8e7f-f502ccce0567","resolution":{"observed_at":"2026-08-14T14:01:56.862967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.842212Z","title":"Ferragina and G","venue":null,"work_id":"f65a22ca-c37c-4dc4-b289-02a5a2d9ef63","year":2000},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.154498Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:05de595f4b51cb10fd603223a52e4f9b47220ae40c5c12edeb7258381141d0ee","observation_id":"bd2a062f-64b7-4c6e-8fcc-09572d5f9123","resolution":{"observed_at":"2026-08-14T14:01:56.846758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.828283Z","title":"Fuentes-Seplveda, G","venue":null,"work_id":"a29eba90-3ef9-430e-90b4-5eeb4c3e929e","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.159213Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:dfeeff69f0637a73f8a14545ab808832a46ee9fcbd5f173a316148a4aaf3bafd","observation_id":"fbe6b790-1948-455a-acd0-de8d553d29fd","resolution":{"observed_at":"2026-08-14T14:01:56.832769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.813764Z","title":null,"venue":null,"work_id":"2834760a-8d14-4a3c-a96a-37f70087f427","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.163678Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:0e8f7b0870477c2d9b7a388a3ed85af9bf67b2bfb965f59a383bc6bfc5e90bad","observation_id":"8cb1bf68-9578-44cd-a541-33516fdd89e9","resolution":{"observed_at":"2026-08-14T14:01:56.818380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.797392Z","title":"Grossi and J","venue":null,"work_id":"39bf96ae-adb3-4d4d-b185-023102c503e4","year":2005},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.167634Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:a7cdf1df2ec8a0bf5986d5bdf3052b34688d6bd69f2d07cd8711a136b53fc0ce","observation_id":"6dee6452-1e5a-4a8f-82bf-186b8a65b1b2","resolution":{"observed_at":"2026-08-14T14:01:56.802988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.780147Z","title":"Guerrini and G","venue":null,"work_id":"ea4df2a7-1742-419b-987d-76b22e9ab04b","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.171481Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:d02e4256ef198eb2be83b9318dbac38b869f46d788ba2464942fdc911a10b35d","observation_id":"3cc5b1d0-7b80-451a-8693-445c934a7fbb","resolution":{"observed_at":"2026-08-14T14:01:56.785554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.763362Z","title":"Holt and L","venue":null,"work_id":"f9198580-8165-40c9-a943-745f9bf2f688","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.175653Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:78ea3440bbf38399dc92af3a99457b719a4e3cfed40c906f82ee148980dd3f36","observation_id":"d62328cd-dd49-4f1b-8c80-7e610575990f","resolution":{"observed_at":"2026-08-14T14:01:56.768745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.745902Z","title":"Holt and L","venue":null,"work_id":"4bc54484-ea83-4b2c-83af-25f8cbd46cf3","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.179772Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:6cea46caef43821ab02f7d4fa52323322df3a6b5ab18061ef18b47ccc2401e76","observation_id":"c26f2ec8-74e1-4fe9-b4b3-3543664957eb","resolution":{"observed_at":"2026-08-14T14:01:56.750795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.730283Z","title":null,"venue":null,"work_id":"cb4c8aa7-68bd-4271-8a38-6c5a90b70733","year":2009},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.184102Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:ae65e606a7ab4115ddb8d90b10eca9af879d580bea8da15f8f9c710203e16f9e","observation_id":"2488edb1-d3b4-4a80-96b9-30594711c3ae","resolution":{"observed_at":"2026-08-14T14:01:56.735214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.714371Z","title":"K¨ arkk¨ ainen","venue":null,"work_id":"601e94d3-3ba4-40b6-a615-42fe385e70c3","year":2007},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.188207Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:04b996feafa9482f7bfc8e5509b12720475ff80014dcf2cb6a87d4721d8d5a0c","observation_id":"646c1cf0-458e-4898-a18f-b0adf2a15fde","resolution":{"observed_at":"2026-08-14T14:01:56.720073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.698894Z","title":"K¨ arkk¨ ainen, G","venue":null,"work_id":"fceac095-3fe6-4d3e-b19d-50b35520ad24","year":null},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.192881Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:3feb97e852cf585b83390248793302e55a0ba3fab2c068fec72ca4f9f2933c5d","observation_id":"be8a3fa7-c0d8-4560-9100-50652ca6d7ae","resolution":{"observed_at":"2026-08-14T14:01:56.703716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.671731Z","title":"Kasai, G","venue":null,"work_id":"5f21041b-1abd-4c7f-a75a-c361aae2ca6c","year":2001},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.203868Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:04b8e4a8393beb9e48645684d37399f1e67fadb456986724bd763838deee15c1","observation_id":"fc3788c7-b146-4a4c-b8e8-3260fe6e2bba","resolution":{"observed_at":"2026-08-14T14:01:56.676280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.656814Z","title":"String synchroniz ing sets: Sublinear- time bwt construction and optimal lce data structure","venue":null,"work_id":"15e10f1e-322c-40c1-91c6-03f69193d04d","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.209174Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:80dd0e2ddd7ee3d14227a8ba13e60ffa4fdb0369aa50d5e535a96e236a51ffa0","observation_id":"097e56f7-ef28-4815-b428-ca3c3bc91b96","resolution":{"observed_at":"2026-08-14T14:01:56.662084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.641328Z","title":"Louza, G.P","venue":null,"work_id":"28c7edcd-64b1-43c9-a11f-e51e378cbe8f","year":2017},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.214442Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:2981a172bfff40e0e0a46b54ced05342695467fb7ef95ee2bb221e8e32742222","observation_id":"a1dcf643-1bc0-4661-878b-21a5c32c2e7d","resolution":{"observed_at":"2026-08-14T14:01:56.646807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.626574Z","title":"Manber and G","venue":null,"work_id":"fec3266a-d5a6-4da0-be93-bfb12906249b","year":1993},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.219333Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:e9c72d94c52049ee6dd6edd41b31e17530766e931e3eb7a175834a08e9dff9c6","observation_id":"ede93f84-e0c5-423f-a884-f0ba6df76f46","resolution":{"observed_at":"2026-08-14T14:01:56.631337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.614178Z","title":"Mantaci, A","venue":null,"work_id":"0c733d9e-f565-4d64-8944-a8660dcb6cd2","year":2007},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.224556Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:ef0a83aaa5ebf59c432fbd68ab0cbaa7e04fbb8e9a258368db681f1007e18670","observation_id":"74272e27-fdf4-440c-81bd-63b563981090","resolution":{"observed_at":"2026-08-14T14:01:56.618029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.598849Z","title":"Two space saving tricks for linear ti me lcp array computation","venue":null,"work_id":"f32a3476-124f-4486-8d7c-675bff1e556e","year":2004},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.229705Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:66bc18831a15d6b7b9db3954c11d520a81d15c553691111c928284feb5ff7e13","observation_id":"3b5d49d5-1a6f-4998-9f6f-3d65a1cf36b6","resolution":{"observed_at":"2026-08-14T14:01:56.604069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.581985Z","title":null,"venue":null,"work_id":"ff5ccdb9-b991-4769-a97f-f837668d96bb","year":2017},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.234457Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:30a6ef5501d17eebfe15b05e93be1c1f2e9b63a7766174c25d995f718470cf02","observation_id":"2e23e762-e62b-4d6e-9f67-87e8d82865bd","resolution":{"observed_at":"2026-08-14T14:01:56.587086Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.564923Z","title":null,"venue":null,"work_id":"28309146-e780-428c-9b2d-a8daf9869fb5","year":1997},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.239088Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:49537773437a5f94a09d3b7797a338b2af47d0b2b3774e13a6d1a43058d4f9e8","observation_id":"db87ba2a-9052-49ed-bf7f-a504d33c2bf7","resolution":{"observed_at":"2026-08-14T14:01:56.569604Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.549456Z","title":"Compact Data Structures: A Practical Approach","venue":null,"work_id":"fd0408cc-f3d5-402b-a39a-58f02723094f","year":2016},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.243680Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:97bab09b0bec3e16466e87a2d39cd5840140fc05dc8cc17fa157ec5d5e8f40e5","observation_id":"ece350b0-4ef2-4ad9-8792-63ee2c9e6faf","resolution":{"observed_at":"2026-08-14T14:01:56.554488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.532697Z","title":"Optimal dynamic seq uence representations","venue":null,"work_id":"10827ab0-2ed6-4b53-bd5a-ad6c9ffcb009","year":2014},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.248147Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:a58bb8cb3dc43734f15835cfc94e9efbeca6f84e2e40febcdf1cc0d698196309","observation_id":"fcf11255-3346-4a53-baaf-e05eb35cf973","resolution":{"observed_at":"2026-08-14T14:01:56.537941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.517354Z","title":"Ohlebusch, J","venue":null,"work_id":"38c7afc6-827f-4983-bb63-d78bc3659454","year":2010},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.252773Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:c9c148e88c7d929e7565a2829b488f5c8dcac6e3a93361a8f06ea4367d0cd739","observation_id":"6dcf0c80-478b-43fc-8b55-a158aed64967","resolution":{"observed_at":"2026-08-14T14:01:56.522356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.501319Z","title":"Policriti, N","venue":null,"work_id":"f54f0178-880b-4541-8ba2-61679fd20cd6","year":2015},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.257458Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:ae3865649d913e64d2602ce8c9a4988df200947f56a3ffd8107891cbe3df7e1f","observation_id":"c63bf046-8805-4dc2-9c05-e4203bad0a50","resolution":{"observed_at":"2026-08-14T14:01:56.506437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.486345Z","title":"Prezza, N","venue":null,"work_id":"16246bd6-6a58-4a72-960b-3ef3aca696c8","year":2018},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.262224Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:243966b252073d8d7445dadd04b2e895bc24960668f0ac0dd1907168e79bea9f","observation_id":"15b8609b-620d-4adb-a49a-bbefbe5916a3","resolution":{"observed_at":"2026-08-14T14:01:56.490773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.471958Z","title":"Prezza, N","venue":null,"work_id":"fc4c736f-3c8e-4d1b-b9e5-c718f49166a2","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.266622Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:cf1c44852bf8b5ec99fb3770e3cf294654d69707c5b5ae003525197fc0e6ef3d","observation_id":"089b9d0a-bcdd-4898-9338-db1011c32ed8","resolution":{"observed_at":"2026-08-14T14:01:56.476635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.457327Z","title":"Prezza and G","venue":null,"work_id":"6ffffc2e-2de0-415a-ba92-a008bdaf69a0","year":2019},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.270898Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:75015b20b368b84b5ecb8403ab33e898cf00fde2869a14fc7c16e49c34ef780f","observation_id":"3a55cc63-fe1c-4681-9d54-b979ec0db5df","resolution":{"observed_at":"2026-08-14T14:01:56.462046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.440956Z","title":"Puglisi and A","venue":null,"work_id":"630c3c22-65b3-4ace-ae44-fea0422de112","year":2008},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.275124Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:4aafe41e3a972daa809f3a67c9f95140de4d78fa7ec5a49c39d9b89babd658bd","observation_id":"cb44d0bc-59bb-4f07-b55d-2b96a012d489","resolution":{"observed_at":"2026-08-14T14:01:56.446122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.419826Z","title":"Sadakane","venue":null,"work_id":"16798468-b157-4d36-9a1f-7c89f4c3a711","year":2002},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.279540Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:abeb186aa597a947b38afd1b6fb243089b1945bffe15a2a10258e85e66dec771","observation_id":"4a391f99-e56c-475c-8995-ee5751a21661","resolution":{"observed_at":"2026-08-14T14:01:56.425229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.404038Z","title":"Sadakane","venue":null,"work_id":"db75eabd-626c-4a2a-8527-f638d163a7ad","year":2007},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.284453Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:b0cad9b3869e4d662219ce56532c7f8026c48e1b28be301fa797f30e7593531e","observation_id":"4150f4dc-74ba-4b4b-8697-db5f6ead3d73","resolution":{"observed_at":"2026-08-14T14:01:56.408778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.386856Z","title":null,"venue":null,"work_id":"aa402cf8-9ff3-426e-960f-86c2d7d1bc8c","year":1996},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.289110Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:d4593e9eee6a727b792f230a0a5633b75aba88f156624c743f99bf373c282c0d","observation_id":"8606663e-5b8a-419f-a20c-566407dd21d8","resolution":{"observed_at":"2026-08-14T14:01:56.392688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.370629Z","title":"Tustumi, Simon Gog, Guilherme P","venue":null,"work_id":"43516a9b-353f-48c9-bdcc-ba814e2de8e7","year":2016},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.293682Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:81743feafe7da9ea2f66bdd3f533f5d4c53f18bc9f66f7e6387d203d7f0f4a71","observation_id":"e354c5e0-a710-4345-8db5-9ba8f64fb179","resolution":{"observed_at":"2026-08-14T14:01:56.375357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.355620Z","title":"V¨ alim¨ aki, V","venue":null,"work_id":"499ad535-0f5c-435d-8173-7b8aece4af49","year":2010},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.298719Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:e4e93851525eefa903ecf0d6d4ce17da877283830617591d8d167f8038965989","observation_id":"f0f3b775-a430-4ee0-8c13-9926061de07f","resolution":{"observed_at":"2026-08-14T14:01:56.360396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:01:56.198478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T14:01:56.198478Z"},"links":{"citing_paper":"/paper/1908.04686"},"observation_digest":"sha256:0a02ea3bf5788ea8deffaa25aa1d5db09c2796b2c8a1f51455fa10f4bcb15002","observation_id":"82f4c486-31bb-4a5d-902a-9813804ad863","resolution":{"observed_at":"2026-08-14T14:01:56.198478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.04686","last_updated":"2019-08-12T10:58:49Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T05:47:16.671278Z","submitted_at":"2019-08-12T10:58:49Z","title":"Space-Efficient Construction of Compressed Suffix Trees"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":37},"total_outbound_references":45},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:1908.04686."}