{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2NSIJB3TYDHXXHWW3RWXDX5ZB3","short_pith_number":"pith:2NSIJB3T","schema_version":"1.0","canonical_sha256":"d364848773c0cf7b9ed6dc6d71dfb90ec186a937520b778fed67c3608cd01cbb","source":{"kind":"arxiv","id":"1102.3932","version":3},"attestation_state":"computed","paper":{"title":"Fife's Theorem Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit","submitted_at":"2011-02-18T23:03:45Z","abstract_excerpt":"We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic."},"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":"1102.3932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-02-18T23:03:45Z","cross_cats_sorted":[],"title_canon_sha256":"b9f73a243777daf500a982c59cffe5c7e832132e07c78f04f7375b5c67b5ca99","abstract_canon_sha256":"1c27a2ad859b520d35db2cfacb76daae76aad807f65a43df3f821dfecf487b0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:43.554005Z","signature_b64":"NrcMDnSLssevSFWS1KZfyMtWINGfUcG/j0QucT/pULvZ+Gx4P4JJUD/JHyFFI26PgD75W6c9dobfsSFUL2WZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d364848773c0cf7b9ed6dc6d71dfb90ec186a937520b778fed67c3608cd01cbb","last_reissued_at":"2026-05-18T04:16:43.553367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:43.553367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fife's Theorem Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit","submitted_at":"2011-02-18T23:03:45Z","abstract_excerpt":"We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3932","kind":"arxiv","version":3},"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":"1102.3932","created_at":"2026-05-18T04:16:43.553463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3932v3","created_at":"2026-05-18T04:16:43.553463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3932","created_at":"2026-05-18T04:16:43.553463+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NSIJB3TYDHX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NSIJB3TYDHXXHWW","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NSIJB3T","created_at":"2026-05-18T12:26:18.847500+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/2NSIJB3TYDHXXHWW3RWXDX5ZB3","json":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3.json","graph_json":"https://pith.science/api/pith-number/2NSIJB3TYDHXXHWW3RWXDX5ZB3/graph.json","events_json":"https://pith.science/api/pith-number/2NSIJB3TYDHXXHWW3RWXDX5ZB3/events.json","paper":"https://pith.science/paper/2NSIJB3T"},"agent_actions":{"view_html":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3","download_json":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3.json","view_paper":"https://pith.science/paper/2NSIJB3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3932&json=true","fetch_graph":"https://pith.science/api/pith-number/2NSIJB3TYDHXXHWW3RWXDX5ZB3/graph.json","fetch_events":"https://pith.science/api/pith-number/2NSIJB3TYDHXXHWW3RWXDX5ZB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3/action/storage_attestation","attest_author":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3/action/author_attestation","sign_citation":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3/action/citation_signature","submit_replication":"https://pith.science/pith/2NSIJB3TYDHXXHWW3RWXDX5ZB3/action/replication_record"}},"created_at":"2026-05-18T04:16:43.553463+00:00","updated_at":"2026-05-18T04:16:43.553463+00:00"}