{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MRE7T4K73ZZQ7YUUJTM67WKIJM","short_pith_number":"pith:MRE7T4K7","schema_version":"1.0","canonical_sha256":"6449f9f15fde730fe2944cd9efd9484b07800792fdee00e70f5d4d71bc8d024a","source":{"kind":"arxiv","id":"2302.04640","version":2},"attestation_state":"computed","paper":{"title":"Prefixes of the Fibonacci word","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit","submitted_at":"2023-02-09T13:52:47Z","abstract_excerpt":"Mignosi, Restivo, and Salemi (1998) proved that for all $\\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\\geq N$ contain a suffix of exponent $\\alpha^2-\\epsilon$, where $\\alpha = (1+\\sqrt{5})/2$ is the golden ratio. In this note we show how to prove an explicit version of this theorem with tools from automata theory and logic. Along the way we gain a better understanding of the repetitive structure of the Fibonacci word."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.04640","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2023-02-09T13:52:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a1e2d6be7c1c98bdbb6956e8caf334cabc6bda4f0c51f924c01a2aa88a92ce09","abstract_canon_sha256":"73a5f99567c763e32c5e27158423be9f6683431c3708d00f943f60ba24ee223e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:34.873139Z","signature_b64":"pgG/Y/iTN1K5eZBC2x/wnYFNSWq0TIl+WqYjTs7SxCJ2AE4i8Li1mqDJ6+Q21kdX9wf8PXlGss341F1vN56ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6449f9f15fde730fe2944cd9efd9484b07800792fdee00e70f5d4d71bc8d024a","last_reissued_at":"2026-07-05T05:40:34.872676Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:34.872676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prefixes of the Fibonacci word","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit","submitted_at":"2023-02-09T13:52:47Z","abstract_excerpt":"Mignosi, Restivo, and Salemi (1998) proved that for all $\\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\\geq N$ contain a suffix of exponent $\\alpha^2-\\epsilon$, where $\\alpha = (1+\\sqrt{5})/2$ is the golden ratio. In this note we show how to prove an explicit version of this theorem with tools from automata theory and logic. Along the way we gain a better understanding of the repetitive structure of the Fibonacci word."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04640","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.04640/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.04640","created_at":"2026-07-05T05:40:34.872734+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.04640v2","created_at":"2026-07-05T05:40:34.872734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04640","created_at":"2026-07-05T05:40:34.872734+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRE7T4K73ZZQ","created_at":"2026-07-05T05:40:34.872734+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRE7T4K73ZZQ7YUU","created_at":"2026-07-05T05:40:34.872734+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRE7T4K7","created_at":"2026-07-05T05:40:34.872734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19887","citing_title":"Bangla-Bayanno: A 52K-Pair Bengali Visual Question Answering Dataset with LLM-Assisted Translation Refinement","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM","json":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM.json","graph_json":"https://pith.science/api/pith-number/MRE7T4K73ZZQ7YUUJTM67WKIJM/graph.json","events_json":"https://pith.science/api/pith-number/MRE7T4K73ZZQ7YUUJTM67WKIJM/events.json","paper":"https://pith.science/paper/MRE7T4K7"},"agent_actions":{"view_html":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM","download_json":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM.json","view_paper":"https://pith.science/paper/MRE7T4K7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.04640&json=true","fetch_graph":"https://pith.science/api/pith-number/MRE7T4K73ZZQ7YUUJTM67WKIJM/graph.json","fetch_events":"https://pith.science/api/pith-number/MRE7T4K73ZZQ7YUUJTM67WKIJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM/action/storage_attestation","attest_author":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM/action/author_attestation","sign_citation":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM/action/citation_signature","submit_replication":"https://pith.science/pith/MRE7T4K73ZZQ7YUUJTM67WKIJM/action/replication_record"}},"created_at":"2026-07-05T05:40:34.872734+00:00","updated_at":"2026-07-05T05:40:34.872734+00:00"}