{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XPH5WH5QVXC3AECWHGD4PTUSPJ","short_pith_number":"pith:XPH5WH5Q","canonical_record":{"source":{"id":"2606.02263","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T13:50:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1ffff050dafb671ec2280d9ffc451e0c813aab1ec6e9b6bb2f6b27b43e342d7","abstract_canon_sha256":"d76a9981a13ad091cac3a89b4b7186a5b9a2adfdbfb679a4fe5df0d82ce1bcb6"},"schema_version":"1.0"},"canonical_sha256":"bbcfdb1fb0adc5b010563987c7ce927a462d8484172b70d2cde2b6e84a544716","source":{"kind":"arxiv","id":"2606.02263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02263","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02263v1","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02263","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"XPH5WH5QVXC3","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"XPH5WH5QVXC3AECW","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"XPH5WH5Q","created_at":"2026-06-02T03:04:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XPH5WH5QVXC3AECWHGD4PTUSPJ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02263","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T13:50:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1ffff050dafb671ec2280d9ffc451e0c813aab1ec6e9b6bb2f6b27b43e342d7","abstract_canon_sha256":"d76a9981a13ad091cac3a89b4b7186a5b9a2adfdbfb679a4fe5df0d82ce1bcb6"},"schema_version":"1.0"},"canonical_sha256":"bbcfdb1fb0adc5b010563987c7ce927a462d8484172b70d2cde2b6e84a544716","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:54.464492Z","signature_b64":"jvwUmR4fFuGtvYgNFNESVIgAnxk87ChfURMQr0/MIDnUVg7pqJGdP+46emY4le0KzCYjLv3Dkhn9zIVA2Zo9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbcfdb1fb0adc5b010563987c7ce927a462d8484172b70d2cde2b6e84a544716","last_reissued_at":"2026-06-02T03:04:54.464153Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:54.464153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02263","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-06-02T03:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYd5jhw+P6RdcJfM25/LXuCRx9lv7kTSTnx1MKaUMDrHVo7ySmbso2uEtZ4Uehuv0ZI5GZwfiInDH8fQ/e0fCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:05.608620Z"},"content_sha256":"0d83e7efc50198fb79332924fd0682e4dc7b427b41dc557efcc6eb154287b841","schema_version":"1.0","event_id":"sha256:0d83e7efc50198fb79332924fd0682e4dc7b427b41dc557efcc6eb154287b841"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XPH5WH5QVXC3AECWHGD4PTUSPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Peter Clifford, Rapha\\\"el Clifford","submitted_at":"2026-06-01T13:50:04Z","abstract_excerpt":"We study exact uniform sampling of permutations of length $n$ whose longest increasing subsequence (LIS) has prescribed length $k$. For $k \\in \\Theta(n)$, we give a direct rejection sampler whose expected running time is $O(n\\log\\log n)$ in the word-RAM model. The sampler uses an expanded proposal space consisting of permutations together with a specified increasing subsequence, and accepts exactly those proposals whose specified subsequence is the leftmost LIS. For arbitrary $1\\le k\\le n$, we give an exact sampler based on the Robinson--Schensted correspondence. The algorithm samples the corr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02263","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/2606.02263/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-06-02T03:04:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4Z4FZMQPNhkHSQqrumMEjcm1633z4ChnyFqVp1qSZGK253DMOIpOpHfcbsQrHzQ/O9LvdZJZAiOfgfyLSwFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:05.609404Z"},"content_sha256":"f8515d31e78729a02f089ad224a70e620edbe1babb2a44c9be04002e552c0177","schema_version":"1.0","event_id":"sha256:f8515d31e78729a02f089ad224a70e620edbe1babb2a44c9be04002e552c0177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/bundle.json","state_url":"https://pith.science/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/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-05T21:28:05Z","links":{"resolver":"https://pith.science/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ","bundle":"https://pith.science/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/bundle.json","state":"https://pith.science/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPH5WH5QVXC3AECWHGD4PTUSPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XPH5WH5QVXC3AECWHGD4PTUSPJ","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":"d76a9981a13ad091cac3a89b4b7186a5b9a2adfdbfb679a4fe5df0d82ce1bcb6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T13:50:04Z","title_canon_sha256":"d1ffff050dafb671ec2280d9ffc451e0c813aab1ec6e9b6bb2f6b27b43e342d7"},"schema_version":"1.0","source":{"id":"2606.02263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02263","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02263v1","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02263","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"XPH5WH5QVXC3","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"XPH5WH5QVXC3AECW","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"XPH5WH5Q","created_at":"2026-06-02T03:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:f8515d31e78729a02f089ad224a70e620edbe1babb2a44c9be04002e552c0177","target":"graph","created_at":"2026-06-02T03:04:54Z","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/2606.02263/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study exact uniform sampling of permutations of length $n$ whose longest increasing subsequence (LIS) has prescribed length $k$. For $k \\in \\Theta(n)$, we give a direct rejection sampler whose expected running time is $O(n\\log\\log n)$ in the word-RAM model. The sampler uses an expanded proposal space consisting of permutations together with a specified increasing subsequence, and accepts exactly those proposals whose specified subsequence is the leftmost LIS. For arbitrary $1\\le k\\le n$, we give an exact sampler based on the Robinson--Schensted correspondence. The algorithm samples the corr","authors_text":"Peter Clifford, Rapha\\\"el Clifford","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T13:50:04Z","title":"Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02263","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:0d83e7efc50198fb79332924fd0682e4dc7b427b41dc557efcc6eb154287b841","target":"record","created_at":"2026-06-02T03:04:54Z","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":"d76a9981a13ad091cac3a89b4b7186a5b9a2adfdbfb679a4fe5df0d82ce1bcb6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T13:50:04Z","title_canon_sha256":"d1ffff050dafb671ec2280d9ffc451e0c813aab1ec6e9b6bb2f6b27b43e342d7"},"schema_version":"1.0","source":{"id":"2606.02263","kind":"arxiv","version":1}},"canonical_sha256":"bbcfdb1fb0adc5b010563987c7ce927a462d8484172b70d2cde2b6e84a544716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbcfdb1fb0adc5b010563987c7ce927a462d8484172b70d2cde2b6e84a544716","first_computed_at":"2026-06-02T03:04:54.464153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:54.464153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvwUmR4fFuGtvYgNFNESVIgAnxk87ChfURMQr0/MIDnUVg7pqJGdP+46emY4le0KzCYjLv3Dkhn9zIVA2Zo9CQ==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:54.464492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d83e7efc50198fb79332924fd0682e4dc7b427b41dc557efcc6eb154287b841","sha256:f8515d31e78729a02f089ad224a70e620edbe1babb2a44c9be04002e552c0177"],"state_sha256":"8fe6243312f6310298bfe56a841e4a713196b7f7d03e818e5dee8f8e87f3610d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+MDHz/es+gNMAOaE2aPaqIRQ/IBVuNxjS77IN5+1oWTIJ13jOVR3rcR3tBqQg507cb/YatauBymQOatvlq3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:28:05.613525Z","bundle_sha256":"3643a873458f1a445619a4cea66a5d6e579bcfacd30f29a67f8eab8a55b46dc0"}}