{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YH5W2R346PQWYA65GUUI3EOH7U","short_pith_number":"pith:YH5W2R34","canonical_record":{"source":{"id":"1010.5673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T12:34:58Z","cross_cats_sorted":[],"title_canon_sha256":"dd617e6a906d56f07a99414c1215d70ae5da8023a16b308155f7b687f85ed0f6","abstract_canon_sha256":"299bb4f2cd4ce4133e831e0ed5f18c023356e5846e6ff5a85c6e51340f5046c9"},"schema_version":"1.0"},"canonical_sha256":"c1fb6d477cf3e16c03dd35288d91c7fd2435fa7093c5c8b71f75e57216e5ab70","source":{"kind":"arxiv","id":"1010.5673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5673","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5673v1","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5673","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"YH5W2R346PQW","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YH5W2R346PQWYA65","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YH5W2R34","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YH5W2R346PQWYA65GUUI3EOH7U","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T12:34:58Z","cross_cats_sorted":[],"title_canon_sha256":"dd617e6a906d56f07a99414c1215d70ae5da8023a16b308155f7b687f85ed0f6","abstract_canon_sha256":"299bb4f2cd4ce4133e831e0ed5f18c023356e5846e6ff5a85c6e51340f5046c9"},"schema_version":"1.0"},"canonical_sha256":"c1fb6d477cf3e16c03dd35288d91c7fd2435fa7093c5c8b71f75e57216e5ab70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:16.186472Z","signature_b64":"i7hW3YssofhcOtLmIbEHfksA70zNp5oDIpFXmGlOTJGYzpFpqfAZ40g2eG5lXnn93osbFvNyDDYFECSGFFm8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1fb6d477cf3e16c03dd35288d91c7fd2435fa7093c5c8b71f75e57216e5ab70","last_reissued_at":"2026-05-18T04:38:16.185930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:16.185930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5673","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-18T04:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwGoK5yUrRWDRFFPqq+boPL/JyFsnQ+Kui++EJPGkrzodT0ftTQt6WT49heUmgMWoKoInha8ptZDYI4WzfwACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:46.461816Z"},"content_sha256":"3010a5754c0ac6fe8558331d3b4179ae6870834fad3928f07c0ba437a9e41100","schema_version":"1.0","event_id":"sha256:3010a5754c0ac6fe8558331d3b4179ae6870834fad3928f07c0ba437a9e41100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YH5W2R346PQWYA65GUUI3EOH7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exterior Pairs and Up Step Statistics on Dyck Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sen-Peng Eu, Tung-Shan Fu","submitted_at":"2010-10-27T12:34:58Z","abstract_excerpt":"Let $\\C_n$ be the set of Dyck paths of length $n$. In this paper, by a new automorphism of ordered trees, we prove that the statistic `number of exterior pairs', introduced by A. Denise and R. Simion, on the set $\\C_n$ is equidistributed with the statistic `number of up steps at height $h$ with $h\\equiv 0$ (mod 3)'. Moreover, for $m\\ge 3$, we prove that the two statistics `number of up steps at height $h$ with $h\\equiv 0$ (mod $m$)' and `number of up steps at height $h$ with $h\\equiv m-1$ (mod $m$)' on the set $\\C_n$ are `almost equidistributed'. Both results are proved combinatorially."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5673","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-18T04:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kmYrbnFK5+rqU3wH15ymJueeocaCHK+o9XS2SN1lM7KUJsQf9hQqKJv9wgVxlkB1njWYpyZV+xublr8ODqoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:46.462433Z"},"content_sha256":"7733b2c04a1dd53bd1a0ff4943c77333e8e59929a8973acd4daf56a83b0d57ee","schema_version":"1.0","event_id":"sha256:7733b2c04a1dd53bd1a0ff4943c77333e8e59929a8973acd4daf56a83b0d57ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YH5W2R346PQWYA65GUUI3EOH7U/bundle.json","state_url":"https://pith.science/pith/YH5W2R346PQWYA65GUUI3EOH7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YH5W2R346PQWYA65GUUI3EOH7U/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-05-26T11:49:46Z","links":{"resolver":"https://pith.science/pith/YH5W2R346PQWYA65GUUI3EOH7U","bundle":"https://pith.science/pith/YH5W2R346PQWYA65GUUI3EOH7U/bundle.json","state":"https://pith.science/pith/YH5W2R346PQWYA65GUUI3EOH7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YH5W2R346PQWYA65GUUI3EOH7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YH5W2R346PQWYA65GUUI3EOH7U","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":"299bb4f2cd4ce4133e831e0ed5f18c023356e5846e6ff5a85c6e51340f5046c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T12:34:58Z","title_canon_sha256":"dd617e6a906d56f07a99414c1215d70ae5da8023a16b308155f7b687f85ed0f6"},"schema_version":"1.0","source":{"id":"1010.5673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5673","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5673v1","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5673","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"YH5W2R346PQW","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YH5W2R346PQWYA65","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YH5W2R34","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:7733b2c04a1dd53bd1a0ff4943c77333e8e59929a8973acd4daf56a83b0d57ee","target":"graph","created_at":"2026-05-18T04:38:16Z","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":"Let $\\C_n$ be the set of Dyck paths of length $n$. In this paper, by a new automorphism of ordered trees, we prove that the statistic `number of exterior pairs', introduced by A. Denise and R. Simion, on the set $\\C_n$ is equidistributed with the statistic `number of up steps at height $h$ with $h\\equiv 0$ (mod 3)'. Moreover, for $m\\ge 3$, we prove that the two statistics `number of up steps at height $h$ with $h\\equiv 0$ (mod $m$)' and `number of up steps at height $h$ with $h\\equiv m-1$ (mod $m$)' on the set $\\C_n$ are `almost equidistributed'. Both results are proved combinatorially.","authors_text":"Sen-Peng Eu, Tung-Shan Fu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T12:34:58Z","title":"Exterior Pairs and Up Step Statistics on Dyck Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5673","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:3010a5754c0ac6fe8558331d3b4179ae6870834fad3928f07c0ba437a9e41100","target":"record","created_at":"2026-05-18T04:38:16Z","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":"299bb4f2cd4ce4133e831e0ed5f18c023356e5846e6ff5a85c6e51340f5046c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-27T12:34:58Z","title_canon_sha256":"dd617e6a906d56f07a99414c1215d70ae5da8023a16b308155f7b687f85ed0f6"},"schema_version":"1.0","source":{"id":"1010.5673","kind":"arxiv","version":1}},"canonical_sha256":"c1fb6d477cf3e16c03dd35288d91c7fd2435fa7093c5c8b71f75e57216e5ab70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1fb6d477cf3e16c03dd35288d91c7fd2435fa7093c5c8b71f75e57216e5ab70","first_computed_at":"2026-05-18T04:38:16.185930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:16.185930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i7hW3YssofhcOtLmIbEHfksA70zNp5oDIpFXmGlOTJGYzpFpqfAZ40g2eG5lXnn93osbFvNyDDYFECSGFFm8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:16.186472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3010a5754c0ac6fe8558331d3b4179ae6870834fad3928f07c0ba437a9e41100","sha256:7733b2c04a1dd53bd1a0ff4943c77333e8e59929a8973acd4daf56a83b0d57ee"],"state_sha256":"68ae6572f1ca87a0e5656f86e2216de31343ffe4134fbd769e962bc4f03d25f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jAyfOJlq+Os/Azuy6M2b08xb6uuDskbXvSdsyjU+bTDYgd+1JeMU2/Cjp5G5WddZEnd9WjolEm9rT2gcsOpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:49:46.464704Z","bundle_sha256":"5ca525d78712e361c3a45527f44b725d3c137ad9f97352cd19156a4d81bf8e90"}}