{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GDPWCSMKOI5J6PXJ6D7TOWSYDF","short_pith_number":"pith:GDPWCSMK","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"},"canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","source":{"kind":"arxiv","id":"1507.02983","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02983","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02983v3","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02983","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"GDPWCSMKOI5J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDPWCSMKOI5J6PXJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDPWCSMK","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GDPWCSMKOI5J6PXJ6D7TOWSYDF","target":"record","payload":{"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"},"canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","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"},"source_kind":"arxiv","source_id":"1507.02983","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4uct1Efqrs1HRxwdBvYDg/uEc3n6vyHWeGjy4JUUqOXzYTx58BlCRvgPKnL4dl6htysRFU1ebJNBKyEXZCYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:23:01.844667Z"},"content_sha256":"78a5666c14fca64d725eea33d247ed3c7684de0f4adc7c25f027f97cb7bfd9e6","schema_version":"1.0","event_id":"sha256:78a5666c14fca64d725eea33d247ed3c7684de0f4adc7c25f027f97cb7bfd9e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GDPWCSMKOI5J6PXJ6D7TOWSYDF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OnSUQy5xDazBmwe/cv4ytbuwm8Mi448McY9Xt46IQJcjQLj8NU9v25dYQKrqY0psqCjt3m8ODVWmOXxfw77JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:23:01.845014Z"},"content_sha256":"a700d67085e5113a6d02c07436d6820ef026489de3183b2653d8a7c40e3ed765","schema_version":"1.0","event_id":"sha256:a700d67085e5113a6d02c07436d6820ef026489de3183b2653d8a7c40e3ed765"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/bundle.json","state_url":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T08:23:01Z","links":{"resolver":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF","bundle":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/bundle.json","state":"https://pith.science/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDPWCSMKOI5J6PXJ6D7TOWSYDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GDPWCSMKOI5J6PXJ6D7TOWSYDF","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":"93fd1df2a94ee74a4bc864045d257fd295dbd03ae36137d9017bd7f8d94679f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T18:27:52Z","title_canon_sha256":"b9f280546390a074e8c5563c311e16b8348429abb77c0c63518eb70dc4b951e5"},"schema_version":"1.0","source":{"id":"1507.02983","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02983","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02983v3","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02983","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"GDPWCSMKOI5J","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDPWCSMKOI5J6PXJ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDPWCSMK","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:a700d67085e5113a6d02c07436d6820ef026489de3183b2653d8a7c40e3ed765","target":"graph","created_at":"2026-05-18T00:22:12Z","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"},"paper":{"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","authors_text":"Adam Hammett, John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T18:27:52Z","title":"On comparability of bigrassmannian permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02983","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:78a5666c14fca64d725eea33d247ed3c7684de0f4adc7c25f027f97cb7bfd9e6","target":"record","created_at":"2026-05-18T00:22:12Z","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":"93fd1df2a94ee74a4bc864045d257fd295dbd03ae36137d9017bd7f8d94679f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T18:27:52Z","title_canon_sha256":"b9f280546390a074e8c5563c311e16b8348429abb77c0c63518eb70dc4b951e5"},"schema_version":"1.0","source":{"id":"1507.02983","kind":"arxiv","version":3}},"canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30df61498a723a9f3ee9f0ff375a581970ac8e367cb78c4ebcda5b33de502018","first_computed_at":"2026-05-18T00:22:12.139795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:12.139795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RVgCd8cXb8R6GLBUjzghd968ov1L0TptvqaXNh9fT0ydkAp2q/9qmebdlB1+wKgQEDOBudZaHtmpJ6lanTsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:12.140545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02983","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78a5666c14fca64d725eea33d247ed3c7684de0f4adc7c25f027f97cb7bfd9e6","sha256:a700d67085e5113a6d02c07436d6820ef026489de3183b2653d8a7c40e3ed765"],"state_sha256":"2c5ee2aea04429cbd2aa7c619a427aa0f3ee388d1dfff02e774ee49fd5fc097c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78HRAs9oIJrpRbbpm7rkIf5m/AlHHElF2oP/A4IzDi5AQRD4C4vZ+hoFC/Dw0osHvxoFsS0A4mQNdbgemcFEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:23:01.846920Z","bundle_sha256":"0ba71282299ecde7f4287623982cf6254cdf097dd182ddcb2ed582cee359365c"}}