{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NQ2P6GY5C2A4RKAA5DLUCELVWU","short_pith_number":"pith:NQ2P6GY5","canonical_record":{"source":{"id":"1904.10029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-22T18:53:14Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"1140c388aff3d5541e91091fa6cba386774894b08b30e671c81192d21d715a95","abstract_canon_sha256":"b0c2555c88a710110df74c78c5110e673d28bf8270b5506a41e1ff0e996f1fd8"},"schema_version":"1.0"},"canonical_sha256":"6c34ff1b1d1681c8a800e8d7411175b53840ba2eeb1e97f87553e15a53daa6fd","source":{"kind":"arxiv","id":"1904.10029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10029","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10029v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10029","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"NQ2P6GY5C2A4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQ2P6GY5C2A4RKAA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQ2P6GY5","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NQ2P6GY5C2A4RKAA5DLUCELVWU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-22T18:53:14Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"1140c388aff3d5541e91091fa6cba386774894b08b30e671c81192d21d715a95","abstract_canon_sha256":"b0c2555c88a710110df74c78c5110e673d28bf8270b5506a41e1ff0e996f1fd8"},"schema_version":"1.0"},"canonical_sha256":"6c34ff1b1d1681c8a800e8d7411175b53840ba2eeb1e97f87553e15a53daa6fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.720655Z","signature_b64":"mWJrq+/3EqFjOBILh/dIrpCksgcb/eYchJQRvyO6++oI1HeQRmwHNwb7XOpV8M2/yu3OT/bnIBssDaA14BjqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c34ff1b1d1681c8a800e8d7411175b53840ba2eeb1e97f87553e15a53daa6fd","last_reissued_at":"2026-05-17T23:44:28.720043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.720043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10029","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzLkQrL/tp/ZnUJIbuTJtvl2Kz5OalHvhBB7mKyXRZJPMc5Lb9+F9TdWgKECy11xsdypfjxnywHXxDW2rbJjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:37:28.429106Z"},"content_sha256":"08813fb50bfec6597e748db84048f2ab15e59e9aa5f4f415adf46efb6ac418eb","schema_version":"1.0","event_id":"sha256:08813fb50bfec6597e748db84048f2ab15e59e9aa5f4f415adf46efb6ac418eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NQ2P6GY5C2A4RKAA5DLUCELVWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The undirected repetition threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"math.CO","authors_text":"James D. Currie, Lucas Mol","submitted_at":"2019-04-22T18:53:14Z","abstract_excerpt":"For rational $1<r\\leq 2$, an undirected $r$-power is a word of the form $xyx'$, where $x$ is nonempty, $x'\\in\\{x,x^\\mathrm{R}\\}$, and $|xyx'|/|xy|=r$. The undirected repetition threshold for $k$ letters, denoted $\\mathrm{URT}(k)$, is the infimum of the set of all $r$ such that undirected $r$-powers are avoidable on $k$ letters. We first demonstrate that $\\mathrm{URT}(3)=\\tfrac{7}{4}$. Then we show that $\\mathrm{URT}(k)\\geq \\tfrac{k-1}{k-2}$ for all $k\\geq 4$. We conjecture that $\\mathrm{URT}(k)=\\tfrac{k-1}{k-2}$ for all $k\\geq 4$, and we confirm this conjecture for $k\\in\\{4,8,12\\}.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10029","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/s83G4RW0gSi4Se1NRUelZjD7EFSY36vDHols8PAZeMWGOuMqz9QwPVFbgpduo/C+OY0obN3gUreOeaV4ZZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:37:28.429472Z"},"content_sha256":"b8927ab312448a3282734d72051cb5ccbe6c8c03066a49cc46f0ffa69d6899b4","schema_version":"1.0","event_id":"sha256:b8927ab312448a3282734d72051cb5ccbe6c8c03066a49cc46f0ffa69d6899b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/bundle.json","state_url":"https://pith.science/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/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-25T04:37:28Z","links":{"resolver":"https://pith.science/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU","bundle":"https://pith.science/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/bundle.json","state":"https://pith.science/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQ2P6GY5C2A4RKAA5DLUCELVWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NQ2P6GY5C2A4RKAA5DLUCELVWU","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":"b0c2555c88a710110df74c78c5110e673d28bf8270b5506a41e1ff0e996f1fd8","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-22T18:53:14Z","title_canon_sha256":"1140c388aff3d5541e91091fa6cba386774894b08b30e671c81192d21d715a95"},"schema_version":"1.0","source":{"id":"1904.10029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10029","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10029v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10029","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"NQ2P6GY5C2A4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQ2P6GY5C2A4RKAA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQ2P6GY5","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:b8927ab312448a3282734d72051cb5ccbe6c8c03066a49cc46f0ffa69d6899b4","target":"graph","created_at":"2026-05-17T23:44:28Z","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":"For rational $1<r\\leq 2$, an undirected $r$-power is a word of the form $xyx'$, where $x$ is nonempty, $x'\\in\\{x,x^\\mathrm{R}\\}$, and $|xyx'|/|xy|=r$. The undirected repetition threshold for $k$ letters, denoted $\\mathrm{URT}(k)$, is the infimum of the set of all $r$ such that undirected $r$-powers are avoidable on $k$ letters. We first demonstrate that $\\mathrm{URT}(3)=\\tfrac{7}{4}$. Then we show that $\\mathrm{URT}(k)\\geq \\tfrac{k-1}{k-2}$ for all $k\\geq 4$. We conjecture that $\\mathrm{URT}(k)=\\tfrac{k-1}{k-2}$ for all $k\\geq 4$, and we confirm this conjecture for $k\\in\\{4,8,12\\}.$","authors_text":"James D. Currie, Lucas Mol","cross_cats":["cs.DM","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-22T18:53:14Z","title":"The undirected repetition threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10029","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:08813fb50bfec6597e748db84048f2ab15e59e9aa5f4f415adf46efb6ac418eb","target":"record","created_at":"2026-05-17T23:44:28Z","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":"b0c2555c88a710110df74c78c5110e673d28bf8270b5506a41e1ff0e996f1fd8","cross_cats_sorted":["cs.DM","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-22T18:53:14Z","title_canon_sha256":"1140c388aff3d5541e91091fa6cba386774894b08b30e671c81192d21d715a95"},"schema_version":"1.0","source":{"id":"1904.10029","kind":"arxiv","version":2}},"canonical_sha256":"6c34ff1b1d1681c8a800e8d7411175b53840ba2eeb1e97f87553e15a53daa6fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c34ff1b1d1681c8a800e8d7411175b53840ba2eeb1e97f87553e15a53daa6fd","first_computed_at":"2026-05-17T23:44:28.720043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.720043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mWJrq+/3EqFjOBILh/dIrpCksgcb/eYchJQRvyO6++oI1HeQRmwHNwb7XOpV8M2/yu3OT/bnIBssDaA14BjqAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.720655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08813fb50bfec6597e748db84048f2ab15e59e9aa5f4f415adf46efb6ac418eb","sha256:b8927ab312448a3282734d72051cb5ccbe6c8c03066a49cc46f0ffa69d6899b4"],"state_sha256":"04b82f75783ed0eb896786c02538c1de3f332e969b87ce378d5baa83433d5106"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKjrry4xhgLWjlJ8Kr89EGese6D1p/+lPQU9EqXm0s+Qepq7DGCIfsg1jnNd5uw8HW3MOzOMH6wGjV29aEkCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:37:28.431377Z","bundle_sha256":"c3609160ee596a961db8404ad7c3fdea48ab86f1beeec9ef140aa24d43b4d9cc"}}