{"as_of":"2026-08-09T01:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c41eb7ce642d66331dfc04498305d2e4fa4a4a81d18557114186521be3543257","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:50:50.125069Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T11:07:15.775983Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.02781","last_updated":"2022-11-23T22:22:38Z","snapshot_observed_at":"2026-07-06T09:10:17.507304Z","submitted_at":"2020-04-06T16:16:26Z","title":"Indexing Highly Repetitive String Collections","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.02781","snapshot_observed_at":"2026-08-07T10:50:50.125069Z","title":"Indexing highly repetitive string collections","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.04926","last_updated":"2025-06-05T12:00:38Z","snapshot_observed_at":"2026-08-07T10:28:02.440014Z","submitted_at":"2025-06-05T12:00:38Z","title":"Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.125069Z"},"links":{"cited_paper":"/paper/2004.02781","citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:f5f4df8632b34412fe341112979fe6d9f979acdbf93adec7dbce652efd75cfda","observation_id":"01d82825-47ef-414a-b3c7-8b3a0c88871a","resolution":{"observed_at":"2026-08-07T10:50:50.125069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02781","last_updated":"2022-11-23T22:22:38Z","snapshot_observed_at":"2026-07-06T09:10:17.507304Z","submitted_at":"2020-04-06T16:16:26Z","title":"Indexing Highly Repetitive String Collections","version":10},"cited_work":{"arxiv_id":"2004.02781","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.02781","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR 2004.02781 (2022)","venue":null,"work_id":"e5f01985-6568-4317-83aa-f91059ef38bc","year":2004},"citing_paper":{"arxiv_id":"2506.05638","last_updated":"2026-07-27T07:54:59Z","snapshot_observed_at":"2026-08-07T10:11:21.532801Z","submitted_at":"2025-06-05T23:58:03Z","title":"Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T11:03:04.407168Z"},"links":{"cited_paper":"/paper/2004.02781","citing_paper":"/paper/2506.05638"},"observation_digest":"sha256:eb1a204a319268e68f9732e2efcac6f02ba7882a35622395c01327cb77db6aed","observation_id":"fc2148ba-55ab-4fdf-8281-bcc89b72046d","resolution":{"observed_at":"2026-05-19T11:07:15.777482Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02781","last_updated":"2022-11-23T22:22:38Z","snapshot_observed_at":"2026-07-06T09:10:17.507304Z","submitted_at":"2020-04-06T16:16:26Z","title":"Indexing Highly Repetitive String Collections","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.02781","snapshot_observed_at":"2026-08-07T10:30:35.437169Z","title":"Navarro, Indexing highly repetitive string collections, CoRR 2004.02781 (2022).doi:10.48550/arXiv.2004.02781","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05638","last_updated":"2026-07-27T07:54:59Z","snapshot_observed_at":"2026-08-07T10:11:21.532801Z","submitted_at":"2025-06-05T23:58:03Z","title":"Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation","version":7},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:35.437169Z"},"links":{"cited_paper":"/paper/2004.02781","citing_paper":"/paper/2506.05638"},"observation_digest":"sha256:d4a9bfd8ce327ec6f4fd9424336cd605e7636c7c15c7bda4b1c9a7620883948b","observation_id":"220b5a65-9735-4bfc-9645-e5a35d923d7f","resolution":{"observed_at":"2026-08-07T10:30:35.437169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.02781","last_updated":"2022-11-23T22:22:38Z","snapshot_observed_at":"2026-07-06T09:10:17.507304Z","submitted_at":"2020-04-06T16:16:26Z","title":"Indexing Highly Repetitive String Collections","version":10},"cited_work":{"arxiv_id":"2004.02781","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.02781","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR 2004.02781 (2022)","venue":null,"work_id":"e5f01985-6568-4317-83aa-f91059ef38bc","year":2004},"citing_paper":{"arxiv_id":"2605.04244","last_updated":"2026-05-05T19:31:05Z","snapshot_observed_at":"2026-07-31T22:22:16.575214Z","submitted_at":"2026-05-05T19:31:05Z","title":"Faster Iterative $\\phi$ Queries on the Positional BWT","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-08T17:36:23.156722Z"},"links":{"cited_paper":"/paper/2004.02781","citing_paper":"/paper/2605.04244"},"observation_digest":"sha256:d3b7aa41804935d1c6363c1329a375fab602e0ff4eb016100dabe21ecbba8cce","observation_id":"355e40b0-0379-48a9-9d84-908670020d91","resolution":{"observed_at":"2026-05-11T17:26:06.447172Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2004.02781/citation-record","integrity":"/paper/2004.02781/integrity","json":"/paper/2004.02781/citation-record.json","paper":"/paper/2004.02781"},"outbound":[],"paper":{"arxiv_id":"2004.02781","last_updated":"2022-11-23T22:22:38Z","latest_version":10,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T09:10:17.507304Z","submitted_at":"2020-04-06T16:16:26Z","title":"Indexing Highly Repetitive String Collections"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2004.02781."}