{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WV2EEFKBXFC3H3CJP75TY2LFNF","short_pith_number":"pith:WV2EEFKB","schema_version":"1.0","canonical_sha256":"b574421541b945b3ec497ffb3c69656942108421f452671eceb870bb0a1fd2c3","source":{"kind":"arxiv","id":"1811.08231","version":1},"attestation_state":"computed","paper":{"title":"Avoiding conjugacy classes on the 5-letter alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Golnaz Badkobeh, Pascal Ochem","submitted_at":"2018-11-20T13:06:33Z","abstract_excerpt":"We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [TCS 2018]"},"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":"1811.08231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-20T13:06:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9cb4503f3224adce29efff9a293041b9e58e756169a5cc2b76d1cc884b88e5d0","abstract_canon_sha256":"2776f5c4e014e8d6cbf30ba4e55221a2a8ff4c8c42229435281eef66be24f519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:16.492580Z","signature_b64":"38VMieW7L+CJ29BMGQPIRUpxxjF8QrZ4p5zrtFtVQzAxI3halBKXEXde0dDiSrLfEQv3xeY0yUkm040/rZ5QDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b574421541b945b3ec497ffb3c69656942108421f452671eceb870bb0a1fd2c3","last_reissued_at":"2026-05-18T00:00:16.491981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:16.491981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Avoiding conjugacy classes on the 5-letter alphabet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Golnaz Badkobeh, Pascal Ochem","submitted_at":"2018-11-20T13:06:33Z","abstract_excerpt":"We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [TCS 2018]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08231","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":"1811.08231","created_at":"2026-05-18T00:00:16.492094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08231v1","created_at":"2026-05-18T00:00:16.492094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08231","created_at":"2026-05-18T00:00:16.492094+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV2EEFKBXFC3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV2EEFKBXFC3H3CJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV2EEFKB","created_at":"2026-05-18T12:33:01.666342+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/WV2EEFKBXFC3H3CJP75TY2LFNF","json":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF.json","graph_json":"https://pith.science/api/pith-number/WV2EEFKBXFC3H3CJP75TY2LFNF/graph.json","events_json":"https://pith.science/api/pith-number/WV2EEFKBXFC3H3CJP75TY2LFNF/events.json","paper":"https://pith.science/paper/WV2EEFKB"},"agent_actions":{"view_html":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF","download_json":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF.json","view_paper":"https://pith.science/paper/WV2EEFKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08231&json=true","fetch_graph":"https://pith.science/api/pith-number/WV2EEFKBXFC3H3CJP75TY2LFNF/graph.json","fetch_events":"https://pith.science/api/pith-number/WV2EEFKBXFC3H3CJP75TY2LFNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF/action/storage_attestation","attest_author":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF/action/author_attestation","sign_citation":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF/action/citation_signature","submit_replication":"https://pith.science/pith/WV2EEFKBXFC3H3CJP75TY2LFNF/action/replication_record"}},"created_at":"2026-05-18T00:00:16.492094+00:00","updated_at":"2026-05-18T00:00:16.492094+00:00"}