{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:7NZTPZEZJ4I2OQZ5I5ZU3X2K55","short_pith_number":"pith:7NZTPZEZ","canonical_record":{"source":{"id":"math/0605490","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-05-17T21:11:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"24f108d60d20eb1912ab9cc811599ca97fe7182e3fa992a7c79f1df697df9370","abstract_canon_sha256":"bc6026fd0d29e57daf97c1e46ade3cda742bc1ab18ba7f065550c0f9725f82ac"},"schema_version":"1.0"},"canonical_sha256":"fb7337e4994f11a7433d47734ddf4aef5e977d588dc75ba1b4e5bec81029f338","source":{"kind":"arxiv","id":"math/0605490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0605490","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0605490v1","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0605490","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"7NZTPZEZJ4I2","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NZTPZEZJ4I2OQZ5","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NZTPZEZ","created_at":"2026-07-04T14:55:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:7NZTPZEZJ4I2OQZ5I5ZU3X2K55","target":"record","payload":{"canonical_record":{"source":{"id":"math/0605490","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-05-17T21:11:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"24f108d60d20eb1912ab9cc811599ca97fe7182e3fa992a7c79f1df697df9370","abstract_canon_sha256":"bc6026fd0d29e57daf97c1e46ade3cda742bc1ab18ba7f065550c0f9725f82ac"},"schema_version":"1.0"},"canonical_sha256":"fb7337e4994f11a7433d47734ddf4aef5e977d588dc75ba1b4e5bec81029f338","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:55:05.161620Z","signature_b64":"FbUNGgz/Bf1fNgQ3AwVHVZLLugRfts7SbnJ4VaMKzREyXQy3vtCByRespV0fcbFskyH7Ip6rSKyEE02+U+8sDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7337e4994f11a7433d47734ddf4aef5e977d588dc75ba1b4e5bec81029f338","last_reissued_at":"2026-07-04T14:55:05.161265Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:55:05.161265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0605490","source_version":1,"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-07-04T14:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrXoV/w9PhOxDZiGXZ5Y7XCW/6Emyxj7aiTAoFMOezJljWeq1jaJS9PvhJSiEXqPZ9qg/B9blfXbap5xclQ6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:58:26.620859Z"},"content_sha256":"da0ae0c311817f66a97a5456e792c51ccc7fa846fc4ac84e5b8df9ace5b35056","schema_version":"1.0","event_id":"sha256:da0ae0c311817f66a97a5456e792c51ccc7fa846fc4ac84e5b8df9ace5b35056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:7NZTPZEZJ4I2OQZ5I5ZU3X2K55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Likelihood of Comparability in Bruhat Order","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Adam Hammett, Boris Pittel","submitted_at":"2006-05-17T21:11:09Z","abstract_excerpt":"The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical experiments, we conjecture that in either case the upper bound is qualitatively close to the actual number of comparable pairs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0605490","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/math/0605490/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"},"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-07-04T14:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhpNxr4ka9Yls5MhCOAywW29IvUBDfTEg4cTwh2YXMxiH3Ao56b5oSjyY38+tyTgfFma7K0/teCR36jYCVdyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T16:58:26.621380Z"},"content_sha256":"9176c61ec261a0b9400300236302e1db1cc0233e176b857fb7090d87a2ace1c2","schema_version":"1.0","event_id":"sha256:9176c61ec261a0b9400300236302e1db1cc0233e176b857fb7090d87a2ace1c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/bundle.json","state_url":"https://pith.science/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/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-08-17T16:58:26Z","links":{"resolver":"https://pith.science/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55","bundle":"https://pith.science/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/bundle.json","state":"https://pith.science/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NZTPZEZJ4I2OQZ5I5ZU3X2K55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:7NZTPZEZJ4I2OQZ5I5ZU3X2K55","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":"bc6026fd0d29e57daf97c1e46ade3cda742bc1ab18ba7f065550c0f9725f82ac","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2006-05-17T21:11:09Z","title_canon_sha256":"24f108d60d20eb1912ab9cc811599ca97fe7182e3fa992a7c79f1df697df9370"},"schema_version":"1.0","source":{"id":"math/0605490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0605490","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"math/0605490v1","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0605490","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"7NZTPZEZJ4I2","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NZTPZEZJ4I2OQZ5","created_at":"2026-07-04T14:55:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NZTPZEZ","created_at":"2026-07-04T14:55:05Z"}],"graph_snapshots":[{"event_id":"sha256:9176c61ec261a0b9400300236302e1db1cc0233e176b857fb7090d87a2ace1c2","target":"graph","created_at":"2026-07-04T14:55:05Z","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/math/0605490/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical experiments, we conjecture that in either case the upper bound is qualitatively close to the actual number of comparable pairs.","authors_text":"Adam Hammett, Boris Pittel","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2006-05-17T21:11:09Z","title":"On the Likelihood of Comparability in Bruhat Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0605490","kind":"arxiv","version":1},"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:da0ae0c311817f66a97a5456e792c51ccc7fa846fc4ac84e5b8df9ace5b35056","target":"record","created_at":"2026-07-04T14:55:05Z","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":"bc6026fd0d29e57daf97c1e46ade3cda742bc1ab18ba7f065550c0f9725f82ac","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2006-05-17T21:11:09Z","title_canon_sha256":"24f108d60d20eb1912ab9cc811599ca97fe7182e3fa992a7c79f1df697df9370"},"schema_version":"1.0","source":{"id":"math/0605490","kind":"arxiv","version":1}},"canonical_sha256":"fb7337e4994f11a7433d47734ddf4aef5e977d588dc75ba1b4e5bec81029f338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7337e4994f11a7433d47734ddf4aef5e977d588dc75ba1b4e5bec81029f338","first_computed_at":"2026-07-04T14:55:05.161265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:55:05.161265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FbUNGgz/Bf1fNgQ3AwVHVZLLugRfts7SbnJ4VaMKzREyXQy3vtCByRespV0fcbFskyH7Ip6rSKyEE02+U+8sDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:55:05.161620Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0605490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da0ae0c311817f66a97a5456e792c51ccc7fa846fc4ac84e5b8df9ace5b35056","sha256:9176c61ec261a0b9400300236302e1db1cc0233e176b857fb7090d87a2ace1c2"],"state_sha256":"93e8046412e4157f09f70840a5b40c4479b146b79892dea208b2d497479ddf68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QBZqgiuY9M6/sINqEhtKU+s7MwoXQDHoMtyqGBKPCPIJJz3aJFrftSYMqSbFeGL0lMDQ+AKh7f9GorB906fAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T16:58:26.627929Z","bundle_sha256":"0a44d005af0dc82b862ff01fa64fa1a3c89617991b2b162cb742d64cfea0f719"}}