{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7B3OWV7DQK66L5AXXQEOEBH773","short_pith_number":"pith:7B3OWV7D","canonical_record":{"source":{"id":"1803.08145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1b893cee9c27763bd2cec2a1dec5c4a0653e10f280d1a473fdc83e3c18d7dabf","abstract_canon_sha256":"7ceb4ca526ed7dce8c6ee3608c0c33a96a50b4edcc651a5722fd91c0ce0cf8a8"},"schema_version":"1.0"},"canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","source":{"kind":"arxiv","id":"1803.08145","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08145","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08145v2","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08145","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"7B3OWV7DQK66","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7B3OWV7DQK66L5AX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7B3OWV7D","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7B3OWV7DQK66L5AXXQEOEBH773","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"1b893cee9c27763bd2cec2a1dec5c4a0653e10f280d1a473fdc83e3c18d7dabf","abstract_canon_sha256":"7ceb4ca526ed7dce8c6ee3608c0c33a96a50b4edcc651a5722fd91c0ce0cf8a8"},"schema_version":"1.0"},"canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.794238Z","signature_b64":"tqvITRe5ZL5ONEhT3GujxD1Zm8fibeFNnWIer/NVZR2bHzXe52JA3VNnp8N+WBnTfelKwSEayudPk9Cy9FwGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","last_reissued_at":"2026-05-18T00:04:07.793632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.793632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08145","source_version":2,"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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1obeIaRqm3JBQlcS5LIIjd+4wKcnyilgwH7PRgGZ7wNh6mOWgRFJiGb0cjbZBbjX0jcVyTp0I0pfBBBoR6y2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:28:08.778819Z"},"content_sha256":"5899b0dc4f0d46c31565c3dcdd0979b18e8ce22251cac4f90bc36a4b221f845c","schema_version":"1.0","event_id":"sha256:5899b0dc4f0d46c31565c3dcdd0979b18e8ce22251cac4f90bc36a4b221f845c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7B3OWV7DQK66L5AXXQEOEBH773","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"James D. Currie, Lucas Mol, Narad Rampersad","submitted_at":"2018-03-21T21:43:53Z","abstract_excerpt":"A word is called $\\beta$-free if it has no factors of exponent greater than or equal to $\\beta$. The repetition threshold $\\mathrm{RT}(k)$ is the infimum of the set of all $\\beta$ such that there are arbitrarily long $k$-ary $\\beta$-free words (or equivalently, there are $k$-ary $\\beta$-free words of every sufficiently large length, or even every length). These three equivalent definitions of the repetition threshold give rise to three natural definitions of a repetition threshold for circular words. The infimum of the set of all $\\beta$ such that\n  - there are arbitrarily long $k$-ary $\\beta$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08145","kind":"arxiv","version":2},"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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/OeNTnX3RDC6PNs+4HyQchz5220fNTC6Dn1kYrP44GlVk7VVUYLrg8Z65K90zvfn2jBoIYakA2Z2+RIR13aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:28:08.779167Z"},"content_sha256":"42d890f9fd19e002a7fc8bdcc207be22ce8a1c21e2b393e59b0a805a93254441","schema_version":"1.0","event_id":"sha256:42d890f9fd19e002a7fc8bdcc207be22ce8a1c21e2b393e59b0a805a93254441"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/bundle.json","state_url":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7B3OWV7DQK66L5AXXQEOEBH773/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-24T19:28:08Z","links":{"resolver":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773","bundle":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/bundle.json","state":"https://pith.science/pith/7B3OWV7DQK66L5AXXQEOEBH773/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7B3OWV7DQK66L5AXXQEOEBH773/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7B3OWV7DQK66L5AXXQEOEBH773","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":"7ceb4ca526ed7dce8c6ee3608c0c33a96a50b4edcc651a5722fd91c0ce0cf8a8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","title_canon_sha256":"1b893cee9c27763bd2cec2a1dec5c4a0653e10f280d1a473fdc83e3c18d7dabf"},"schema_version":"1.0","source":{"id":"1803.08145","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08145","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08145v2","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08145","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"7B3OWV7DQK66","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7B3OWV7DQK66L5AX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7B3OWV7D","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:42d890f9fd19e002a7fc8bdcc207be22ce8a1c21e2b393e59b0a805a93254441","target":"graph","created_at":"2026-05-18T00:04:07Z","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 word is called $\\beta$-free if it has no factors of exponent greater than or equal to $\\beta$. The repetition threshold $\\mathrm{RT}(k)$ is the infimum of the set of all $\\beta$ such that there are arbitrarily long $k$-ary $\\beta$-free words (or equivalently, there are $k$-ary $\\beta$-free words of every sufficiently large length, or even every length). These three equivalent definitions of the repetition threshold give rise to three natural definitions of a repetition threshold for circular words. The infimum of the set of all $\\beta$ such that\n  - there are arbitrarily long $k$-ary $\\beta$","authors_text":"James D. Currie, Lucas Mol, Narad Rampersad","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","title":"Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08145","kind":"arxiv","version":2},"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:5899b0dc4f0d46c31565c3dcdd0979b18e8ce22251cac4f90bc36a4b221f845c","target":"record","created_at":"2026-05-18T00:04:07Z","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":"7ceb4ca526ed7dce8c6ee3608c0c33a96a50b4edcc651a5722fd91c0ce0cf8a8","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-21T21:43:53Z","title_canon_sha256":"1b893cee9c27763bd2cec2a1dec5c4a0653e10f280d1a473fdc83e3c18d7dabf"},"schema_version":"1.0","source":{"id":"1803.08145","kind":"arxiv","version":2}},"canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f876eb57e382bde5f417bc08e204fffedb9650847a9dffb1d800a3c5d908c48a","first_computed_at":"2026-05-18T00:04:07.793632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:07.793632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqvITRe5ZL5ONEhT3GujxD1Zm8fibeFNnWIer/NVZR2bHzXe52JA3VNnp8N+WBnTfelKwSEayudPk9Cy9FwGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:07.794238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08145","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5899b0dc4f0d46c31565c3dcdd0979b18e8ce22251cac4f90bc36a4b221f845c","sha256:42d890f9fd19e002a7fc8bdcc207be22ce8a1c21e2b393e59b0a805a93254441"],"state_sha256":"bdad526b1108587fe07245a7b51536c73245e834b8b5cb075d075aed1c4fd4e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LyzW5sl4nTCxcZQLlygL+kR9Up0G5OlBKZ44T/lSZwUsLbM4jg7owkvNxAom3TU7UIKa45Zw4RT8vP5mpAMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:28:08.781078Z","bundle_sha256":"a621f44de920ff788acb5026b52b690dc2114cf978bc99e2a11f93070ab72ac1"}}