{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LASH7PDX4V6JYTXASO27G5M22U","short_pith_number":"pith:LASH7PDX","canonical_record":{"source":{"id":"1205.4753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-21T21:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"f6df3daa7f5da2f0250792979a1c2762a4938041bfb9859fb4d951d037b7e8d6","abstract_canon_sha256":"9789dcfd80e7c58b2d93beb19ce5ef5949d2c14c2cdce9d9ed953d50f2f54180"},"schema_version":"1.0"},"canonical_sha256":"58247fbc77e57c9c4ee093b5f3759ad50858623a79bb94b0d88a1baac123531c","source":{"kind":"arxiv","id":"1205.4753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4753","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4753v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4753","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"LASH7PDX4V6J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LASH7PDX4V6JYTXA","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LASH7PDX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LASH7PDX4V6JYTXASO27G5M22U","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-21T21:19:17Z","cross_cats_sorted":[],"title_canon_sha256":"f6df3daa7f5da2f0250792979a1c2762a4938041bfb9859fb4d951d037b7e8d6","abstract_canon_sha256":"9789dcfd80e7c58b2d93beb19ce5ef5949d2c14c2cdce9d9ed953d50f2f54180"},"schema_version":"1.0"},"canonical_sha256":"58247fbc77e57c9c4ee093b5f3759ad50858623a79bb94b0d88a1baac123531c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.742289Z","signature_b64":"Nl2IIwCFJfRTMtICRgI2PmD+utsFqqYQZD5MsBzgvVzwaoPKnnKCry+uf8sN26RFcVG3dBE5Dwg56qS1RV2gCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58247fbc77e57c9c4ee093b5f3759ad50858623a79bb94b0d88a1baac123531c","last_reissued_at":"2026-05-18T03:55:11.741613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.741613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4753","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpvpDDz+i8mw7NWdpBFMzPQXADHrUXG7mBiVR/iiTJe0OXR59xPhm2GnlvQplKWg4pUVkmX25SbIMmg+WAAoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:47:47.525176Z"},"content_sha256":"79f0019627c907c236fbfa36eddbbcc0ab8138da61b210c833f2b9fd84dd64bf","schema_version":"1.0","event_id":"sha256:79f0019627c907c236fbfa36eddbbcc0ab8138da61b210c833f2b9fd84dd64bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LASH7PDX4V6JYTXASO27G5M22U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle structure of the interchange process and representation theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gady Kozma, Nathana\\\"el Berestycki","submitted_at":"2012-05-21T21:19:17Z","abstract_excerpt":"Consider the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we show that the expected number of cycles of size k jumps from 0 to its equilibrium value, 1/k, at the time where the giant component of the associated random graph first exceeds k. Consequently we deduce a new and simple proof of Schramm's theorem on random transpositions, that giant cycles emerge at the same time as the giant component in the random graph. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4753","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+a6jvGuFmN1vdfTgmgJ4pR5DHbKq6RuV4kYCFg/x+FV14t38uWz1jfMsSE8M8cfQ48Pbs/hvm7RjcPvIvikBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:47:47.525535Z"},"content_sha256":"e3af5fca7548f1ea74b289da71cf7bdf5a60c8f7f7e358287ff21a6f309df11e","schema_version":"1.0","event_id":"sha256:e3af5fca7548f1ea74b289da71cf7bdf5a60c8f7f7e358287ff21a6f309df11e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LASH7PDX4V6JYTXASO27G5M22U/bundle.json","state_url":"https://pith.science/pith/LASH7PDX4V6JYTXASO27G5M22U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LASH7PDX4V6JYTXASO27G5M22U/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-20T06:47:47Z","links":{"resolver":"https://pith.science/pith/LASH7PDX4V6JYTXASO27G5M22U","bundle":"https://pith.science/pith/LASH7PDX4V6JYTXASO27G5M22U/bundle.json","state":"https://pith.science/pith/LASH7PDX4V6JYTXASO27G5M22U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LASH7PDX4V6JYTXASO27G5M22U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LASH7PDX4V6JYTXASO27G5M22U","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":"9789dcfd80e7c58b2d93beb19ce5ef5949d2c14c2cdce9d9ed953d50f2f54180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-21T21:19:17Z","title_canon_sha256":"f6df3daa7f5da2f0250792979a1c2762a4938041bfb9859fb4d951d037b7e8d6"},"schema_version":"1.0","source":{"id":"1205.4753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4753","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4753v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4753","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"LASH7PDX4V6J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LASH7PDX4V6JYTXA","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LASH7PDX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:e3af5fca7548f1ea74b289da71cf7bdf5a60c8f7f7e358287ff21a6f309df11e","target":"graph","created_at":"2026-05-18T03:55:11Z","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 the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we show that the expected number of cycles of size k jumps from 0 to its equilibrium value, 1/k, at the time where the giant component of the associated random graph first exceeds k. Consequently we deduce a new and simple proof of Schramm's theorem on random transpositions, that giant cycles emerge at the same time as the giant component in the random graph. ","authors_text":"Gady Kozma, Nathana\\\"el Berestycki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-21T21:19:17Z","title":"Cycle structure of the interchange process and representation theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4753","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:79f0019627c907c236fbfa36eddbbcc0ab8138da61b210c833f2b9fd84dd64bf","target":"record","created_at":"2026-05-18T03:55:11Z","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":"9789dcfd80e7c58b2d93beb19ce5ef5949d2c14c2cdce9d9ed953d50f2f54180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-21T21:19:17Z","title_canon_sha256":"f6df3daa7f5da2f0250792979a1c2762a4938041bfb9859fb4d951d037b7e8d6"},"schema_version":"1.0","source":{"id":"1205.4753","kind":"arxiv","version":1}},"canonical_sha256":"58247fbc77e57c9c4ee093b5f3759ad50858623a79bb94b0d88a1baac123531c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58247fbc77e57c9c4ee093b5f3759ad50858623a79bb94b0d88a1baac123531c","first_computed_at":"2026-05-18T03:55:11.741613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.741613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nl2IIwCFJfRTMtICRgI2PmD+utsFqqYQZD5MsBzgvVzwaoPKnnKCry+uf8sN26RFcVG3dBE5Dwg56qS1RV2gCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.742289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79f0019627c907c236fbfa36eddbbcc0ab8138da61b210c833f2b9fd84dd64bf","sha256:e3af5fca7548f1ea74b289da71cf7bdf5a60c8f7f7e358287ff21a6f309df11e"],"state_sha256":"5f4c4a19aea6d6654f7217d78b3470a960fe8b6be06eb3ca933ab8b2bf6e3146"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19EA6EB+PaniCBR6QfjmsYO3Mk3c/bZQh1b/k5IQID2iUEb93JSm1++yUxhXqBEJHp5nOQdVAjg/Pk8544ftDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:47:47.527504Z","bundle_sha256":"68ce0d14eb2dbf55b1aebfd1f48c5d4ddd8fe6a04c725e92cc3ee47ba82bfdf3"}}