{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UQLJOQYE5HD4ZSA7OZJQQHAQHK","short_pith_number":"pith:UQLJOQYE","schema_version":"1.0","canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","source":{"kind":"arxiv","id":"1805.06077","version":2},"attestation_state":"computed","paper":{"title":"Increasing Consecutive Patterns in Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Mingjia Yang","submitted_at":"2018-05-16T00:48:42Z","abstract_excerpt":"We show how to enumerate words in $1^{m_1} \\dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \\dots r$ for any $r \\geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \\dots n^s$, avoiding the consecutive pattern $1\\dots r$, for any $s$, and any $r$. This enables us to supply many more terms to quite a few OEIS sequences, and create new ones. We also treat the more general case of counting words with a specified number of the pattern of interest (the avoiding case corresponding to zero appearances). This article is accompanied by three Maple packages i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.06077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-16T00:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"ad2135390f892c6d09a54757d349f907d4e6090a87167cacdf727ccdffe8939a","abstract_canon_sha256":"095ca763dd2a841e4059fa8ebc1b1cba9ad519517d8079aa9117f3ec557de0cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:27.447079Z","signature_b64":"YKpBfSIFyITooYK4aruH39/kTKks2X3T0eMdzqRxNA6Uw3I4PGx5B9ifHtinpz/dHzaqlaDpZ7k9A8yJWHoWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","last_reissued_at":"2026-05-18T00:15:27.446286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:27.446286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing Consecutive Patterns in Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doron Zeilberger, Mingjia Yang","submitted_at":"2018-05-16T00:48:42Z","abstract_excerpt":"We show how to enumerate words in $1^{m_1} \\dots n^{m_n}$ that avoid the increasing consecutive pattern $12 \\dots r$ for any $r \\geq 2$. Our approach yields an $O(n^{s+1})$ algorithm to enumerate words in $1^s \\dots n^s$, avoiding the consecutive pattern $1\\dots r$, for any $s$, and any $r$. This enables us to supply many more terms to quite a few OEIS sequences, and create new ones. We also treat the more general case of counting words with a specified number of the pattern of interest (the avoiding case corresponding to zero appearances). This article is accompanied by three Maple packages i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06077","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.06077","created_at":"2026-05-18T00:15:27.446423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06077v2","created_at":"2026-05-18T00:15:27.446423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06077","created_at":"2026-05-18T00:15:27.446423+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQLJOQYE5HD4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQLJOQYE5HD4ZSA7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQLJOQYE","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK","json":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK.json","graph_json":"https://pith.science/api/pith-number/UQLJOQYE5HD4ZSA7OZJQQHAQHK/graph.json","events_json":"https://pith.science/api/pith-number/UQLJOQYE5HD4ZSA7OZJQQHAQHK/events.json","paper":"https://pith.science/paper/UQLJOQYE"},"agent_actions":{"view_html":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK","download_json":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK.json","view_paper":"https://pith.science/paper/UQLJOQYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06077&json=true","fetch_graph":"https://pith.science/api/pith-number/UQLJOQYE5HD4ZSA7OZJQQHAQHK/graph.json","fetch_events":"https://pith.science/api/pith-number/UQLJOQYE5HD4ZSA7OZJQQHAQHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/action/storage_attestation","attest_author":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/action/author_attestation","sign_citation":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/action/citation_signature","submit_replication":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/action/replication_record"}},"created_at":"2026-05-18T00:15:27.446423+00:00","updated_at":"2026-05-18T00:15:27.446423+00:00"}