{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VCGDHZLJL4T7ZX4344NRHSRWQ2","short_pith_number":"pith:VCGDHZLJ","schema_version":"1.0","canonical_sha256":"a88c33e5695f27fcdf9be71b13ca3686a28efe7cf22cbc09042514b33ceabb83","source":{"kind":"arxiv","id":"2405.08943","version":2},"attestation_state":"computed","paper":{"title":"Between weak and Bruhat: the middle order on permutations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bridget Eileen Tenner, Luca Ferrari, Mathilde Bouvel","submitted_at":"2024-05-14T20:15:42Z","abstract_excerpt":"We define a partial order $\\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\\mathcal{P}_n$ refines the weak order on permutations and admits the Bruhat order as a refinement, justifying the terminology. These middle orders are distributive lattices and we establish some of their combinatorial properties, including characterization and enumeration of intervals and boolean intervals (in general, or of any given rank), and a combinatorial interpretation of t"},"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":"2405.08943","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-14T20:15:42Z","cross_cats_sorted":[],"title_canon_sha256":"8e9295618558e4f6dcd4fba58a3b72a0cf007983eae70d68729a4263fc98a3b8","abstract_canon_sha256":"0f242a91ad1012faafd7e218b7bb6f51f323d0b41e0159bcb2d795481b22a9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:37.262646Z","signature_b64":"1x+DyH64vf720mr+kDr7G7lEm8ShkXLSWP8C5AhLF6XutdYovQJabLLvPkd2/vBu8beCGeSVIUTIMYXGm+AxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88c33e5695f27fcdf9be71b13ca3686a28efe7cf22cbc09042514b33ceabb83","last_reissued_at":"2026-07-05T09:00:37.262201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:37.262201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Between weak and Bruhat: the middle order on permutations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bridget Eileen Tenner, Luca Ferrari, Mathilde Bouvel","submitted_at":"2024-05-14T20:15:42Z","abstract_excerpt":"We define a partial order $\\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\\mathcal{P}_n$ refines the weak order on permutations and admits the Bruhat order as a refinement, justifying the terminology. These middle orders are distributive lattices and we establish some of their combinatorial properties, including characterization and enumeration of intervals and boolean intervals (in general, or of any given rank), and a combinatorial interpretation of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08943","kind":"arxiv","version":2},"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/2405.08943/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":"2405.08943","created_at":"2026-07-05T09:00:37.262253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08943v2","created_at":"2026-07-05T09:00:37.262253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08943","created_at":"2026-07-05T09:00:37.262253+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCGDHZLJL4T7","created_at":"2026-07-05T09:00:37.262253+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCGDHZLJL4T7ZX43","created_at":"2026-07-05T09:00:37.262253+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCGDHZLJ","created_at":"2026-07-05T09:00:37.262253+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17628","citing_title":"Intervals in a family of Fibonacci lattices","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2","json":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2.json","graph_json":"https://pith.science/api/pith-number/VCGDHZLJL4T7ZX4344NRHSRWQ2/graph.json","events_json":"https://pith.science/api/pith-number/VCGDHZLJL4T7ZX4344NRHSRWQ2/events.json","paper":"https://pith.science/paper/VCGDHZLJ"},"agent_actions":{"view_html":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2","download_json":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2.json","view_paper":"https://pith.science/paper/VCGDHZLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08943&json=true","fetch_graph":"https://pith.science/api/pith-number/VCGDHZLJL4T7ZX4344NRHSRWQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/VCGDHZLJL4T7ZX4344NRHSRWQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2/action/storage_attestation","attest_author":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2/action/author_attestation","sign_citation":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2/action/citation_signature","submit_replication":"https://pith.science/pith/VCGDHZLJL4T7ZX4344NRHSRWQ2/action/replication_record"}},"created_at":"2026-07-05T09:00:37.262253+00:00","updated_at":"2026-07-05T09:00:37.262253+00:00"}