{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MFKEEONI6KA2QA562OFRR6NEIM","short_pith_number":"pith:MFKEEONI","schema_version":"1.0","canonical_sha256":"61544239a8f281a803bed38b18f9a44314172ffc0914d650eb847f2b51ca6dde","source":{"kind":"arxiv","id":"1208.3831","version":3},"attestation_state":"computed","paper":{"title":"The $\\s$-Eulerian polynomials have only real roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla D. Savage, Mirk\\'o Visontai","submitted_at":"2012-08-19T12:57:08Z","abstract_excerpt":"We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or subexcedant functions) were recently generalized by Savage and Schuster, to arbitrary sequences $\\s$ of positive integers, which they called $\\s$-inversion sequences.\n  Our object of study is the generating polynomial of the {\\em ascent} statistic over the set of $\\s$-inversion sequences of length $n$. Since this ascent statistic over inversion sequences is equidis"},"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":"1208.3831","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-19T12:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"5c897aecce098f31945e17be9f490c72eac739afeea71c9ed9ee4b01bad65b80","abstract_canon_sha256":"cb9e0e3b85a64ce3c5be217fc2114319c38cf75addd60d010119d7611db9029d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:00.495786Z","signature_b64":"sNhqqqJO0+XZ4zy2ltLaZPjM8qM1q3g2AYFqrCFFpmNv+7Qbu6C9/dOWhZEn8qi+5shkaqMB7I51KxnTHq2wBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61544239a8f281a803bed38b18f9a44314172ffc0914d650eb847f2b51ca6dde","last_reissued_at":"2026-05-18T02:32:00.495283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:00.495283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $\\s$-Eulerian polynomials have only real roots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carla D. Savage, Mirk\\'o Visontai","submitted_at":"2012-08-19T12:57:08Z","abstract_excerpt":"We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or subexcedant functions) were recently generalized by Savage and Schuster, to arbitrary sequences $\\s$ of positive integers, which they called $\\s$-inversion sequences.\n  Our object of study is the generating polynomial of the {\\em ascent} statistic over the set of $\\s$-inversion sequences of length $n$. Since this ascent statistic over inversion sequences is equidis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3831","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.3831","created_at":"2026-05-18T02:32:00.495373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3831v3","created_at":"2026-05-18T02:32:00.495373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3831","created_at":"2026-05-18T02:32:00.495373+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFKEEONI6KA2","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFKEEONI6KA2QA56","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFKEEONI","created_at":"2026-05-18T12:27:14.488303+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/MFKEEONI6KA2QA562OFRR6NEIM","json":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM.json","graph_json":"https://pith.science/api/pith-number/MFKEEONI6KA2QA562OFRR6NEIM/graph.json","events_json":"https://pith.science/api/pith-number/MFKEEONI6KA2QA562OFRR6NEIM/events.json","paper":"https://pith.science/paper/MFKEEONI"},"agent_actions":{"view_html":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM","download_json":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM.json","view_paper":"https://pith.science/paper/MFKEEONI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3831&json=true","fetch_graph":"https://pith.science/api/pith-number/MFKEEONI6KA2QA562OFRR6NEIM/graph.json","fetch_events":"https://pith.science/api/pith-number/MFKEEONI6KA2QA562OFRR6NEIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM/action/storage_attestation","attest_author":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM/action/author_attestation","sign_citation":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM/action/citation_signature","submit_replication":"https://pith.science/pith/MFKEEONI6KA2QA562OFRR6NEIM/action/replication_record"}},"created_at":"2026-05-18T02:32:00.495373+00:00","updated_at":"2026-05-18T02:32:00.495373+00:00"}