{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5A74LGLRHBAEIYJBSYD6MDD73E","short_pith_number":"pith:5A74LGLR","schema_version":"1.0","canonical_sha256":"e83fc5997138404461219607e60c7fd90f1341ce21da5201c4fca22015055fba","source":{"kind":"arxiv","id":"1508.03890","version":1},"attestation_state":"computed","paper":{"title":"On connectivity in a general random intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Jun Zhao","submitted_at":"2015-08-17T00:56:55Z","abstract_excerpt":"There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\\mathbb{G}(n,\\overrightarrow{a}, \\overrightarrow{K_n},P_n)$ defined on a set $\\mathcal{V}_n$ comprising $n$ vertices, where $\\overrightarrow{a}$ is a probability vector $(a_1,a_2,\\ldots,a_m)$ and $\\overrightarrow{K_n}$ is $(K_{1,n},K_{2,n},\\ldots,K_{m,n})$. This graph has been studied in the literature including a most recent work by Ya\\u{g}an [arXiv:1508.02407]. Suppose there is a pool $\\mathcal{P}_n$ consisting of $P_n$ distinct objects. The $n$ ve"},"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":"1508.03890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-08-17T00:56:55Z","cross_cats_sorted":["cs.SI","math.PR","physics.soc-ph"],"title_canon_sha256":"b7920470d0f475aade0ca923387abcc03275f39057a411fa1d8f744ef140c9cc","abstract_canon_sha256":"538708a45b13c84080cd47c977b5530ecc2188742bdb9a7f1805eaedf2dd10a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:14.971296Z","signature_b64":"0NrhrMtzVtjnqbumtY3gMMfYSsBn9a1PKyR5HkROiFDUWCPWo3mLRPk7NX/TUhSbztM2d0PZhjS5Azmk9n0EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83fc5997138404461219607e60c7fd90f1341ce21da5201c4fca22015055fba","last_reissued_at":"2026-05-18T01:35:14.970855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:14.970855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On connectivity in a general random intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Jun Zhao","submitted_at":"2015-08-17T00:56:55Z","abstract_excerpt":"There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\\mathbb{G}(n,\\overrightarrow{a}, \\overrightarrow{K_n},P_n)$ defined on a set $\\mathcal{V}_n$ comprising $n$ vertices, where $\\overrightarrow{a}$ is a probability vector $(a_1,a_2,\\ldots,a_m)$ and $\\overrightarrow{K_n}$ is $(K_{1,n},K_{2,n},\\ldots,K_{m,n})$. This graph has been studied in the literature including a most recent work by Ya\\u{g}an [arXiv:1508.02407]. Suppose there is a pool $\\mathcal{P}_n$ consisting of $P_n$ distinct objects. The $n$ ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03890","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":"1508.03890","created_at":"2026-05-18T01:35:14.970927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03890v1","created_at":"2026-05-18T01:35:14.970927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03890","created_at":"2026-05-18T01:35:14.970927+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A74LGLRHBAE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A74LGLRHBAEIYJB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A74LGLR","created_at":"2026-05-18T12:29:05.191682+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/5A74LGLRHBAEIYJBSYD6MDD73E","json":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E.json","graph_json":"https://pith.science/api/pith-number/5A74LGLRHBAEIYJBSYD6MDD73E/graph.json","events_json":"https://pith.science/api/pith-number/5A74LGLRHBAEIYJBSYD6MDD73E/events.json","paper":"https://pith.science/paper/5A74LGLR"},"agent_actions":{"view_html":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E","download_json":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E.json","view_paper":"https://pith.science/paper/5A74LGLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03890&json=true","fetch_graph":"https://pith.science/api/pith-number/5A74LGLRHBAEIYJBSYD6MDD73E/graph.json","fetch_events":"https://pith.science/api/pith-number/5A74LGLRHBAEIYJBSYD6MDD73E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E/action/storage_attestation","attest_author":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E/action/author_attestation","sign_citation":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E/action/citation_signature","submit_replication":"https://pith.science/pith/5A74LGLRHBAEIYJBSYD6MDD73E/action/replication_record"}},"created_at":"2026-05-18T01:35:14.970927+00:00","updated_at":"2026-05-18T01:35:14.970927+00:00"}