{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UQLJOQYE5HD4ZSA7OZJQQHAQHK","short_pith_number":"pith:UQLJOQYE","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"},"canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","source":{"kind":"arxiv","id":"1805.06077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06077","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06077v2","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06077","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"UQLJOQYE5HD4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQLJOQYE5HD4ZSA7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQLJOQYE","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UQLJOQYE5HD4ZSA7OZJQQHAQHK","target":"record","payload":{"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"},"canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","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"},"source_kind":"arxiv","source_id":"1805.06077","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-18T00:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeXm6YAZWGr1o9Ga9XQoNgF7hBrPIShQQycRwksZArQNJPvgi9sIJPN/DmuuLFLBFvvSsuz4bbww161Zh+eEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:32:24.758059Z"},"content_sha256":"2d1f8d3795107a69662edad062c07f420cee63e19fdc1066e003391dad6a520c","schema_version":"1.0","event_id":"sha256:2d1f8d3795107a69662edad062c07f420cee63e19fdc1066e003391dad6a520c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UQLJOQYE5HD4ZSA7OZJQQHAQHK","target":"graph","payload":{"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"},"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-18T00:15:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYY36LWRmdpQQb/l0kcmglR8G06IeDLmqqEcqg9xWZd4g0Lo+80Vx6azqkhBd86sR1CydSrk/lqNMJnAqAuxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:32:24.758427Z"},"content_sha256":"dcbe6111cfa5061a091fcbddca48bf5fd3bc9420ce779d387b4e434e62e94456","schema_version":"1.0","event_id":"sha256:dcbe6111cfa5061a091fcbddca48bf5fd3bc9420ce779d387b4e434e62e94456"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/bundle.json","state_url":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/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-22T04:32:24Z","links":{"resolver":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK","bundle":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/bundle.json","state":"https://pith.science/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQLJOQYE5HD4ZSA7OZJQQHAQHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQLJOQYE5HD4ZSA7OZJQQHAQHK","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":"095ca763dd2a841e4059fa8ebc1b1cba9ad519517d8079aa9117f3ec557de0cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-16T00:48:42Z","title_canon_sha256":"ad2135390f892c6d09a54757d349f907d4e6090a87167cacdf727ccdffe8939a"},"schema_version":"1.0","source":{"id":"1805.06077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06077","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06077v2","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06077","created_at":"2026-05-18T00:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"UQLJOQYE5HD4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQLJOQYE5HD4ZSA7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQLJOQYE","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:dcbe6111cfa5061a091fcbddca48bf5fd3bc9420ce779d387b4e434e62e94456","target":"graph","created_at":"2026-05-18T00:15:27Z","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 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","authors_text":"Doron Zeilberger, Mingjia Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-16T00:48:42Z","title":"Increasing Consecutive Patterns in Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06077","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:2d1f8d3795107a69662edad062c07f420cee63e19fdc1066e003391dad6a520c","target":"record","created_at":"2026-05-18T00:15:27Z","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":"095ca763dd2a841e4059fa8ebc1b1cba9ad519517d8079aa9117f3ec557de0cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-16T00:48:42Z","title_canon_sha256":"ad2135390f892c6d09a54757d349f907d4e6090a87167cacdf727ccdffe8939a"},"schema_version":"1.0","source":{"id":"1805.06077","kind":"arxiv","version":2}},"canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a416974304e9c7ccc81f7653081c103ab6b3ea5a19fcdc0d33e8945d824501c3","first_computed_at":"2026-05-18T00:15:27.446286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:27.446286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YKpBfSIFyITooYK4aruH39/kTKks2X3T0eMdzqRxNA6Uw3I4PGx5B9ifHtinpz/dHzaqlaDpZ7k9A8yJWHoWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:27.447079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d1f8d3795107a69662edad062c07f420cee63e19fdc1066e003391dad6a520c","sha256:dcbe6111cfa5061a091fcbddca48bf5fd3bc9420ce779d387b4e434e62e94456"],"state_sha256":"3a1fb5770a183cc65d2f47bb42ff63a5dadf0dee969dbed8eca491281496520b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ckVs8tNXaWzzY0zQYn+T5TrJROK430frkS7pQ85eLhmFCcn0JnsbJw7PZl7JWIUHKxYn9sii5YP610Ty211Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:32:24.760386Z","bundle_sha256":"65a687e90621c77ce31d471de1ebfba93fa9eb9d3e67501b346a493b477ae5c7"}}