{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:Q7L3RYONTLL4DY6TXFO44IN4PF","short_pith_number":"pith:Q7L3RYON","schema_version":"1.0","canonical_sha256":"87d7b8e1cd9ad7c1e3d3b95dce21bc7959c4c5c24a74fb1b3c53a59a39a1b951","source":{"kind":"arxiv","id":"cs/0512051","version":1},"attestation_state":"computed","paper":{"title":"Existence of finite test-sets for k-power-freeness of uniform morphisms","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francis Wlazinski (LaRIA), Gw\\'ena\\\"el Richomme (LaRIA)","submitted_at":"2005-12-13T13:51:13Z","abstract_excerpt":"A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k >= 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite test-sets for k-power-freeness."},"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":"cs/0512051","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2005-12-13T13:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"05272be21ae5a6aa571a6253e77a1a6f4d01e2e49e50b82a99089a4dd2786e89","abstract_canon_sha256":"5d9280e980f4ca06b739ca59e30dd98c6c09b5e93bb69ecf1e9ec4fb0f54fe7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.920346Z","signature_b64":"MDaI/Eykbg2ebKxtYLgiS4FGOo7We0XBAlBijaU3306T7wmX9KqFvVWCMPRtISk0GFR/s+pbsKffcGCUxIsrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d7b8e1cd9ad7c1e3d3b95dce21bc7959c4c5c24a74fb1b3c53a59a39a1b951","last_reissued_at":"2026-05-18T01:08:54.919705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.919705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Existence of finite test-sets for k-power-freeness of uniform morphisms","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francis Wlazinski (LaRIA), Gw\\'ena\\\"el Richomme (LaRIA)","submitted_at":"2005-12-13T13:51:13Z","abstract_excerpt":"A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k >= 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite test-sets for k-power-freeness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512051","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":"cs/0512051","created_at":"2026-05-18T01:08:54.919810+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512051v1","created_at":"2026-05-18T01:08:54.919810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512051","created_at":"2026-05-18T01:08:54.919810+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7L3RYONTLL4","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7L3RYONTLL4DY6T","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7L3RYON","created_at":"2026-05-18T12:25:53.335082+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/Q7L3RYONTLL4DY6TXFO44IN4PF","json":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF.json","graph_json":"https://pith.science/api/pith-number/Q7L3RYONTLL4DY6TXFO44IN4PF/graph.json","events_json":"https://pith.science/api/pith-number/Q7L3RYONTLL4DY6TXFO44IN4PF/events.json","paper":"https://pith.science/paper/Q7L3RYON"},"agent_actions":{"view_html":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF","download_json":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF.json","view_paper":"https://pith.science/paper/Q7L3RYON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512051&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7L3RYONTLL4DY6TXFO44IN4PF/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7L3RYONTLL4DY6TXFO44IN4PF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF/action/storage_attestation","attest_author":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF/action/author_attestation","sign_citation":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF/action/citation_signature","submit_replication":"https://pith.science/pith/Q7L3RYONTLL4DY6TXFO44IN4PF/action/replication_record"}},"created_at":"2026-05-18T01:08:54.919810+00:00","updated_at":"2026-05-18T01:08:54.919810+00:00"}