{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FHIR543HEKYTRFRDR54ZGGW7V5","short_pith_number":"pith:FHIR543H","schema_version":"1.0","canonical_sha256":"29d11ef36722b13896238f79931adfaf4f69f8fa565724bf9f45263b68ae3918","source":{"kind":"arxiv","id":"2408.06611","version":2},"attestation_state":"computed","paper":{"title":"Poisson approximation for large permutation groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nathan Tung, Persi Diaconis","submitted_at":"2024-08-13T03:48:15Z","abstract_excerpt":"Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of $G_{k,n}$. This includes novel limit theorems for fixed points, cycles of various lengths, number of cycles and inversions. The limits are compound Poisson distributions with interesting dependence structure."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2408.06611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-08-13T03:48:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b507476f8800861e3d77125c51307e28efdaac759a7aa1def14f6b3c2a2d965","abstract_canon_sha256":"fa33ddd264fdcfd6e3036342b92bd428ebab54477280045382f051dad02bc58f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:35.398675Z","signature_b64":"saxzfz7va/CcOdjIn9barxhCDUEjIdv2S7BZuktdrnHqPHLwZ1fC5fbt8jJ801+lioaLhzduIKwnX6Pfv+RECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29d11ef36722b13896238f79931adfaf4f69f8fa565724bf9f45263b68ae3918","last_reissued_at":"2026-07-05T10:54:35.398140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:35.398140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poisson approximation for large permutation groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Nathan Tung, Persi Diaconis","submitted_at":"2024-08-13T03:48:15Z","abstract_excerpt":"Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of $G_{k,n}$. This includes novel limit theorems for fixed points, cycles of various lengths, number of cycles and inversions. The limits are compound Poisson distributions with interesting dependence structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06611","kind":"arxiv","version":2},"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/2408.06611/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.06611","created_at":"2026-07-05T10:54:35.398218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06611v2","created_at":"2026-07-05T10:54:35.398218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06611","created_at":"2026-07-05T10:54:35.398218+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHIR543HEKYT","created_at":"2026-07-05T10:54:35.398218+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHIR543HEKYTRFRD","created_at":"2026-07-05T10:54:35.398218+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHIR543H","created_at":"2026-07-05T10:54:35.398218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11731","citing_title":"Counting the number of group orbits by marrying the Burnside process with importance sampling","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5","json":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5.json","graph_json":"https://pith.science/api/pith-number/FHIR543HEKYTRFRDR54ZGGW7V5/graph.json","events_json":"https://pith.science/api/pith-number/FHIR543HEKYTRFRDR54ZGGW7V5/events.json","paper":"https://pith.science/paper/FHIR543H"},"agent_actions":{"view_html":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5","download_json":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5.json","view_paper":"https://pith.science/paper/FHIR543H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06611&json=true","fetch_graph":"https://pith.science/api/pith-number/FHIR543HEKYTRFRDR54ZGGW7V5/graph.json","fetch_events":"https://pith.science/api/pith-number/FHIR543HEKYTRFRDR54ZGGW7V5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5/action/storage_attestation","attest_author":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5/action/author_attestation","sign_citation":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5/action/citation_signature","submit_replication":"https://pith.science/pith/FHIR543HEKYTRFRDR54ZGGW7V5/action/replication_record"}},"created_at":"2026-07-05T10:54:35.398218+00:00","updated_at":"2026-07-05T10:54:35.398218+00:00"}