{"as_of":"2026-08-16T15:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4eb8edb372d3c80bfdbe20b52853243fd7b4bc89d6c858be71317612f13f5d7f","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:21:07.991966Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"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.01263/citation-record","integrity":"/paper/1908.01263/integrity","json":"/paper/1908.01263/citation-record.json","paper":"/paper/1908.01263"},"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-14T15:21:08.227185Z","title":"Prefix-free parsing for building big BWTs","venue":null,"work_id":"15df365b-9463-47be-88cf-dc280d17fbb3","year":2019},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.928684Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:a7de9ced78e1bd739f9dce31a919093d1d9043595a7fd53f603933872863d980","observation_id":"5d49bad7-bfa6-41cb-b4fe-c801b415e2e6","resolution":{"observed_at":"2026-08-14T15:21:08.231393Z","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-14T15:21:08.212149Z","title":"A block-sorting los sless data compression algorithm","venue":null,"work_id":"35db0e4b-dd8b-46d5-a966-2a4ac313f965","year":1994},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.933070Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:cd3e591c61e0ca91054c3254d7107514fdb1a3edba301975f3dba3598226ba32","observation_id":"b034009e-67a8-4e89-b3df-97ef082df426","resolution":{"observed_at":"2026-08-14T15:21:08.216966Z","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-14T15:21:08.196221Z","title":"Indexing compres sed text","venue":null,"work_id":"8f4e3817-ab2d-4885-ae92-69f32a048cc3","year":2005},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.937280Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:43c30d38b5546eb2c14b6fd909a4b87d9e9d96b8d8cdef1794b32676ab26040b","observation_id":"3b485998-0ec5-4e45-a082-9b30d4b0e450","resolution":{"observed_at":"2026-08-14T15:21:08.201812Z","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-14T15:21:08.180811Z","title":"Optim al-time text indexing in BWT-runs bounded space","venue":null,"work_id":"e15d3735-b2da-4fcf-aaf9-7e3316f15062","year":2018},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.942392Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:6385829c315824544e652c29f7415b1eeec55ab9e280234207ed813805a1a61e","observation_id":"adee9040-3638-4979-b128-245537a575d7","resolution":{"observed_at":"2026-08-14T15:21:08.186038Z","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-14T15:21:08.163512Z","title":"From theory to practice: Plug and play with succinct data structures","venue":null,"work_id":"1bc2486d-bbb9-4d1a-a242-cbb0812b4c58","year":2014},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.947200Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:711a916e10bb438f41cf85d896a46acb8c0d5454b693a7f5e1e431a638caab0c","observation_id":"3b516a19-4855-421a-8f4f-fcd21e9c3cd5","resolution":{"observed_at":"2026-08-14T15:21:08.168966Z","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-14T15:21:08.146038Z","title":"Efficient construction of a complete index for pan-g enomics read alignment","venue":null,"work_id":"af26727b-0199-4c9e-8d3f-82f165e5c591","year":2019},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.952814Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:73cbf3c9fc4344b03b952daa78f86eb22e89ef996ad4c3749cf9e26e9b0a8766","observation_id":"fe65346a-afd2-4e93-bcb3-cab4a572360f","resolution":{"observed_at":"2026-08-14T15:21:08.151959Z","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-14T15:21:08.130665Z","title":"Fast gapped-read ali gnment with Bowtie 2","venue":null,"work_id":"4147d860-3684-4421-a2fe-90172e661a69","year":2012},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.958400Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:fcb4448969463cbb9fa21cc7d725bdb3868f5d17bd3b0fbfed86a881913e17f8","observation_id":"18b8ddc8-37b0-452a-bb94-b9c81d5d729b","resolution":{"observed_at":"2026-08-14T15:21:08.135512Z","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-14T15:21:08.114357Z","title":"Ultrafast and memory- efficient alignment of short dna sequences to the human genome","venue":null,"work_id":"39557f75-b370-4e75-b6e7-0cb3e8f501f3","year":2009},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.963141Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:fea344a7f62a4e696509618b74b60d2c881d4553adf761a3f720cc5e63a35c33","observation_id":"e18da6a2-5d13-4439-b79d-6918c0fe2b8e","resolution":{"observed_at":"2026-08-14T15:21:08.119329Z","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-14T15:21:08.098256Z","title":"Fast and accurate short read a lignment with Burrows-Wheeler transform","venue":null,"work_id":"0f18fd3c-2a69-421a-bdb2-b23cbc27ecc1","year":2009},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.968543Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:29c9b4f6e1e50f0740f84f070d1c93e541070dfd01b3f0a07a98170728ee1917","observation_id":"41f923f9-7ced-46ed-8460-c153fe5a7d52","resolution":{"observed_at":"2026-08-14T15:21:08.103879Z","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-14T15:21:08.082237Z","title":"The sequenc e alignment/map format and SAMtools","venue":null,"work_id":"db10b0cb-3695-4aba-96e8-2d78aafb053f","year":2009},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.973860Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:3d98176e9033033a910aadb52e776b7ecc55f8cbb154dbcf2391dbec173734e4","observation_id":"76241cb5-7992-49e2-9dde-fb777ca528b1","resolution":{"observed_at":"2026-08-14T15:21:08.087496Z","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-14T15:21:07.978956Z","title":"Storage and retrieval of highly repetitive sequence collections","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.978956Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:b9b57bf5d1b150de90cafe6356a65a5de36137f220216485c1234572588af2d1","observation_id":"e6caedca-982f-476e-b955-a24647b418ed","resolution":{"observed_at":"2026-08-14T15:21:07.978956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:21:08.055768Z","title":"Two efficient algori thms for linear time suffix array construction","venue":null,"work_id":"b2145be7-090d-409a-880a-f17bbfa6b146","year":2010},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.983669Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:d70e589b2bd6b10f039c040922eb2a996d554c83d665c66b6e528dcc9e4d8ce7","observation_id":"36ba2309-979b-4a23-ba79-3823e087b40c","resolution":{"observed_at":"2026-08-14T15:21:08.060767Z","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-14T15:21:08.038888Z","title":"ViPR: an op en bioinformatics database and analysis resource for virology research","venue":null,"work_id":"76bd0a07-191f-4140-9e28-5b2597948b06","year":2012},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.988143Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:03ebaa2916e8504847ddc7ceb1fa0c3b5195130f3113e6caccdcc6d053c3a162","observation_id":"ad5d8ff5-297c-4fc9-b97d-c53813c593bf","resolution":{"observed_at":"2026-08-14T15:21:08.044785Z","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-14T15:21:08.021472Z","title":null,"venue":null,"work_id":"cc4c4b1c-a898-45b9-a2a9-6900208b1751","year":2018},"citing_paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:21:07.991966Z"},"links":{"citing_paper":"/paper/1908.01263"},"observation_digest":"sha256:b673aaaa903e73a1283d1e4a00560ab361458238663f2e737ac20b89c161b710","observation_id":"4516d8b1-a4fa-4daa-9d92-a164a2ebc4ac","resolution":{"observed_at":"2026-08-14T15:21:08.027632Z","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"}}],"paper":{"arxiv_id":"1908.01263","last_updated":"2019-08-04T03:31:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T14:14:29.282605Z","submitted_at":"2019-08-04T03:31:16Z","title":"Matching reads to many genomes with the $r$-index"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":14},"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 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.01263."}