{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:5CP7RMUGXGMDOJZK3WKNMAEBAS","short_pith_number":"pith:5CP7RMUG","schema_version":"1.0","canonical_sha256":"e89ff8b286b99837272add94d600810488e55150cedd75dc15501111faab357b","source":{"kind":"arxiv","id":"math/0311426","version":1},"attestation_state":"computed","paper":{"title":"A New Approach to Order Polynomials of Labeled Posets and Their Generalizations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Wright, John Shareshian, Wenhua Zhao","submitted_at":"2003-11-24T22:28:08Z","abstract_excerpt":"In this paper, we first give formulas for the order polynomial $\\Omega (\\Pw; t)$ and the Eulerian polynomial $e(\\Pw; \\lambda)$ of a finite labeled poset $(P, \\omega)$ using the adjacency matrix of what we call the $\\omega$-graph of $(P, \\omega)$. We then derive various recursion formulas for $\\Omega (\\Pw; t)$ and $e(\\Pw; \\lambda)$ and discuss some applications of these formulas to Bernoulli numbers and Bernoulli polynomials. Finally, we give a recursive algorithm using a single linear operator on a vector space. This algorithm provides a uniform method to construct a family of new invariants f"},"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":"math/0311426","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-11-24T22:28:08Z","cross_cats_sorted":[],"title_canon_sha256":"0b9c9b36e1455244eaaaa783b5ea16799875f290c462919e80e56c6e71f1c326","abstract_canon_sha256":"74a5f2113ff0d8dde4e1adc4cf99ef6c0beb2e66659b07346dde058b5ecec745"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:38:01.594246Z","signature_b64":"h63KhYURarkSKp3rSHeCe+jKOA32SgjSOkOyKgNLK3ro5Jdzm9QbM9WwKfLGw2Z5l/fqBleTbjU5D7sLhrI8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e89ff8b286b99837272add94d600810488e55150cedd75dc15501111faab357b","last_reissued_at":"2026-07-04T14:38:01.593813Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:38:01.593813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to Order Polynomials of Labeled Posets and Their Generalizations","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Wright, John Shareshian, Wenhua Zhao","submitted_at":"2003-11-24T22:28:08Z","abstract_excerpt":"In this paper, we first give formulas for the order polynomial $\\Omega (\\Pw; t)$ and the Eulerian polynomial $e(\\Pw; \\lambda)$ of a finite labeled poset $(P, \\omega)$ using the adjacency matrix of what we call the $\\omega$-graph of $(P, \\omega)$. We then derive various recursion formulas for $\\Omega (\\Pw; t)$ and $e(\\Pw; \\lambda)$ and discuss some applications of these formulas to Bernoulli numbers and Bernoulli polynomials. Finally, we give a recursive algorithm using a single linear operator on a vector space. This algorithm provides a uniform method to construct a family of new invariants f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311426","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/math/0311426/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":"math/0311426","created_at":"2026-07-04T14:38:01.593893+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0311426v1","created_at":"2026-07-04T14:38:01.593893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311426","created_at":"2026-07-04T14:38:01.593893+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CP7RMUGXGMD","created_at":"2026-07-04T14:38:01.593893+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CP7RMUGXGMDOJZK","created_at":"2026-07-04T14:38:01.593893+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CP7RMUG","created_at":"2026-07-04T14:38:01.593893+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.08394","citing_title":"Ehrhart positivity for marked order polytopes","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS","json":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS.json","graph_json":"https://pith.science/api/pith-number/5CP7RMUGXGMDOJZK3WKNMAEBAS/graph.json","events_json":"https://pith.science/api/pith-number/5CP7RMUGXGMDOJZK3WKNMAEBAS/events.json","paper":"https://pith.science/paper/5CP7RMUG"},"agent_actions":{"view_html":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS","download_json":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS.json","view_paper":"https://pith.science/paper/5CP7RMUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0311426&json=true","fetch_graph":"https://pith.science/api/pith-number/5CP7RMUGXGMDOJZK3WKNMAEBAS/graph.json","fetch_events":"https://pith.science/api/pith-number/5CP7RMUGXGMDOJZK3WKNMAEBAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS/action/storage_attestation","attest_author":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS/action/author_attestation","sign_citation":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS/action/citation_signature","submit_replication":"https://pith.science/pith/5CP7RMUGXGMDOJZK3WKNMAEBAS/action/replication_record"}},"created_at":"2026-07-04T14:38:01.593893+00:00","updated_at":"2026-07-04T14:38:01.593893+00:00"}