{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KRJ36K5HZSS7CV464C2RP7XOSQ","short_pith_number":"pith:KRJ36K5H","schema_version":"1.0","canonical_sha256":"5453bf2ba7cca5f1579ee0b517feee9405010d0dcae2d4cc553cd0be44ce94cd","source":{"kind":"arxiv","id":"1809.05631","version":1},"attestation_state":"computed","paper":{"title":"A sharp threshold of propagation connectivity for mixed random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Guangyan Zhou, Ke Xu","submitted_at":"2018-09-15T01:41:18Z","abstract_excerpt":"This paper studies the propagation connectivity of a random hypergraph $\\mathbb{G}$ containing both 2-edges and 3-hyperedges. We find an exact threshold of the propagation connectivity of $\\mathbb{G}$: If $I_{\\epsilon,r}<-1$, then $\\mathbb{G}$ is not propagation connected with high probability; while if $I_{\\epsilon,r}>-1$, then $\\mathbb{G}$ is propagation connected with high probability, where $I_{\\epsilon,r}$ is a constant dependent on the parameters of 2 and 3-edge probabilities."},"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":"1809.05631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-15T01:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"c610cb038793c181443987184737bc9f84b61f92b74cf69d335f7fb5b1fbf7e4","abstract_canon_sha256":"ee8ef44d4337a003ce0df334fe61bb6b8b6d3b0d0ebdc2d6a38d648d311d1d1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:40.413613Z","signature_b64":"VluFLb/bh9/A7P3QnRrPnLKop6FqDCl96Cx2vUWETr58/ZP/Qf6ksWLB+cTw8A4UokMB3vnorElYWTGvT40VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5453bf2ba7cca5f1579ee0b517feee9405010d0dcae2d4cc553cd0be44ce94cd","last_reissued_at":"2026-05-18T00:05:40.412991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:40.412991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp threshold of propagation connectivity for mixed random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Guangyan Zhou, Ke Xu","submitted_at":"2018-09-15T01:41:18Z","abstract_excerpt":"This paper studies the propagation connectivity of a random hypergraph $\\mathbb{G}$ containing both 2-edges and 3-hyperedges. We find an exact threshold of the propagation connectivity of $\\mathbb{G}$: If $I_{\\epsilon,r}<-1$, then $\\mathbb{G}$ is not propagation connected with high probability; while if $I_{\\epsilon,r}>-1$, then $\\mathbb{G}$ is propagation connected with high probability, where $I_{\\epsilon,r}$ is a constant dependent on the parameters of 2 and 3-edge probabilities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05631","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":"1809.05631","created_at":"2026-05-18T00:05:40.413092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05631v1","created_at":"2026-05-18T00:05:40.413092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05631","created_at":"2026-05-18T00:05:40.413092+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRJ36K5HZSS7","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRJ36K5HZSS7CV46","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRJ36K5H","created_at":"2026-05-18T12:32:33.847187+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/KRJ36K5HZSS7CV464C2RP7XOSQ","json":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ.json","graph_json":"https://pith.science/api/pith-number/KRJ36K5HZSS7CV464C2RP7XOSQ/graph.json","events_json":"https://pith.science/api/pith-number/KRJ36K5HZSS7CV464C2RP7XOSQ/events.json","paper":"https://pith.science/paper/KRJ36K5H"},"agent_actions":{"view_html":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ","download_json":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ.json","view_paper":"https://pith.science/paper/KRJ36K5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05631&json=true","fetch_graph":"https://pith.science/api/pith-number/KRJ36K5HZSS7CV464C2RP7XOSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KRJ36K5HZSS7CV464C2RP7XOSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ/action/storage_attestation","attest_author":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ/action/author_attestation","sign_citation":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ/action/citation_signature","submit_replication":"https://pith.science/pith/KRJ36K5HZSS7CV464C2RP7XOSQ/action/replication_record"}},"created_at":"2026-05-18T00:05:40.413092+00:00","updated_at":"2026-05-18T00:05:40.413092+00:00"}