{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ACG7FNTJH63SUBMYPQZYKCR6K4","short_pith_number":"pith:ACG7FNTJ","canonical_record":{"source":{"id":"2510.23573","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-27T17:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"3bda29e12e3072a3a47d471410bb5d78e680b8d8cdbcc19cc18f4e38d9724b52","abstract_canon_sha256":"c9b591c8cda0dc28b2a84936a36a30821fd296c8adc04e928ebb60340e0664b7"},"schema_version":"1.0"},"canonical_sha256":"008df2b6693fb72a05987c33850a3e572080bc6df2eeebafd4e5364bd836f269","source":{"kind":"arxiv","id":"2510.23573","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.23573","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"2510.23573v4","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23573","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"ACG7FNTJH63S","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_16","alias_value":"ACG7FNTJH63SUBMY","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_8","alias_value":"ACG7FNTJ","created_at":"2026-05-20T02:05:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ACG7FNTJH63SUBMYPQZYKCR6K4","target":"record","payload":{"canonical_record":{"source":{"id":"2510.23573","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-27T17:42:16Z","cross_cats_sorted":[],"title_canon_sha256":"3bda29e12e3072a3a47d471410bb5d78e680b8d8cdbcc19cc18f4e38d9724b52","abstract_canon_sha256":"c9b591c8cda0dc28b2a84936a36a30821fd296c8adc04e928ebb60340e0664b7"},"schema_version":"1.0"},"canonical_sha256":"008df2b6693fb72a05987c33850a3e572080bc6df2eeebafd4e5364bd836f269","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:37.512376Z","signature_b64":"gTn5+EwlARu0xtv8RzAyYnAQIj8z7AXBaAxhy+FHANlsael4V/u4EpvHc91JzMwwqAMajYHwvMonbQqRlzHTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008df2b6693fb72a05987c33850a3e572080bc6df2eeebafd4e5364bd836f269","last_reissued_at":"2026-05-20T02:05:37.511543Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:37.511543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.23573","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-05-20T02:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PWT37tHRzaz8Oj4Tsiw3vJ5JCSMGvhMAtza8xa+JidvslaZwCkjQ2R3BtrELrHwSzGlbUCtG4wPwxE5HW2ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:21:12.697936Z"},"content_sha256":"95a581c23258b7cd609385f1f2d8a5690d533b2e726fc0f3129a560223463d31","schema_version":"1.0","event_id":"sha256:95a581c23258b7cd609385f1f2d8a5690d533b2e726fc0f3129a560223463d31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ACG7FNTJH63SUBMYPQZYKCR6K4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Erd\\H{o}s--Szekeres type result for words with repeats","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Every word with kn^6+1 repeats must contain one of seven specific patterns.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abigail Ollson, Jun Yan, Kyle Celano, Niraj Velankar","submitted_at":"2025-10-27T17:42:16Z","abstract_excerpt":"We prove an Erd\\H{o}s--Szekeres type result for finite words over $\\mathbb{N}$ with repeated values. Specifically, we define a \\emph{repeat} in a word to be an occurrence of a value which is not its first occurrence. We define an occurrence of a \\emph{pattern} $\\pi$ in a word $w$ to be a (not necessarily consecutive) subword of $w$ that is order isomorphic to $\\pi$. In this note, we show that every word with $kn^6+1$ repeats contains one of the following patterns: $0^{k+2}$, $0011\\cdots nn$, $nn\\cdots1100$, $012 \\cdots n012 \\cdots n$, $012 \\cdots nn\\cdots 210$, $n\\cdots 210012\\cdots n$, $n\\cdo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that every word with kn^6+1 repeats contains one of the following patterns: 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, n⋯210n⋯210. Moreover, when k=1, this is best possible by constructing a word with n^6 repeats that does not contain any of these patterns.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The central claim rests on the specific choice of the seven target patterns as the complete set of unavoidable configurations once the repeat count exceeds the stated threshold; if a different or larger set of patterns were required to be avoided, the quantitative bound would not necessarily hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Every word with kn^6+1 repeats contains one of the patterns 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, or n⋯210n⋯210, with the bound tight for k=1 via an explicit construction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every word with kn^6+1 repeats must contain one of seven specific patterns.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d0215262a008421df88b1f3bbda65d80f5f2af99bb438d21778d6075489bb8ba"},"source":{"id":"2510.23573","kind":"arxiv","version":4},"verdict":{"id":"5aa0ebc8-332a-420f-b240-3dd87677e71d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T03:19:32.078774Z","strongest_claim":"We show that every word with kn^6+1 repeats contains one of the following patterns: 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, n⋯210n⋯210. Moreover, when k=1, this is best possible by constructing a word with n^6 repeats that does not contain any of these patterns.","one_line_summary":"Every word with kn^6+1 repeats contains one of the patterns 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, or n⋯210n⋯210, with the bound tight for k=1 via an explicit construction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The central claim rests on the specific choice of the seven target patterns as the complete set of unavoidable configurations once the repeat count exceeds the stated threshold; if a different or larger set of patterns were required to be avoided, the quantitative bound would not necessarily hold.","pith_extraction_headline":"Every word with kn^6+1 repeats must contain one of seven specific patterns."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.23573/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":1,"snapshot_sha256":"98b49e42be43bbb2bf652fe7219b1367ea47be13967f957aecb0279d13d53854"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"5aa0ebc8-332a-420f-b240-3dd87677e71d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T02:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ec8mT6IQi2ZFWtCqPOH9aC3FgLe0JrNIirF3sfstd07Xs1uGByh54riLs6O5rREyTOb5dzcqHXo3PiBbDb2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:21:12.698535Z"},"content_sha256":"9786f089e54ca7c2b06df73c346331541b41aa4459c79ac8158094e1923b7dba","schema_version":"1.0","event_id":"sha256:9786f089e54ca7c2b06df73c346331541b41aa4459c79ac8158094e1923b7dba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/bundle.json","state_url":"https://pith.science/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/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-26T03:21:12Z","links":{"resolver":"https://pith.science/pith/ACG7FNTJH63SUBMYPQZYKCR6K4","bundle":"https://pith.science/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/bundle.json","state":"https://pith.science/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACG7FNTJH63SUBMYPQZYKCR6K4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ACG7FNTJH63SUBMYPQZYKCR6K4","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":"c9b591c8cda0dc28b2a84936a36a30821fd296c8adc04e928ebb60340e0664b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-27T17:42:16Z","title_canon_sha256":"3bda29e12e3072a3a47d471410bb5d78e680b8d8cdbcc19cc18f4e38d9724b52"},"schema_version":"1.0","source":{"id":"2510.23573","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.23573","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"2510.23573v4","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23573","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"ACG7FNTJH63S","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_16","alias_value":"ACG7FNTJH63SUBMY","created_at":"2026-05-20T02:05:37Z"},{"alias_kind":"pith_short_8","alias_value":"ACG7FNTJ","created_at":"2026-05-20T02:05:37Z"}],"graph_snapshots":[{"event_id":"sha256:9786f089e54ca7c2b06df73c346331541b41aa4459c79ac8158094e1923b7dba","target":"graph","created_at":"2026-05-20T02:05:37Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that every word with kn^6+1 repeats contains one of the following patterns: 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, n⋯210n⋯210. Moreover, when k=1, this is best possible by constructing a word with n^6 repeats that does not contain any of these patterns."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The central claim rests on the specific choice of the seven target patterns as the complete set of unavoidable configurations once the repeat count exceeds the stated threshold; if a different or larger set of patterns were required to be avoided, the quantitative bound would not necessarily hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Every word with kn^6+1 repeats contains one of the patterns 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, or n⋯210n⋯210, with the bound tight for k=1 via an explicit construction."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every word with kn^6+1 repeats must contain one of seven specific patterns."}],"snapshot_sha256":"d0215262a008421df88b1f3bbda65d80f5f2af99bb438d21778d6075489bb8ba"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"98b49e42be43bbb2bf652fe7219b1367ea47be13967f957aecb0279d13d53854"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.23573/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove an Erd\\H{o}s--Szekeres type result for finite words over $\\mathbb{N}$ with repeated values. Specifically, we define a \\emph{repeat} in a word to be an occurrence of a value which is not its first occurrence. We define an occurrence of a \\emph{pattern} $\\pi$ in a word $w$ to be a (not necessarily consecutive) subword of $w$ that is order isomorphic to $\\pi$. In this note, we show that every word with $kn^6+1$ repeats contains one of the following patterns: $0^{k+2}$, $0011\\cdots nn$, $nn\\cdots1100$, $012 \\cdots n012 \\cdots n$, $012 \\cdots nn\\cdots 210$, $n\\cdots 210012\\cdots n$, $n\\cdo","authors_text":"Abigail Ollson, Jun Yan, Kyle Celano, Niraj Velankar","cross_cats":[],"headline":"Every word with kn^6+1 repeats must contain one of seven specific patterns.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-27T17:42:16Z","title":"An Erd\\H{o}s--Szekeres type result for words with repeats"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.23573","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-18T03:19:32.078774Z","id":"5aa0ebc8-332a-420f-b240-3dd87677e71d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Every word with kn^6+1 repeats contains one of the patterns 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, or n⋯210n⋯210, with the bound tight for k=1 via an explicit construction.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every word with kn^6+1 repeats must contain one of seven specific patterns.","strongest_claim":"We show that every word with kn^6+1 repeats contains one of the following patterns: 0^{k+2}, 0011⋯nn, nn⋯1100, 012⋯n012⋯n, 012⋯nn⋯210, n⋯210012⋯n, n⋯210n⋯210. Moreover, when k=1, this is best possible by constructing a word with n^6 repeats that does not contain any of these patterns.","weakest_assumption":"The central claim rests on the specific choice of the seven target patterns as the complete set of unavoidable configurations once the repeat count exceeds the stated threshold; if a different or larger set of patterns were required to be avoided, the quantitative bound would not necessarily hold."}},"verdict_id":"5aa0ebc8-332a-420f-b240-3dd87677e71d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95a581c23258b7cd609385f1f2d8a5690d533b2e726fc0f3129a560223463d31","target":"record","created_at":"2026-05-20T02:05:37Z","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":"c9b591c8cda0dc28b2a84936a36a30821fd296c8adc04e928ebb60340e0664b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-27T17:42:16Z","title_canon_sha256":"3bda29e12e3072a3a47d471410bb5d78e680b8d8cdbcc19cc18f4e38d9724b52"},"schema_version":"1.0","source":{"id":"2510.23573","kind":"arxiv","version":4}},"canonical_sha256":"008df2b6693fb72a05987c33850a3e572080bc6df2eeebafd4e5364bd836f269","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"008df2b6693fb72a05987c33850a3e572080bc6df2eeebafd4e5364bd836f269","first_computed_at":"2026-05-20T02:05:37.511543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:37.511543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gTn5+EwlARu0xtv8RzAyYnAQIj8z7AXBaAxhy+FHANlsael4V/u4EpvHc91JzMwwqAMajYHwvMonbQqRlzHTDA==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:37.512376Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.23573","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a581c23258b7cd609385f1f2d8a5690d533b2e726fc0f3129a560223463d31","sha256:9786f089e54ca7c2b06df73c346331541b41aa4459c79ac8158094e1923b7dba"],"state_sha256":"23b1f21c39c96c6ba8928c183928454126b5102680a2ecd453c193d5cb88faea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlSyDVPvR9L1eZdr+mM9qrWv6kdnuonYXtgAq63b+QobDI6eOdpSA4bSDizZ5ngUUyF7ThclSe8ot+lKw0IkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:21:12.701468Z","bundle_sha256":"6cf592631133158a5ec86e05a8bf304cb3bfd3b703f3cd969d1d2f30d817daaf"}}