{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZGQKTY6TFWWBVTNNTPWPUC6ECT","short_pith_number":"pith:ZGQKTY6T","canonical_record":{"source":{"id":"1010.6261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T16:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"f9418986b8496b944b7807b145c3e16953647b0d2cc2354ae3c87d86dfce9758","abstract_canon_sha256":"29f1c357cefea4285738bea37edf87b484d3bb572e38aee72f85f91226e0dfd7"},"schema_version":"1.0"},"canonical_sha256":"c9a0a9e3d32dac1acdad9becfa0bc414d0b74569e598aec1bd4ea82184c3b8da","source":{"kind":"arxiv","id":"1010.6261","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6261","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6261v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6261","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZGQKTY6TFWWB","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZGQKTY6TFWWBVTNN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZGQKTY6T","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZGQKTY6TFWWBVTNNTPWPUC6ECT","target":"record","payload":{"canonical_record":{"source":{"id":"1010.6261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T16:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"f9418986b8496b944b7807b145c3e16953647b0d2cc2354ae3c87d86dfce9758","abstract_canon_sha256":"29f1c357cefea4285738bea37edf87b484d3bb572e38aee72f85f91226e0dfd7"},"schema_version":"1.0"},"canonical_sha256":"c9a0a9e3d32dac1acdad9becfa0bc414d0b74569e598aec1bd4ea82184c3b8da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:07.212894Z","signature_b64":"7DUMxwHA38tY2XBlYCPci9R1ZtoPsHUO0EBqNTGg77WgrWG8buTjqp3iAVMdK1tKV2hizhsNJvr+xUrD8oV8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9a0a9e3d32dac1acdad9becfa0bc414d0b74569e598aec1bd4ea82184c3b8da","last_reissued_at":"2026-05-18T04:38:07.212368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:07.212368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.6261","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7JajU9A3QvLck8n4uqAbZoh5riON+NNa6OS5aMXblWLs52fcczmw+TlX8sKXJ9g7FIqWI9EiYKSGFyJhhcpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:08:26.706542Z"},"content_sha256":"4fbfaaedfd801a583c47a1756ec83f194fa84c155ab5e34cf4969f7ca8bd3dd3","schema_version":"1.0","event_id":"sha256:4fbfaaedfd801a583c47a1756ec83f194fa84c155ab5e34cf4969f7ca8bd3dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZGQKTY6TFWWBVTNNTPWPUC6ECT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Permutations and 2-Regular Skew Tableaux","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cindy C.Y. Gu, Kevin J. Ma, William Y.C. Chen","submitted_at":"2010-10-29T16:21:50Z","abstract_excerpt":"Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let $\\mathcal{F}_d(n)$ denote the set of minimal permutations of length $n$ with $d$ descents, and let $f_d(n)= |\\mathcal{F}_d(n)|$. They derived that $f_{n-2}(n)=2^{n}-(n-1)n-2$ and $f_n(2n)=C_n$, where $C_n$ is the $n$-th Catalan number. Mansour and Yan proved that $f_{n+1}(2n+1)=2^{n-2}nC_{n+1}$. In this paper, we consider the problem of counting minimal permutations in $\\mathcal{F}_d(n)$ with a prescribed set of ascents. We show that suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6261","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWOn9Lo8tJpCqeep4BXqfiIRc8d2AqZHoucsXs+VY71QEfxXKDZAQLWfS6ewQB9KhPiJJyf9hyg6lxIEBbW3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:08:26.706888Z"},"content_sha256":"af5100f4c996bf6236a99c226ce23ee4f9eb78cbbc93bd712730cb75c67c5807","schema_version":"1.0","event_id":"sha256:af5100f4c996bf6236a99c226ce23ee4f9eb78cbbc93bd712730cb75c67c5807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/bundle.json","state_url":"https://pith.science/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/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-20T03:08:26Z","links":{"resolver":"https://pith.science/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT","bundle":"https://pith.science/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/bundle.json","state":"https://pith.science/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGQKTY6TFWWBVTNNTPWPUC6ECT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZGQKTY6TFWWBVTNNTPWPUC6ECT","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":"29f1c357cefea4285738bea37edf87b484d3bb572e38aee72f85f91226e0dfd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T16:21:50Z","title_canon_sha256":"f9418986b8496b944b7807b145c3e16953647b0d2cc2354ae3c87d86dfce9758"},"schema_version":"1.0","source":{"id":"1010.6261","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6261","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6261v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6261","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZGQKTY6TFWWB","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZGQKTY6TFWWBVTNN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZGQKTY6T","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:af5100f4c996bf6236a99c226ce23ee4f9eb78cbbc93bd712730cb75c67c5807","target":"graph","created_at":"2026-05-18T04:38:07Z","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":"Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let $\\mathcal{F}_d(n)$ denote the set of minimal permutations of length $n$ with $d$ descents, and let $f_d(n)= |\\mathcal{F}_d(n)|$. They derived that $f_{n-2}(n)=2^{n}-(n-1)n-2$ and $f_n(2n)=C_n$, where $C_n$ is the $n$-th Catalan number. Mansour and Yan proved that $f_{n+1}(2n+1)=2^{n-2}nC_{n+1}$. In this paper, we consider the problem of counting minimal permutations in $\\mathcal{F}_d(n)$ with a prescribed set of ascents. We show that suc","authors_text":"Cindy C.Y. Gu, Kevin J. Ma, William Y.C. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T16:21:50Z","title":"Minimal Permutations and 2-Regular Skew Tableaux"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6261","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:4fbfaaedfd801a583c47a1756ec83f194fa84c155ab5e34cf4969f7ca8bd3dd3","target":"record","created_at":"2026-05-18T04:38:07Z","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":"29f1c357cefea4285738bea37edf87b484d3bb572e38aee72f85f91226e0dfd7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T16:21:50Z","title_canon_sha256":"f9418986b8496b944b7807b145c3e16953647b0d2cc2354ae3c87d86dfce9758"},"schema_version":"1.0","source":{"id":"1010.6261","kind":"arxiv","version":1}},"canonical_sha256":"c9a0a9e3d32dac1acdad9becfa0bc414d0b74569e598aec1bd4ea82184c3b8da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9a0a9e3d32dac1acdad9becfa0bc414d0b74569e598aec1bd4ea82184c3b8da","first_computed_at":"2026-05-18T04:38:07.212368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:07.212368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7DUMxwHA38tY2XBlYCPci9R1ZtoPsHUO0EBqNTGg77WgrWG8buTjqp3iAVMdK1tKV2hizhsNJvr+xUrD8oV8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:07.212894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6261","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fbfaaedfd801a583c47a1756ec83f194fa84c155ab5e34cf4969f7ca8bd3dd3","sha256:af5100f4c996bf6236a99c226ce23ee4f9eb78cbbc93bd712730cb75c67c5807"],"state_sha256":"cd1cb8ecaed3be46959ba67244af1796a56638a4ae9bef5f1a3b820e2d44aa80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXQxzkcesf4lOlqJe1vwT9GI8W5eGs25z7fQ56QA+f7AD+MkH181QEWU6bQAPm+0PCoYcaiBPt/UCVoRcyLQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:08:26.709067Z","bundle_sha256":"d93c8aca12fe3e196a04bc15147de7ef457a86e65661763ae6c5ade4a673513e"}}