{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KADWPMG3PVNLX2XVRJG7NFQP6Q","short_pith_number":"pith:KADWPMG3","schema_version":"1.0","canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","source":{"kind":"arxiv","id":"1712.08662","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of words that contain the pattern 123 exactly once","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mingjia Yang","submitted_at":"2017-12-22T21:16:00Z","abstract_excerpt":"Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly once is new and will be the focus of this paper. Previously, Doron Zeilberger provided a shortened version of Alexander Burstein's combinatorial proof of John Noonan's theorem that the number of permutations with exactly one $321$ pattern is equal to $\\frac{3}{n} \\binom{2n}{n+3}$. Surprisingly, a similar method can be directly adapted to words. We are able t"},"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":"1712.08662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T21:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd1cb45543cecec3231ac0267dae73889a48e677ba291bd0f50418f373cb3140","abstract_canon_sha256":"cd54d8a3ef7988aafbb1fc14995773bb8f9d2163b071ab369e97a3073d44283c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:17.084773Z","signature_b64":"+1WpspLkZBg7ddQU0iZcHaLPpkvepTTbhFBQwFdBIFoQmt0RxGRN4nLpNjOoYuHMlPIMQypKZt8TGeO4makjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","last_reissued_at":"2026-05-18T00:27:17.084370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:17.084370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of words that contain the pattern 123 exactly once","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mingjia Yang","submitted_at":"2017-12-22T21:16:00Z","abstract_excerpt":"Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly once is new and will be the focus of this paper. Previously, Doron Zeilberger provided a shortened version of Alexander Burstein's combinatorial proof of John Noonan's theorem that the number of permutations with exactly one $321$ pattern is equal to $\\frac{3}{n} \\binom{2n}{n+3}$. Surprisingly, a similar method can be directly adapted to words. We are able t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08662","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.08662","created_at":"2026-05-18T00:27:17.084427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08662v1","created_at":"2026-05-18T00:27:17.084427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08662","created_at":"2026-05-18T00:27:17.084427+00:00"},{"alias_kind":"pith_short_12","alias_value":"KADWPMG3PVNL","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KADWPMG3PVNLX2XV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KADWPMG3","created_at":"2026-05-18T12:31:24.725408+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/KADWPMG3PVNLX2XVRJG7NFQP6Q","json":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q.json","graph_json":"https://pith.science/api/pith-number/KADWPMG3PVNLX2XVRJG7NFQP6Q/graph.json","events_json":"https://pith.science/api/pith-number/KADWPMG3PVNLX2XVRJG7NFQP6Q/events.json","paper":"https://pith.science/paper/KADWPMG3"},"agent_actions":{"view_html":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q","download_json":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q.json","view_paper":"https://pith.science/paper/KADWPMG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08662&json=true","fetch_graph":"https://pith.science/api/pith-number/KADWPMG3PVNLX2XVRJG7NFQP6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/KADWPMG3PVNLX2XVRJG7NFQP6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/action/storage_attestation","attest_author":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/action/author_attestation","sign_citation":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/action/citation_signature","submit_replication":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/action/replication_record"}},"created_at":"2026-05-18T00:27:17.084427+00:00","updated_at":"2026-05-18T00:27:17.084427+00:00"}