{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2PCJV764BZ5VN73S3DXMMFBTFG","short_pith_number":"pith:2PCJV764","canonical_record":{"source":{"id":"1404.5887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T16:52:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a9b94d0de9922633b031cc5a7adb74404c9045915c02183de40d967bbd3237b7","abstract_canon_sha256":"0f6534afb192db5358ecf6fbbc8f852a3f4f75ad3fb76514cb5a30ca6bf2a22a"},"schema_version":"1.0"},"canonical_sha256":"d3c49affdc0e7b56ff72d8eec6143329b3d0d1dcf9bb302e15aa60f5c94703e7","source":{"kind":"arxiv","id":"1404.5887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5887","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5887v2","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5887","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"2PCJV764BZ5V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PCJV764BZ5VN73S","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PCJV764","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2PCJV764BZ5VN73S3DXMMFBTFG","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T16:52:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a9b94d0de9922633b031cc5a7adb74404c9045915c02183de40d967bbd3237b7","abstract_canon_sha256":"0f6534afb192db5358ecf6fbbc8f852a3f4f75ad3fb76514cb5a30ca6bf2a22a"},"schema_version":"1.0"},"canonical_sha256":"d3c49affdc0e7b56ff72d8eec6143329b3d0d1dcf9bb302e15aa60f5c94703e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:58.524867Z","signature_b64":"f41MIc4inBtgAqcM8UF8w/zAmWRT+VEmScnSXD/UHFCzG6Rm53an6Z6NUZuY3gC3xPGHXfkKlrHm0kiDdLCcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c49affdc0e7b56ff72d8eec6143329b3d0d1dcf9bb302e15aa60f5c94703e7","last_reissued_at":"2026-05-18T01:22:58.524237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:58.524237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5887","source_version":2,"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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egDp+GB24ncVhjbREv9z0e+66dMfkBGl7CQIHhSbN8oWymZT9fHqM9CksJ2Bo8h9X8TYnfPrdgI6FhPOaDxOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:22:23.362243Z"},"content_sha256":"063e1e6d1b8f26350299ead74214ee68d1b8a988084230470e20891dd967068b","schema_version":"1.0","event_id":"sha256:063e1e6d1b8f26350299ead74214ee68d1b8a988084230470e20891dd967068b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2PCJV764BZ5VN73S3DXMMFBTFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting connected hypergraphs via the probabilistic method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Oliver Riordan","submitted_at":"2014-04-23T16:52:07Z","abstract_excerpt":"In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform hypergraphs on $[n]$ with $m$ edges and so nullity $t=(r-1)m-n+1$ were proved by Karo\\'nski and \\L uczak for the case $t=o(\\log n/\\log\\log n)$, and Behrisch, Coja-Oghlan and Kang for $t=\\Theta(n)$. Here we prove such a formula for any $r\\ge 3$ fixed, and any $t=t(n)$ satisfying $t=o(n)$ and $t\\to\\infty$ as $n\\to\\infty$. This leaves open only the (much simpler) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5887","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":""},"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:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7E/La3u9LzBuCquf3AQKua7OtS/YffffdViscxCJjBaV6ozywen0I5cYwOhWm7fbnJw8FL7fRxK1K559/E9qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:22:23.362899Z"},"content_sha256":"540c4c2e633daff8d5a6c5e1c91564ad20319810d31f4992970c2f2885be44df","schema_version":"1.0","event_id":"sha256:540c4c2e633daff8d5a6c5e1c91564ad20319810d31f4992970c2f2885be44df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PCJV764BZ5VN73S3DXMMFBTFG/bundle.json","state_url":"https://pith.science/pith/2PCJV764BZ5VN73S3DXMMFBTFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PCJV764BZ5VN73S3DXMMFBTFG/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-02T14:22:23Z","links":{"resolver":"https://pith.science/pith/2PCJV764BZ5VN73S3DXMMFBTFG","bundle":"https://pith.science/pith/2PCJV764BZ5VN73S3DXMMFBTFG/bundle.json","state":"https://pith.science/pith/2PCJV764BZ5VN73S3DXMMFBTFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PCJV764BZ5VN73S3DXMMFBTFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2PCJV764BZ5VN73S3DXMMFBTFG","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":"0f6534afb192db5358ecf6fbbc8f852a3f4f75ad3fb76514cb5a30ca6bf2a22a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T16:52:07Z","title_canon_sha256":"a9b94d0de9922633b031cc5a7adb74404c9045915c02183de40d967bbd3237b7"},"schema_version":"1.0","source":{"id":"1404.5887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5887","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5887v2","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5887","created_at":"2026-05-18T01:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"2PCJV764BZ5V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PCJV764BZ5VN73S","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PCJV764","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:540c4c2e633daff8d5a6c5e1c91564ad20319810d31f4992970c2f2885be44df","target":"graph","created_at":"2026-05-18T01:22:58Z","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":"In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asymptotic formulae for the number of connected $r$-uniform hypergraphs on $[n]$ with $m$ edges and so nullity $t=(r-1)m-n+1$ were proved by Karo\\'nski and \\L uczak for the case $t=o(\\log n/\\log\\log n)$, and Behrisch, Coja-Oghlan and Kang for $t=\\Theta(n)$. Here we prove such a formula for any $r\\ge 3$ fixed, and any $t=t(n)$ satisfying $t=o(n)$ and $t\\to\\infty$ as $n\\to\\infty$. This leaves open only the (much simpler) ","authors_text":"B\\'ela Bollob\\'as, Oliver Riordan","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T16:52:07Z","title":"Counting connected hypergraphs via the probabilistic method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5887","kind":"arxiv","version":2},"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:063e1e6d1b8f26350299ead74214ee68d1b8a988084230470e20891dd967068b","target":"record","created_at":"2026-05-18T01:22:58Z","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":"0f6534afb192db5358ecf6fbbc8f852a3f4f75ad3fb76514cb5a30ca6bf2a22a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-23T16:52:07Z","title_canon_sha256":"a9b94d0de9922633b031cc5a7adb74404c9045915c02183de40d967bbd3237b7"},"schema_version":"1.0","source":{"id":"1404.5887","kind":"arxiv","version":2}},"canonical_sha256":"d3c49affdc0e7b56ff72d8eec6143329b3d0d1dcf9bb302e15aa60f5c94703e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c49affdc0e7b56ff72d8eec6143329b3d0d1dcf9bb302e15aa60f5c94703e7","first_computed_at":"2026-05-18T01:22:58.524237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:58.524237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f41MIc4inBtgAqcM8UF8w/zAmWRT+VEmScnSXD/UHFCzG6Rm53an6Z6NUZuY3gC3xPGHXfkKlrHm0kiDdLCcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:58.524867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:063e1e6d1b8f26350299ead74214ee68d1b8a988084230470e20891dd967068b","sha256:540c4c2e633daff8d5a6c5e1c91564ad20319810d31f4992970c2f2885be44df"],"state_sha256":"a93b90e9dbe2be9c9a899c7412dfcd0542b4a8b480c704ec4444c66b74dbf888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhylEe+xO4gqi9MeIZ8SdcpWNUftGKKeJu/CCr1SJ1QV9uPtQ8pDOagsqdF18T9l6wwi8wsWTcpWG7h6hK2OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:22:23.365647Z","bundle_sha256":"43f0ccd153056c132c17f7cf855da9447becf7fb87ade3d50f936276c8d87e2f"}}