{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NSPNUOLMQG3U2M63T66LDGP4YH","short_pith_number":"pith:NSPNUOLM","canonical_record":{"source":{"id":"2411.16113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T05:58:21Z","cross_cats_sorted":[],"title_canon_sha256":"5ba3bdcaa670e0095102eb85cec0437387eb0b2aeba5a5fcfbe7ce1473ffd305","abstract_canon_sha256":"371ae35f751ff239189ac794460255ca17227c24cd945349e01e42bdf178365c"},"schema_version":"1.0"},"canonical_sha256":"6c9eda396c81b74d33db9fbcb199fcc1fb90a9c1d84c3406bcffb4629402eb24","source":{"kind":"arxiv","id":"2411.16113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16113","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16113v1","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16113","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"NSPNUOLMQG3U","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_16","alias_value":"NSPNUOLMQG3U2M63","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_8","alias_value":"NSPNUOLM","created_at":"2026-07-05T09:40:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NSPNUOLMQG3U2M63T66LDGP4YH","target":"record","payload":{"canonical_record":{"source":{"id":"2411.16113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T05:58:21Z","cross_cats_sorted":[],"title_canon_sha256":"5ba3bdcaa670e0095102eb85cec0437387eb0b2aeba5a5fcfbe7ce1473ffd305","abstract_canon_sha256":"371ae35f751ff239189ac794460255ca17227c24cd945349e01e42bdf178365c"},"schema_version":"1.0"},"canonical_sha256":"6c9eda396c81b74d33db9fbcb199fcc1fb90a9c1d84c3406bcffb4629402eb24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:04.340604Z","signature_b64":"0MdwY/ZTnLryQlNNs/xFpZjNTSF6mgcnlWTai1I8BLtVhpZYgS3wxOC00lgayr01QqVin/VvOfGTt6bSWJ3iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9eda396c81b74d33db9fbcb199fcc1fb90a9c1d84c3406bcffb4629402eb24","last_reissued_at":"2026-07-05T09:40:04.340156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:04.340156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.16113","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-07-05T09:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dr7skY5qDpjX2M940e/lEefVLXP/l4d3SMHj3ycIoDiUukLuiSWyChUSMSXXXqw6Dvwys85cR+clDQGfJywTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:07:40.595651Z"},"content_sha256":"9c9b2880a1e00dc8278f19701faebee3496ad3022d08f54c831f139baddc2ea8","schema_version":"1.0","event_id":"sha256:9c9b2880a1e00dc8278f19701faebee3496ad3022d08f54c831f139baddc2ea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NSPNUOLMQG3U2M63T66LDGP4YH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting up-up-or-down-down permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel","submitted_at":"2024-11-25T05:58:21Z","abstract_excerpt":"Answering a question of Donald Knuth, we find the bivariate exponential generating function for \"up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\\cdots a_n$ satisfying $a_{2i-1}<a_{2i}$ if and only if $a_{2i}<a_{2i+1}$ for $1\\le i <n/2$. Equivalently, an up-up-or-down-down permutation is one in which every peak and every valley is odd."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16113","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.16113/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:40:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9boXJQsYr3vS2MuYhVVpZSqzsutJaawpIDtScJPzPSsfUtgdJG3wnHo55eEPtMcsv7S3dW3jup9oWxLi3hyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:07:40.596132Z"},"content_sha256":"219ea93b75b263f8b261627cbf47d1ea50de2a927b7ea0be650d798f6a39a410","schema_version":"1.0","event_id":"sha256:219ea93b75b263f8b261627cbf47d1ea50de2a927b7ea0be650d798f6a39a410"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSPNUOLMQG3U2M63T66LDGP4YH/bundle.json","state_url":"https://pith.science/pith/NSPNUOLMQG3U2M63T66LDGP4YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSPNUOLMQG3U2M63T66LDGP4YH/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-08-12T22:07:40Z","links":{"resolver":"https://pith.science/pith/NSPNUOLMQG3U2M63T66LDGP4YH","bundle":"https://pith.science/pith/NSPNUOLMQG3U2M63T66LDGP4YH/bundle.json","state":"https://pith.science/pith/NSPNUOLMQG3U2M63T66LDGP4YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSPNUOLMQG3U2M63T66LDGP4YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NSPNUOLMQG3U2M63T66LDGP4YH","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":"371ae35f751ff239189ac794460255ca17227c24cd945349e01e42bdf178365c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T05:58:21Z","title_canon_sha256":"5ba3bdcaa670e0095102eb85cec0437387eb0b2aeba5a5fcfbe7ce1473ffd305"},"schema_version":"1.0","source":{"id":"2411.16113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16113","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16113v1","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16113","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_12","alias_value":"NSPNUOLMQG3U","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_16","alias_value":"NSPNUOLMQG3U2M63","created_at":"2026-07-05T09:40:04Z"},{"alias_kind":"pith_short_8","alias_value":"NSPNUOLM","created_at":"2026-07-05T09:40:04Z"}],"graph_snapshots":[{"event_id":"sha256:219ea93b75b263f8b261627cbf47d1ea50de2a927b7ea0be650d798f6a39a410","target":"graph","created_at":"2026-07-05T09:40:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16113/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answering a question of Donald Knuth, we find the bivariate exponential generating function for \"up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\\cdots a_n$ satisfying $a_{2i-1}<a_{2i}$ if and only if $a_{2i}<a_{2i+1}$ for $1\\le i <n/2$. Equivalently, an up-up-or-down-down permutation is one in which every peak and every valley is odd.","authors_text":"Ira M. Gessel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T05:58:21Z","title":"Counting up-up-or-down-down permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16113","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:9c9b2880a1e00dc8278f19701faebee3496ad3022d08f54c831f139baddc2ea8","target":"record","created_at":"2026-07-05T09:40:04Z","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":"371ae35f751ff239189ac794460255ca17227c24cd945349e01e42bdf178365c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T05:58:21Z","title_canon_sha256":"5ba3bdcaa670e0095102eb85cec0437387eb0b2aeba5a5fcfbe7ce1473ffd305"},"schema_version":"1.0","source":{"id":"2411.16113","kind":"arxiv","version":1}},"canonical_sha256":"6c9eda396c81b74d33db9fbcb199fcc1fb90a9c1d84c3406bcffb4629402eb24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c9eda396c81b74d33db9fbcb199fcc1fb90a9c1d84c3406bcffb4629402eb24","first_computed_at":"2026-07-05T09:40:04.340156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:04.340156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MdwY/ZTnLryQlNNs/xFpZjNTSF6mgcnlWTai1I8BLtVhpZYgS3wxOC00lgayr01QqVin/VvOfGTt6bSWJ3iCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:04.340604Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c9b2880a1e00dc8278f19701faebee3496ad3022d08f54c831f139baddc2ea8","sha256:219ea93b75b263f8b261627cbf47d1ea50de2a927b7ea0be650d798f6a39a410"],"state_sha256":"ea50028a75813c8611a003f3ed8ecb1acd7bcac7b3e99f910796ca28830c1aa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhKtGK7Old3gyvAXdHkP45YO+CihM9aCWtNhDElwxLtxruZLXtTN7hm//Vhb5++GSOHfXmHZiML8EtAdWrNZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:07:40.600653Z","bundle_sha256":"0e2d1b8b5d5d939c18931be7dc587894a84d40700e4ff17b01723d04a72cc7dc"}}