{"as_of":"2026-08-08T05:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:065eae177286ded64aa1139820340d30040c972f4e3058ab1c3496c808900e48","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:50:50.133854Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-06-28T08:13:59.840341Z","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-07-02T05:16:40.128746Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.04926","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04926","snapshot_observed_at":"2026-07-02T05:16:40.128746Z","title":"Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended","venue":null,"work_id":"7843630a-562d-48a4-855f-480386235eb9","year":null},"citing_paper":{"arxiv_id":"2606.03570","last_updated":"2026-06-08T08:15:16Z","snapshot_observed_at":"2026-08-08T02:43:10.113616Z","submitted_at":"2026-06-02T12:38:58Z","title":"STC: Reversible Digit-Context Decomposition for BWT-Family Text Compression","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T08:13:59.840341Z"},"links":{"cited_paper":"/paper/2506.04926","citing_paper":"/paper/2606.03570"},"observation_digest":"sha256:9507ce46a213b5b0455b714776cc8322661847f84f0cdba49e66d6bb122792e7","observation_id":"4a9c404c-4241-4934-9d73-15181d25027c","resolution":{"observed_at":"2026-07-02T05:16:40.130512Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.04926/citation-record","integrity":"/paper/2506.04926/integrity","json":"/paper/2506.04926/citation-record.json","paper":"/paper/2506.04926"},"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-07T10:50:51.065505Z","title":"Sensitivity of string com- pressors and repetitiveness measures.Information and Computation, 291:104999, 2023","venue":null,"work_id":"7ad27a2a-0c46-4b21-8875-638eec692da2","year":2023},"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":1,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.890305Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:1c1b916c033d72f3c637a8604881a9866c5cdfd1435aeef003ee754f26951365","observation_id":"f91ceec0-897e-4192-a306-1a457f4b6934","resolution":{"observed_at":"2026-08-07T10:50:51.069560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:49.901206Z","title":"Bijective BWT based com- pression schemes","venue":null,"work_id":null,"year":2024},"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":2,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.901206Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:0ec27e5ea789526850e504a6bf12bcf3dd8a804cad20c82c38a546f3f810f4a0","observation_id":"14444d5a-5f33-4ed6-b16e-8c0c6992dd8f","resolution":{"observed_at":"2026-08-07T10:50:49.901206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11298","last_updated":"2024-11-18T05:48:55Z","snapshot_observed_at":"2026-08-04T19:21:28.108446Z","submitted_at":"2024-11-18T05:48:55Z","title":"On the compressiveness of the Burrows-Wheeler transform","version":1},"cited_work":{"arxiv_id":"2411.11298","doi":"10.48550/arxiv.2411.11298","metadata_source":"pith","pith_arxiv_id":"2411.11298","snapshot_observed_at":"2026-08-07T18:16:16.850658Z","title":"On the compressiveness of the Burrows-Wheeler transform","venue":"cs.DM","work_id":"4f54245b-3db3-44f3-9192-5d00d20dd0a0","year":2024},"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":3,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.915170Z"},"links":{"cited_paper":"/paper/2411.11298","citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:b28ffa0ad7bf08841252b9d32d81813f84f6f739a1fed3ea2a37c85702b81529","observation_id":"4a9bde9b-ddf6-4a0b-bc31-3c27bc05155e","resolution":{"observed_at":"2026-08-07T10:50:50.168816Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:51.051358Z","title":"Con- structing the bijective and the extended Burrows-Wheeler transform in linear time","venue":null,"work_id":"303c1fb0-2ff2-4629-acc3-18c1dbe4bf8e","year":2021},"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":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.925895Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:fbe5cd173ace8706394a7dca3a9cff7d4ea714797d40fdf13cd6d4d1791f1d2d","observation_id":"7fa2f928-5170-491d-b2b4-aa7335533468","resolution":{"observed_at":"2026-08-07T10:50:51.056468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:51.038563Z","title":"On the number of equal-letter runs of the bijective burrows-wheeler transform.Theoretical Computer Science, 1027:115004, 2025","venue":null,"work_id":"78946733-7529-4b4f-911f-9e97cde4b5df","year":2025},"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":5,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.934468Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:88d67d23dc1326c3ebdfb3ecdca851669c17b0ce874110bffa0f6b0ef9c5af01","observation_id":"77d4a1b4-9348-4bbe-880a-32fd71259755","resolution":{"observed_at":"2026-08-07T10:50:51.044154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:51.026838Z","title":"Classes of identities for the generalized Fibonacci numbers gn = gn−1 + gn−c from matrices with constant valued determinants.The Fibonacci Quarterly, 34(2):121–128, 1996","venue":null,"work_id":"ab887e66-cb2a-4a07-8580-d3cf1b1c6865","year":1996},"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":6,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.945131Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:9fed2b6c504aab4354512addf0b95e88610f93ca27860b0741e562ed4a606205","observation_id":"8bc6a60d-dea2-4d00-8ace-7a36eb397e61","resolution":{"observed_at":"2026-08-07T10:50:51.032297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:51.013293Z","title":"Linear recursion and Fibonacci sequences.(No Title), 1971","venue":null,"work_id":"98bd0245-c8e9-4f96-b1b0-296fac8f437f","year":1971},"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":7,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.955932Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:adfb6b18b6b4a44414109567d47a56cc4e923c3a50132d591540ee64c48686d9","observation_id":"95602a39-b2d6-43bb-9aa1-79d6a6635133","resolution":{"observed_at":"2026-08-07T10:50:51.019418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:49.972672Z","title":"A block-sorting lossless data compression algorithm","venue":null,"work_id":null,"year":1994},"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":8,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.972672Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:34faa5d3f96469568f8f4108ca114e3650109bdc1bd0132c12c855252269923d","observation_id":"36ad52cd-5ecb-4759-8b39-9b2886c71725","resolution":{"observed_at":"2026-08-07T10:50:49.972672Z","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-07T10:50:50.997795Z","title":"A survey of bwt variants for string collec- tions","venue":null,"work_id":"611c74b3-3939-41da-a43e-86bfae361cb4","year":2024},"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":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.983531Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:e537e9ff64a250bcf0597ccca81691496074adb3d295f41f70467188962c021c","observation_id":"196b830c-3480-4850-9d08-c45c6d4e57b3","resolution":{"observed_at":"2026-08-07T10:50:51.003366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.984736Z","title":"Free differential calculus, iv","venue":null,"work_id":"03d85046-295b-43fc-852f-fa39604292c5","year":1958},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:49.991898Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:79e770900e9c62bb6f7d3b91d6d1bdbe3962209eccb2673b3575d9f376b35bec","observation_id":"ebca3a19-6808-4315-986c-d69e2a9bb0dd","resolution":{"observed_at":"2026-08-07T10:50:50.990453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3077","last_updated":"2012-01-15T10:17:36Z","snapshot_observed_at":"2026-08-04T22:28:54.782023Z","submitted_at":"2012-01-15T10:17:36Z","title":"A Bijective String Sorting Transform","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3077","snapshot_observed_at":"2026-08-07T10:50:50.002807Z","title":"A bijective string sorting transform.arXiv preprint arXiv:1201.3077, 2012","venue":null,"work_id":null,"year":2012},"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":11,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.002807Z"},"links":{"cited_paper":"/paper/1201.3077","citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:5919f4b2c9e38bbc950ceacae612b8e3495877958ca6bbf21a3ea43064b60b1c","observation_id":"724e30d1-2452-430e-95a6-882d514867aa","resolution":{"observed_at":"2026-08-07T10:50:50.002807Z","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-07T10:50:50.974123Z","title":"Novel results on the number of runs of the burrows- wheeler-transform","venue":null,"work_id":"4cb6fd4e-a674-4a1c-ac49-abf0a2a521e8","year":2021},"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":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.011517Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:431dbfede213dee702ad06e702a17db2fa892fc70753e34d919b4c9a0aedab9d","observation_id":"1ad42dad-9176-47c1-bea9-7d407dba5f53","resolution":{"observed_at":"2026-08-07T10:50:50.978741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.962186Z","title":"Novel results on the number of runs of the burrows- wheeler-transform","venue":null,"work_id":"47e59eb0-e4cb-46fa-b38c-8de33180e5e2","year":2021},"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":13,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.022423Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:5a9c7f1620306dfd88af463015ad38522ffaf197d54628ef49d8d3b242e25c0b","observation_id":"958c1bfd-d15f-4d50-87dc-4811705552cd","resolution":{"observed_at":"2026-08-07T10:50:50.967794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.951647Z","title":"A generalization of the Fibonacci numbers.The Fibonacci Quarterly, 2(4):227–289, 1964","venue":null,"work_id":"81d9bbd4-00af-47c2-94bb-29ee68aaa678","year":1964},"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":14,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.047771Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:f9073dcbc58a938c7f2fb5c8ffa65942879d31665ea385b07bbdbe5d4509e5e0","observation_id":"8f502040-4665-4513-8262-a76da01e468d","resolution":{"observed_at":"2026-08-07T10:50:50.956829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.942044Z","title":"Compositions ofn with parts in a set.Con- gressus Numerantium, 168:127, 2004","venue":null,"work_id":"7dab116b-3ff9-47ce-8f10-8f7faf431121","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":15,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.063745Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:3d1d3c0c353f71bc8ee6f0abf475d46a9fdede4a2b50cadaf6e849cebf415db4","observation_id":"ae081fe6-72e1-4130-af73-a3e61da135f7","resolution":{"observed_at":"2026-08-07T10:50:50.946308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.930728Z","title":"Closed form formula for the num- ber of restricted compositions","venue":null,"work_id":"f70fe301-00b7-470e-b72f-034b0b330881","year":2010},"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":16,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.076916Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:e8396122c9442aa33a79c9c589604857a3e5e98581445f23dca9eb1efb59c702","observation_id":"8c2caff3-fe47-4c95-9a7b-26cc5b4239f5","resolution":{"observed_at":"2026-08-07T10:50:50.935009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.921122Z","title":"The sequence read archive: a decade more of explosive growth.Nucleic acids research, 50(D1):D387–D390, 2022","venue":null,"work_id":"698ec75b-2b87-40a8-9bb4-834853ec850a","year":2022},"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":17,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.092831Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:f499a17691c020e5659a651ea84201b7889020c68bb0c80d16e5bf7bbab86943","observation_id":"d44f96ae-5a28-488b-bfb3-747572c56bc6","resolution":{"observed_at":"2026-08-07T10:50:50.925604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.911516Z","title":"On circulant matrices.Notices of the AMS, 59(3):368–377, 2012","venue":null,"work_id":"814d34cf-91bf-49f7-9c64-d55e2971aec8","year":2012},"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":18,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.098382Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:f14768c0d1df135bfc1d0b0618ef49a1794b51ccc52954ebd644d7538f5f6d94","observation_id":"91a97481-2c0d-455e-bb04-61f401283887","resolution":{"observed_at":"2026-08-07T10:50:50.914304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.903854Z","title":"Combinatorics on words, volume 17","venue":null,"work_id":"1b425f2a-0826-4c8a-9113-5f6c9e92ccec","year":1997},"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":19,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.102427Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:e524089a44b72509a32cf88e84bdbff3abbd6b76ac10e994518a53e3f1881786","observation_id":"972615e6-0323-48e0-823b-7598f412e1b1","resolution":{"observed_at":"2026-08-07T10:50:50.906605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.891503Z","title":"An extension of the Burrows–Wheeler transform.Theoretical Computer Science, 387(3):298–312, 2007","venue":null,"work_id":"7b1525fb-bfb0-4a39-9c40-ff4ac67e56f8","year":2007},"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":20,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.106380Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:adc80acadf435821b61be1ced5880b98d79fb13abdf71911e8954d6d59582e60","observation_id":"003550da-8cba-462b-bc30-13b6f1f2133e","resolution":{"observed_at":"2026-08-07T10:50:50.898888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.712308Z","title":"Measuring the clustering effect of BWT via RLE.Theoretical Com- puter Science, 698:79–87, 2017","venue":null,"work_id":"1ae20616-256e-4747-bcff-7ba36750e368","year":2017},"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":21,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.111478Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:8e1fb0d8bc394624bee181baaeecd6e6d810deaee8ac3c7221d76f4a146d00d7","observation_id":"1634da28-9a59-4f86-ae46-1a66806d0678","resolution":{"observed_at":"2026-08-07T10:50:50.819124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.506329Z","title":"An analysis of the Burrows–Wheeler transform.Journal of the ACM (JACM), 48(3):407–430, 2001","venue":null,"work_id":"36d37a33-70ef-4339-9fcd-24a4b6f6429f","year":2001},"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":22,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.117273Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:944a50bae21e856b655450daae6582647b93e00be3fdd381d34d2caa94aee21e","observation_id":"7d4c051a-9b6a-4f92-b800-f55022730002","resolution":{"observed_at":"2026-08-07T10:50:50.596509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.282276Z","title":"Artin’s primitive root conjecture–a survey","venue":null,"work_id":"5e74a622-ef83-43d4-8ab2-e842691cf708","year":2012},"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":23,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.120697Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:ab12136f249a049ca9f8a1ff954fdd2203c7601f7d0774cf4eaadf8a3536b49c","observation_id":"3de01978-2760-4173-aad2-7541ac540d42","resolution":{"observed_at":"2026-08-07T10:50:50.405170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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: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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:50:50.210626Z","title":"Results of a prototype television bandwidth compression scheme","venue":null,"work_id":"cdb9abf6-8448-409d-96fe-65a4337303a1","year":1967},"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":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.130662Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:5c987c0424279e50193bab2c845efba9e3e5292db327e9ecf62a205497b5870a","observation_id":"e32ecb97-c16d-40ef-9e12-26bbed192522","resolution":{"observed_at":"2026-08-07T10:50:50.213688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0701397","last_updated":"2008-01-28T17:45:48Z","snapshot_observed_at":"2026-07-07T06:03:42.664992Z","submitted_at":"2007-01-14T22:48:30Z","title":"The Mahler measure of algebraic numbers: a survey","version":2},"cited_work":{"arxiv_id":"math/0701397","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0701397","snapshot_observed_at":"2026-08-07T10:50:50.180820Z","title":"The Mahler measure of algebraic numbers: a survey","venue":"math.NT","work_id":"b66c0c8b-d223-4610-9cb0-ce5ff85b6dac","year":2007},"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":26,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.133854Z"},"links":{"cited_paper":"/paper/math/0701397","citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:3775f1c2e961964bdf958c56f79e1c12b8042729d7f15c38d13348b59492b67c","observation_id":"f4b4bcb2-dd3c-4996-bd56-117a0731d6df","resolution":{"observed_at":"2026-08-07T10:50:50.186347Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T10:50:50.034666Z","title":null,"venue":null,"work_id":null,"year":null},"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":2021,"source":"pdf_text","source_observed_at":"2026-08-07T10:50:50.034666Z"},"links":{"citing_paper":"/paper/2506.04926"},"observation_digest":"sha256:4738ac3dde78975074780c5a5242daefea25648a1ff8f829b2168b2ab242d076","observation_id":"dad494bf-77a8-4ea9-84d5-76660d394cb1","resolution":{"observed_at":"2026-08-07T10:50:50.034666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.04926","last_updated":"2025-06-05T12:00:38Z","latest_version":1,"primary_category":"cs.DS","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"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":20},"total_outbound_references":27},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:2506.04926."}