{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NJ52IJYM3Q2SXCDUAQPU7DJ33H","short_pith_number":"pith:NJ52IJYM","schema_version":"1.0","canonical_sha256":"6a7ba4270cdc352b8874041f4f8d3bd9e4fce6518514d869549ebf04b8b3e050","source":{"kind":"arxiv","id":"2605.29853","version":1},"attestation_state":"computed","paper":{"title":"Pairs of square-free arithmetic progressions in infinite words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Rosenfeld, Pascal Ochem, Thomas Del\\'epine","submitted_at":"2026-05-28T12:35:04Z","abstract_excerpt":"We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q \\geq 3$, the only two pairs with this property known prior to this work were $(3, 11)$ and $(5, 6)$. We prove that there are finitely many pairs $(p, q)$ of relatively prime integers with $p, q \\geq 3$ for which there is no infinite ternary square-free word whose subsequences modulo $p$ and $q$ are square-free. To prove our result, we combine different techn"},"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":"2605.29853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-28T12:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"ba4afc767420228abd03a72a6ea98bbe6eb3d58419b63d13c0b0ca84441a5eb2","abstract_canon_sha256":"864cb5d49622f58874d3b4de5ed9be2ff7523cc0cb4e3ff71fdeaea149a9fa2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:56.123116Z","signature_b64":"zICeA3WUQdTyn+WFqpRaDE/r4sYxLgOaldg61r2Q1llfRCZqK5gYiz0Ce/YBPPlU4bVeOCjj5r6aJbq3af2sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a7ba4270cdc352b8874041f4f8d3bd9e4fce6518514d869549ebf04b8b3e050","last_reissued_at":"2026-05-29T02:05:56.122280Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:56.122280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairs of square-free arithmetic progressions in infinite words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Rosenfeld, Pascal Ochem, Thomas Del\\'epine","submitted_at":"2026-05-28T12:35:04Z","abstract_excerpt":"We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q \\geq 3$, the only two pairs with this property known prior to this work were $(3, 11)$ and $(5, 6)$. We prove that there are finitely many pairs $(p, q)$ of relatively prime integers with $p, q \\geq 3$ for which there is no infinite ternary square-free word whose subsequences modulo $p$ and $q$ are square-free. To prove our result, we combine different techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29853","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.29853","created_at":"2026-05-29T02:05:56.122396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29853v1","created_at":"2026-05-29T02:05:56.122396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29853","created_at":"2026-05-29T02:05:56.122396+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJ52IJYM3Q2S","created_at":"2026-05-29T02:05:56.122396+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJ52IJYM3Q2SXCDU","created_at":"2026-05-29T02:05:56.122396+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJ52IJYM","created_at":"2026-05-29T02:05:56.122396+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/NJ52IJYM3Q2SXCDUAQPU7DJ33H","json":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H.json","graph_json":"https://pith.science/api/pith-number/NJ52IJYM3Q2SXCDUAQPU7DJ33H/graph.json","events_json":"https://pith.science/api/pith-number/NJ52IJYM3Q2SXCDUAQPU7DJ33H/events.json","paper":"https://pith.science/paper/NJ52IJYM"},"agent_actions":{"view_html":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H","download_json":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H.json","view_paper":"https://pith.science/paper/NJ52IJYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29853&json=true","fetch_graph":"https://pith.science/api/pith-number/NJ52IJYM3Q2SXCDUAQPU7DJ33H/graph.json","fetch_events":"https://pith.science/api/pith-number/NJ52IJYM3Q2SXCDUAQPU7DJ33H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H/action/storage_attestation","attest_author":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H/action/author_attestation","sign_citation":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H/action/citation_signature","submit_replication":"https://pith.science/pith/NJ52IJYM3Q2SXCDUAQPU7DJ33H/action/replication_record"}},"created_at":"2026-05-29T02:05:56.122396+00:00","updated_at":"2026-05-29T02:05:56.122396+00:00"}