{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4TJYRL42VG66HIXYLI7ZTJU6IK","short_pith_number":"pith:4TJYRL42","schema_version":"1.0","canonical_sha256":"e4d388af9aa9bde3a2f85a3f99a69e428ede76fbb3fe354e3f1ef6109b7f59e9","source":{"kind":"arxiv","id":"1904.09157","version":1},"attestation_state":"computed","paper":{"title":"New results on pseudosquare avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit, Narad Rampersad, Pascal Ochem, Tim Ng","submitted_at":"2019-04-19T11:53:45Z","abstract_excerpt":"We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \\overline{x}$), and we completely classify which possibilities can occur. We consider avoiding $x p(x)$, where $p$ is any permutation of the underlying alphabet, and $x t(x)$, where $t$ is any transformation of the underlying alphabet. Finally, we prove the existence of an infinite binary word simultaneously avoiding all occurrences of $x h(x)$ for every nonerasing morphism $h$ and all sufficiently large words $x$."},"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":"1904.09157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-19T11:53:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"2019fe665654dbae9f2463a57c1c30a7913351d5d36faf2d7991cfbf295e7f52","abstract_canon_sha256":"e3e5fe925dc1b28b2986d227b5192f5c0e3d29b622bcdb6e700aea32b2632dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:08.170156Z","signature_b64":"iHintGNGizTooApNDKcYK0De7UJHBNc4ZlvhzH0A/Hvatr70PBeXtjzYRy2K359xps59e+6cKay367702trzBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d388af9aa9bde3a2f85a3f99a69e428ede76fbb3fe354e3f1ef6109b7f59e9","last_reissued_at":"2026-05-17T23:48:08.169602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:08.169602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New results on pseudosquare avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit, Narad Rampersad, Pascal Ochem, Tim Ng","submitted_at":"2019-04-19T11:53:45Z","abstract_excerpt":"We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \\overline{x}$), and we completely classify which possibilities can occur. We consider avoiding $x p(x)$, where $p$ is any permutation of the underlying alphabet, and $x t(x)$, where $t$ is any transformation of the underlying alphabet. Finally, we prove the existence of an infinite binary word simultaneously avoiding all occurrences of $x h(x)$ for every nonerasing morphism $h$ and all sufficiently large words $x$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09157","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":"1904.09157","created_at":"2026-05-17T23:48:08.169678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09157v1","created_at":"2026-05-17T23:48:08.169678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09157","created_at":"2026-05-17T23:48:08.169678+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TJYRL42VG66","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TJYRL42VG66HIXY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TJYRL42","created_at":"2026-05-18T12:33:10.108867+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/4TJYRL42VG66HIXYLI7ZTJU6IK","json":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK.json","graph_json":"https://pith.science/api/pith-number/4TJYRL42VG66HIXYLI7ZTJU6IK/graph.json","events_json":"https://pith.science/api/pith-number/4TJYRL42VG66HIXYLI7ZTJU6IK/events.json","paper":"https://pith.science/paper/4TJYRL42"},"agent_actions":{"view_html":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK","download_json":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK.json","view_paper":"https://pith.science/paper/4TJYRL42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09157&json=true","fetch_graph":"https://pith.science/api/pith-number/4TJYRL42VG66HIXYLI7ZTJU6IK/graph.json","fetch_events":"https://pith.science/api/pith-number/4TJYRL42VG66HIXYLI7ZTJU6IK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK/action/storage_attestation","attest_author":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK/action/author_attestation","sign_citation":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK/action/citation_signature","submit_replication":"https://pith.science/pith/4TJYRL42VG66HIXYLI7ZTJU6IK/action/replication_record"}},"created_at":"2026-05-17T23:48:08.169678+00:00","updated_at":"2026-05-17T23:48:08.169678+00:00"}