{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PWOGNSXU7K6XMDV3XLBLBLKCM6","short_pith_number":"pith:PWOGNSXU","schema_version":"1.0","canonical_sha256":"7d9c66caf4fabd760ebbbac2b0ad42679c1000dfdf8eb2960f865561ba9add47","source":{"kind":"arxiv","id":"1111.1999","version":3},"attestation_state":"computed","paper":{"title":"On uniform recurrence of HD0l systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Ivan Mitrofanov","submitted_at":"2011-11-08T18:07:42Z","abstract_excerpt":"We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov."},"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":"1111.1999","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-08T18:07:42Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"f5f3b08c0d2ad3dcfea6439f1d07f7d8b66aadc52dbfa8338dd9951a1c7e4069","abstract_canon_sha256":"35ca2bb521c8b27234e7762a5867fc1f85f93053167867634aa798f9ad972301"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:48.639038Z","signature_b64":"8jEMEfO5EJ03ioZabwbrcBciQ/GwHtriwZHoveU8OR1NV+QP84g4OFNE1ABRoAV6+r7h1cLFBxhlIUljXGyXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d9c66caf4fabd760ebbbac2b0ad42679c1000dfdf8eb2960f865561ba9add47","last_reissued_at":"2026-05-18T03:50:48.638443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:48.638443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On uniform recurrence of HD0l systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Ivan Mitrofanov","submitted_at":"2011-11-08T18:07:42Z","abstract_excerpt":"We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1999","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":"1111.1999","created_at":"2026-05-18T03:50:48.638559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1999v3","created_at":"2026-05-18T03:50:48.638559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1999","created_at":"2026-05-18T03:50:48.638559+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWOGNSXU7K6X","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWOGNSXU7K6XMDV3","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWOGNSXU","created_at":"2026-05-18T12:26:39.201973+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/PWOGNSXU7K6XMDV3XLBLBLKCM6","json":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6.json","graph_json":"https://pith.science/api/pith-number/PWOGNSXU7K6XMDV3XLBLBLKCM6/graph.json","events_json":"https://pith.science/api/pith-number/PWOGNSXU7K6XMDV3XLBLBLKCM6/events.json","paper":"https://pith.science/paper/PWOGNSXU"},"agent_actions":{"view_html":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6","download_json":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6.json","view_paper":"https://pith.science/paper/PWOGNSXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1999&json=true","fetch_graph":"https://pith.science/api/pith-number/PWOGNSXU7K6XMDV3XLBLBLKCM6/graph.json","fetch_events":"https://pith.science/api/pith-number/PWOGNSXU7K6XMDV3XLBLBLKCM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6/action/storage_attestation","attest_author":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6/action/author_attestation","sign_citation":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6/action/citation_signature","submit_replication":"https://pith.science/pith/PWOGNSXU7K6XMDV3XLBLBLKCM6/action/replication_record"}},"created_at":"2026-05-18T03:50:48.638559+00:00","updated_at":"2026-05-18T03:50:48.638559+00:00"}