{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:35KD46EVXCDGLX6N5MDGYMV7I2","short_pith_number":"pith:35KD46EV","canonical_record":{"source":{"id":"2306.11836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-16T17:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c4232ff59244015857edd6ef0dd82977f14093982b6db095634eafd944464ae","abstract_canon_sha256":"8db8f4b4ded1443b254cf068a3aedefc3527c5e7f0ba4d49c18411cbbe5a3322"},"schema_version":"1.0"},"canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","source":{"kind":"arxiv","id":"2306.11836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11836","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11836v1","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11836","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"35KD46EVXCDG","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"35KD46EVXCDGLX6N","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"35KD46EV","created_at":"2026-07-05T06:23:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:35KD46EVXCDGLX6N5MDGYMV7I2","target":"record","payload":{"canonical_record":{"source":{"id":"2306.11836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-16T17:33:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c4232ff59244015857edd6ef0dd82977f14093982b6db095634eafd944464ae","abstract_canon_sha256":"8db8f4b4ded1443b254cf068a3aedefc3527c5e7f0ba4d49c18411cbbe5a3322"},"schema_version":"1.0"},"canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:07.400795Z","signature_b64":"0a4PTIY4k55LiwmBegyBtKGxoQR3z8PvwyjwGws2XygepwZxItpMh3TvFYVo6dA0WzzMlXOe1cd5UNi06JEqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","last_reissued_at":"2026-07-05T06:23:07.400252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:07.400252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.11836","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-05T06:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BVgsHy+WUcNv4IO3soa6v2ML5SP3HvTM8Qq+w9V5rpRdSnMSMUuvzUX0/o1Be+B18QwiMWn7E0LDb/Xd+OyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T16:01:54.801256Z"},"content_sha256":"a8c1959d60b365297b7a18c9afbd4740f059b015d9b377a39f1effae94fa37b6","schema_version":"1.0","event_id":"sha256:a8c1959d60b365297b7a18c9afbd4740f059b015d9b377a39f1effae94fa37b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:35KD46EVXCDGLX6N5MDGYMV7I2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Eulerian Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Dong","submitted_at":"2023-06-16T17:33:29Z","abstract_excerpt":"Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report, we define numbers of the form $A(n,m,k)$, which count the number of permutations on $[n]$ with exactly $m$ descents and the last element $k$. We then show bijections between this definition and various other analogs for $r$-excedances and $r$-descents. We also prove a variation of Worpitzky's identity on $A(n,m,k)$ using a combinatorial argument mentioned i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11836","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/2306.11836/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-05T06:23:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFPG8OZqpcsN4gi7xvqPLdNn+DWAsBTZhfV75F5rtRTZWYsAXkiElbt+3LI417g1nV/hM+G6l7fkWfkoZhj6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T16:01:54.801638Z"},"content_sha256":"6faa2d92273ac396cf1bbaecbbd2f11d1f052e0a5ba15535963cf24464d335ba","schema_version":"1.0","event_id":"sha256:6faa2d92273ac396cf1bbaecbbd2f11d1f052e0a5ba15535963cf24464d335ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/bundle.json","state_url":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35KD46EVXCDGLX6N5MDGYMV7I2/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-07-19T16:01:54Z","links":{"resolver":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2","bundle":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/bundle.json","state":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35KD46EVXCDGLX6N5MDGYMV7I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:35KD46EVXCDGLX6N5MDGYMV7I2","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":"8db8f4b4ded1443b254cf068a3aedefc3527c5e7f0ba4d49c18411cbbe5a3322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-16T17:33:29Z","title_canon_sha256":"6c4232ff59244015857edd6ef0dd82977f14093982b6db095634eafd944464ae"},"schema_version":"1.0","source":{"id":"2306.11836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11836","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11836v1","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11836","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_12","alias_value":"35KD46EVXCDG","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_16","alias_value":"35KD46EVXCDGLX6N","created_at":"2026-07-05T06:23:07Z"},{"alias_kind":"pith_short_8","alias_value":"35KD46EV","created_at":"2026-07-05T06:23:07Z"}],"graph_snapshots":[{"event_id":"sha256:6faa2d92273ac396cf1bbaecbbd2f11d1f052e0a5ba15535963cf24464d335ba","target":"graph","created_at":"2026-07-05T06:23: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.11836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report, we define numbers of the form $A(n,m,k)$, which count the number of permutations on $[n]$ with exactly $m$ descents and the last element $k$. We then show bijections between this definition and various other analogs for $r$-excedances and $r$-descents. We also prove a variation of Worpitzky's identity on $A(n,m,k)$ using a combinatorial argument mentioned i","authors_text":"David Dong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-16T17:33:29Z","title":"Generalized Eulerian Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11836","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:a8c1959d60b365297b7a18c9afbd4740f059b015d9b377a39f1effae94fa37b6","target":"record","created_at":"2026-07-05T06:23: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":"8db8f4b4ded1443b254cf068a3aedefc3527c5e7f0ba4d49c18411cbbe5a3322","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-06-16T17:33:29Z","title_canon_sha256":"6c4232ff59244015857edd6ef0dd82977f14093982b6db095634eafd944464ae"},"schema_version":"1.0","source":{"id":"2306.11836","kind":"arxiv","version":1}},"canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","first_computed_at":"2026-07-05T06:23:07.400252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:07.400252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0a4PTIY4k55LiwmBegyBtKGxoQR3z8PvwyjwGws2XygepwZxItpMh3TvFYVo6dA0WzzMlXOe1cd5UNi06JEqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:07.400795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.11836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8c1959d60b365297b7a18c9afbd4740f059b015d9b377a39f1effae94fa37b6","sha256:6faa2d92273ac396cf1bbaecbbd2f11d1f052e0a5ba15535963cf24464d335ba"],"state_sha256":"9038e9fc52925b6beb9397c618ea8b7b1e86c4169343a7dd2c0548f69d07087b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UY8zGoXBQWerbctTwTPYIzvcM3cqG84B/pJbt4yqhHYjAcPOhQk1y5LbeYnwx8xglDQI9kyqTGNcEkbtWPoAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T16:01:54.803888Z","bundle_sha256":"b730fef1461936ef799b8a574dbfccab0292a4187658d6c5baf162751ccea0da"}}