{"as_of":"2026-08-15T22:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c088ac63d75ba9cfa65488c04e28ac5325549f6d310a8b46c0dcac33afcb563","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:44:16.273605Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T22:06:56.270152Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.12439","snapshot_observed_at":"2026-08-03T22:06:56.270152Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing.arXiv preprint arXiv:2411.12439(2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.12205","last_updated":"2026-01-15T07:54:33Z","snapshot_observed_at":"2026-08-14T19:55:37.129829Z","submitted_at":"2025-11-15T13:17:51Z","title":"LCPan: efficient variation graph construction using Locally Consistent Parsing","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T22:06:56.270152Z"},"links":{"cited_paper":"/paper/2411.12439","citing_paper":"/paper/2511.12205"},"observation_digest":"sha256:c86fae2be220a57bd05409f098b34fe41255e5d37c082a41e062a82819eeeb46","observation_id":"59a0b4c9-9e95-4802-98bd-145d9998ff08","resolution":{"observed_at":"2026-08-03T22:06:56.270152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.12439/citation-record","integrity":"/paper/2411.12439/integrity","json":"/paper/2411.12439/citation-record.json","paper":"/paper/2411.12439"},"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-12T17:44:16.507380Z","title":"Prefix-free parsing for building big BWT s","venue":null,"work_id":"953d5955-3c76-491f-a7a8-f55e58c38976","year":2019},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.197059Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:812fd8dc4537b777917cbeae44adb0a8c16d195a0e72ec562188fe04e1111634","observation_id":"0850bea0-9c95-4bcd-93b7-f6f140f5dbc6","resolution":{"observed_at":"2026-08-12T17:44:16.509510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.500954Z","title":"The smallest grammar problem","venue":null,"work_id":"08063d72-04b5-4541-b514-ff5c9de20cda","year":2005},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.200256Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:155f3e6b22610963bf745f50048f4057ecc98d329089eda9a3ca5b8c61a13485","observation_id":"327ee0c7-bc39-470c-9719-a396ef579821","resolution":{"observed_at":"2026-08-12T17:44:16.503652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.494225Z","title":"Optimal-time dictionary-compressed indexes","venue":null,"work_id":"b88ba1e1-8e1d-4f2d-8a43-3a88ed722980","year":2020},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.203589Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:6ee6269b264f57c09906688be5fe7675ba1d79f9530de73079a5d9c9516219c2","observation_id":"b968566d-9950-41fa-9069-12d866963d6d","resolution":{"observed_at":"2026-08-12T17:44:16.496920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.487542Z","title":"Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms","venue":null,"work_id":"1d7125f0-5404-438c-8057-b12e428bc23a","year":1986},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.206474Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:d6980a7ff4113419e47df255f7887a7798520b9b68832749535a6cfdc613944d","observation_id":"43c537d7-c81c-4d85-b105-1bf61669a676","resolution":{"observed_at":"2026-08-12T17:44:16.490190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.480668Z","title":"FM -indexing grammars induced by suffix sorting for long patterns","venue":null,"work_id":"31555232-7f91-434f-871f-fb1a457c2044","year":2022},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.209583Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:eb836ae078883baa4e47975c3bb67965f5114a4e84b3ad452727d3ae9f96e1ce","observation_id":"30f0717f-2241-4990-8069-984d6a17da22","resolution":{"observed_at":"2026-08-12T17:44:16.483173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.473826Z","title":"AGC : compact representation of assembled genomes with fast queries and updates","venue":null,"work_id":"f2a9c6dc-4975-4a34-9009-4381cf6b7797","year":2023},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.212461Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:feba01d18ef00f821ca12fbbfa9b0ae5ebff98fcb685a4328666f43d8a0259d3","observation_id":"3c135a4f-1ef6-4da0-b5b2-9b9323e39876","resolution":{"observed_at":"2026-08-12T17:44:16.476460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.467283Z","title":"Efficient construction of the BWT for repetitive text using string compression","venue":null,"work_id":"e8fddd8c-b3e4-4b6f-a553-5c64105a3878","year":2023},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.215060Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:999ef908a73df72250727c33f2a9d516f4afe8557cb000179d99c8b12432b4d1","observation_id":"4e00c710-9572-4bcf-ace4-700baf942718","resolution":{"observed_at":"2026-08-12T17:44:16.469864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.460491Z","title":"An LMS -based grammar self-index with local consistency properties","venue":null,"work_id":"00da3f98-373e-4078-bc33-47d16940b450","year":2021},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.217565Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:406506defbe66fce5b8dacd021d9041930422a3a1e5ea29cadd1a673be9c0e6a","observation_id":"9166c826-bcb0-4c55-81e0-28acfee7f18c","resolution":{"observed_at":"2026-08-12T17:44:16.463209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.453690Z","title":"Computing all-vs-all MEM s in grammar-compressed text","venue":null,"work_id":"e50ebb01-361a-4642-af95-0fb2332eef26","year":2023},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.220028Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:0c574a0078ce00e42e55911a03c5048a1a097b177455b0c86e170af3dec7fa1f","observation_id":"5f573129-b2dc-4921-ac89-afb38a16b6ce","resolution":{"observed_at":"2026-08-12T17:44:16.456245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.446967Z","title":"Polynomial hash functions are reliable","venue":null,"work_id":"3404cd58-36e1-453f-85ac-1e1ad7734222","year":1992},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.222574Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:a6e41e537fc5ed2db7d7b17e9e30d18e10cd2677e8fd3964847c9fe71d8951f4","observation_id":"fc544bfa-efda-4d8f-a37b-008200f04af4","resolution":{"observed_at":"2026-08-12T17:44:16.449690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.2540","last_updated":"2014-01-06T11:35:10Z","snapshot_observed_at":"2026-08-14T23:55:44.550657Z","submitted_at":"2013-11-11T19:21:53Z","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.2540","snapshot_observed_at":"2026-08-12T17:44:16.225103Z","title":"Asymmetric numeral systems: entropy coding combining speed of huffman coding with compression rate of arithmetic coding","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.225103Z"},"links":{"cited_paper":"/paper/1311.2540","citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:92dee21a3be61c8be590fcd3a8e0ab42c4d0cefe3ac203b525638405c4918763","observation_id":"f8d10609-7310-4b9b-a1d2-00b4b20c91a2","resolution":{"observed_at":"2026-08-12T17:44:16.225103Z","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-12T17:44:16.440252Z","title":"Rpair: Rescaling R e P air with rsync","venue":null,"work_id":"71a2ffed-f5d3-4a64-b31b-8720da2f7367","year":2019},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.227990Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:8dc86c0af6986fddb1fdb50d4a0296fb435dc712082f71b3d4bc7368e178ceca","observation_id":"02526c5d-b7fb-460e-86c7-5aff408cb2d1","resolution":{"observed_at":"2026-08-12T17:44:16.442863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.434186Z","title":"Optimal dynamic strings","venue":null,"work_id":"a0c3f6fa-188b-4490-b76f-7e5abea1a134","year":2018},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.230553Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:5d1a0ff86213080b1ba27b71f73b54cc743a909286cc9f02ca3e8b1b303bd94b","observation_id":"3212f472-b51d-40ea-8fae-2f976a36eabe","resolution":{"observed_at":"2026-08-12T17:44:16.436232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.428645Z","title":null,"venue":null,"work_id":"95d4e301-348d-4325-be5c-61019e0a4664","year":1952},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.232869Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:79eafdef6a51be95a67755dee6c3ad8bdd125d858e6918ea595e7c58dc0762fa","observation_id":"03b3f607-e129-4c6c-bb09-0ca99b7e532b","resolution":{"observed_at":"2026-08-12T17:44:16.430591Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1101/2024.03.08.584059","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T17:44:16.290314Z","title":"AllTheBacteria -all bacterial genomes assembled, available and searchable, 2024","venue":null,"work_id":"f3b67534-f28d-4734-a217-6ab046b9d1c0","year":2024},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.235170Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:ffe20d3188efba6060f4c6a424be68c78ed4bc662edd9c8457a42a2b01082ef5","observation_id":"2eec9c41-2087-4781-bdb2-76bc3c11ab03","resolution":{"observed_at":"2026-08-12T17:44:16.294736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.423018Z","title":"A really simple approximation of smallest grammar","venue":null,"work_id":"5fea82a2-a6a6-49f5-81fc-1e356676d3a9","year":2016},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.237158Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:7c86dd61f5b53ce92f229118b316c1ad752d0049461af64a3729fde902428dbe","observation_id":"708fcb46-7a53-42c9-9944-8e01f453875d","resolution":{"observed_at":"2026-08-12T17:44:16.425119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.416995Z","title":"Kieffer and En Hui Yang","venue":null,"work_id":"3d4cc8d7-9e16-45b3-ba35-6b50101f0b09","year":2000},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.239219Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:132c2cb63edc4e74c778515b6262dcb0ea0584f75cc9a8be86967f5c3c69edf8","observation_id":"1fd40337-1fb2-40c3-8dd2-8504e8990d5c","resolution":{"observed_at":"2026-08-12T17:44:16.419575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.410118Z","title":"Near-optimal search time in -optimal space, and vice versa","venue":null,"work_id":"01c55bb1-3cc5-49f5-b9f5-c7a5e2074344","year":2024},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.241076Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:4670090251c8e7a1351a96189f6ff2296164b6610286e531875d725def530c3d","observation_id":"b4f8e62f-d486-435d-aaf3-e578717914a8","resolution":{"observed_at":"2026-08-12T17:44:16.412792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.403363Z","title":"Toward a definitive compressibility measure for repetitive sequences","venue":null,"work_id":"1d68cb72-1bdf-48ac-9cd4-ecc7863102c6","year":2022},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.242957Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:be4f8ac01483420a0f98808a6ad7715536e9fe5e77ecf2d34627ccb9cff0408a","observation_id":"4cb2b755-be86-4eef-99d9-0de164e373e3","resolution":{"observed_at":"2026-08-12T17:44:16.405959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.396443Z","title":"Jesper Larsson and Alistair Moffat","venue":null,"work_id":"eda7d13b-c1f6-4b00-bad2-5ff7b03dc0af","year":2000},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.244768Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:b17eea187f9801b933177790a3961c0a751f5e21e6c89563f730de800750fb7e","observation_id":"00a3c562-b546-4762-a83c-41e0d85ad97b","resolution":{"observed_at":"2026-08-12T17:44:16.399206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.389811Z","title":"On the complexity of finite sequences","venue":null,"work_id":"4333176a-9249-4199-acda-e593d30cd9ad","year":1976},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.246822Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:e467e44d12205608789963fc88d3388d880cdb701661d31989357f7e291874df","observation_id":"ab1603e7-5cfd-46c7-a167-0149de0c1799","resolution":{"observed_at":"2026-08-12T17:44:16.392320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.383266Z","title":"Fast and accurate long-read alignment with B urrows- W heeler T ransform","venue":null,"work_id":"0d3d832f-5518-4e30-a4a1-813341d5c667","year":2010},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.248642Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:1b42d3cc863e745529f55388cf7857a75e009f38203e0ddaf06dd2e2e5969df2","observation_id":"55cc65ee-59dc-4288-95b8-afee87cb5630","resolution":{"observed_at":"2026-08-12T17:44:16.385857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.376228Z","title":"Maintaining dynamic sequences under equality tests in polylogarithmic time","venue":null,"work_id":"fc11dea7-8c7b-48cc-8be4-5cfc94b18267","year":1997},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.250461Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:f8b9512c7e1967e7497ca7877d7b21040ddca49af7b7472549dc17e58284f19a","observation_id":"4256aa82-2e51-49f6-9cf6-3f341c38df6f","resolution":{"observed_at":"2026-08-12T17:44:16.378897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.369394Z","title":"Muthukrishnan and S \\\"u leyman Cenk Sahinalp","venue":null,"work_id":"88963d4a-e369-4db5-8619-c35f649b2e61","year":2000},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.252332Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:bbe64ee5ea454677ec1bbd7dfd669e31808007c5bb5108b16e3d5eaf25dcef10","observation_id":"10cb4cbf-dec1-49b3-8483-37f832210d6d","resolution":{"observed_at":"2026-08-12T17:44:16.371955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.362303Z","title":"Computing MEM s and relatives on repetitive text collections","venue":null,"work_id":"837ad044-695b-44d0-a0da-1f7d844533c4","year":2024},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.254677Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:59fca450ecf158b6f05b4f05f40cc338fe25e0b50436487c50415c1cfe2af01a","observation_id":"8fb33aa0-e65a-4462-855a-3f6e09d82a0c","resolution":{"observed_at":"2026-08-12T17:44:16.365001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.355411Z","title":"Nevill-Manning and Ian H","venue":null,"work_id":"a4123ee9-b98e-4838-bd68-86f0f02fb19c","year":1997},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.257133Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:49d6fdd78dc44cc9423dd47fa3b0975d6ae58ea64fc886f288924fc833b34512","observation_id":"de54ad1a-1470-47fb-9e04-4b603a304434","resolution":{"observed_at":"2026-08-12T17:44:16.357924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.349409Z","title":"Practical linear-time O(1) -workspace suffix sorting for constant alphabets","venue":null,"work_id":"40251b7d-3764-4631-a347-5a80adafd501","year":2013},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.259525Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:e8cfc19d82a2c66a279bf1b454919d3d9394b765cd43952d0a5dafb0c470b9b9","observation_id":"613f1879-d9a9-4662-a819-20cc49229e39","resolution":{"observed_at":"2026-08-12T17:44:16.351639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.342981Z","title":"Linear suffix array construction by almost pure induced-sorting","venue":null,"work_id":"204ec879-15d8-40e1-930e-a4b5147b6ac5","year":2009},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.261855Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:3d283c457d1bfd4bfef9fe0cc15ffb326b02c867453ed0e8d0141e8134895bbc","observation_id":"60643086-8a5a-4062-ada4-add0cb045acf","resolution":{"observed_at":"2026-08-12T17:44:16.345497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.336058Z","title":"Louza, Simon Gog, Mauricio Ayala-Rinc \\' o n, and Gonzalo Navarro","venue":null,"work_id":"ab23a9f7-29d6-4aff-8d86-4d5bdcb008f2","year":2018},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.264265Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:c87587f4ea46a3f34836afdd66eafbc2230c725465e3d417459ef6e85a81ac4c","observation_id":"af2b090d-2314-46e6-8d20-26076fdaeda5","resolution":{"observed_at":"2026-08-12T17:44:16.338720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.328728Z","title":"RePair and all irreducible grammars are upper bounded by high-order empirical entropy","venue":null,"work_id":"916e5027-ba51-45c6-a7fe-4f8010f74e4d","year":2018},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.266602Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:fc569c21705cff1050261ff292326fcd29355d625189b8cd029ee8fa8e5655d2","observation_id":"8b55c545-c4e5-4f64-877d-ab1ed621bb35","resolution":{"observed_at":"2026-08-12T17:44:16.331569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.320478Z","title":"Sublinear algorithms for approximating string compressibility","venue":null,"work_id":"26c6e23b-6e45-4b14-8404-bb63afa968a4","year":2013},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.268842Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:cd28d38d89eed96277f6cf72499da8f5beb41e6c5fdf32eeb0f54e9578b35ed5","observation_id":"752c47cf-d7cf-484f-8428-8418a3f16376","resolution":{"observed_at":"2026-08-12T17:44:16.323251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.313288Z","title":"Symmetry breaking for suffix tree construction","venue":null,"work_id":"8bf99637-8603-4c75-8d81-a96f886fae7b","year":1994},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.271187Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:fb943ccee966d9d6311bc3092364f22eb92f6527e5f24ecc5e16300cc6f65782","observation_id":"66010d5a-2eef-4527-b427-7c0b9e63bb64","resolution":{"observed_at":"2026-08-12T17:44:16.315934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-12T17:44:16.306169Z","title":"A universal algorithm for sequential data compression","venue":null,"work_id":"da8ae712-4836-4df9-bcf3-75b2db6867b7","year":1977},"citing_paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T17:44:16.273605Z"},"links":{"citing_paper":"/paper/2411.12439"},"observation_digest":"sha256:4fc5c84e7bb738bcaa85664b950288256d668994b4a0d48352a8084d282406a6","observation_id":"1fdfe195-c29b-4dbb-b2d2-db0fb3cdde2e","resolution":{"observed_at":"2026-08-12T17:44:16.308844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.12439","last_updated":"2025-02-24T21:52:11Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T09:37:13.549491Z","submitted_at":"2024-11-19T11:59:27Z","title":"Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":30},"total_outbound_references":33},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 1 inbound Pith citation observation for arXiv:2411.12439."}