{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DGUNJAJWPWBZZESIK4QHMMYKTX","short_pith_number":"pith:DGUNJAJW","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"},"canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","source":{"kind":"arxiv","id":"1409.6021","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6021","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6021v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6021","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"DGUNJAJWPWBZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DGUNJAJWPWBZZESI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DGUNJAJW","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DGUNJAJWPWBZZESIK4QHMMYKTX","target":"record","payload":{"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"},"canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","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"},"source_kind":"arxiv","source_id":"1409.6021","source_version":2,"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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkYuxlGQ/7gkxdYClyx0gobv8hqfWsFPQl7owRuzxDXFGJ1uO6gE726hvTlv1OPNYG0ILOjT5ph6wxDKtBmQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:27:29.326819Z"},"content_sha256":"af210b34d38f856f02319949593ca9e1326918938235d62308a983dfd5659e3a","schema_version":"1.0","event_id":"sha256:af210b34d38f856f02319949593ca9e1326918938235d62308a983dfd5659e3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DGUNJAJWPWBZZESIK4QHMMYKTX","target":"graph","payload":{"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"},"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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wEl+TvGZsdOTJ5QP6xVJI0Tek++egsbGvEQjNSh6qjJY/SygVKR7nE8CQjI5ULJKburFPsZAo6OmMRE36DCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:27:29.327228Z"},"content_sha256":"c5f50f99acff82daf9718abfa6a89e69fe85526a0a8494dc9d9e9ae902411c05","schema_version":"1.0","event_id":"sha256:c5f50f99acff82daf9718abfa6a89e69fe85526a0a8494dc9d9e9ae902411c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/bundle.json","state_url":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/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-12T06:27:29Z","links":{"resolver":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX","bundle":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/bundle.json","state":"https://pith.science/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGUNJAJWPWBZZESIK4QHMMYKTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DGUNJAJWPWBZZESIK4QHMMYKTX","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":"f1e553e22db4e6318e55441ed5784c46348e3ca506af7eebdc95858468253cf7","cross_cats_sorted":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-21T17:48:32Z","title_canon_sha256":"0b2ebb8da07b24cb42781538052c8d7ca4691c67a64b65b77a163a5f173c8683"},"schema_version":"1.0","source":{"id":"1409.6021","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6021","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6021v2","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6021","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"DGUNJAJWPWBZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DGUNJAJWPWBZZESI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DGUNJAJW","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:c5f50f99acff82daf9718abfa6a89e69fe85526a0a8494dc9d9e9ae902411c05","target":"graph","created_at":"2026-05-18T02:34:51Z","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":"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","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","cross_cats":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-21T17:48:32Z","title":"On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6021","kind":"arxiv","version":2},"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:af210b34d38f856f02319949593ca9e1326918938235d62308a983dfd5659e3a","target":"record","created_at":"2026-05-18T02:34:51Z","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":"f1e553e22db4e6318e55441ed5784c46348e3ca506af7eebdc95858468253cf7","cross_cats_sorted":["cs.DM","cs.SI","math.PR","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-21T17:48:32Z","title_canon_sha256":"0b2ebb8da07b24cb42781538052c8d7ca4691c67a64b65b77a163a5f173c8683"},"schema_version":"1.0","source":{"id":"1409.6021","kind":"arxiv","version":2}},"canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a8d481367d839c9248572076330a9df9473acbae93827bc9d7e8ee06720049","first_computed_at":"2026-05-18T02:34:51.689896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.689896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KdibzQCuTrGSjfUV68GO8kcBPt4d5w6GEvuSboIPn/lggLPAn1jXpgADltXqsu6H4d9UWUo7Z9Kr5JYn1R8FAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.690271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6021","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af210b34d38f856f02319949593ca9e1326918938235d62308a983dfd5659e3a","sha256:c5f50f99acff82daf9718abfa6a89e69fe85526a0a8494dc9d9e9ae902411c05"],"state_sha256":"68c0988b4a7c25b977278da876de5bb800f01dc4bff6f8e66603372f019b1320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8M8/cjWbzuJV4fxMvIECZFs5VRZszWKnRGRAc4Gdim7ASsr3B3Q3beXc84EdISV4OPsrFhhcV3WC63eddRGTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:27:29.329909Z","bundle_sha256":"7aaca37a7ab799904acfc9fa58815074759a6a030ac28ce0a99b162c347c0c3e"}}