{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ADAJTY6RO4E5DEDSXYOUXEDUB4","short_pith_number":"pith:ADAJTY6R","canonical_record":{"source":{"id":"1207.5723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"e73db3e48f65b5bca7ef3bf3df783dc939f4971483c9fc8ce41c16e34635dbe3","abstract_canon_sha256":"c395004962bb7e89c98e6b03b89f80e119aab5088f30a6fbcc2cc367eba09e0b"},"schema_version":"1.0"},"canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","source":{"kind":"arxiv","id":"1207.5723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5723","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5723v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5723","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"ADAJTY6RO4E5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ADAJTY6RO4E5DEDS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ADAJTY6R","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ADAJTY6RO4E5DEDSXYOUXEDUB4","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"e73db3e48f65b5bca7ef3bf3df783dc939f4971483c9fc8ce41c16e34635dbe3","abstract_canon_sha256":"c395004962bb7e89c98e6b03b89f80e119aab5088f30a6fbcc2cc367eba09e0b"},"schema_version":"1.0"},"canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:11.496418Z","signature_b64":"xh/X4Pefcn7+Dw0F0L9AZf/7CvDWWFzy8eWEfLqpnp66bFAuv+E4IL0890SzjtDbi13V1D7E4ElEJUopb/ZvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","last_reissued_at":"2026-05-18T03:50:11.495588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:11.495588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5723","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-18T03:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIB/V133QlpZDjN4B1lbA4J7dnbo45LgT6a0mZ4Ay7BV+F0R2mS2HOkc5FK+xuAZRsIlJpU2/HS7EBcVRIvTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:36:51.756195Z"},"content_sha256":"1aa9912bf5d98f5e9b454728d469e204c4b7ba72a89ec76847e3e0b9d8167554","schema_version":"1.0","event_id":"sha256:1aa9912bf5d98f5e9b454728d469e204c4b7ba72a89ec76847e3e0b9d8167554"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ADAJTY6RO4E5DEDSXYOUXEDUB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fewest repetitions in infinite binary words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Golnaz Badkobeh, Maxime Crochemore","submitted_at":"2012-07-24T15:20:47Z","abstract_excerpt":"A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period.\n  In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5723","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-18T03:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXBja6AQTMydAmUt4RRP/jO4WA+WdvCQ7OACU710jO52qJocxsI6NcQjEz1uQy4qCDCbZoVDPG8O6FuMsd3oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:36:51.757022Z"},"content_sha256":"67d60d79c4201d485210223789acf9494358f48c013ee67c4393fa8376139a2d","schema_version":"1.0","event_id":"sha256:67d60d79c4201d485210223789acf9494358f48c013ee67c4393fa8376139a2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/bundle.json","state_url":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/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-10T00:36:51Z","links":{"resolver":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4","bundle":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/bundle.json","state":"https://pith.science/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADAJTY6RO4E5DEDSXYOUXEDUB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ADAJTY6RO4E5DEDSXYOUXEDUB4","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":"c395004962bb7e89c98e6b03b89f80e119aab5088f30a6fbcc2cc367eba09e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","title_canon_sha256":"e73db3e48f65b5bca7ef3bf3df783dc939f4971483c9fc8ce41c16e34635dbe3"},"schema_version":"1.0","source":{"id":"1207.5723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5723","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5723v1","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5723","created_at":"2026-05-18T03:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"ADAJTY6RO4E5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ADAJTY6RO4E5DEDS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ADAJTY6R","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:67d60d79c4201d485210223789acf9494358f48c013ee67c4393fa8376139a2d","target":"graph","created_at":"2026-05-18T03:50:11Z","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":"A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period.\n  In this article we give a proof of the fact that there exists an infinite binary word which contains finitely many squares and simultaneously avoids words of exponent larger than 7/3. Our infinite word contains 12 squares, which is the smallest possible number of squares to get the property, and 2 factors of exponent 7/3. These are the only factors of exponent larger than 2. The value 7/3 ","authors_text":"Golnaz Badkobeh, Maxime Crochemore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","title":"Fewest repetitions in infinite binary words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5723","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:1aa9912bf5d98f5e9b454728d469e204c4b7ba72a89ec76847e3e0b9d8167554","target":"record","created_at":"2026-05-18T03:50:11Z","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":"c395004962bb7e89c98e6b03b89f80e119aab5088f30a6fbcc2cc367eba09e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-24T15:20:47Z","title_canon_sha256":"e73db3e48f65b5bca7ef3bf3df783dc939f4971483c9fc8ce41c16e34635dbe3"},"schema_version":"1.0","source":{"id":"1207.5723","kind":"arxiv","version":1}},"canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00c099e3d17709d19072be1d4b90740f13d2d0d4dc0acbc300b34610d677e461","first_computed_at":"2026-05-18T03:50:11.495588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:11.495588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xh/X4Pefcn7+Dw0F0L9AZf/7CvDWWFzy8eWEfLqpnp66bFAuv+E4IL0890SzjtDbi13V1D7E4ElEJUopb/ZvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:11.496418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aa9912bf5d98f5e9b454728d469e204c4b7ba72a89ec76847e3e0b9d8167554","sha256:67d60d79c4201d485210223789acf9494358f48c013ee67c4393fa8376139a2d"],"state_sha256":"e16f7e75c2779112c12067201534da4ac794cc9cfcf612980b09ceb92c6094da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjjUKSLDBb+ETmUSaQmVZSesAVpbSUtGLT21ntKVuPBktU65tGmMGGjix749WZGHLASDVewtxlyxp17ufLM1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:36:51.761341Z","bundle_sha256":"053bcf5da0edd4d46d9dda44f4cbc159650d25ffb35b473246ed22ac7e6037d9"}}