{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GDPWCSMKOI5J6PXJ6D7TOWSYDF","short_pith_number":"pith:GDPWCSMK","schema_version":"1.0","canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","source":{"kind":"arxiv","id":"1507.02983","version":3},"attestation_state":"computed","paper":{"title":"On comparability of bigrassmannian permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Hammett, John Engbers","submitted_at":"2015-07-10T18:27:52Z","abstract_excerpt":"Let $\\mathfrak{S}_n$ and $\\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\\mathfrak{S}_n,\\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset $(\\mathfrak{B}_n,\\leq)$, first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the number of maximal elements below $r$ fixed elements. It also quickly produces formulas for $\\beta(\\omega)$ ($\\alpha(\\omega)$ respectively), the"},"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":"1507.02983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T18:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"b9f280546390a074e8c5563c311e16b8348429abb77c0c63518eb70dc4b951e5","abstract_canon_sha256":"93fd1df2a94ee74a4bc864045d257fd295dbd03ae36137d9017bd7f8d94679f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.140545Z","signature_b64":"7RVgCd8cXb8R6GLBUjzghd968ov1L0TptvqaXNh9fT0ydkAp2q/9qmebdlB1+wKgQEDOBudZaHtmpJ6lanTsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","last_reissued_at":"2026-05-18T00:22:12.139795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.139795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On comparability of bigrassmannian permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Hammett, John Engbers","submitted_at":"2015-07-10T18:27:52Z","abstract_excerpt":"Let $\\mathfrak{S}_n$ and $\\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\\mathfrak{S}_n,\\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset $(\\mathfrak{B}_n,\\leq)$, first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the number of maximal elements below $r$ fixed elements. It also quickly produces formulas for $\\beta(\\omega)$ ($\\alpha(\\omega)$ respectively), the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02983","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":""},"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":"1507.02983","created_at":"2026-05-18T00:22:12.139916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02983v3","created_at":"2026-05-18T00:22:12.139916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02983","created_at":"2026-05-18T00:22:12.139916+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDPWCSMKOI5J","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDPWCSMKOI5J6PXJ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDPWCSMK","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF","json":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF.json","graph_json":"https://pith.science/api/pith-number/GDPWCSMKOI5J6PXJ6D7TOWSYDF/graph.json","events_json":"https://pith.science/api/pith-number/GDPWCSMKOI5J6PXJ6D7TOWSYDF/events.json","paper":"https://pith.science/paper/GDPWCSMK"},"agent_actions":{"view_html":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF","download_json":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF.json","view_paper":"https://pith.science/paper/GDPWCSMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02983&json=true","fetch_graph":"https://pith.science/api/pith-number/GDPWCSMKOI5J6PXJ6D7TOWSYDF/graph.json","fetch_events":"https://pith.science/api/pith-number/GDPWCSMKOI5J6PXJ6D7TOWSYDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/action/storage_attestation","attest_author":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/action/author_attestation","sign_citation":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/action/citation_signature","submit_replication":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/action/replication_record"}},"created_at":"2026-05-18T00:22:12.139916+00:00","updated_at":"2026-05-18T00:22:12.139916+00:00"}