{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ALDIJKERTZ65RJ2CBOAIZXSES2","short_pith_number":"pith:ALDIJKER","schema_version":"1.0","canonical_sha256":"02c684a8919e7dd8a7420b808cde4496be92e59a6beee77bab7c94d0d9d896d3","source":{"kind":"arxiv","id":"1505.04078","version":1},"attestation_state":"computed","paper":{"title":"Pattern-avoiding alternating words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emma L.L. Gao, Philip B. Zhang, Sergey Kitaev","submitted_at":"2015-05-15T14:49:49Z","abstract_excerpt":"A word $w=w_1w_2\\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\\cdots$ (when the word is up-down) or $w_1>w_2<w_3>w_4<\\cdots$ (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 123-avoiding up-down words of even length is given by the Narayana numbers, which is also the case, shown by us bijectively, with 132-avoiding up-down words of even length. We also give formulas for enumerating a"},"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":"1505.04078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-15T14:49:49Z","cross_cats_sorted":[],"title_canon_sha256":"87439bfc88992c75066b324067a2204f854005f680dedf1d1092591e82d10d83","abstract_canon_sha256":"9110b2d0281943a747f026de8729201c782a612a26dad49f75e7dd5a566ef6f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:40.199489Z","signature_b64":"bUkr0impSmPI26/9dG9RtuAJPeUWhw0rdnN+VXvEPFU6MHZUjBKEbcbENHIhbLIQdU/6L3IiGJK7Y5v+qGdoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02c684a8919e7dd8a7420b808cde4496be92e59a6beee77bab7c94d0d9d896d3","last_reissued_at":"2026-05-18T02:09:40.198848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:40.198848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern-avoiding alternating words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emma L.L. Gao, Philip B. Zhang, Sergey Kitaev","submitted_at":"2015-05-15T14:49:49Z","abstract_excerpt":"A word $w=w_1w_2\\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\\cdots$ (when the word is up-down) or $w_1>w_2<w_3>w_4<\\cdots$ (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 123-avoiding up-down words of even length is given by the Narayana numbers, which is also the case, shown by us bijectively, with 132-avoiding up-down words of even length. We also give formulas for enumerating a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04078","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":"1505.04078","created_at":"2026-05-18T02:09:40.198952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04078v1","created_at":"2026-05-18T02:09:40.198952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04078","created_at":"2026-05-18T02:09:40.198952+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALDIJKERTZ65","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALDIJKERTZ65RJ2C","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALDIJKER","created_at":"2026-05-18T12:29:10.953037+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/ALDIJKERTZ65RJ2CBOAIZXSES2","json":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2.json","graph_json":"https://pith.science/api/pith-number/ALDIJKERTZ65RJ2CBOAIZXSES2/graph.json","events_json":"https://pith.science/api/pith-number/ALDIJKERTZ65RJ2CBOAIZXSES2/events.json","paper":"https://pith.science/paper/ALDIJKER"},"agent_actions":{"view_html":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2","download_json":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2.json","view_paper":"https://pith.science/paper/ALDIJKER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04078&json=true","fetch_graph":"https://pith.science/api/pith-number/ALDIJKERTZ65RJ2CBOAIZXSES2/graph.json","fetch_events":"https://pith.science/api/pith-number/ALDIJKERTZ65RJ2CBOAIZXSES2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2/action/storage_attestation","attest_author":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2/action/author_attestation","sign_citation":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2/action/citation_signature","submit_replication":"https://pith.science/pith/ALDIJKERTZ65RJ2CBOAIZXSES2/action/replication_record"}},"created_at":"2026-05-18T02:09:40.198952+00:00","updated_at":"2026-05-18T02:09:40.198952+00:00"}