{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WWISM2AKRKHLDWCEQZ2ZUPON3K","short_pith_number":"pith:WWISM2AK","canonical_record":{"source":{"id":"1902.01291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"e1585fa358d52bb7235c8bc0630eab2159cf76c4ada13ff5667235ab85ea4214","abstract_canon_sha256":"efe78c243801ae00b4c3b3f38f8b3f9583fad93e974bed30d3632f00a490f7ec"},"schema_version":"1.0"},"canonical_sha256":"b59126680a8a8eb1d84486759a3dcdda835ded5f3ce67cd88ab5320346aab6a1","source":{"kind":"arxiv","id":"1902.01291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01291","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01291v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01291","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"WWISM2AKRKHL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WWISM2AKRKHLDWCE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WWISM2AK","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WWISM2AKRKHLDWCEQZ2ZUPON3K","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"e1585fa358d52bb7235c8bc0630eab2159cf76c4ada13ff5667235ab85ea4214","abstract_canon_sha256":"efe78c243801ae00b4c3b3f38f8b3f9583fad93e974bed30d3632f00a490f7ec"},"schema_version":"1.0"},"canonical_sha256":"b59126680a8a8eb1d84486759a3dcdda835ded5f3ce67cd88ab5320346aab6a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:49.255172Z","signature_b64":"aJYS0uT4SKHb8UPS+HTLt+Um/DyXuBrT4r4g3JJSmzS65kNM6huRhwz5LD6dmnezCv5mA8ZEcTqNqfjbnYAuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b59126680a8a8eb1d84486759a3dcdda835ded5f3ce67cd88ab5320346aab6a1","last_reissued_at":"2026-05-17T23:54:49.254754Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:49.254754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01291","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-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kmhr7GboIquDTEEv6U3kRBH3U7fCAtHi1F9P+RswI/rdrq4VBgBolcRQRrF4WKyRA2f446GqHT+2jN0bwacFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:54:07.611139Z"},"content_sha256":"a3d64f033e40e7b04676920893281a88e039d174084bf69ae37dc2be50d02a7c","schema_version":"1.0","event_id":"sha256:a3d64f033e40e7b04676920893281a88e039d174084bf69ae37dc2be50d02a7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WWISM2AKRKHLDWCEQZ2ZUPON3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Anti-Powers in Aperiodic Recurrent Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Berger, Colin Defant","submitted_at":"2019-02-04T16:34:09Z","abstract_excerpt":"Fici, Restivo, Silva, and Zamboni define a $\\textit{$k$-anti-power}$ to be a concatenation of $k$ consecutive words that are pairwise distinct and have the same length. They ask for the maximum $k$ such that every aperiodic recurrent word must contain a $k$-anti-power, and they prove that this maximum must be 3, 4, or 5. We resolve this question by demonstrating that the maximum is 5. We also conjecture that if $W$ is a reasonably nice aperiodic morphic word, then there is some constant $C = C(W)$ such that for all $i,k\\geq 1$, $W$ contains a $k$-anti-power with blocks of length at most $Ck$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01291","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-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIUhaY/rmauh/VPDjWcE7ksYaQJZZS0W5VOORDKVGwztmeefbBpxrXa1Vml80UFTgPIEB7VZp3r68+EqjyX3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:54:07.611495Z"},"content_sha256":"8197d354a4eb558fd6cb6e9205c091a98ac7196eac03e46c720b998f94796612","schema_version":"1.0","event_id":"sha256:8197d354a4eb558fd6cb6e9205c091a98ac7196eac03e46c720b998f94796612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/bundle.json","state_url":"https://pith.science/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/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-23T00:54:07Z","links":{"resolver":"https://pith.science/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K","bundle":"https://pith.science/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/bundle.json","state":"https://pith.science/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWISM2AKRKHLDWCEQZ2ZUPON3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WWISM2AKRKHLDWCEQZ2ZUPON3K","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":"efe78c243801ae00b4c3b3f38f8b3f9583fad93e974bed30d3632f00a490f7ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:34:09Z","title_canon_sha256":"e1585fa358d52bb7235c8bc0630eab2159cf76c4ada13ff5667235ab85ea4214"},"schema_version":"1.0","source":{"id":"1902.01291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01291","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01291v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01291","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"WWISM2AKRKHL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WWISM2AKRKHLDWCE","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WWISM2AK","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:8197d354a4eb558fd6cb6e9205c091a98ac7196eac03e46c720b998f94796612","target":"graph","created_at":"2026-05-17T23:54:49Z","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":"Fici, Restivo, Silva, and Zamboni define a $\\textit{$k$-anti-power}$ to be a concatenation of $k$ consecutive words that are pairwise distinct and have the same length. They ask for the maximum $k$ such that every aperiodic recurrent word must contain a $k$-anti-power, and they prove that this maximum must be 3, 4, or 5. We resolve this question by demonstrating that the maximum is 5. We also conjecture that if $W$ is a reasonably nice aperiodic morphic word, then there is some constant $C = C(W)$ such that for all $i,k\\geq 1$, $W$ contains a $k$-anti-power with blocks of length at most $Ck$ b","authors_text":"Aaron Berger, Colin Defant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:34:09Z","title":"On Anti-Powers in Aperiodic Recurrent Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01291","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:a3d64f033e40e7b04676920893281a88e039d174084bf69ae37dc2be50d02a7c","target":"record","created_at":"2026-05-17T23:54:49Z","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":"efe78c243801ae00b4c3b3f38f8b3f9583fad93e974bed30d3632f00a490f7ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-04T16:34:09Z","title_canon_sha256":"e1585fa358d52bb7235c8bc0630eab2159cf76c4ada13ff5667235ab85ea4214"},"schema_version":"1.0","source":{"id":"1902.01291","kind":"arxiv","version":1}},"canonical_sha256":"b59126680a8a8eb1d84486759a3dcdda835ded5f3ce67cd88ab5320346aab6a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b59126680a8a8eb1d84486759a3dcdda835ded5f3ce67cd88ab5320346aab6a1","first_computed_at":"2026-05-17T23:54:49.254754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:49.254754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aJYS0uT4SKHb8UPS+HTLt+Um/DyXuBrT4r4g3JJSmzS65kNM6huRhwz5LD6dmnezCv5mA8ZEcTqNqfjbnYAuCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:49.255172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d64f033e40e7b04676920893281a88e039d174084bf69ae37dc2be50d02a7c","sha256:8197d354a4eb558fd6cb6e9205c091a98ac7196eac03e46c720b998f94796612"],"state_sha256":"80f99b5899173cfe083a15d53f121343914ac308c0d365f4277cdedbfb6534ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+lJ7X0NghILa+8Y+w8Xbmk6q53HHvmY+hqoP5ctbFID8kvS+rUC3eNoxvKtTw9GBpiddLUhL1sahSfOSXVWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:54:07.613329Z","bundle_sha256":"f3e8e5798bda417cf5419755104bd55558f3a875c52a53a36ab8d3ac030c8491"}}