{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PJQQBQ7IVSB4NFL6YL7I7CBNUK","short_pith_number":"pith:PJQQBQ7I","schema_version":"1.0","canonical_sha256":"7a6100c3e8ac83c6957ec2fe8f882da288ab23058c2a7110a3cb14440535d918","source":{"kind":"arxiv","id":"2105.15181","version":1},"attestation_state":"computed","paper":{"title":"Extending higher Bruhat orders to non-longest words in $S_n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Hothem","submitted_at":"2021-05-31T17:45:02Z","abstract_excerpt":"In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with unique minimal and maximal elements. As in Manin and Schechtman's original paper, the $k$-th Bruhat order for $w$ is created out of equivalence classes of maximal chains in its $(k-1)$-st Bruhat order. We also define the second and third Bruhat orders for arbitrary realizable k-sets, and prove that the second Bruhat order has a unique minimal and maximal element"},"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":"2105.15181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-31T17:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"b5a44abb015923861acf466a575f1efc68f1d344a6c586db07bdc009d1505d9e","abstract_canon_sha256":"3ac67c7be84168a97c9f3a75742d6e9cea495ec3f3511cccf09eadf1f50d6167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:45.714573Z","signature_b64":"MSkjdJHcpPFVxJk+eTSOEeYZklxpBF5wYPxn9JzzqvwAOEv259b1O8bEplmfCARcAhfSPDAChh9An0YP7LjwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6100c3e8ac83c6957ec2fe8f882da288ab23058c2a7110a3cb14440535d918","last_reissued_at":"2026-07-05T02:44:45.714112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:45.714112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending higher Bruhat orders to non-longest words in $S_n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Hothem","submitted_at":"2021-05-31T17:45:02Z","abstract_excerpt":"In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with unique minimal and maximal elements. As in Manin and Schechtman's original paper, the $k$-th Bruhat order for $w$ is created out of equivalence classes of maximal chains in its $(k-1)$-st Bruhat order. We also define the second and third Bruhat orders for arbitrary realizable k-sets, and prove that the second Bruhat order has a unique minimal and maximal element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.15181","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/2105.15181/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":"2105.15181","created_at":"2026-07-05T02:44:45.714177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.15181v1","created_at":"2026-07-05T02:44:45.714177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.15181","created_at":"2026-07-05T02:44:45.714177+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJQQBQ7IVSB4","created_at":"2026-07-05T02:44:45.714177+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJQQBQ7IVSB4NFL6","created_at":"2026-07-05T02:44:45.714177+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJQQBQ7I","created_at":"2026-07-05T02:44:45.714177+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24573","citing_title":"Commutation classes of reduced words and higher Bruhat orders for affine permutations","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK","json":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK.json","graph_json":"https://pith.science/api/pith-number/PJQQBQ7IVSB4NFL6YL7I7CBNUK/graph.json","events_json":"https://pith.science/api/pith-number/PJQQBQ7IVSB4NFL6YL7I7CBNUK/events.json","paper":"https://pith.science/paper/PJQQBQ7I"},"agent_actions":{"view_html":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK","download_json":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK.json","view_paper":"https://pith.science/paper/PJQQBQ7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.15181&json=true","fetch_graph":"https://pith.science/api/pith-number/PJQQBQ7IVSB4NFL6YL7I7CBNUK/graph.json","fetch_events":"https://pith.science/api/pith-number/PJQQBQ7IVSB4NFL6YL7I7CBNUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK/action/storage_attestation","attest_author":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK/action/author_attestation","sign_citation":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK/action/citation_signature","submit_replication":"https://pith.science/pith/PJQQBQ7IVSB4NFL6YL7I7CBNUK/action/replication_record"}},"created_at":"2026-07-05T02:44:45.714177+00:00","updated_at":"2026-07-05T02:44:45.714177+00:00"}