{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BEFAYVE3F2JAUUGG6DOROOCHZN","short_pith_number":"pith:BEFAYVE3","canonical_record":{"source":{"id":"1602.01270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-03T11:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"60cccc9548510404f20ebe7914a56f3208a5a5ccd414ca76d84407c1807c8872","abstract_canon_sha256":"de6b394c4b6bb4f5a5a684bfaef7ad1a0d9f7a80c32a7bfec10def6b1e46ce99"},"schema_version":"1.0"},"canonical_sha256":"090a0c549b2e920a50c6f0dd173847cb420d2c2c9329ab3239526e366898ec2e","source":{"kind":"arxiv","id":"1602.01270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01270","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01270v1","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01270","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"BEFAYVE3F2JA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BEFAYVE3F2JAUUGG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BEFAYVE3","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BEFAYVE3F2JAUUGG6DOROOCHZN","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-03T11:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"60cccc9548510404f20ebe7914a56f3208a5a5ccd414ca76d84407c1807c8872","abstract_canon_sha256":"de6b394c4b6bb4f5a5a684bfaef7ad1a0d9f7a80c32a7bfec10def6b1e46ce99"},"schema_version":"1.0"},"canonical_sha256":"090a0c549b2e920a50c6f0dd173847cb420d2c2c9329ab3239526e366898ec2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.627454Z","signature_b64":"coD8zz7vj5zsTvi/uTSejYNFe+u/RZY+NruTr9Zp3E47aRYFn0uB97NMtYa/JfOQQDpYffHEH2o2ehDf470zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090a0c549b2e920a50c6f0dd173847cb420d2c2c9329ab3239526e366898ec2e","last_reissued_at":"2026-05-18T01:21:20.626971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.626971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01270","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-18T01:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcCiqXFrZTRSVDktsf/Zn7sQuGjgErppMOM7ZuyknuR2l7NEal97gIEegCZP94JETMLEGmaFzqH9D6Hb9JL6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:26.984837Z"},"content_sha256":"049c130f442642f1dc2d552dab48cb0b943c367a0ed066cbdccb7021cf479e61","schema_version":"1.0","event_id":"sha256:049c130f442642f1dc2d552dab48cb0b943c367a0ed066cbdccb7021cf479e61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BEFAYVE3F2JAUUGG6DOROOCHZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On random partitions induced by random maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dmitry Krachun, Yuri Yakubovich","submitted_at":"2016-02-03T11:29:07Z","abstract_excerpt":"The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\\phi: [n] \\rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\\dots,p_t$ are chosen independently according to the uniform measure on the set of mappings $[n]\\rightarrow [n]$. The probability that the coarsest refinement of all $p_i$'s is the finest partitions $\\{\\{1\\},\\dots,\\{n\\}\\}$ is shown to approach $1$ for any $t\\geq 3$ and $e^{-1/2}$ for $t=2$. The probability that the finest coarsening of all $p_i$'s is the one-block partition is sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01270","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-18T01:21:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JehgH/pMS6crSuj7aPGybK2DJoiP6OvCXeJfVWm545BbNspL/XrKciY+XugPjryw5O+xt8/nCAPJHtTLULoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:26.985191Z"},"content_sha256":"8c7a001d379299e16ad916d0f5af32a3112a0c19859494f9f9041f477fc8301c","schema_version":"1.0","event_id":"sha256:8c7a001d379299e16ad916d0f5af32a3112a0c19859494f9f9041f477fc8301c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/bundle.json","state_url":"https://pith.science/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/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-05-30T22:46:26Z","links":{"resolver":"https://pith.science/pith/BEFAYVE3F2JAUUGG6DOROOCHZN","bundle":"https://pith.science/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/bundle.json","state":"https://pith.science/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEFAYVE3F2JAUUGG6DOROOCHZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BEFAYVE3F2JAUUGG6DOROOCHZN","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":"de6b394c4b6bb4f5a5a684bfaef7ad1a0d9f7a80c32a7bfec10def6b1e46ce99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-03T11:29:07Z","title_canon_sha256":"60cccc9548510404f20ebe7914a56f3208a5a5ccd414ca76d84407c1807c8872"},"schema_version":"1.0","source":{"id":"1602.01270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01270","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01270v1","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01270","created_at":"2026-05-18T01:21:20Z"},{"alias_kind":"pith_short_12","alias_value":"BEFAYVE3F2JA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BEFAYVE3F2JAUUGG","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BEFAYVE3","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:8c7a001d379299e16ad916d0f5af32a3112a0c19859494f9f9041f477fc8301c","target":"graph","created_at":"2026-05-18T01:21:20Z","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":"The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\\phi: [n] \\rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\\dots,p_t$ are chosen independently according to the uniform measure on the set of mappings $[n]\\rightarrow [n]$. The probability that the coarsest refinement of all $p_i$'s is the finest partitions $\\{\\{1\\},\\dots,\\{n\\}\\}$ is shown to approach $1$ for any $t\\geq 3$ and $e^{-1/2}$ for $t=2$. The probability that the finest coarsening of all $p_i$'s is the one-block partition is sho","authors_text":"Dmitry Krachun, Yuri Yakubovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-03T11:29:07Z","title":"On random partitions induced by random maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01270","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:049c130f442642f1dc2d552dab48cb0b943c367a0ed066cbdccb7021cf479e61","target":"record","created_at":"2026-05-18T01:21:20Z","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":"de6b394c4b6bb4f5a5a684bfaef7ad1a0d9f7a80c32a7bfec10def6b1e46ce99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-02-03T11:29:07Z","title_canon_sha256":"60cccc9548510404f20ebe7914a56f3208a5a5ccd414ca76d84407c1807c8872"},"schema_version":"1.0","source":{"id":"1602.01270","kind":"arxiv","version":1}},"canonical_sha256":"090a0c549b2e920a50c6f0dd173847cb420d2c2c9329ab3239526e366898ec2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"090a0c549b2e920a50c6f0dd173847cb420d2c2c9329ab3239526e366898ec2e","first_computed_at":"2026-05-18T01:21:20.626971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:20.626971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"coD8zz7vj5zsTvi/uTSejYNFe+u/RZY+NruTr9Zp3E47aRYFn0uB97NMtYa/JfOQQDpYffHEH2o2ehDf470zAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:20.627454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:049c130f442642f1dc2d552dab48cb0b943c367a0ed066cbdccb7021cf479e61","sha256:8c7a001d379299e16ad916d0f5af32a3112a0c19859494f9f9041f477fc8301c"],"state_sha256":"67aee6a3db84b8ba41e197e95e7041cb5f4d2fbaaab6afc0f1c345781ff00f74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQ2M2ybRaJnvixrE3spEdsTBgfbnk4uF8f+i4/OJBlFpd0jYhYIKhLXbBv+e48FvFnS85zBvrK0ZSi5uTdtmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:46:26.987257Z","bundle_sha256":"f6c9749cb7f397ebd568697d0ca640b1521a8a88edd051fba25fb93e9bd6a86b"}}