{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KADWPMG3PVNLX2XVRJG7NFQP6Q","short_pith_number":"pith:KADWPMG3","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"},"canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","source":{"kind":"arxiv","id":"1712.08662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08662","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08662v1","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08662","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"KADWPMG3PVNL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KADWPMG3PVNLX2XV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KADWPMG3","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KADWPMG3PVNLX2XVRJG7NFQP6Q","target":"record","payload":{"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"},"canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","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"},"source_kind":"arxiv","source_id":"1712.08662","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-18T00:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2RHrKoPebRWYngMXMo/ssLWoOBCy69wL7nD/FcQAYoIx4hOScQPjsJB8YYJptuzSwion+gBv2YtC7kTYCMOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:39:29.584560Z"},"content_sha256":"ab1142f0bc5262db8fe20a50cbb39dc894b356fd3546b6936e891edf5b360d81","schema_version":"1.0","event_id":"sha256:ab1142f0bc5262db8fe20a50cbb39dc894b356fd3546b6936e891edf5b360d81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KADWPMG3PVNLX2XVRJG7NFQP6Q","target":"graph","payload":{"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"},"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:27:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wf90m08GjWn1TzCd1CcQENqdfIbnVrNav4OO+bhSYNqf4MVOsDSdzJ1QqvrSo8Lxt9j/SL8SJVm+3GJA/TngDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:39:29.584924Z"},"content_sha256":"cb6aada12060dadfd2f9e6651389a1de9d86eb185043b79ecdce38e3f00cfc82","schema_version":"1.0","event_id":"sha256:cb6aada12060dadfd2f9e6651389a1de9d86eb185043b79ecdce38e3f00cfc82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/bundle.json","state_url":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/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-22T06:39:29Z","links":{"resolver":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q","bundle":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/bundle.json","state":"https://pith.science/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KADWPMG3PVNLX2XVRJG7NFQP6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KADWPMG3PVNLX2XVRJG7NFQP6Q","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":"cd54d8a3ef7988aafbb1fc14995773bb8f9d2163b071ab369e97a3073d44283c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T21:16:00Z","title_canon_sha256":"dd1cb45543cecec3231ac0267dae73889a48e677ba291bd0f50418f373cb3140"},"schema_version":"1.0","source":{"id":"1712.08662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08662","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08662v1","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08662","created_at":"2026-05-18T00:27:17Z"},{"alias_kind":"pith_short_12","alias_value":"KADWPMG3PVNL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KADWPMG3PVNLX2XV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KADWPMG3","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:cb6aada12060dadfd2f9e6651389a1de9d86eb185043b79ecdce38e3f00cfc82","target":"graph","created_at":"2026-05-18T00:27:17Z","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":"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","authors_text":"Mingjia Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T21:16:00Z","title":"Enumeration of words that contain the pattern 123 exactly once"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08662","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:ab1142f0bc5262db8fe20a50cbb39dc894b356fd3546b6936e891edf5b360d81","target":"record","created_at":"2026-05-18T00:27:17Z","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":"cd54d8a3ef7988aafbb1fc14995773bb8f9d2163b071ab369e97a3073d44283c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-22T21:16:00Z","title_canon_sha256":"dd1cb45543cecec3231ac0267dae73889a48e677ba291bd0f50418f373cb3140"},"schema_version":"1.0","source":{"id":"1712.08662","kind":"arxiv","version":1}},"canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"500767b0db7d5abbeaf58a4df6960ff40f5c59075de2f2299a6213ca2f5e63c8","first_computed_at":"2026-05-18T00:27:17.084370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:17.084370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+1WpspLkZBg7ddQU0iZcHaLPpkvepTTbhFBQwFdBIFoQmt0RxGRN4nLpNjOoYuHMlPIMQypKZt8TGeO4makjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:17.084773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1142f0bc5262db8fe20a50cbb39dc894b356fd3546b6936e891edf5b360d81","sha256:cb6aada12060dadfd2f9e6651389a1de9d86eb185043b79ecdce38e3f00cfc82"],"state_sha256":"594be46aabb7267d82e83fefb36bbacb7c7a7a12adc22a603de651146e4fc072"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnb2+vPVrsXwHyUJwsUothUPj5DPGaM5gl8/ZEo489UvzvHhKdCWb2qz5dn+x14IJS9XFMbX3vAeeV5PqPzQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T06:39:29.586949Z","bundle_sha256":"37cbc424a65bcc23ffcbce79778a55bbe05db0e17733b5cf0e9e70b5fe6d372f"}}