{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ERHZDZEC65WLJ7W5GDK3BWMWH","short_pith_number":"pith:5ERHZDZE","canonical_record":{"source":{"id":"1906.06336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-14T10:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"9e27a649115cf2a9b46c51136e2ebf9f6e1821c6773f5a3151d5a390957c339b","abstract_canon_sha256":"6ad72bdb47ae651ecd06027b858c9a1c64e206dd5e43882f5c1ed2cc0804b686"},"schema_version":"1.0"},"canonical_sha256":"e9227c8f2417bb65a7f6e986ad86ccb1dd58013bb75431d90f709f8905957baa","source":{"kind":"arxiv","id":"1906.06336","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06336","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06336v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06336","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"5ERHZDZEC65W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ERHZDZEC65WLJ7W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ERHZDZE","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ERHZDZEC65WLJ7W5GDK3BWMWH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-14T10:27:40Z","cross_cats_sorted":[],"title_canon_sha256":"9e27a649115cf2a9b46c51136e2ebf9f6e1821c6773f5a3151d5a390957c339b","abstract_canon_sha256":"6ad72bdb47ae651ecd06027b858c9a1c64e206dd5e43882f5c1ed2cc0804b686"},"schema_version":"1.0"},"canonical_sha256":"e9227c8f2417bb65a7f6e986ad86ccb1dd58013bb75431d90f709f8905957baa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.967778Z","signature_b64":"cN5YHiOAWpwyz1lUBJ5tuLt8yM7BHEsxtzJjfuZX1CrNkiKZ4lWCSVcaXfcd5mbisY7Ig32Qyyx90Ummwm/eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9227c8f2417bb65a7f6e986ad86ccb1dd58013bb75431d90f709f8905957baa","last_reissued_at":"2026-05-17T23:43:13.967306Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.967306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06336","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-05-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsPXMZSNSQ8nQe04KPsQbMeL4xdU9Cq2IArNCVTcUG8ZUKOcz+PfOlAWtbXwAL+MIjrPfZWL/CXh1SH/JegpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:30:08.356402Z"},"content_sha256":"bd114c26187452aadb8668f084d5e9b99715a7a0bbad2c8ee006994565f15ebc","schema_version":"1.0","event_id":"sha256:bd114c26187452aadb8668f084d5e9b99715a7a0bbad2c8ee006994565f15ebc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ERHZDZEC65WLJ7W5GDK3BWMWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Poisson limit for the number of cycles in a random permutation and the number of segregating sites","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Helmut H. Pitters, Philip Weissmann","submitted_at":"2019-06-14T10:27:40Z","abstract_excerpt":"Consider a random permutation of $\\{1, \\ldots, \\lfloor n^{t_2}\\rfloor\\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\\equiv (t_1, t_2)\\in\\mathbb [0, 1]^2$.\n  Next, consider a sample drawn from a large, neutral population of haploid individuals subject to mutation under the infinitely many sites model of Kimura whose genealogy is governed by Kingman's coalescent. Let $S(n, t)$ count the number of segregating sites in a sample of size $\\lfloor n^{t_2}\\rfloor$ when mutations arrive at rate $t_1/2$.\n  We show that $K(n, (t_1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06336","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":""},"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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ibS2O6+yFgUwZuhWaVKIk/cmA63nZnUhRch5SqtIEo+BoDJjZVMcL9ke+/CTTTyEi3Z55OUxOfE6SCsitakCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:30:08.356760Z"},"content_sha256":"dcd3d50da033dbc64f913fb307da3d1ea22d9f5d72abdbcb2f94bb80ea97d9be","schema_version":"1.0","event_id":"sha256:dcd3d50da033dbc64f913fb307da3d1ea22d9f5d72abdbcb2f94bb80ea97d9be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/bundle.json","state_url":"https://pith.science/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/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-21T05:30:08Z","links":{"resolver":"https://pith.science/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH","bundle":"https://pith.science/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/bundle.json","state":"https://pith.science/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ERHZDZEC65WLJ7W5GDK3BWMWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ERHZDZEC65WLJ7W5GDK3BWMWH","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":"6ad72bdb47ae651ecd06027b858c9a1c64e206dd5e43882f5c1ed2cc0804b686","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-14T10:27:40Z","title_canon_sha256":"9e27a649115cf2a9b46c51136e2ebf9f6e1821c6773f5a3151d5a390957c339b"},"schema_version":"1.0","source":{"id":"1906.06336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06336","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06336v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06336","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"5ERHZDZEC65W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ERHZDZEC65WLJ7W","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ERHZDZE","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:dcd3d50da033dbc64f913fb307da3d1ea22d9f5d72abdbcb2f94bb80ea97d9be","target":"graph","created_at":"2026-05-17T23:43:13Z","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":"Consider a random permutation of $\\{1, \\ldots, \\lfloor n^{t_2}\\rfloor\\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\\equiv (t_1, t_2)\\in\\mathbb [0, 1]^2$.\n  Next, consider a sample drawn from a large, neutral population of haploid individuals subject to mutation under the infinitely many sites model of Kimura whose genealogy is governed by Kingman's coalescent. Let $S(n, t)$ count the number of segregating sites in a sample of size $\\lfloor n^{t_2}\\rfloor$ when mutations arrive at rate $t_1/2$.\n  We show that $K(n, (t_1/","authors_text":"Helmut H. Pitters, Philip Weissmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-14T10:27:40Z","title":"Poisson limit for the number of cycles in a random permutation and the number of segregating sites"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06336","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:bd114c26187452aadb8668f084d5e9b99715a7a0bbad2c8ee006994565f15ebc","target":"record","created_at":"2026-05-17T23:43:13Z","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":"6ad72bdb47ae651ecd06027b858c9a1c64e206dd5e43882f5c1ed2cc0804b686","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-14T10:27:40Z","title_canon_sha256":"9e27a649115cf2a9b46c51136e2ebf9f6e1821c6773f5a3151d5a390957c339b"},"schema_version":"1.0","source":{"id":"1906.06336","kind":"arxiv","version":1}},"canonical_sha256":"e9227c8f2417bb65a7f6e986ad86ccb1dd58013bb75431d90f709f8905957baa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9227c8f2417bb65a7f6e986ad86ccb1dd58013bb75431d90f709f8905957baa","first_computed_at":"2026-05-17T23:43:13.967306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:13.967306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cN5YHiOAWpwyz1lUBJ5tuLt8yM7BHEsxtzJjfuZX1CrNkiKZ4lWCSVcaXfcd5mbisY7Ig32Qyyx90Ummwm/eBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:13.967778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd114c26187452aadb8668f084d5e9b99715a7a0bbad2c8ee006994565f15ebc","sha256:dcd3d50da033dbc64f913fb307da3d1ea22d9f5d72abdbcb2f94bb80ea97d9be"],"state_sha256":"985e05c3e0440355c9b0d399e97e948a19e810dfcf3d98403e28bb28eea256f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XHSov7qctnIiFN3fsMPcwpgKRHMqP9/NjqUwTcc+LXP8VzI1ym/wS2Hz8URbWQzXjFI1QEpFZ1juu2kbScrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T05:30:08.358751Z","bundle_sha256":"5b25f2a5c9b60483674ea212681295661a1e572c1b04c3acd0cbb68ececbc1b7"}}