{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:35KD46EVXCDGLX6N5MDGYMV7I2","short_pith_number":"pith:35KD46EV","schema_version":"1.0","canonical_sha256":"df543e7895b88665dfcdeb066c32bf46a49fd2bdbe7b9de547970269ff66cde0","source":{"kind":"arxiv","id":"2306.11836","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.11836","created_at":"2026-07-05T06:23:07.400302+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.11836v1","created_at":"2026-07-05T06:23:07.400302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11836","created_at":"2026-07-05T06:23:07.400302+00:00"},{"alias_kind":"pith_short_12","alias_value":"35KD46EVXCDG","created_at":"2026-07-05T06:23:07.400302+00:00"},{"alias_kind":"pith_short_16","alias_value":"35KD46EVXCDGLX6N","created_at":"2026-07-05T06:23:07.400302+00:00"},{"alias_kind":"pith_short_8","alias_value":"35KD46EV","created_at":"2026-07-05T06:23:07.400302+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2","json":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2.json","graph_json":"https://pith.science/api/pith-number/35KD46EVXCDGLX6N5MDGYMV7I2/graph.json","events_json":"https://pith.science/api/pith-number/35KD46EVXCDGLX6N5MDGYMV7I2/events.json","paper":"https://pith.science/paper/35KD46EV"},"agent_actions":{"view_html":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2","download_json":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2.json","view_paper":"https://pith.science/paper/35KD46EV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.11836&json=true","fetch_graph":"https://pith.science/api/pith-number/35KD46EVXCDGLX6N5MDGYMV7I2/graph.json","fetch_events":"https://pith.science/api/pith-number/35KD46EVXCDGLX6N5MDGYMV7I2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/action/storage_attestation","attest_author":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/action/author_attestation","sign_citation":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/action/citation_signature","submit_replication":"https://pith.science/pith/35KD46EVXCDGLX6N5MDGYMV7I2/action/replication_record"}},"created_at":"2026-07-05T06:23:07.400302+00:00","updated_at":"2026-07-05T06:23:07.400302+00:00"}