{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AEDYLANQNVLOASKDDWKHZEUOV2","short_pith_number":"pith:AEDYLANQ","schema_version":"1.0","canonical_sha256":"01078581b06d56e049431d947c928eaea01b0c91746c62f800281835b64a6668","source":{"kind":"arxiv","id":"1802.00325","version":1},"attestation_state":"computed","paper":{"title":"Common factors in automatic and Sturmian sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Jeffrey Shallit, Narad Rampersad","submitted_at":"2018-02-01T15:05:19Z","abstract_excerpt":"In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common."},"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":"1802.00325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-01T15:05:19Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"d26cd18f51ca4777ad70401c9d3906997070a1faa04e3aa52c455e0d84ba67da","abstract_canon_sha256":"f64bac39480dbf907af04c43fea9b07d4019b09e25ee56980148d19984f4bf66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.258737Z","signature_b64":"EWbtw3Ypb9+BCRxefEab+4KADwO7FiRWSsht/HKrvABwHyedaIdmge5Hrfk95/m+W9EzNN+rxVh1ZjmMZ7xHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01078581b06d56e049431d947c928eaea01b0c91746c62f800281835b64a6668","last_reissued_at":"2026-05-18T00:24:36.258299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.258299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Common factors in automatic and Sturmian sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Jeffrey Shallit, Narad Rampersad","submitted_at":"2018-02-01T15:05:19Z","abstract_excerpt":"In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00325","kind":"arxiv","version":1},"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":"1802.00325","created_at":"2026-05-18T00:24:36.258372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00325v1","created_at":"2026-05-18T00:24:36.258372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00325","created_at":"2026-05-18T00:24:36.258372+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEDYLANQNVLO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEDYLANQNVLOASKD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEDYLANQ","created_at":"2026-05-18T12:32:13.499390+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/AEDYLANQNVLOASKDDWKHZEUOV2","json":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2.json","graph_json":"https://pith.science/api/pith-number/AEDYLANQNVLOASKDDWKHZEUOV2/graph.json","events_json":"https://pith.science/api/pith-number/AEDYLANQNVLOASKDDWKHZEUOV2/events.json","paper":"https://pith.science/paper/AEDYLANQ"},"agent_actions":{"view_html":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2","download_json":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2.json","view_paper":"https://pith.science/paper/AEDYLANQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00325&json=true","fetch_graph":"https://pith.science/api/pith-number/AEDYLANQNVLOASKDDWKHZEUOV2/graph.json","fetch_events":"https://pith.science/api/pith-number/AEDYLANQNVLOASKDDWKHZEUOV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2/action/storage_attestation","attest_author":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2/action/author_attestation","sign_citation":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2/action/citation_signature","submit_replication":"https://pith.science/pith/AEDYLANQNVLOASKDDWKHZEUOV2/action/replication_record"}},"created_at":"2026-05-18T00:24:36.258372+00:00","updated_at":"2026-05-18T00:24:36.258372+00:00"}