{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FCO7EDN4ODCIAUGFBQK2ASINBZ","short_pith_number":"pith:FCO7EDN4","schema_version":"1.0","canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","source":{"kind":"arxiv","id":"1208.1052","version":1},"attestation_state":"computed","paper":{"title":"The classification of 231-avoiding permutations by descents and maximum drop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Remmel, Matthew Hyatt","submitted_at":"2012-08-05T21:33:06Z","abstract_excerpt":"We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$ with $n-j$ peaks and height $\\leq k+1$, and the number of ordered trees with $n$ edges, $j+1$ internal nodes, and of height $\\leq k+1$. We show that the generating functions for the $a_{n,231,j}^{(k)}$s with $k$ fixed satisfy a simple recursion. We also use the combinatorics of ordered trees to prove new explicit formulas for $a_{n,231,j}^{(k)}$ as a function "},"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":"1208.1052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-05T21:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"c45c74a68b38c544205a3cb1239523dbc4dbfd56387c78803e5f651cb7172032","abstract_canon_sha256":"0a563bd2ba8120c5e08917ecef6be8bca24db57afb06961a1ebff6ec8184dfbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.677839Z","signature_b64":"QMW1KW06VNXWNBwptVIgDCfnd5zSrWSdF6xbHsF3WMTnH3lltlW3ivE1/Ho/Uv5JAsILos/aNlQFS5LszrGbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","last_reissued_at":"2026-05-18T03:49:20.677155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.677155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The classification of 231-avoiding permutations by descents and maximum drop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Remmel, Matthew Hyatt","submitted_at":"2012-08-05T21:33:06Z","abstract_excerpt":"We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$ with $n-j$ peaks and height $\\leq k+1$, and the number of ordered trees with $n$ edges, $j+1$ internal nodes, and of height $\\leq k+1$. We show that the generating functions for the $a_{n,231,j}^{(k)}$s with $k$ fixed satisfy a simple recursion. We also use the combinatorics of ordered trees to prove new explicit formulas for $a_{n,231,j}^{(k)}$ as a function "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1052","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":"1208.1052","created_at":"2026-05-18T03:49:20.677240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1052v1","created_at":"2026-05-18T03:49:20.677240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1052","created_at":"2026-05-18T03:49:20.677240+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCO7EDN4ODCI","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCO7EDN4ODCIAUGF","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCO7EDN4","created_at":"2026-05-18T12:27:06.952714+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/FCO7EDN4ODCIAUGFBQK2ASINBZ","json":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ.json","graph_json":"https://pith.science/api/pith-number/FCO7EDN4ODCIAUGFBQK2ASINBZ/graph.json","events_json":"https://pith.science/api/pith-number/FCO7EDN4ODCIAUGFBQK2ASINBZ/events.json","paper":"https://pith.science/paper/FCO7EDN4"},"agent_actions":{"view_html":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ","download_json":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ.json","view_paper":"https://pith.science/paper/FCO7EDN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1052&json=true","fetch_graph":"https://pith.science/api/pith-number/FCO7EDN4ODCIAUGFBQK2ASINBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FCO7EDN4ODCIAUGFBQK2ASINBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/action/storage_attestation","attest_author":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/action/author_attestation","sign_citation":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/action/citation_signature","submit_replication":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/action/replication_record"}},"created_at":"2026-05-18T03:49:20.677240+00:00","updated_at":"2026-05-18T03:49:20.677240+00:00"}