{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z6RKAFHPOQIVQPYH66NJQMUZ5N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"336b358d36e9b66fc1fdaf6aa7e4f7982b80a0d417ec06ae14dbe01af97745b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-12T21:48:16Z","title_canon_sha256":"53ecd55dd303acf8b20c3b62cc1b97f87bb664f71ba8e42772d59efdd4c929e2"},"schema_version":"1.0","source":{"id":"1310.3429","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.3429","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1310.3429v3","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3429","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z6RKAFHPOQIV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z6RKAFHPOQIVQPYH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z6RKAFHP","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:006fb114091f42e92753ebb4e63429011013f36b7500e541d256c10374601166","target":"graph","created_at":"2026-05-18T02:45:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie presented in 2007 an asymptotic upper bound of 2n - Theta(log n). We show that a string of length n contains at most 5n/3 distinct squares. This new upper bound is obtained by investigating the combinatorial structure of double squares and showing that a string of length n contains at most 2n/3 double squares. In addition, the established structural pr","authors_text":"Adrien Thierry, Antoine Deza, Frantisek Franek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-12T21:48:16Z","title":"How many double squares can a string contain?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3429","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:34736eeff15b808f7fa574672d4db7670120c1e883d91665c55776d09482df4a","target":"record","created_at":"2026-05-18T02:45:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"336b358d36e9b66fc1fdaf6aa7e4f7982b80a0d417ec06ae14dbe01af97745b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-12T21:48:16Z","title_canon_sha256":"53ecd55dd303acf8b20c3b62cc1b97f87bb664f71ba8e42772d59efdd4c929e2"},"schema_version":"1.0","source":{"id":"1310.3429","kind":"arxiv","version":3}},"canonical_sha256":"cfa2a014ef7411583f07f79a983299eb51c97609d0b0abd1fc4a3539f07fc115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfa2a014ef7411583f07f79a983299eb51c97609d0b0abd1fc4a3539f07fc115","first_computed_at":"2026-05-18T02:45:58.250388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:58.250388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XsatzZnaCaB7/S/H67TEkCUvfWR1AHRkl2xj9axIBhFh546Omk1MbsBE1gKnJGChZhsToXwFVOIqn2SwyAp/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:58.250836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.3429","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34736eeff15b808f7fa574672d4db7670120c1e883d91665c55776d09482df4a","sha256:006fb114091f42e92753ebb4e63429011013f36b7500e541d256c10374601166"],"state_sha256":"d629d890186d856031e1c34345dac986e2b29e5cda2b847b472cf564f8a4e99c"}