{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FCO7EDN4ODCIAUGFBQK2ASINBZ","short_pith_number":"pith:FCO7EDN4","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"},"canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","source":{"kind":"arxiv","id":"1208.1052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1052","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1052v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1052","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"FCO7EDN4ODCI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCO7EDN4ODCIAUGF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCO7EDN4","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FCO7EDN4ODCIAUGFBQK2ASINBZ","target":"record","payload":{"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"},"canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","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"},"source_kind":"arxiv","source_id":"1208.1052","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-18T03:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dQtgt+uayJ/ARyCUH0YV2Zlj1VvQoknvdVSYkU7yQ+MlUnTBCoTU3hhFYFt5TDugQ9tutfLhNw4gl9Go8b9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:45:39.715239Z"},"content_sha256":"71681d4ec9407e7c4846d0e904762c5f45c001837b8e7921f9d4fc98983786c5","schema_version":"1.0","event_id":"sha256:71681d4ec9407e7c4846d0e904762c5f45c001837b8e7921f9d4fc98983786c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FCO7EDN4ODCIAUGFBQK2ASINBZ","target":"graph","payload":{"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"},"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-18T03:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7JCaPioLCwPHzsjrVDUF4daB0slBxwmX+zOXFZMTx3Ogl2K25/EJQNgrZIRo64Gpe0ZKpLncTbGJRXoGkErCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:45:39.715623Z"},"content_sha256":"1c7ca93d1608811c03d25942cb5a44b022f286494f72b95f71d78aaa9c181fcd","schema_version":"1.0","event_id":"sha256:1c7ca93d1608811c03d25942cb5a44b022f286494f72b95f71d78aaa9c181fcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/bundle.json","state_url":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/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-01T16:45:39Z","links":{"resolver":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ","bundle":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/bundle.json","state":"https://pith.science/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCO7EDN4ODCIAUGFBQK2ASINBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FCO7EDN4ODCIAUGFBQK2ASINBZ","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":"0a563bd2ba8120c5e08917ecef6be8bca24db57afb06961a1ebff6ec8184dfbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-05T21:33:06Z","title_canon_sha256":"c45c74a68b38c544205a3cb1239523dbc4dbfd56387c78803e5f651cb7172032"},"schema_version":"1.0","source":{"id":"1208.1052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1052","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1052v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1052","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"FCO7EDN4ODCI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCO7EDN4ODCIAUGF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCO7EDN4","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:1c7ca93d1608811c03d25942cb5a44b022f286494f72b95f71d78aaa9c181fcd","target":"graph","created_at":"2026-05-18T03:49:20Z","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":"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 ","authors_text":"Jeffrey Remmel, Matthew Hyatt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-05T21:33:06Z","title":"The classification of 231-avoiding permutations by descents and maximum drop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1052","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:71681d4ec9407e7c4846d0e904762c5f45c001837b8e7921f9d4fc98983786c5","target":"record","created_at":"2026-05-18T03:49:20Z","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":"0a563bd2ba8120c5e08917ecef6be8bca24db57afb06961a1ebff6ec8184dfbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-05T21:33:06Z","title_canon_sha256":"c45c74a68b38c544205a3cb1239523dbc4dbfd56387c78803e5f651cb7172032"},"schema_version":"1.0","source":{"id":"1208.1052","kind":"arxiv","version":1}},"canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"289df20dbc70c48050c50c15a0490d0e7b3886a5cc256217ef40789f8b95cfa7","first_computed_at":"2026-05-18T03:49:20.677155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.677155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMW1KW06VNXWNBwptVIgDCfnd5zSrWSdF6xbHsF3WMTnH3lltlW3ivE1/Ho/Uv5JAsILos/aNlQFS5LszrGbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.677839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71681d4ec9407e7c4846d0e904762c5f45c001837b8e7921f9d4fc98983786c5","sha256:1c7ca93d1608811c03d25942cb5a44b022f286494f72b95f71d78aaa9c181fcd"],"state_sha256":"4c31d6836efe9972e49274a0213feb43bcdaba54504431ef6c3c61599f42a409"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fa8heOR94Rv/iPw0DRoPSb82SbFmZWfGLU3umpOR17TZ5Hvh2bq2IYYhrRZ7ph75FHCZhm6Vp8hyyqcXfHdiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:45:39.717639Z","bundle_sha256":"71f5bbff26b1c9913f28eb499cc491f131810f1346e8423139b6adb92ac4f243"}}