{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2YYJHJGRAT34BPZSG3X6UNOROB","short_pith_number":"pith:2YYJHJGR","schema_version":"1.0","canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","source":{"kind":"arxiv","id":"1708.06462","version":1},"attestation_state":"computed","paper":{"title":"Constructing Words with High Distinct Square Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"F. Blanchet-Sadri (Department of Computer Science, S. Osborne (Department of Computer Science, University of North Carolina)","submitted_at":"2017-08-22T00:48:55Z","abstract_excerpt":"Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position. Improvements by Ilie to $2n-\\Theta(\\log n)$ and by Deza et al. to 11n/6 rely on the study of combinatorics of FS-double-squares, when the maximum number of two last occurrences of squares begin. In this paper, we first study how to maximize runs of FS-double-squares in the prefix of a word. We show that for a given positive integer m, the minimum length of a word beginning with m F"},"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":"1708.06462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"92c9a6522e97f25272d00a77f4618c98effac5a348ce2654c0a4c9f2efa6a229","abstract_canon_sha256":"6ee4338e202076079daeb4fec14c7a51819706dec3e74e13e03c29002407e2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.434690Z","signature_b64":"ZWMQNhjHf0NIuputDs1sTX6mxG4RGAVDtpBPmFskogbsGDZzYEhOcvv98+k45PLFJJd5eoWMoU34RSD34WbjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","last_reissued_at":"2026-05-18T00:37:41.434017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.434017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Words with High Distinct Square Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"F. Blanchet-Sadri (Department of Computer Science, S. Osborne (Department of Computer Science, University of North Carolina)","submitted_at":"2017-08-22T00:48:55Z","abstract_excerpt":"Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position. Improvements by Ilie to $2n-\\Theta(\\log n)$ and by Deza et al. to 11n/6 rely on the study of combinatorics of FS-double-squares, when the maximum number of two last occurrences of squares begin. In this paper, we first study how to maximize runs of FS-double-squares in the prefix of a word. We show that for a given positive integer m, the minimum length of a word beginning with m F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06462","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":"1708.06462","created_at":"2026-05-18T00:37:41.434100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06462v1","created_at":"2026-05-18T00:37:41.434100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06462","created_at":"2026-05-18T00:37:41.434100+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YYJHJGRAT34","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YYJHJGRAT34BPZS","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YYJHJGR","created_at":"2026-05-18T12:30:55.937587+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/2YYJHJGRAT34BPZSG3X6UNOROB","json":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB.json","graph_json":"https://pith.science/api/pith-number/2YYJHJGRAT34BPZSG3X6UNOROB/graph.json","events_json":"https://pith.science/api/pith-number/2YYJHJGRAT34BPZSG3X6UNOROB/events.json","paper":"https://pith.science/paper/2YYJHJGR"},"agent_actions":{"view_html":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB","download_json":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB.json","view_paper":"https://pith.science/paper/2YYJHJGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06462&json=true","fetch_graph":"https://pith.science/api/pith-number/2YYJHJGRAT34BPZSG3X6UNOROB/graph.json","fetch_events":"https://pith.science/api/pith-number/2YYJHJGRAT34BPZSG3X6UNOROB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/action/storage_attestation","attest_author":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/action/author_attestation","sign_citation":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/action/citation_signature","submit_replication":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/action/replication_record"}},"created_at":"2026-05-18T00:37:41.434100+00:00","updated_at":"2026-05-18T00:37:41.434100+00:00"}