{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DGUNJAJWPWBZZESIK4QHMMYKTX","short_pith_number":"pith:DGUNJAJW","schema_version":"1.0","canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","source":{"kind":"arxiv","id":"1409.6021","version":2},"attestation_state":"computed","paper":{"title":"On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"primary_cat":"math.CO","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2014-09-21T17:48:32Z","abstract_excerpt":"Random $s$-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random $s$-intersection graph is constructed by first assigning each vertex a set of items in some random manner, and then putting an undirected edge between all pairs of vertices that share at least $s$ items (the graph is called a random intersection graph when $s=1$). A special case of particular interest is a uniform random $s$-intersection graph, where each vertex independently selects the same number of items uniformly at random from a common item pool. Another im"},"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":"1409.6021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-21T17:48:32Z","cross_cats_sorted":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"title_canon_sha256":"0b2ebb8da07b24cb42781538052c8d7ca4691c67a64b65b77a163a5f173c8683","abstract_canon_sha256":"f1e553e22db4e6318e55441ed5784c46348e3ca506af7eebdc95858468253cf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.690271Z","signature_b64":"KdibzQCuTrGSjfUV68GO8kcBPt4d5w6GEvuSboIPn/lggLPAn1jXpgADltXqsu6H4d9UWUo7Z9Kr5JYn1R8FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","last_reissued_at":"2026-05-18T02:34:51.689896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.689896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"primary_cat":"math.CO","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2014-09-21T17:48:32Z","abstract_excerpt":"Random $s$-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random $s$-intersection graph is constructed by first assigning each vertex a set of items in some random manner, and then putting an undirected edge between all pairs of vertices that share at least $s$ items (the graph is called a random intersection graph when $s=1$). A special case of particular interest is a uniform random $s$-intersection graph, where each vertex independently selects the same number of items uniformly at random from a common item pool. Another im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6021","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.6021","created_at":"2026-05-18T02:34:51.689959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6021v2","created_at":"2026-05-18T02:34:51.689959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6021","created_at":"2026-05-18T02:34:51.689959+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGUNJAJWPWBZ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGUNJAJWPWBZZESI","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGUNJAJW","created_at":"2026-05-18T12:28:25.294606+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/DGUNJAJWPWBZZESIK4QHMMYKTX","json":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX.json","graph_json":"https://pith.science/api/pith-number/DGUNJAJWPWBZZESIK4QHMMYKTX/graph.json","events_json":"https://pith.science/api/pith-number/DGUNJAJWPWBZZESIK4QHMMYKTX/events.json","paper":"https://pith.science/paper/DGUNJAJW"},"agent_actions":{"view_html":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX","download_json":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX.json","view_paper":"https://pith.science/paper/DGUNJAJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6021&json=true","fetch_graph":"https://pith.science/api/pith-number/DGUNJAJWPWBZZESIK4QHMMYKTX/graph.json","fetch_events":"https://pith.science/api/pith-number/DGUNJAJWPWBZZESIK4QHMMYKTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/action/storage_attestation","attest_author":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/action/author_attestation","sign_citation":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/action/citation_signature","submit_replication":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/action/replication_record"}},"created_at":"2026-05-18T02:34:51.689959+00:00","updated_at":"2026-05-18T02:34:51.689959+00:00"}