{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TILMAWWNJCBVDHRIDHKZHDMSVM","short_pith_number":"pith:TILMAWWN","schema_version":"1.0","canonical_sha256":"9a16c05acd4883519e2819d5938d92ab2a9366be3be3b9e2ecf24af33dec4077","source":{"kind":"arxiv","id":"1809.00679","version":2},"attestation_state":"computed","paper":{"title":"Cobham's Theorem and Automaticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit, Lucas Mol, Manon Stipulanti, Narad Rampersad","submitted_at":"2018-09-03T18:09:37Z","abstract_excerpt":"We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are multiplicatively independent. We also show that an automatic sequence cannot have arbitrarily large factors in common with a Sturmian sequence."},"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":"1809.00679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-09-03T18:09:37Z","cross_cats_sorted":["math.CO","math.NT"],"title_canon_sha256":"1e5f02cf53cb2a960e582eb2c3a3e8ef122cc669b79c688252b8dc3e65c6f2bf","abstract_canon_sha256":"b8f3fa3ceaabe6ec300ae7e5d76dc047c008c3d4ac544b69fe71b93b635a976f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:18.993257Z","signature_b64":"/QNYV1WjEhz/khFiwxUZZDKaMOu9dLWcfu7FWSjNIArVzEHvJ+EwslTg1J2kP7EdesvZo00XwT5l9TAvOrr8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a16c05acd4883519e2819d5938d92ab2a9366be3be3b9e2ecf24af33dec4077","last_reissued_at":"2026-05-17T23:58:18.992650Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:18.992650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cobham's Theorem and Automaticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit, Lucas Mol, Manon Stipulanti, Narad Rampersad","submitted_at":"2018-09-03T18:09:37Z","abstract_excerpt":"We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are multiplicatively independent. We also show that an automatic sequence cannot have arbitrarily large factors in common with a Sturmian sequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00679","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":""},"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":"1809.00679","created_at":"2026-05-17T23:58:18.992736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00679v2","created_at":"2026-05-17T23:58:18.992736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00679","created_at":"2026-05-17T23:58:18.992736+00:00"},{"alias_kind":"pith_short_12","alias_value":"TILMAWWNJCBV","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TILMAWWNJCBVDHRI","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TILMAWWN","created_at":"2026-05-18T12:32:53.628368+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/TILMAWWNJCBVDHRIDHKZHDMSVM","json":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM.json","graph_json":"https://pith.science/api/pith-number/TILMAWWNJCBVDHRIDHKZHDMSVM/graph.json","events_json":"https://pith.science/api/pith-number/TILMAWWNJCBVDHRIDHKZHDMSVM/events.json","paper":"https://pith.science/paper/TILMAWWN"},"agent_actions":{"view_html":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM","download_json":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM.json","view_paper":"https://pith.science/paper/TILMAWWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00679&json=true","fetch_graph":"https://pith.science/api/pith-number/TILMAWWNJCBVDHRIDHKZHDMSVM/graph.json","fetch_events":"https://pith.science/api/pith-number/TILMAWWNJCBVDHRIDHKZHDMSVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM/action/storage_attestation","attest_author":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM/action/author_attestation","sign_citation":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM/action/citation_signature","submit_replication":"https://pith.science/pith/TILMAWWNJCBVDHRIDHKZHDMSVM/action/replication_record"}},"created_at":"2026-05-17T23:58:18.992736+00:00","updated_at":"2026-05-17T23:58:18.992736+00:00"}