{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3Z534MTVSH2Q5QNIINXTO554E6","short_pith_number":"pith:3Z534MTV","canonical_record":{"source":{"id":"1908.03169","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:02:16Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"da0ca07d6a11b5586af4f1c29d1eb1da2505b87894513e61f625bfdf6e469b13","abstract_canon_sha256":"db2eabafc696f5541b1a69ed275d0f72f6b6d247cfe8afbf0c918433de75e492"},"schema_version":"1.0"},"canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","source":{"kind":"arxiv","id":"1908.03169","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03169","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03169v4","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03169","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"3Z534MTVSH2Q","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"3Z534MTVSH2Q5QNI","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"3Z534MTV","created_at":"2026-07-05T06:23:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3Z534MTVSH2Q5QNIINXTO554E6","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03169","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:02:16Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"da0ca07d6a11b5586af4f1c29d1eb1da2505b87894513e61f625bfdf6e469b13","abstract_canon_sha256":"db2eabafc696f5541b1a69ed275d0f72f6b6d247cfe8afbf0c918433de75e492"},"schema_version":"1.0"},"canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:27.757480Z","signature_b64":"IkwKjmotEuOEFx7PPuRjnjyWIuEuXcpqm9PCK1XddOoK2kUB3i/qFHdv2fB1Og81zNqRYUH3Roa8w5JE+YMrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","last_reissued_at":"2026-07-05T06:23:27.757062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:27.757062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03169","source_version":4,"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-07-05T06:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOIrCyp5ZKCQkFYVibTZaQyZ3rDfw/4WCK+GzjAFSPOVTKuStfgm9PlIfH5MQH2gPFcorGa0/kw3OFYEWYiyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:46.306160Z"},"content_sha256":"e6fe61ffb3535f7a73974cb16b0996aeb87d1042ff589cf035181b727d21a47d","schema_version":"1.0","event_id":"sha256:e6fe61ffb3535f7a73974cb16b0996aeb87d1042ff589cf035181b727d21a47d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3Z534MTVSH2Q5QNIINXTO554E6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The repetition threshold for binary rich words","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":"2019-08-08T17:02:16Z","abstract_excerpt":"A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\\sqrt{2}/2$ ($\\approx 2.707$) and conjectured that this was the least possible critical exponent for infinite binary rich words (i.e., that the repetition threshold for binary rich words is $2+\\sqrt{2}/2$). In this article, we give a structure theorem for infinite binary rich words that avoid $14/5$-powers (i.e., repetitions with exponent at least 2.8). As a consequence,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03169","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03169/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoL4Y4zyQ007kxy4JBYmPyAUyqXRR7gSBaG5uQzwmpCxyCrQKkfkB8qRlQTRv/IgI9x3GJ0rgDcP48p+/t7EAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:46.306668Z"},"content_sha256":"d99dcbcd1ddc7db01452b5148727c427648bfa984271dc7906ed7fb2baa4fbad","schema_version":"1.0","event_id":"sha256:d99dcbcd1ddc7db01452b5148727c427648bfa984271dc7906ed7fb2baa4fbad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/bundle.json","state_url":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3Z534MTVSH2Q5QNIINXTO554E6/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-08-16T05:23:46Z","links":{"resolver":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6","bundle":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/bundle.json","state":"https://pith.science/pith/3Z534MTVSH2Q5QNIINXTO554E6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3Z534MTVSH2Q5QNIINXTO554E6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3Z534MTVSH2Q5QNIINXTO554E6","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":"db2eabafc696f5541b1a69ed275d0f72f6b6d247cfe8afbf0c918433de75e492","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:02:16Z","title_canon_sha256":"da0ca07d6a11b5586af4f1c29d1eb1da2505b87894513e61f625bfdf6e469b13"},"schema_version":"1.0","source":{"id":"1908.03169","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03169","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03169v4","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03169","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"3Z534MTVSH2Q","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"3Z534MTVSH2Q5QNI","created_at":"2026-07-05T06:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"3Z534MTV","created_at":"2026-07-05T06:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:d99dcbcd1ddc7db01452b5148727c427648bfa984271dc7906ed7fb2baa4fbad","target":"graph","created_at":"2026-07-05T06:23:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03169/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\\sqrt{2}/2$ ($\\approx 2.707$) and conjectured that this was the least possible critical exponent for infinite binary rich words (i.e., that the repetition threshold for binary rich words is $2+\\sqrt{2}/2$). In this article, we give a structure theorem for infinite binary rich words that avoid $14/5$-powers (i.e., repetitions with exponent at least 2.8). As a consequence,","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":"2019-08-08T17:02:16Z","title":"The repetition threshold for binary rich words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03169","kind":"arxiv","version":4},"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:e6fe61ffb3535f7a73974cb16b0996aeb87d1042ff589cf035181b727d21a47d","target":"record","created_at":"2026-07-05T06:23:27Z","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":"db2eabafc696f5541b1a69ed275d0f72f6b6d247cfe8afbf0c918433de75e492","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:02:16Z","title_canon_sha256":"da0ca07d6a11b5586af4f1c29d1eb1da2505b87894513e61f625bfdf6e469b13"},"schema_version":"1.0","source":{"id":"1908.03169","kind":"arxiv","version":4}},"canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7bbe327591f50ec1a8436f3777bc27a95c2b867b15d0db9b127cacbaf0b44d","first_computed_at":"2026-07-05T06:23:27.757062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:27.757062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IkwKjmotEuOEFx7PPuRjnjyWIuEuXcpqm9PCK1XddOoK2kUB3i/qFHdv2fB1Og81zNqRYUH3Roa8w5JE+YMrBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:27.757480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03169","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6fe61ffb3535f7a73974cb16b0996aeb87d1042ff589cf035181b727d21a47d","sha256:d99dcbcd1ddc7db01452b5148727c427648bfa984271dc7906ed7fb2baa4fbad"],"state_sha256":"5acd653da2a7e22d43f75d56698312b83006a97ddce3511560cbda9830743c3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asQfXvRVIQXEXJgCq0JundhCh1wHaBu9BNrV4ucTMX5BEysjR0Nk3asHPQswmebudlTCW/4yqczfX+NMedhtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:23:46.311870Z","bundle_sha256":"1cbe1d5ef4c4d5b14cf31be3fb53abcd1aecd7adf167a7f905c5f64ca0bc1272"}}