{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2YYJHJGRAT34BPZSG3X6UNOROB","short_pith_number":"pith:2YYJHJGR","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"},"canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","source":{"kind":"arxiv","id":"1708.06462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06462","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06462v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06462","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"2YYJHJGRAT34","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YYJHJGRAT34BPZS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YYJHJGR","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2YYJHJGRAT34BPZSG3X6UNOROB","target":"record","payload":{"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"},"canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","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"},"source_kind":"arxiv","source_id":"1708.06462","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/b80uqrF7jKrmdBGwP9UoUNBRIQBH9Pk5KXJ/LNeE+4kTpvM1X2b1lGEzKgpV9C6OH7wAiULqjH6hgEvQ3EiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:32:45.636038Z"},"content_sha256":"e35fb53c0dc80d4bec1e3080380bb090006338dfc0baf05eb5c478eeb13032e6","schema_version":"1.0","event_id":"sha256:e35fb53c0dc80d4bec1e3080380bb090006338dfc0baf05eb5c478eeb13032e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2YYJHJGRAT34BPZSG3X6UNOROB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XkBGTSWzVrzlwu4dKsZawf6Mmomo7U1QHz+Mwoy5WUFoxaXjR+v4dPWvtBA4nxGplxhjI71T7ejQfBDfy81Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:32:45.636619Z"},"content_sha256":"a1e5ee0bea74bc77f8be0a144a8a20341fbf87b110ae2fb38dbf8eee4eadcaf8","schema_version":"1.0","event_id":"sha256:a1e5ee0bea74bc77f8be0a144a8a20341fbf87b110ae2fb38dbf8eee4eadcaf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/bundle.json","state_url":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YYJHJGRAT34BPZSG3X6UNOROB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T08:32:45Z","links":{"resolver":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB","bundle":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/bundle.json","state":"https://pith.science/pith/2YYJHJGRAT34BPZSG3X6UNOROB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YYJHJGRAT34BPZSG3X6UNOROB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2YYJHJGRAT34BPZSG3X6UNOROB","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":"6ee4338e202076079daeb4fec14c7a51819706dec3e74e13e03c29002407e2e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:55Z","title_canon_sha256":"92c9a6522e97f25272d00a77f4618c98effac5a348ce2654c0a4c9f2efa6a229"},"schema_version":"1.0","source":{"id":"1708.06462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06462","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06462v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06462","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"2YYJHJGRAT34","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YYJHJGRAT34BPZS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YYJHJGR","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:a1e5ee0bea74bc77f8be0a144a8a20341fbf87b110ae2fb38dbf8eee4eadcaf8","target":"graph","created_at":"2026-05-18T00:37:41Z","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":"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","authors_text":"F. Blanchet-Sadri (Department of Computer Science, S. Osborne (Department of Computer Science, University of North Carolina)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:55Z","title":"Constructing Words with High Distinct Square Densities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06462","kind":"arxiv","version":1},"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:e35fb53c0dc80d4bec1e3080380bb090006338dfc0baf05eb5c478eeb13032e6","target":"record","created_at":"2026-05-18T00:37:41Z","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":"6ee4338e202076079daeb4fec14c7a51819706dec3e74e13e03c29002407e2e5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:48:55Z","title_canon_sha256":"92c9a6522e97f25272d00a77f4618c98effac5a348ce2654c0a4c9f2efa6a229"},"schema_version":"1.0","source":{"id":"1708.06462","kind":"arxiv","version":1}},"canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d63093a4d104f7c0bf3236efea35d17066776ebd8576ec2f3360a313a34b4af8","first_computed_at":"2026-05-18T00:37:41.434017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.434017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZWMQNhjHf0NIuputDs1sTX6mxG4RGAVDtpBPmFskogbsGDZzYEhOcvv98+k45PLFJJd5eoWMoU34RSD34WbjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.434690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e35fb53c0dc80d4bec1e3080380bb090006338dfc0baf05eb5c478eeb13032e6","sha256:a1e5ee0bea74bc77f8be0a144a8a20341fbf87b110ae2fb38dbf8eee4eadcaf8"],"state_sha256":"356e5fae0a7979c9d6a526440be1c3490063e1a7ad09b905eb6c9e657a10c746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IU15N7ikzC3Zp/7H+s26o3DFpaO/FKK68WeqhhZwWlDZoY30OAe5HnW7TbhRooeSSpmwHWBNY1y+s2jPBpYiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:32:45.639299Z","bundle_sha256":"155713b20712c7e39dc390d4c8b1f840f50752c5b4e96ff9e8b041b09e3e98c8"}}