{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2BFJA7MB7CQLT45ACC7XYNCXUY","short_pith_number":"pith:2BFJA7MB","schema_version":"1.0","canonical_sha256":"d04a907d81f8a0b9f3a010bf7c3457a6345cc62336ff151a5b23b2aaa57525d0","source":{"kind":"arxiv","id":"1603.01058","version":1},"attestation_state":"computed","paper":{"title":"Rich square-free words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Jetro Vesti","submitted_at":"2016-03-03T11:22:03Z","abstract_excerpt":"A word w is rich if it has |w|+1 many distinct palindromic factors, including the empty word. A word is square-free if it does not have a factor uu, where u is a non-empty word.\n  Pelantov\\'a and Starosta (Discrete Math. 313 (2013)) proved that every infinite rich word contains a square. We will give another proof for that result. Pelantov\\'a and Starosta denoted by r(n) the length of a longest rich square-free word on an alphabet of size n. The exact value of r(n) was left as an open question. We will give an upper and a lower bound for r(n), and make a conjecture that our lower bound is exac"},"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":"1603.01058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-03T11:22:03Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"fa65750c5b782f10be19088fa6de4bc357082ae0543f45e7cf369600cfc4113a","abstract_canon_sha256":"c18d2609365a464180e9f1a7422f5da197d74239a11bf2d1264c96462ee90a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.777452Z","signature_b64":"VT+DVsysduwoL7ByZ3X/nAldY5nV/4knGtITWuLXIovEnrawz/6Zn26CqKKm1gQVXlHktYECUgGqa+PvkT9jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d04a907d81f8a0b9f3a010bf7c3457a6345cc62336ff151a5b23b2aaa57525d0","last_reissued_at":"2026-05-18T01:19:39.776892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.776892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rich square-free words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Jetro Vesti","submitted_at":"2016-03-03T11:22:03Z","abstract_excerpt":"A word w is rich if it has |w|+1 many distinct palindromic factors, including the empty word. A word is square-free if it does not have a factor uu, where u is a non-empty word.\n  Pelantov\\'a and Starosta (Discrete Math. 313 (2013)) proved that every infinite rich word contains a square. We will give another proof for that result. Pelantov\\'a and Starosta denoted by r(n) the length of a longest rich square-free word on an alphabet of size n. The exact value of r(n) was left as an open question. We will give an upper and a lower bound for r(n), and make a conjecture that our lower bound is exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01058","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":"1603.01058","created_at":"2026-05-18T01:19:39.776978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01058v1","created_at":"2026-05-18T01:19:39.776978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01058","created_at":"2026-05-18T01:19:39.776978+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BFJA7MB7CQL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BFJA7MB7CQLT45A","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BFJA7MB","created_at":"2026-05-18T12:29:52.810259+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/2BFJA7MB7CQLT45ACC7XYNCXUY","json":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY.json","graph_json":"https://pith.science/api/pith-number/2BFJA7MB7CQLT45ACC7XYNCXUY/graph.json","events_json":"https://pith.science/api/pith-number/2BFJA7MB7CQLT45ACC7XYNCXUY/events.json","paper":"https://pith.science/paper/2BFJA7MB"},"agent_actions":{"view_html":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY","download_json":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY.json","view_paper":"https://pith.science/paper/2BFJA7MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01058&json=true","fetch_graph":"https://pith.science/api/pith-number/2BFJA7MB7CQLT45ACC7XYNCXUY/graph.json","fetch_events":"https://pith.science/api/pith-number/2BFJA7MB7CQLT45ACC7XYNCXUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY/action/storage_attestation","attest_author":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY/action/author_attestation","sign_citation":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY/action/citation_signature","submit_replication":"https://pith.science/pith/2BFJA7MB7CQLT45ACC7XYNCXUY/action/replication_record"}},"created_at":"2026-05-18T01:19:39.776978+00:00","updated_at":"2026-05-18T01:19:39.776978+00:00"}