{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:PFWNBRSQBY4RYBSNQLOLECMQQR","short_pith_number":"pith:PFWNBRSQ","canonical_record":{"source":{"id":"0911.2960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-16T06:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"2fbf165804d9b2c6b24cebdda55d72b05ea33bbad447fd6f97994125f6563cdc","abstract_canon_sha256":"9cfb0883497b86dd7b942b3a72019d4502ab025ace391f8e07b1d15b2d1ec649"},"schema_version":"1.0"},"canonical_sha256":"796cd0c6500e391c064d82dcb20990844b68f7008e584793e2152880be1ac762","source":{"kind":"arxiv","id":"0911.2960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2960","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2960v1","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2960","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"PFWNBRSQBY4R","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"PFWNBRSQBY4RYBSN","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"PFWNBRSQ","created_at":"2026-07-04T17:15:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:PFWNBRSQBY4RYBSNQLOLECMQQR","target":"record","payload":{"canonical_record":{"source":{"id":"0911.2960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-16T06:50:18Z","cross_cats_sorted":[],"title_canon_sha256":"2fbf165804d9b2c6b24cebdda55d72b05ea33bbad447fd6f97994125f6563cdc","abstract_canon_sha256":"9cfb0883497b86dd7b942b3a72019d4502ab025ace391f8e07b1d15b2d1ec649"},"schema_version":"1.0"},"canonical_sha256":"796cd0c6500e391c064d82dcb20990844b68f7008e584793e2152880be1ac762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:15:54.297360Z","signature_b64":"1UeqxzaDJxXsru+6nbOOWNZGYg1phAtTIIKsZch5aj6Qsy0oJ17WJthkh8ROGoQgXiVIbkR8UsmjK3a/NH8OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"796cd0c6500e391c064d82dcb20990844b68f7008e584793e2152880be1ac762","last_reissued_at":"2026-07-04T17:15:54.296980Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:15:54.296980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.2960","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-04T17:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFfSKSAntD0m9OEC8eLIdjxUQ6fJYxAxwJBj3O9Y8tfMadKdPaMBlnPHAJospc5qygBr0qEslvo2RPOMMTW/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:05:46.895117Z"},"content_sha256":"fa67e2092d4636eae94750615884ff39f56d7ab1486620ae4e2c0277f9685ede","schema_version":"1.0","event_id":"sha256:fa67e2092d4636eae94750615884ff39f56d7ab1486620ae4e2c0277f9685ede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:PFWNBRSQBY4RYBSNQLOLECMQQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random $k$-noncrossing partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian M. Reidys, Jing Qin","submitted_at":"2009-11-16T06:50:18Z","abstract_excerpt":"In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually crossing arcs in its canonical representation and is 2-regular if the latter does not contain arcs of the form $(i,i+1)$. Using a bijection of Chen {\\it et al.} \\cite{Chen,Reidys:08tan}, we interpret $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions as restricted generalized vacillating tableaux. Furthermore, we interpret the tableaux as sampling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2960","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/0911.2960/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-04T17:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQaunT8AyqIiDQnTeTx0xrNvIN5ergQ5Tu1R4Zf6VSftOyqrKMqnLvN8j3Akd+KUHeINcFwq+7G9m8gLRxdgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:05:46.895639Z"},"content_sha256":"d059f1fd2cf34259f7cd71f5066b4e8cd1f1abe946f0dce0efdd3bf17eb63449","schema_version":"1.0","event_id":"sha256:d059f1fd2cf34259f7cd71f5066b4e8cd1f1abe946f0dce0efdd3bf17eb63449"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/bundle.json","state_url":"https://pith.science/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/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-13T10:05:46Z","links":{"resolver":"https://pith.science/pith/PFWNBRSQBY4RYBSNQLOLECMQQR","bundle":"https://pith.science/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/bundle.json","state":"https://pith.science/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFWNBRSQBY4RYBSNQLOLECMQQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:PFWNBRSQBY4RYBSNQLOLECMQQR","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":"9cfb0883497b86dd7b942b3a72019d4502ab025ace391f8e07b1d15b2d1ec649","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-16T06:50:18Z","title_canon_sha256":"2fbf165804d9b2c6b24cebdda55d72b05ea33bbad447fd6f97994125f6563cdc"},"schema_version":"1.0","source":{"id":"0911.2960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.2960","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"0911.2960v1","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2960","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"PFWNBRSQBY4R","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_16","alias_value":"PFWNBRSQBY4RYBSN","created_at":"2026-07-04T17:15:54Z"},{"alias_kind":"pith_short_8","alias_value":"PFWNBRSQ","created_at":"2026-07-04T17:15:54Z"}],"graph_snapshots":[{"event_id":"sha256:d059f1fd2cf34259f7cd71f5066b4e8cd1f1abe946f0dce0efdd3bf17eb63449","target":"graph","created_at":"2026-07-04T17:15: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/0911.2960/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually crossing arcs in its canonical representation and is 2-regular if the latter does not contain arcs of the form $(i,i+1)$. Using a bijection of Chen {\\it et al.} \\cite{Chen,Reidys:08tan}, we interpret $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions as restricted generalized vacillating tableaux. Furthermore, we interpret the tableaux as sampling","authors_text":"Christian M. Reidys, Jing Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-16T06:50:18Z","title":"Random $k$-noncrossing partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2960","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:fa67e2092d4636eae94750615884ff39f56d7ab1486620ae4e2c0277f9685ede","target":"record","created_at":"2026-07-04T17:15: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":"9cfb0883497b86dd7b942b3a72019d4502ab025ace391f8e07b1d15b2d1ec649","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-16T06:50:18Z","title_canon_sha256":"2fbf165804d9b2c6b24cebdda55d72b05ea33bbad447fd6f97994125f6563cdc"},"schema_version":"1.0","source":{"id":"0911.2960","kind":"arxiv","version":1}},"canonical_sha256":"796cd0c6500e391c064d82dcb20990844b68f7008e584793e2152880be1ac762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"796cd0c6500e391c064d82dcb20990844b68f7008e584793e2152880be1ac762","first_computed_at":"2026-07-04T17:15:54.296980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:15:54.296980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1UeqxzaDJxXsru+6nbOOWNZGYg1phAtTIIKsZch5aj6Qsy0oJ17WJthkh8ROGoQgXiVIbkR8UsmjK3a/NH8OCA==","signature_status":"signed_v1","signed_at":"2026-07-04T17:15:54.297360Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.2960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa67e2092d4636eae94750615884ff39f56d7ab1486620ae4e2c0277f9685ede","sha256:d059f1fd2cf34259f7cd71f5066b4e8cd1f1abe946f0dce0efdd3bf17eb63449"],"state_sha256":"fc9ff1e90b72e72dbb27e219144c271a19c1e5bf948d5f100e901c96f9099322"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHfOY7nFyyRFoqn6i1ENIOSdq/u3Sh35ssp/CofwHJXe8SFsUjXuFZh4PLsQoxnOpzcoBkQIBwpdQ7sWusfyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:05:46.900001Z","bundle_sha256":"2bc984d2a297bf48f58ed8d74e9a7ef1f625b7b5318a40326cf4c61a164a5934"}}