{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DHOUI3SIVDGNHRDT24MKMP2ROE","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":"12fec4b3667ba987daa6259bfdd34e22a6cf75ea541f941816f248d412d9b60b","cross_cats_sorted":["math.GN","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T18:20:31Z","title_canon_sha256":"c02c5f933b3e2b5c1956b9955caab8a11e6f83abd858f07890a9d344701bcc64"},"schema_version":"1.0","source":{"id":"2506.23355","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.23355","created_at":"2026-06-08T01:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.23355v3","created_at":"2026-06-08T01:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23355","created_at":"2026-06-08T01:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"DHOUI3SIVDGN","created_at":"2026-06-08T01:03:45Z"},{"alias_kind":"pith_short_16","alias_value":"DHOUI3SIVDGNHRDT","created_at":"2026-06-08T01:03:45Z"},{"alias_kind":"pith_short_8","alias_value":"DHOUI3SI","created_at":"2026-06-08T01:03:45Z"}],"graph_snapshots":[{"event_id":"sha256:7c652e047716741d256589d5479e37303ce0d6ae745f32277ef6e2bd56065ac2","target":"graph","created_at":"2026-06-08T01:03:45Z","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/2506.23355/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Bruce E Sagan (Michigan State University), Sheila Sundaram (University of Minnesota)","cross_cats":["math.GN","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T18:20:31Z","title":"Ordered set partition posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23355","kind":"arxiv","version":3},"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:102d9701f3c43a2d659dc5a6b270246957bf03f32ed10329c2b6e34b4f1f99b6","target":"record","created_at":"2026-06-08T01:03:45Z","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":"12fec4b3667ba987daa6259bfdd34e22a6cf75ea541f941816f248d412d9b60b","cross_cats_sorted":["math.GN","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-29T18:20:31Z","title_canon_sha256":"c02c5f933b3e2b5c1956b9955caab8a11e6f83abd858f07890a9d344701bcc64"},"schema_version":"1.0","source":{"id":"2506.23355","kind":"arxiv","version":3}},"canonical_sha256":"19dd446e48a8ccd3c473d718a63f5171136e3218b4b961f13e8269502eefb87b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19dd446e48a8ccd3c473d718a63f5171136e3218b4b961f13e8269502eefb87b","first_computed_at":"2026-06-08T01:03:45.993692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:03:45.993692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bPYIHj0xtG96denCyyt4/NylsAkbLE3tZgbMXaSik975/cvkDZx6SowPhUz2ATWrwxHAD+ORW3iSG3EHHXSABA==","signature_status":"signed_v1","signed_at":"2026-06-08T01:03:45.994691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.23355","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:102d9701f3c43a2d659dc5a6b270246957bf03f32ed10329c2b6e34b4f1f99b6","sha256:7c652e047716741d256589d5479e37303ce0d6ae745f32277ef6e2bd56065ac2"],"state_sha256":"ec0a36b97791ed872176889408588cd229e4b82fac82201f2b0ce901c9964d6e"}