{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L3LWL62UPCOQDJCGA62W6HZ4OH","short_pith_number":"pith:L3LWL62U","canonical_record":{"source":{"id":"1809.01426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-05T10:36:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f57f87bd4f0f838dc02f218b8b39b1033421f3bc27e349d2d0b79db1f15d0e86","abstract_canon_sha256":"1536795a01d811c8365e8048b308aebfbaec6c3ff0b8e64914cf061378703426"},"schema_version":"1.0"},"canonical_sha256":"5ed765fb54789d01a44607b56f1f3c71fa4a3f6c29fdde753c2a36f1120fba54","source":{"kind":"arxiv","id":"1809.01426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01426","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01426v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01426","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"L3LWL62UPCOQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3LWL62UPCOQDJCG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3LWL62U","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L3LWL62UPCOQDJCGA62W6HZ4OH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-05T10:36:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f57f87bd4f0f838dc02f218b8b39b1033421f3bc27e349d2d0b79db1f15d0e86","abstract_canon_sha256":"1536795a01d811c8365e8048b308aebfbaec6c3ff0b8e64914cf061378703426"},"schema_version":"1.0"},"canonical_sha256":"5ed765fb54789d01a44607b56f1f3c71fa4a3f6c29fdde753c2a36f1120fba54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.810288Z","signature_b64":"bpwZySCuTg5jhaNSqtdAfjhQoVfnDbExG77xbAM0psQ8ESxN57vqQssRjzCyBiqQ2msPhe2QeXHFDmlFhlgUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ed765fb54789d01a44607b56f1f3c71fa4a3f6c29fdde753c2a36f1120fba54","last_reissued_at":"2026-05-17T23:47:39.809895Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.809895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01426","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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdhBhA/XtYNDqaqcPGGNcay6YyFozX/xdgumSbaQVqbLTNhRzCZ1fYTD/w2A3+Kqa/pq9YqDhVlaJ073JlPgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:34:11.003624Z"},"content_sha256":"dfd6b0bc4061f00c35a1f60e63cca2f911448b4b987d10e5de0e04f121662724","schema_version":"1.0","event_id":"sha256:dfd6b0bc4061f00c35a1f60e63cca2f911448b4b987d10e5de0e04f121662724"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L3LWL62UPCOQDJCGA62W6HZ4OH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Repetition avoidance in products of factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kamellia Reshadi, Pamela Fleischmann, Pascal Ochem","submitted_at":"2018-09-05T10:36:14Z","abstract_excerpt":"We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let $\\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$ factors of the word $w$. The repetition threshold $\\texttt{RT}_i(k)$ is then the infimum of $\\texttt{pexp}_i(w)$ over all words $w\\in\\Sigma^\\omega_k$. Mousavi and Shallit obtained that $\\texttt{RT}_i(2)=2i$ and $\\texttt{RT}_2(3)=\\tfrac{13}4$. We show that $\\texttt{RT}_i(3)=\\tfrac{3i}2+\\tfrac14$ if $i$ is even and $\\texttt{RT}_i(3)=\\tfrac{3i}2+\\tfrac16$ if $i$ is odd and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01426","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:47:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IN5AQYcrpYLvJGJa6Zn+j4wOQpQsFoIzKnab5gZTTxDoPByZNmPzoILibwr1+Fu7iOwrEeubv3BUealx6Sb6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:34:11.004201Z"},"content_sha256":"21bf713bfb987fe7ed9ee21f1e16cf3730387395688359665eb8f73072f59e3d","schema_version":"1.0","event_id":"sha256:21bf713bfb987fe7ed9ee21f1e16cf3730387395688359665eb8f73072f59e3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/bundle.json","state_url":"https://pith.science/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/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-05-27T18:34:11Z","links":{"resolver":"https://pith.science/pith/L3LWL62UPCOQDJCGA62W6HZ4OH","bundle":"https://pith.science/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/bundle.json","state":"https://pith.science/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3LWL62UPCOQDJCGA62W6HZ4OH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L3LWL62UPCOQDJCGA62W6HZ4OH","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":"1536795a01d811c8365e8048b308aebfbaec6c3ff0b8e64914cf061378703426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-05T10:36:14Z","title_canon_sha256":"f57f87bd4f0f838dc02f218b8b39b1033421f3bc27e349d2d0b79db1f15d0e86"},"schema_version":"1.0","source":{"id":"1809.01426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01426","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01426v2","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01426","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"L3LWL62UPCOQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3LWL62UPCOQDJCG","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3LWL62U","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:21bf713bfb987fe7ed9ee21f1e16cf3730387395688359665eb8f73072f59e3d","target":"graph","created_at":"2026-05-17T23:47:39Z","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":"We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let $\\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$ factors of the word $w$. The repetition threshold $\\texttt{RT}_i(k)$ is then the infimum of $\\texttt{pexp}_i(w)$ over all words $w\\in\\Sigma^\\omega_k$. Mousavi and Shallit obtained that $\\texttt{RT}_i(2)=2i$ and $\\texttt{RT}_2(3)=\\tfrac{13}4$. We show that $\\texttt{RT}_i(3)=\\tfrac{3i}2+\\tfrac14$ if $i$ is even and $\\texttt{RT}_i(3)=\\tfrac{3i}2+\\tfrac16$ if $i$ is odd and","authors_text":"Kamellia Reshadi, Pamela Fleischmann, Pascal Ochem","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-05T10:36:14Z","title":"Repetition avoidance in products of factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01426","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:dfd6b0bc4061f00c35a1f60e63cca2f911448b4b987d10e5de0e04f121662724","target":"record","created_at":"2026-05-17T23:47:39Z","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":"1536795a01d811c8365e8048b308aebfbaec6c3ff0b8e64914cf061378703426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-09-05T10:36:14Z","title_canon_sha256":"f57f87bd4f0f838dc02f218b8b39b1033421f3bc27e349d2d0b79db1f15d0e86"},"schema_version":"1.0","source":{"id":"1809.01426","kind":"arxiv","version":2}},"canonical_sha256":"5ed765fb54789d01a44607b56f1f3c71fa4a3f6c29fdde753c2a36f1120fba54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ed765fb54789d01a44607b56f1f3c71fa4a3f6c29fdde753c2a36f1120fba54","first_computed_at":"2026-05-17T23:47:39.809895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.809895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bpwZySCuTg5jhaNSqtdAfjhQoVfnDbExG77xbAM0psQ8ESxN57vqQssRjzCyBiqQ2msPhe2QeXHFDmlFhlgUBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.810288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfd6b0bc4061f00c35a1f60e63cca2f911448b4b987d10e5de0e04f121662724","sha256:21bf713bfb987fe7ed9ee21f1e16cf3730387395688359665eb8f73072f59e3d"],"state_sha256":"978e9fbc437833ce6ff17122d915ad9ef7d33cf5489071b151ae450dfeab7ac9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkrHy6z65H5MBb2f5UylIPbjMMJuDSwQmkSWXfY8J4kLamoRcbxRgaM38IScut08s3xlqVIMTS4wTg0d/xeiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:34:11.006968Z","bundle_sha256":"c70656e05e5fe06e72a47f80f6978e898d1d0e3ccf241183490b21a5eb24977a"}}