{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y62ROYPFZF3P7UHPY4AMCPU5OT","short_pith_number":"pith:Y62ROYPF","schema_version":"1.0","canonical_sha256":"c7b51761e5c976ffd0efc700c13e9d74da3fe15c4bc2a4ac3a9566993390f099","source":{"kind":"arxiv","id":"1406.0670","version":4},"attestation_state":"computed","paper":{"title":"Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Chen Fei Du, Hamoon Mousavi, Jeffrey Shallit, Luke Schaeffer","submitted_at":"2014-06-03T11:10:34Z","abstract_excerpt":"We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) \"Fibonacci-automatic\". This class includes, for example, the famous Fibonacci word f = 01001010..., the fixed point of the morphism 0 -> 01 and 1 -> 0. We then recover many results about the Fibonacci word from the literature (and improve some of them), such as assertions about the occurrences in f of squares, cubes, palindromes, and so forth. As an application of our method we prove a new result: there exists an aperiodic infinite binary word avoiding the "},"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":"1406.0670","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-03T11:10:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"cf89e25e0af08a3c427bb684ceae91e70ecc9a34a0bc0851bc966fe798faf51a","abstract_canon_sha256":"c32529b3891d035e724ed25aab9a82b9e81a943ac44f80e6a7f93e249c02d40e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:24.191907Z","signature_b64":"1ZWSv7h/JXIKB9HHVhwrGXDIPcNLBgwAfMwcs2pwkstQLmsyJHeBIddJE+zeu2qhKyGQb2OtSS3xaDNufpIoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7b51761e5c976ffd0efc700c13e9d74da3fe15c4bc2a4ac3a9566993390f099","last_reissued_at":"2026-05-18T02:46:24.191499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:24.191499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Chen Fei Du, Hamoon Mousavi, Jeffrey Shallit, Luke Schaeffer","submitted_at":"2014-06-03T11:10:34Z","abstract_excerpt":"We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) \"Fibonacci-automatic\". This class includes, for example, the famous Fibonacci word f = 01001010..., the fixed point of the morphism 0 -> 01 and 1 -> 0. We then recover many results about the Fibonacci word from the literature (and improve some of them), such as assertions about the occurrences in f of squares, cubes, palindromes, and so forth. As an application of our method we prove a new result: there exists an aperiodic infinite binary word avoiding the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0670","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1406.0670","created_at":"2026-05-18T02:46:24.191556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0670v4","created_at":"2026-05-18T02:46:24.191556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0670","created_at":"2026-05-18T02:46:24.191556+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y62ROYPFZF3P","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y62ROYPFZF3P7UHP","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y62ROYPF","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT","json":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT.json","graph_json":"https://pith.science/api/pith-number/Y62ROYPFZF3P7UHPY4AMCPU5OT/graph.json","events_json":"https://pith.science/api/pith-number/Y62ROYPFZF3P7UHPY4AMCPU5OT/events.json","paper":"https://pith.science/paper/Y62ROYPF"},"agent_actions":{"view_html":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT","download_json":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT.json","view_paper":"https://pith.science/paper/Y62ROYPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0670&json=true","fetch_graph":"https://pith.science/api/pith-number/Y62ROYPFZF3P7UHPY4AMCPU5OT/graph.json","fetch_events":"https://pith.science/api/pith-number/Y62ROYPFZF3P7UHPY4AMCPU5OT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT/action/storage_attestation","attest_author":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT/action/author_attestation","sign_citation":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT/action/citation_signature","submit_replication":"https://pith.science/pith/Y62ROYPFZF3P7UHPY4AMCPU5OT/action/replication_record"}},"created_at":"2026-05-18T02:46:24.191556+00:00","updated_at":"2026-05-18T02:46:24.191556+00:00"}