{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EVIY6BK62UEWH7PHT5VWY5F3HR","short_pith_number":"pith:EVIY6BK6","schema_version":"1.0","canonical_sha256":"25518f055ed50963fde79f6b6c74bb3c456263dc285f0676ed46d42004b6812e","source":{"kind":"arxiv","id":"1604.00842","version":1},"attestation_state":"computed","paper":{"title":"Homological connectivity of random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oliver Cooley, Penny Haxell, Philipp Spr\\\"ussel","submitted_at":"2016-04-04T13:01:23Z","abstract_excerpt":"We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first homology groups with coefficients in $\\mathbb{F}_2$ vanish. Although this is not intrinsically a monotone property, we show that it nevertheless has a single sharp threshold, and indeed prove a hitting time result relating the connectedness to the disappearance of the last minimal obstruction."},"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":"1604.00842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-04T13:01:23Z","cross_cats_sorted":[],"title_canon_sha256":"08e221caf68ff712f5a18f099f92bbf54959617c1fba7772b5c963e053959ff1","abstract_canon_sha256":"c50ac09a3bd097dd51974133333a33b1f887dbefd2c327253f3bb339e32bde27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.055809Z","signature_b64":"7P5mHfOFh0Ij7Td6mQZmPh2NvbVV8F6cu2yCC1Z1YIegyXWTqa15JO0S0OT3ItS9DprkVjf5o9Ou5Sce4qR1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25518f055ed50963fde79f6b6c74bb3c456263dc285f0676ed46d42004b6812e","last_reissued_at":"2026-05-18T01:17:48.054971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.054971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homological connectivity of random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mihyun Kang, Oliver Cooley, Penny Haxell, Philipp Spr\\\"ussel","submitted_at":"2016-04-04T13:01:23Z","abstract_excerpt":"We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first homology groups with coefficients in $\\mathbb{F}_2$ vanish. Although this is not intrinsically a monotone property, we show that it nevertheless has a single sharp threshold, and indeed prove a hitting time result relating the connectedness to the disappearance of the last minimal obstruction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00842","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.00842","created_at":"2026-05-18T01:17:48.055094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00842v1","created_at":"2026-05-18T01:17:48.055094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00842","created_at":"2026-05-18T01:17:48.055094+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVIY6BK62UEW","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVIY6BK62UEWH7PH","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVIY6BK6","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR","json":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR.json","graph_json":"https://pith.science/api/pith-number/EVIY6BK62UEWH7PHT5VWY5F3HR/graph.json","events_json":"https://pith.science/api/pith-number/EVIY6BK62UEWH7PHT5VWY5F3HR/events.json","paper":"https://pith.science/paper/EVIY6BK6"},"agent_actions":{"view_html":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR","download_json":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR.json","view_paper":"https://pith.science/paper/EVIY6BK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00842&json=true","fetch_graph":"https://pith.science/api/pith-number/EVIY6BK62UEWH7PHT5VWY5F3HR/graph.json","fetch_events":"https://pith.science/api/pith-number/EVIY6BK62UEWH7PHT5VWY5F3HR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR/action/storage_attestation","attest_author":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR/action/author_attestation","sign_citation":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR/action/citation_signature","submit_replication":"https://pith.science/pith/EVIY6BK62UEWH7PHT5VWY5F3HR/action/replication_record"}},"created_at":"2026-05-18T01:17:48.055094+00:00","updated_at":"2026-05-18T01:17:48.055094+00:00"}