{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PHFMCFE376IBRD5WZLJNZBV634","short_pith_number":"pith:PHFMCFE3","canonical_record":{"source":{"id":"1208.1075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-06T03:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"9ad9199b173444dc84a7fc9fd5d9735292c15c95875b477aa5337a68ff5f1aff","abstract_canon_sha256":"7f55e4ee24f1eecbd2961a51fca67f9c68f7a89386dee58c31bfb62fff66eee0"},"schema_version":"1.0"},"canonical_sha256":"79cac1149bff90188fb6cad2dc86bedf019bd46659cb8a6373d1f607c2fccb2d","source":{"kind":"arxiv","id":"1208.1075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1075","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1075v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1075","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"PHFMCFE376IB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PHFMCFE376IBRD5W","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PHFMCFE3","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PHFMCFE376IBRD5WZLJNZBV634","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-06T03:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"9ad9199b173444dc84a7fc9fd5d9735292c15c95875b477aa5337a68ff5f1aff","abstract_canon_sha256":"7f55e4ee24f1eecbd2961a51fca67f9c68f7a89386dee58c31bfb62fff66eee0"},"schema_version":"1.0"},"canonical_sha256":"79cac1149bff90188fb6cad2dc86bedf019bd46659cb8a6373d1f607c2fccb2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.646544Z","signature_b64":"NxtwoxWOAPLIa3cMXFQBXKPqQMm4V5+YGA5Vt4vrLD/7BRCAHI9RT3mmOFNZj24wzVaXI6G3PnM+JRBl8pA0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cac1149bff90188fb6cad2dc86bedf019bd46659cb8a6373d1f607c2fccb2d","last_reissued_at":"2026-05-18T03:49:20.645769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.645769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1075","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":"04p+7RLqINgg4k3mc1VF6TsIANZRmZJ1haaU2/jja4GNcMUfOb+GAJv6iKe5WBZ+sJVnsP7x26NPXSnmeKz2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:27:58.723824Z"},"content_sha256":"542f9befeebb6a68ff5ce090307ec89ae68accc39d5db2d37855db66030e5a83","schema_version":"1.0","event_id":"sha256:542f9befeebb6a68ff5ce090307ec89ae68accc39d5db2d37855db66030e5a83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PHFMCFE376IBRD5WZLJNZBV634","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial bijections from hatted avoiding permutations in $S_n(132)$ to generalized Dyck and Motzkin paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dominique Rossin, Phan Thuan Do, Thi Thu Huong Tran","submitted_at":"2012-08-06T03:11:54Z","abstract_excerpt":"We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to barred pattern. We prove that Dyck paths with no peak at height $p$, Dyck paths with no $ud... du$ and Motzkin paths are counted by hatted pattern avoiding permutations in $\\s_n(132)$ by showing explicit bijections. As a result, a new direct bijection between Motzkin paths and permutations in $\\s_n(132)$ without two consecutive adjacent numbers is given. These p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1075","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":"MaFKF7MsW1Uol7MhR75j/4qGtwyFIJ/p8kiIiashpoXy5pavioTh5FOJ2HpwaleUVSHPE767AthdRs3S8IYcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:27:58.724167Z"},"content_sha256":"5c91ab0ff412731fd4eadcd28578d4fba9c7b9af8ab69188bac702ee3c62ecf6","schema_version":"1.0","event_id":"sha256:5c91ab0ff412731fd4eadcd28578d4fba9c7b9af8ab69188bac702ee3c62ecf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHFMCFE376IBRD5WZLJNZBV634/bundle.json","state_url":"https://pith.science/pith/PHFMCFE376IBRD5WZLJNZBV634/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHFMCFE376IBRD5WZLJNZBV634/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-02T17:27:58Z","links":{"resolver":"https://pith.science/pith/PHFMCFE376IBRD5WZLJNZBV634","bundle":"https://pith.science/pith/PHFMCFE376IBRD5WZLJNZBV634/bundle.json","state":"https://pith.science/pith/PHFMCFE376IBRD5WZLJNZBV634/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHFMCFE376IBRD5WZLJNZBV634/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PHFMCFE376IBRD5WZLJNZBV634","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":"7f55e4ee24f1eecbd2961a51fca67f9c68f7a89386dee58c31bfb62fff66eee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-06T03:11:54Z","title_canon_sha256":"9ad9199b173444dc84a7fc9fd5d9735292c15c95875b477aa5337a68ff5f1aff"},"schema_version":"1.0","source":{"id":"1208.1075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1075","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1075v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1075","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"PHFMCFE376IB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PHFMCFE376IBRD5W","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PHFMCFE3","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:5c91ab0ff412731fd4eadcd28578d4fba9c7b9af8ab69188bac702ee3c62ecf6","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 introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to barred pattern. We prove that Dyck paths with no peak at height $p$, Dyck paths with no $ud... du$ and Motzkin paths are counted by hatted pattern avoiding permutations in $\\s_n(132)$ by showing explicit bijections. As a result, a new direct bijection between Motzkin paths and permutations in $\\s_n(132)$ without two consecutive adjacent numbers is given. These p","authors_text":"Dominique Rossin, Phan Thuan Do, Thi Thu Huong Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-06T03:11:54Z","title":"Combinatorial bijections from hatted avoiding permutations in $S_n(132)$ to generalized Dyck and Motzkin paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1075","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:542f9befeebb6a68ff5ce090307ec89ae68accc39d5db2d37855db66030e5a83","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":"7f55e4ee24f1eecbd2961a51fca67f9c68f7a89386dee58c31bfb62fff66eee0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-06T03:11:54Z","title_canon_sha256":"9ad9199b173444dc84a7fc9fd5d9735292c15c95875b477aa5337a68ff5f1aff"},"schema_version":"1.0","source":{"id":"1208.1075","kind":"arxiv","version":1}},"canonical_sha256":"79cac1149bff90188fb6cad2dc86bedf019bd46659cb8a6373d1f607c2fccb2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79cac1149bff90188fb6cad2dc86bedf019bd46659cb8a6373d1f607c2fccb2d","first_computed_at":"2026-05-18T03:49:20.645769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.645769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NxtwoxWOAPLIa3cMXFQBXKPqQMm4V5+YGA5Vt4vrLD/7BRCAHI9RT3mmOFNZj24wzVaXI6G3PnM+JRBl8pA0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.646544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:542f9befeebb6a68ff5ce090307ec89ae68accc39d5db2d37855db66030e5a83","sha256:5c91ab0ff412731fd4eadcd28578d4fba9c7b9af8ab69188bac702ee3c62ecf6"],"state_sha256":"77d9a6f732c2d57b89a2c9cdbf42b80fab21b07587a1fb73362a62aa73b84016"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GVfEjFixBQb/GlQiB8H/rmAetKB9bFw1B4DtfqRZOIVEOosC3QaRO5FhH3NpT+/AeqnG8Q7z5LX/GtKE17ABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:27:58.726096Z","bundle_sha256":"63742b28625ac8c124076bf2bf3930bea7218acb13a4cd298e1353e79f0e23f1"}}