{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CGXO76YLXVGDQUTCWUVSRGFSRV","short_pith_number":"pith:CGXO76YL","canonical_record":{"source":{"id":"1802.01171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-04T18:23:30Z","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"title_canon_sha256":"67e7b8bc26ea5f30f4287466a05736567c96b4778596c678c3f2b07953004db8","abstract_canon_sha256":"ffddb2fe53f7937516fdcd33806a82a03d7783b7bb6035758a41f70409237fb2"},"schema_version":"1.0"},"canonical_sha256":"11aeeffb0bbd4c385262b52b2898b28d5f31b7ba480e1ec4c4ae5668e22657c8","source":{"kind":"arxiv","id":"1802.01171","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01171","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01171v2","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01171","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGXO76YLXVGD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGXO76YLXVGDQUTC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGXO76YL","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CGXO76YLXVGDQUTCWUVSRGFSRV","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-04T18:23:30Z","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"title_canon_sha256":"67e7b8bc26ea5f30f4287466a05736567c96b4778596c678c3f2b07953004db8","abstract_canon_sha256":"ffddb2fe53f7937516fdcd33806a82a03d7783b7bb6035758a41f70409237fb2"},"schema_version":"1.0"},"canonical_sha256":"11aeeffb0bbd4c385262b52b2898b28d5f31b7ba480e1ec4c4ae5668e22657c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:32.261477Z","signature_b64":"1RCrw+75bD1Wxy0sbLh7RyopwNJcJ3QHhIe4b25dawXR8GGjw0BdDVbuzQESK66zc1RPgnn3AxKVI2UCQ6s8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11aeeffb0bbd4c385262b52b2898b28d5f31b7ba480e1ec4c4ae5668e22657c8","last_reissued_at":"2026-05-18T00:12:32.260873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:32.260873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01171","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-18T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1nB/yVwbYPhKbhbylM0v48nMbeWDZWUzrbb0kh6xVVgX5BhE0mh/vSSr7JrosZw8gGXsQ6OdkKhMoWIll8xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:17:31.432622Z"},"content_sha256":"981a426c8a63b9312f97779e30f6b1366280d9a6094ca8e357852958ff2faa5d","schema_version":"1.0","event_id":"sha256:981a426c8a63b9312f97779e30f6b1366280d9a6094ca8e357852958ff2faa5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CGXO76YLXVGDQUTCWUVSRGFSRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameter estimators of random intersection graphs with thinned communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Johan S.H. van Leeuwaarden, Joona Karjalainen, Lasse Leskel\\\"a","submitted_at":"2018-02-04T18:23:30Z","abstract_excerpt":"This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with probability $q$ via the community. In the special case with $q=1$ the model reduces to a random intersection graph which is known to generate high levels of transitivity also in the sparse context. The parameter $q$ adds a degree of freedom and leads to a parsimonious and analytically tractable network model with tunable density, transitivity, and degree fluctuations. We prove that the parameters of this model can be co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01171","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-18T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mywXfw4PY7QrU52sihPVbckv/myVGCIurCJ2uxIyYChhp8q8sFYqrEjIGjtMCzSMhoOVeV5WSjgN7rJ+GG3OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:17:31.433249Z"},"content_sha256":"102399b62e43477a549a8736a7d1c00ca799ee42cb567a546b7444db13ce1094","schema_version":"1.0","event_id":"sha256:102399b62e43477a549a8736a7d1c00ca799ee42cb567a546b7444db13ce1094"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/bundle.json","state_url":"https://pith.science/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/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-05-30T10:17:31Z","links":{"resolver":"https://pith.science/pith/CGXO76YLXVGDQUTCWUVSRGFSRV","bundle":"https://pith.science/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/bundle.json","state":"https://pith.science/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGXO76YLXVGDQUTCWUVSRGFSRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CGXO76YLXVGDQUTCWUVSRGFSRV","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":"ffddb2fe53f7937516fdcd33806a82a03d7783b7bb6035758a41f70409237fb2","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-04T18:23:30Z","title_canon_sha256":"67e7b8bc26ea5f30f4287466a05736567c96b4778596c678c3f2b07953004db8"},"schema_version":"1.0","source":{"id":"1802.01171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01171","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01171v2","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01171","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGXO76YLXVGD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGXO76YLXVGDQUTC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGXO76YL","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:102399b62e43477a549a8736a7d1c00ca799ee42cb567a546b7444db13ce1094","target":"graph","created_at":"2026-05-18T00:12:32Z","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":"This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with probability $q$ via the community. In the special case with $q=1$ the model reduces to a random intersection graph which is known to generate high levels of transitivity also in the sparse context. The parameter $q$ adds a degree of freedom and leads to a parsimonious and analytically tractable network model with tunable density, transitivity, and degree fluctuations. We prove that the parameters of this model can be co","authors_text":"Johan S.H. van Leeuwaarden, Joona Karjalainen, Lasse Leskel\\\"a","cross_cats":["cs.SI","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-04T18:23:30Z","title":"Parameter estimators of random intersection graphs with thinned communities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01171","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:981a426c8a63b9312f97779e30f6b1366280d9a6094ca8e357852958ff2faa5d","target":"record","created_at":"2026-05-18T00:12:32Z","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":"ffddb2fe53f7937516fdcd33806a82a03d7783b7bb6035758a41f70409237fb2","cross_cats_sorted":["cs.SI","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-02-04T18:23:30Z","title_canon_sha256":"67e7b8bc26ea5f30f4287466a05736567c96b4778596c678c3f2b07953004db8"},"schema_version":"1.0","source":{"id":"1802.01171","kind":"arxiv","version":2}},"canonical_sha256":"11aeeffb0bbd4c385262b52b2898b28d5f31b7ba480e1ec4c4ae5668e22657c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11aeeffb0bbd4c385262b52b2898b28d5f31b7ba480e1ec4c4ae5668e22657c8","first_computed_at":"2026-05-18T00:12:32.260873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:32.260873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RCrw+75bD1Wxy0sbLh7RyopwNJcJ3QHhIe4b25dawXR8GGjw0BdDVbuzQESK66zc1RPgnn3AxKVI2UCQ6s8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:32.261477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981a426c8a63b9312f97779e30f6b1366280d9a6094ca8e357852958ff2faa5d","sha256:102399b62e43477a549a8736a7d1c00ca799ee42cb567a546b7444db13ce1094"],"state_sha256":"a7d1af6024ae60f54cc9ba3701b40b26f76702e8ae2ad900a0c6cd2f8fdeba4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzDcYd6hNTYDs+3vSr2ZPLg/C4TXjyCMB7VAhN5tbxaQWaSYqHjKkxDP/0cYpRG9GhVX0jho1lo10x/VKpl7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:17:31.435947Z","bundle_sha256":"fdd216caceba83b0a13db0d109b4bf6025e1f26ac8880bc8fabdc4ffc75e300b"}}