{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:G3WMBNZXP54MNAZBD3DQOBW6Y2","short_pith_number":"pith:G3WMBNZX","canonical_record":{"source":{"id":"0706.0497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-06-04T18:49:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f6af65549fdd04920e4a32fe441bd3b11cf91075cf00774c9feaf50dfba706dd","abstract_canon_sha256":"41e9a4a7cad79477a16db1251527f1264f14617d888a8a66b4f46dd5c906fd50"},"schema_version":"1.0"},"canonical_sha256":"36ecc0b7377f78c683211ec70706dec69e3398cb9f8d01b52da3774f57fac6b9","source":{"kind":"arxiv","id":"0706.0497","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.0497","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"0706.0497v3","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0497","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"G3WMBNZXP54M","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"G3WMBNZXP54MNAZB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"G3WMBNZX","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:G3WMBNZXP54MNAZBD3DQOBW6Y2","target":"record","payload":{"canonical_record":{"source":{"id":"0706.0497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-06-04T18:49:03Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f6af65549fdd04920e4a32fe441bd3b11cf91075cf00774c9feaf50dfba706dd","abstract_canon_sha256":"41e9a4a7cad79477a16db1251527f1264f14617d888a8a66b4f46dd5c906fd50"},"schema_version":"1.0"},"canonical_sha256":"36ecc0b7377f78c683211ec70706dec69e3398cb9f8d01b52da3774f57fac6b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:02.218264Z","signature_b64":"2gzq8ZEDz3lspH3mTIs1yDhWjVtRR5E3N3F3t3i9Ie6+NUglBsfUuzWdRI94k3REIaTSvUhGeQcfM7gGk30nAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ecc0b7377f78c683211ec70706dec69e3398cb9f8d01b52da3774f57fac6b9","last_reissued_at":"2026-05-18T02:49:02.217850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:02.217850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0706.0497","source_version":3,"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-18T02:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q02QX/3EX7eFiU76tV0ohT6XHeelKTf91G9Nb/w2sWoxPYLgAej8OC0iTzBM6IYrRi08s3VRs5D7rL86Yl08BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:11:42.910658Z"},"content_sha256":"18b65b6930d954877ff2fb6ab4b57850bf553d25ad0524c0855916cd37e6216c","schema_version":"1.0","event_id":"sha256:18b65b6930d954877ff2fb6ab4b57850bf553d25ad0524c0855916cd37e6216c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:G3WMBNZXP54MNAZBD3DQOBW6Y2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Limit Theorems and Number of Connected Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Amin Coja-Oghlan, Michael Behrisch, Mihyun Kang","submitted_at":"2007-06-04T18:49:03Z","abstract_excerpt":"Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$ vertices and $m$ edges. We derive local limit theorems for the joint distribution of the number of vertices and the number of edges in the largest component of $H_d(n,p)$ and $H_d(n,m)$ for the regime ${{n-1}\\choose{d-1}} p,dm/n >(d-1)^{-1}+\\epsilon$. As an application, we obtain an asymptotic formula for the probability that $H_d(n,p)$ or $H_d(n,m)$ is connecte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.0497","kind":"arxiv","version":3},"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-18T02:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PP+AYO4lfaS8pRY7F7YR2si4DycTeWW3Ir28XDMqpNVmsX305m1hga5mYR2D9LQa4neBBrDhokgBQ4gx9d4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:11:42.911415Z"},"content_sha256":"79e02541fec88ee1f87e7c2b6eeee9d5ac031c65cc7edd3f0556c5e0b7906260","schema_version":"1.0","event_id":"sha256:79e02541fec88ee1f87e7c2b6eeee9d5ac031c65cc7edd3f0556c5e0b7906260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/bundle.json","state_url":"https://pith.science/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/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-31T19:11:42Z","links":{"resolver":"https://pith.science/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2","bundle":"https://pith.science/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/bundle.json","state":"https://pith.science/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3WMBNZXP54MNAZBD3DQOBW6Y2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:G3WMBNZXP54MNAZBD3DQOBW6Y2","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":"41e9a4a7cad79477a16db1251527f1264f14617d888a8a66b4f46dd5c906fd50","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-06-04T18:49:03Z","title_canon_sha256":"f6af65549fdd04920e4a32fe441bd3b11cf91075cf00774c9feaf50dfba706dd"},"schema_version":"1.0","source":{"id":"0706.0497","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.0497","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"0706.0497v3","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.0497","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"G3WMBNZXP54M","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"G3WMBNZXP54MNAZB","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"G3WMBNZX","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:79e02541fec88ee1f87e7c2b6eeee9d5ac031c65cc7edd3f0556c5e0b7906260","target":"graph","created_at":"2026-05-18T02:49:02Z","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":"Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$ vertices and $m$ edges. We derive local limit theorems for the joint distribution of the number of vertices and the number of edges in the largest component of $H_d(n,p)$ and $H_d(n,m)$ for the regime ${{n-1}\\choose{d-1}} p,dm/n >(d-1)^{-1}+\\epsilon$. As an application, we obtain an asymptotic formula for the probability that $H_d(n,p)$ or $H_d(n,m)$ is connecte","authors_text":"Amin Coja-Oghlan, Michael Behrisch, Mihyun Kang","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-06-04T18:49:03Z","title":"Local Limit Theorems and Number of Connected Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.0497","kind":"arxiv","version":3},"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:18b65b6930d954877ff2fb6ab4b57850bf553d25ad0524c0855916cd37e6216c","target":"record","created_at":"2026-05-18T02:49:02Z","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":"41e9a4a7cad79477a16db1251527f1264f14617d888a8a66b4f46dd5c906fd50","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-06-04T18:49:03Z","title_canon_sha256":"f6af65549fdd04920e4a32fe441bd3b11cf91075cf00774c9feaf50dfba706dd"},"schema_version":"1.0","source":{"id":"0706.0497","kind":"arxiv","version":3}},"canonical_sha256":"36ecc0b7377f78c683211ec70706dec69e3398cb9f8d01b52da3774f57fac6b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ecc0b7377f78c683211ec70706dec69e3398cb9f8d01b52da3774f57fac6b9","first_computed_at":"2026-05-18T02:49:02.217850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:02.217850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gzq8ZEDz3lspH3mTIs1yDhWjVtRR5E3N3F3t3i9Ie6+NUglBsfUuzWdRI94k3REIaTSvUhGeQcfM7gGk30nAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:02.218264Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.0497","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18b65b6930d954877ff2fb6ab4b57850bf553d25ad0524c0855916cd37e6216c","sha256:79e02541fec88ee1f87e7c2b6eeee9d5ac031c65cc7edd3f0556c5e0b7906260"],"state_sha256":"c9c272dbd245a07000c5502e736da2e7564f2f710626ed008128311df05dd498"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r66lq7kvmHYkCDIgZufPsAeCu4FIwCKClnXYwe0whL7Dj8eDphqUmHFVctpzTXlXoKOH2Q+rKq9HBb+L1lLjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:11:42.915278Z","bundle_sha256":"8bcf313bfaeb9fdbf13052d81d52403c041f1c2c2802acae2fff25c8b01b734e"}}