{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DHOUI3SIVDGNHRDT24MKMP2ROE","short_pith_number":"pith:DHOUI3SI","schema_version":"1.0","canonical_sha256":"19dd446e48a8ccd3c473d718a63f5171136e3218b4b961f13e8269502eefb87b","source":{"kind":"arxiv","id":"2506.23355","version":3},"attestation_state":"computed","paper":{"title":"Ordered set partition posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN","math.RT"],"primary_cat":"math.CO","authors_text":"Bruce E Sagan (Michigan State University), Sheila Sundaram (University of Minnesota)","submitted_at":"2025-06-29T18:20:31Z","abstract_excerpt":"A set partition is said to be ordered if the blocks of the partition are listed in a specific order. The ordered set partitions of $\\{1,\\ldots,n\\}$, with a unique minimal element adjoined, form a lattice $\\Om_n$ with respect to refinement. The lattice $\\Om_n$ is well known to be the face lattice of the permutohedron. In this paper we study the combinatorics and topology of two subposets of $\\Om_n$ with restricted block sizes, either all divisible by some fixed $d\\ge2$, or all congruent to $1$ modulo $d$. For the $d$-divisible case we derive an explicit recursive atom ordering for the lattice, "},"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":"2506.23355","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T18:20:31Z","cross_cats_sorted":["math.GN","math.RT"],"title_canon_sha256":"c02c5f933b3e2b5c1956b9955caab8a11e6f83abd858f07890a9d344701bcc64","abstract_canon_sha256":"12fec4b3667ba987daa6259bfdd34e22a6cf75ea541f941816f248d412d9b60b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:45.994691Z","signature_b64":"bPYIHj0xtG96denCyyt4/NylsAkbLE3tZgbMXaSik975/cvkDZx6SowPhUz2ATWrwxHAD+ORW3iSG3EHHXSABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19dd446e48a8ccd3c473d718a63f5171136e3218b4b961f13e8269502eefb87b","last_reissued_at":"2026-06-08T01:03:45.993692Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:45.993692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered set partition posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN","math.RT"],"primary_cat":"math.CO","authors_text":"Bruce E Sagan (Michigan State University), Sheila Sundaram (University of Minnesota)","submitted_at":"2025-06-29T18:20:31Z","abstract_excerpt":"A set partition is said to be ordered if the blocks of the partition are listed in a specific order. The ordered set partitions of $\\{1,\\ldots,n\\}$, with a unique minimal element adjoined, form a lattice $\\Om_n$ with respect to refinement. The lattice $\\Om_n$ is well known to be the face lattice of the permutohedron. In this paper we study the combinatorics and topology of two subposets of $\\Om_n$ with restricted block sizes, either all divisible by some fixed $d\\ge2$, or all congruent to $1$ modulo $d$. For the $d$-divisible case we derive an explicit recursive atom ordering for the lattice, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23355","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.23355/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":"2506.23355","created_at":"2026-06-08T01:03:45.993797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23355v3","created_at":"2026-06-08T01:03:45.993797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23355","created_at":"2026-06-08T01:03:45.993797+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHOUI3SIVDGN","created_at":"2026-06-08T01:03:45.993797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHOUI3SIVDGNHRDT","created_at":"2026-06-08T01:03:45.993797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHOUI3SI","created_at":"2026-06-08T01:03:45.993797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.20965","citing_title":"An identity relating Catalan numbers to tangent numbers with arithmetic applications","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE","json":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE.json","graph_json":"https://pith.science/api/pith-number/DHOUI3SIVDGNHRDT24MKMP2ROE/graph.json","events_json":"https://pith.science/api/pith-number/DHOUI3SIVDGNHRDT24MKMP2ROE/events.json","paper":"https://pith.science/paper/DHOUI3SI"},"agent_actions":{"view_html":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE","download_json":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE.json","view_paper":"https://pith.science/paper/DHOUI3SI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23355&json=true","fetch_graph":"https://pith.science/api/pith-number/DHOUI3SIVDGNHRDT24MKMP2ROE/graph.json","fetch_events":"https://pith.science/api/pith-number/DHOUI3SIVDGNHRDT24MKMP2ROE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE/action/storage_attestation","attest_author":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE/action/author_attestation","sign_citation":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE/action/citation_signature","submit_replication":"https://pith.science/pith/DHOUI3SIVDGNHRDT24MKMP2ROE/action/replication_record"}},"created_at":"2026-06-08T01:03:45.993797+00:00","updated_at":"2026-06-08T01:03:45.993797+00:00"}