{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BAGUGWVPKNCX4FXS5BLDUNLLEV","short_pith_number":"pith:BAGUGWVP","canonical_record":{"source":{"id":"1401.7381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T01:23:49Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8996e9d4b0ab2e7d673ea826b7c944682998517048dccdeba731033d3c0de188","abstract_canon_sha256":"936e9e28b1608acbca569c4d76186b7c2147d7db2b559110d287d7d6748359e3"},"schema_version":"1.0"},"canonical_sha256":"080d435aaf53457e16f2e8563a356b257d0092ef9a5fce1459dcef58ff9816bd","source":{"kind":"arxiv","id":"1401.7381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7381","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7381v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7381","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"BAGUGWVPKNCX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BAGUGWVPKNCX4FXS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BAGUGWVP","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BAGUGWVPKNCX4FXS5BLDUNLLEV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T01:23:49Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8996e9d4b0ab2e7d673ea826b7c944682998517048dccdeba731033d3c0de188","abstract_canon_sha256":"936e9e28b1608acbca569c4d76186b7c2147d7db2b559110d287d7d6748359e3"},"schema_version":"1.0"},"canonical_sha256":"080d435aaf53457e16f2e8563a356b257d0092ef9a5fce1459dcef58ff9816bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.660805Z","signature_b64":"XsoGqd6iNhMBm9pdD+Bt0UF9YV6QCtBl/xIY4XKdvvbQuX3qnFBlSEuyqFzyGh9hWAwTY3sFGOSAKvLlwP2xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"080d435aaf53457e16f2e8563a356b257d0092ef9a5fce1459dcef58ff9816bd","last_reissued_at":"2026-05-18T03:00:48.660094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.660094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7381","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:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGjNNKtVvkP/RREpng+TcjDxFfs23RSIwpMq2xjAXTciKGk20ju7CbogIRTYN51rIwZVWXFMJQ/6o+xZOHQkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:21.226280Z"},"content_sha256":"dd8c7006a4cec0d0e60eb43f62cbb97c5fb514c8d0fb3d6aaea4b479c2e83ec9","schema_version":"1.0","event_id":"sha256:dd8c7006a4cec0d0e60eb43f62cbb97c5fb514c8d0fb3d6aaea4b479c2e83ec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BAGUGWVPKNCX4FXS5BLDUNLLEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of sparse connected 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Cristiane M. Sato, Nick Wormald","submitted_at":"2014-01-29T01:23:49Z","abstract_excerpt":"We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\\omega(N^{1/3}\\ln^{2} N)$. This almost completely fills the gap in the range of $M$ for which the formula is known. We approach the problem using an `inside-out' approach of an earlier paper of Pittel and the second author, for connected graphs. A key part of the method uses structural components of connected hypergraphs called cores and kernels. These are structural components of connected hypergraphs. Our results also g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7381","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:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMCv+rV3wjoR5Khpesfyyl1cgDgU6rYOQOFvHnrrtHLd+uXrcpXaaGGg8yekLwGKy0PkCBq8kRlqH1whywezAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:21.226634Z"},"content_sha256":"d061d577db4fc114265a4344430c314c962bb205efbd9ccb10fe60bfbdb5cb01","schema_version":"1.0","event_id":"sha256:d061d577db4fc114265a4344430c314c962bb205efbd9ccb10fe60bfbdb5cb01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/bundle.json","state_url":"https://pith.science/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/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-01T10:00:21Z","links":{"resolver":"https://pith.science/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV","bundle":"https://pith.science/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/bundle.json","state":"https://pith.science/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAGUGWVPKNCX4FXS5BLDUNLLEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BAGUGWVPKNCX4FXS5BLDUNLLEV","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":"936e9e28b1608acbca569c4d76186b7c2147d7db2b559110d287d7d6748359e3","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T01:23:49Z","title_canon_sha256":"8996e9d4b0ab2e7d673ea826b7c944682998517048dccdeba731033d3c0de188"},"schema_version":"1.0","source":{"id":"1401.7381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7381","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7381v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7381","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"BAGUGWVPKNCX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BAGUGWVPKNCX4FXS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BAGUGWVP","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d061d577db4fc114265a4344430c314c962bb205efbd9ccb10fe60bfbdb5cb01","target":"graph","created_at":"2026-05-18T03:00:48Z","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":"We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\\omega(N^{1/3}\\ln^{2} N)$. This almost completely fills the gap in the range of $M$ for which the formula is known. We approach the problem using an `inside-out' approach of an earlier paper of Pittel and the second author, for connected graphs. A key part of the method uses structural components of connected hypergraphs called cores and kernels. These are structural components of connected hypergraphs. Our results also g","authors_text":"Cristiane M. Sato, Nick Wormald","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T01:23:49Z","title":"Asymptotic enumeration of sparse connected 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7381","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:dd8c7006a4cec0d0e60eb43f62cbb97c5fb514c8d0fb3d6aaea4b479c2e83ec9","target":"record","created_at":"2026-05-18T03:00:48Z","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":"936e9e28b1608acbca569c4d76186b7c2147d7db2b559110d287d7d6748359e3","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-29T01:23:49Z","title_canon_sha256":"8996e9d4b0ab2e7d673ea826b7c944682998517048dccdeba731033d3c0de188"},"schema_version":"1.0","source":{"id":"1401.7381","kind":"arxiv","version":1}},"canonical_sha256":"080d435aaf53457e16f2e8563a356b257d0092ef9a5fce1459dcef58ff9816bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"080d435aaf53457e16f2e8563a356b257d0092ef9a5fce1459dcef58ff9816bd","first_computed_at":"2026-05-18T03:00:48.660094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:48.660094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XsoGqd6iNhMBm9pdD+Bt0UF9YV6QCtBl/xIY4XKdvvbQuX3qnFBlSEuyqFzyGh9hWAwTY3sFGOSAKvLlwP2xCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:48.660805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd8c7006a4cec0d0e60eb43f62cbb97c5fb514c8d0fb3d6aaea4b479c2e83ec9","sha256:d061d577db4fc114265a4344430c314c962bb205efbd9ccb10fe60bfbdb5cb01"],"state_sha256":"9992cf9a8772fa34becf61995a65bf3b6db97e6410a70c105e64c443079eecd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksHnfFAFDdHMGX58lSCPlQcdkqADSqgkcbP/Z/H42gAyiy/5lVwZ7BU9DxG1C3uyoXPmgjwI9Dp3FkSihhAsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:00:21.228656Z","bundle_sha256":"97333e3d116a67a0dbc45844cdf5ec910f25153bf0e64f25a057f434aacfd838"}}