{"as_of":"2026-08-16T16:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ac5b037d153e8c271234254980c1e05efee855721cc9ca68a3e3eacb269cbc4","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:32:12.267924Z","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-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.03169/citation-record","integrity":"/paper/1908.03169/integrity","json":"/paper/1908.03169/citation-record.json","paper":"/paper/1908.03169"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.660392Z","title":"Allouche and J","venue":null,"work_id":"30691e21-9d0a-4180-8986-4b100283f861","year":2003},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.156143Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:c973a00d9ed2065c9bb15af6bc18edeff40c3082513c08c845d46dedc8a74f0f","observation_id":"cc4bf5f5-db2d-4c12-9f3b-5bddb497e2c6","resolution":{"observed_at":"2026-08-14T14:32:12.663774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.649525Z","title":"Balkov´ a, E","venue":null,"work_id":"c6c9b08e-096c-4ce6-9763-e1b7aee68d6c","year":2011},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.160165Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:5b9db76e61981b0706c49c09f3abdf968192787969802d9c5457c844975bf8de","observation_id":"e1603538-d59a-406f-a6f1-a36f32f334a4","resolution":{"observed_at":"2026-08-14T14:32:12.653088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.639441Z","title":"Baranwal and J","venue":null,"work_id":"65b0b8f3-95d8-40b4-98d0-dd0a4ce57aa0","year":2019},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.163525Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:bb9249049416cdaca01010806240bc193295a2c67eb77d48ed95e26259689fa9","observation_id":"ecb6ef97-ec1f-4e45-b1ac-b95064d6b56c","resolution":{"observed_at":"2026-08-14T14:32:12.642800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.628466Z","title":"Baranwal and J","venue":null,"work_id":"4c4b9e22-e321-4297-b752-df24d08459fb","year":2019},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.166903Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:b8943bdb52ac79e51e92fc8c8c217d6ba42e36b7be7a48e2e38f3bc393a6ae26","observation_id":"fea7f4f9-b59e-4603-a188-3869eabdf5c9","resolution":{"observed_at":"2026-08-14T14:32:12.632850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.616980Z","title":"Blondin Mass´ e, S","venue":null,"work_id":"d3843b18-dc34-404d-b3dd-8079dfd66b0f","year":2011},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.171853Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:02f36e881379e4597be9e9dd0a8059123e8fd0b3fa680ca720dc05817066932b","observation_id":"c941afbb-0530-486d-a5b4-2cefd8322b61","resolution":{"observed_at":"2026-08-14T14:32:12.621133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.607899Z","title":"Brlek, S","venue":null,"work_id":"97f6ba5e-9b8e-4e59-856a-8d87d78d94e6","year":2004},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.175607Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:219ca866ffe599b3c9564bab52387ce10872441828977a1dd58a284193744d02","observation_id":"9b8e36c7-6a67-4a5e-9e38-aed7f841e17f","resolution":{"observed_at":"2026-08-14T14:32:12.610882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.597729Z","title":"Carpi, On Dejean’s conjecture over large alphabets, T heoret","venue":null,"work_id":"8411bd0e-cd3d-48cd-b45b-3c5be4e8e985","year":2007},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.179643Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:14abe10248e534f96c5c6fc905401ba34fc814be4973938c5cef944979069fed","observation_id":"91127a7e-73d3-4eea-b789-bed86c06b3cf","resolution":{"observed_at":"2026-08-14T14:32:12.601254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.587283Z","title":null,"venue":null,"work_id":"6b5b639f-1383-4ceb-8fe6-6c8afb7a6044","year":2009},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.183097Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:ba03c37affc9ab084c2085960c8ff98c9d914468ae766ad3c560b6ca20c52169","observation_id":"2670e272-91e9-4dc5-ba72-7de715fa0ff9","resolution":{"observed_at":"2026-08-14T14:32:12.590700Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.576804Z","title":null,"venue":null,"work_id":"e6147168-d824-4bfb-ac69-8ee268511847","year":2011},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.186568Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:98e48f04837420a616b3c3cc377ea387169e3cb800e3e47b6a493ec2bbcd2af5","observation_id":"16809809-0189-41ed-a110-3c21d4c5ee41","resolution":{"observed_at":"2026-08-14T14:32:12.580172Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.565498Z","title":"Damanik and D","venue":null,"work_id":"9a0b3bab-b93e-474b-85bd-bbf70650d31a","year":2002},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.190115Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:ea7523d58e4cdcf23940fc88da649a8a4cceb1add9428ce5c90f8166cfa41684","observation_id":"c78bbef2-5ed1-4fc7-a253-b8fb130f26d0","resolution":{"observed_at":"2026-08-14T14:32:12.569205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.555037Z","title":"de Luca, A","venue":null,"work_id":"817fd728-488c-4446-879b-5cf1aceb2aea","year":2008},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.193566Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:4591453de21ea3ee361c40d718a2cb76d309035c952fda2c63939db2c96f68f7","observation_id":"1ed1dc0b-0411-485d-9f67-9b798f14e095","resolution":{"observed_at":"2026-08-14T14:32:12.558531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.544414Z","title":"Dejean, Sur un th´ eor` eme de Thue, J","venue":null,"work_id":"6cdc177c-8266-471e-a4dd-3825192204ec","year":1972},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.196671Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:ba3564293028f0f3d1c3fd370ed048463a2aa9562f6b87ca1f5ded754e5185b8","observation_id":"34dddc49-408d-47ea-9f0e-e7e19b0a12b9","resolution":{"observed_at":"2026-08-14T14:32:12.547961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.533883Z","title":"Droubay, J","venue":null,"work_id":"6f122723-51e9-4dbb-8f46-adf1d0e7fd34","year":2001},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.199881Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:f5e061e3a5456bce2a6e2b3c48a05dfd8d7efa71540798d33398cbb0ac47dc62","observation_id":"2ff9efca-9ccd-4009-81d8-2cab30d4473c","resolution":{"observed_at":"2026-08-14T14:32:12.537122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.524639Z","title":"Glen and J","venue":null,"work_id":"004ac239-20b1-4330-be8e-74a7365486c6","year":2009},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.202982Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:624f73562e2c3be79309777cd09b59e804d44218dff743f0e68f8f01d7d4bb70","observation_id":"1234d698-0109-4e21-9a0b-5b84d218309d","resolution":{"observed_at":"2026-08-14T14:32:12.527563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.513958Z","title":null,"venue":null,"work_id":"7a4adfcf-66b2-4bdc-95ad-6776f3ecffbf","year":2009},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.206141Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:fe52ad447d2fac1a85b0e292c489008df1a75d124120b1755a7a7c69d7f535ec","observation_id":"6af15a91-599d-4ac3-8e5b-5eb3761becab","resolution":{"observed_at":"2026-08-14T14:32:12.517662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.502935Z","title":null,"venue":null,"work_id":"4656e67a-8d6a-420f-9058-248d56f78c21","year":1995},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.209237Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:a55a51e8ccde094013cf52e13b1e5056374b7ca4d2b70101cb2a9638aefcb2fc","observation_id":"27ae4f57-2a23-47dc-8686-27c9984cb373","resolution":{"observed_at":"2026-08-14T14:32:12.506675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.491874Z","title":"Justin and G","venue":null,"work_id":"e8a5b393-1c13-4c4a-afa6-5e64aee8fed0","year":2001},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.212021Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:fd4285377b4c14413dba4308d6cf6a1fde1f664913f597471046c3c5764cdb10","observation_id":"19b256d0-32cc-4cf8-b137-9bfebd85ceb8","resolution":{"observed_at":"2026-08-14T14:32:12.495518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.480690Z","title":"Karhum¨ aki and J","venue":null,"work_id":"de06179f-bd45-4822-9c12-dd04989079d5","year":2004},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.214958Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:54b0c35bd84a8593b8b372b3faca37ad818a1b78637fb2d25e646e938719e768","observation_id":"ec361f56-8c29-4e72-8839-00699d2a5386","resolution":{"observed_at":"2026-08-14T14:32:12.484224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.468440Z","title":"Lothaire, Algebraic Combinatorics on Words, Cambri dge, 2002","venue":null,"work_id":"3a988a06-9fa4-42f7-8e26-cc152587b75b","year":2002},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.218393Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:2abe039d06bd8971eb572951a93b81dd737bf0206f2bb39f721e32a7fddd9cfd","observation_id":"c0d3980c-7445-4421-8115-bad46eefb8aa","resolution":{"observed_at":"2026-08-14T14:32:12.473009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.03748","last_updated":"2018-12-10T11:57:08Z","snapshot_observed_at":"2026-08-14T17:46:04.968426Z","submitted_at":"2018-12-10T11:57:08Z","title":"Derivated sequences of complementary symmetric Rote sequences","version":1},"cited_work":{"arxiv_id":"1812.03748","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.03748","snapshot_observed_at":"2026-08-14T14:32:12.297829Z","title":"Derivated sequences of complementary symmetric Rote sequences","venue":"math.CO","work_id":"5b27d353-da1d-4e58-8fcf-65f9e015d2b0","year":2018},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.221838Z"},"links":{"cited_paper":"/paper/1812.03748","citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:1a6af9115932169775104033eb966cb2a17a468bf581a297380d4df6024b5e80","observation_id":"90dfe1ac-a558-4b4d-b80c-9aaadee494c9","resolution":{"observed_at":"2026-08-14T14:32:12.304179Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.457248Z","title":"Mohammad-Noori and J","venue":null,"work_id":"f501510c-b6f5-4489-a0fc-3ce51bd4b14d","year":2007},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.226075Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:fc5dc446ab9891ca206637d4fe3f98b86d07b78956bc51901ff1793ca64b5647","observation_id":"363afa33-3c1e-48ed-bfb6-c158fdf37862","resolution":{"observed_at":"2026-08-14T14:32:12.460881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.446685Z","title":"Moulin-Ollagnier, Proof of Dejean’s conjecture for alphabets with 5, 6, 7, 8, 9, 10, and 11 letters, Theoret","venue":null,"work_id":"c3ed2016-b0b4-4937-86e1-424a0ecafc33","year":1992},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.229700Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:0a623c13758b728af3a580e33af1da832deed32fa44d76f6bfbb1673be05bb04","observation_id":"3a205085-2605-437f-8f69-6ca5eef9de9a","resolution":{"observed_at":"2026-08-14T14:32:12.450832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.437099Z","title":null,"venue":null,"work_id":"d790a501-9aea-4203-b5e7-47681e5934b2","year":1984},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.232994Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:68bff1884b2a5fa013661e5fb184d746f740c7e506c9a9e779d6f867eaf419e1","observation_id":"ca91032e-83dc-441c-b761-f932c803d3bd","resolution":{"observed_at":"2026-08-14T14:32:12.440377Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.425390Z","title":"Pelantov´ a and ˇStˇ ep´ an Starosta, Languages invariant under more symmetries: Overlapping factors versus palindromic richness, Discrete Math","venue":null,"work_id":"0b91bd3f-9bbe-465b-9ae2-c32772800a6a","year":2013},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.235754Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:c2491bb842466a3d0dac54ea99337c071006f0b544cb5af13adbdd6b47c004d2","observation_id":"327ba394-2aca-4498-a781-3a8826c5283e","resolution":{"observed_at":"2026-08-14T14:32:12.429790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.412802Z","title":"Peltom¨ aki, Characterization of repetitions in Sturmian words: A new proof","venue":null,"work_id":"eaa73b09-4fa3-4cd3-952b-a6f07819e432","year":2015},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.238607Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:0facdaa5e5a9425bf4d90ca9656d43c5577e40d6db9082e209627cd1eca9b8c2","observation_id":"ee3fd182-8255-41c3-a937-d890e297cd19","resolution":{"observed_at":"2026-08-14T14:32:12.417054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.401597Z","title":"Peltom¨ aki, Privileged W ords and Sturmian W ords, PhD thesis, TUCS Dissertations No","venue":null,"work_id":"935e1cfe-df26-41f8-8106-589ecafb2665","year":2016},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.241540Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:54d2d4c8c4019fe0a86f14a7d10e54141396c8ef8d02e09abf87cbf162453343","observation_id":"0f803beb-1c68-4473-989e-983efdb234d7","resolution":{"observed_at":"2026-08-14T14:32:12.405598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.389852Z","title":"Rote, Sequences with subword complexity 2n, J","venue":null,"work_id":"75b78bbc-777b-4ebc-9e6b-5fccab8377fa","year":1994},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.244467Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:717cdc35ea422c23a2e1ccd6dc6cbce6dc046500504bc914d59ad29dcffe3972","observation_id":"2b496108-b880-45a3-bad9-811d9e9c83df","resolution":{"observed_at":"2026-08-14T14:32:12.393829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.378539Z","title":"Rampersad, J","venue":null,"work_id":"fced8044-e1a5-4270-8c3f-9f304f236506","year":2019},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.247381Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:fbf1ad46084b5b1cc8e8453a673bbb257a1a97f5cb78279283ffd5097f96632b","observation_id":"b903b6fc-366c-4a67-8221-004a14c27ad9","resolution":{"observed_at":"2026-08-14T14:32:12.382350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.366815Z","title":"Rao, Last cases of Dejean’s conjecture, Theoret","venue":null,"work_id":"6984e622-1457-49b2-a49f-05ce9309e9fb","year":2011},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.250398Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:2cafb785c8c99ab68f4481fa600c263c159c21e63070a0256a2689e155e9347e","observation_id":"950bd30f-32b7-4a97-a901-a9c1e52e6b92","resolution":{"observed_at":"2026-08-14T14:32:12.370653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.355703Z","title":"Restivo and G","venue":null,"work_id":"ab4bb6eb-c4e7-47a6-a09e-0410aad69107","year":2009},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.253214Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:2795b7898e3059a9ffba6626b9197a13c0e8d462633c7c8cf90b60b52dc311a4","observation_id":"0560aab7-f279-4611-9e86-80acc8583c59","resolution":{"observed_at":"2026-08-14T14:32:12.359416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.345652Z","title":"Restivo and S","venue":null,"work_id":"01317f12-1331-4fa9-9cd0-a726ab5f41a5","year":1983},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.256720Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:64a6fffd5954847867eb28326eb245cf8662f51c1c8f51886013fda5d69a4dc9","observation_id":"9f7e1a4b-b08b-4bbe-95bb-47ac2ca23e11","resolution":{"observed_at":"2026-08-14T14:32:12.348858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.334529Z","title":"Restivo and S","venue":null,"work_id":"8dd7ac73-0170-4063-a508-c9ece71153c1","year":1985},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.260200Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:4431825a00c55542fb6cf305008cd6c2970244f4dffc2c9ba81c14e08ffd1c3b","observation_id":"5d1b5ee1-3c40-473a-8344-23accb871c97","resolution":{"observed_at":"2026-08-14T14:32:12.338073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.323388Z","title":"V esti, Extensions of rich words, Theoret","venue":null,"work_id":"1d8e186d-bf5c-4491-8f27-a71537082a43","year":2014},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.264379Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:5249add9494c2d643fd12e72ffaa686c8cf8629a72028a9e1f270fbe5fafce4c","observation_id":"557bca8c-7e15-484b-86b4-120682822ab8","resolution":{"observed_at":"2026-08-14T14:32:12.327173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:32:12.312268Z","title":"V esti, Rich square-free words, Theoret","venue":null,"work_id":"7b040691-4f17-498f-85e3-0e59a1806d4d","year":2017},"citing_paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:32:12.267924Z"},"links":{"citing_paper":"/paper/1908.03169"},"observation_digest":"sha256:e92f387a44c32864dec5b6b13279b00da00f984028820b49f1138836677a37a6","observation_id":"0314065e-4707-4f66-932a-7491d2c96d13","resolution":{"observed_at":"2026-08-14T14:32:12.316100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03169","last_updated":"2020-02-06T20:38:44Z","latest_version":4,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T06:07:06.918863Z","submitted_at":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":34},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:1908.03169."}