{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O74FPSKJS6ZYOPOB7KJ76I6KET","short_pith_number":"pith:O74FPSKJ","canonical_record":{"source":{"id":"1905.05646","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-14T14:41:54Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ae613a5a868e93e4d3b19a10265235bd54716bd522f5386b38ed0c7981555d23","abstract_canon_sha256":"b720c35a46d929560bd2256bcdad54165d429e8bbb27a96959152ba89c5266aa"},"schema_version":"1.0"},"canonical_sha256":"77f857c94997b3873dc1fa93ff23ca24c0c14b9780925652804ca8cb50faacc5","source":{"kind":"arxiv","id":"1905.05646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05646","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05646v1","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05646","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"O74FPSKJS6ZY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O74FPSKJS6ZYOPOB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O74FPSKJ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O74FPSKJS6ZYOPOB7KJ76I6KET","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05646","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-14T14:41:54Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ae613a5a868e93e4d3b19a10265235bd54716bd522f5386b38ed0c7981555d23","abstract_canon_sha256":"b720c35a46d929560bd2256bcdad54165d429e8bbb27a96959152ba89c5266aa"},"schema_version":"1.0"},"canonical_sha256":"77f857c94997b3873dc1fa93ff23ca24c0c14b9780925652804ca8cb50faacc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:13.939865Z","signature_b64":"tt2xS0FOuvqIW1xzYzH5mO56qMAU69XAlo/d7Ay/7dw/gR0QnNPj1gM2C7RiSNQU7c/DY2qXuqBcOrWNS8ouAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77f857c94997b3873dc1fa93ff23ca24c0c14b9780925652804ca8cb50faacc5","last_reissued_at":"2026-05-17T23:46:13.939285Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:13.939285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05646","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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fy1M+YxhMbS6EYJ2RfEY1/RA8eK1PdV6MIcQrImZP53QM2TH/AYdeLisJSKQXKIhF8PrATUxD2L2/mXOFl9UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:40.855453Z"},"content_sha256":"0498c229fa3eed9b4b719e0957b980a02d7797571f63c7fc0b063b98afa044ea","schema_version":"1.0","event_id":"sha256:0498c229fa3eed9b4b719e0957b980a02d7797571f63c7fc0b063b98afa044ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O74FPSKJS6ZYOPOB7KJ76I6KET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alexander Roitershtein, Reza Rastegar, Toufik Mansour","submitted_at":"2019-05-14T14:41:54Z","abstract_excerpt":"The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given pattern $v$ exactly $r$ times. In addition, we study the asymptotic behavior of the random variable $X_n,$ the number of pattern occurrences in a random $n$-array word. The two topics are closely related through the identity $P(X_n=r) = $ $\\frac{1}{k^n}f_r^v(k,n).$ In particular, we show that for any $r\\geq 0,$ the Stanley-Wilf sequence $\\bigl(f_r^v(k,n)\\bigr)^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05646","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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7PnDyDiOU/J62TYHncgs+JEbzDYO5/0YgnzrgHBWN4PfBrN4kCF/OGK8+VooCvW3bzyJcrj9msLAOWeudhXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:40.855844Z"},"content_sha256":"a87903803d53f85692015a7f56b0ab7084e67bc32f466b017a52e00cd072e382","schema_version":"1.0","event_id":"sha256:a87903803d53f85692015a7f56b0ab7084e67bc32f466b017a52e00cd072e382"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/bundle.json","state_url":"https://pith.science/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/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-01T14:34:40Z","links":{"resolver":"https://pith.science/pith/O74FPSKJS6ZYOPOB7KJ76I6KET","bundle":"https://pith.science/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/bundle.json","state":"https://pith.science/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O74FPSKJS6ZYOPOB7KJ76I6KET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O74FPSKJS6ZYOPOB7KJ76I6KET","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":"b720c35a46d929560bd2256bcdad54165d429e8bbb27a96959152ba89c5266aa","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-14T14:41:54Z","title_canon_sha256":"ae613a5a868e93e4d3b19a10265235bd54716bd522f5386b38ed0c7981555d23"},"schema_version":"1.0","source":{"id":"1905.05646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05646","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05646v1","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05646","created_at":"2026-05-17T23:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"O74FPSKJS6ZY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O74FPSKJS6ZYOPOB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O74FPSKJ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:a87903803d53f85692015a7f56b0ab7084e67bc32f466b017a52e00cd072e382","target":"graph","created_at":"2026-05-17T23:46:13Z","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":"The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given pattern $v$ exactly $r$ times. In addition, we study the asymptotic behavior of the random variable $X_n,$ the number of pattern occurrences in a random $n$-array word. The two topics are closely related through the identity $P(X_n=r) = $ $\\frac{1}{k^n}f_r^v(k,n).$ In particular, we show that for any $r\\geq 0,$ the Stanley-Wilf sequence $\\bigl(f_r^v(k,n)\\bigr)^{","authors_text":"Alexander Roitershtein, Reza Rastegar, Toufik Mansour","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-14T14:41:54Z","title":"Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05646","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:0498c229fa3eed9b4b719e0957b980a02d7797571f63c7fc0b063b98afa044ea","target":"record","created_at":"2026-05-17T23:46:13Z","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":"b720c35a46d929560bd2256bcdad54165d429e8bbb27a96959152ba89c5266aa","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-14T14:41:54Z","title_canon_sha256":"ae613a5a868e93e4d3b19a10265235bd54716bd522f5386b38ed0c7981555d23"},"schema_version":"1.0","source":{"id":"1905.05646","kind":"arxiv","version":1}},"canonical_sha256":"77f857c94997b3873dc1fa93ff23ca24c0c14b9780925652804ca8cb50faacc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77f857c94997b3873dc1fa93ff23ca24c0c14b9780925652804ca8cb50faacc5","first_computed_at":"2026-05-17T23:46:13.939285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:13.939285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tt2xS0FOuvqIW1xzYzH5mO56qMAU69XAlo/d7Ay/7dw/gR0QnNPj1gM2C7RiSNQU7c/DY2qXuqBcOrWNS8ouAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:13.939865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0498c229fa3eed9b4b719e0957b980a02d7797571f63c7fc0b063b98afa044ea","sha256:a87903803d53f85692015a7f56b0ab7084e67bc32f466b017a52e00cd072e382"],"state_sha256":"894a4a7d826eeca89235a95747453d53d257be314ec957f258729fe23cb8194f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ngna7oFjF2yrSAphDKvxByUJYLxMe20SKdHDaXkRkDhhr77hwJjHcUUJQwLVXmFylzhymXnOWBCnB3zRlrkDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:34:40.858094Z","bundle_sha256":"a70fcecc6db5722233e68553060cc84edb615f02552a1955ad6a3f5de2a82e1b"}}