{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MEQXBQDEUUH5RNSJBEVLN4SP7X","short_pith_number":"pith:MEQXBQDE","canonical_record":{"source":{"id":"0807.2040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-13T16:26:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"387fdb650823e1a63578bfbf484f6976d4acbc4061d51275964f06b38050657d","abstract_canon_sha256":"3abd1f6d48d1dfdbd4e9b136e40bd2fd74cefa89f43f1c670d7a1c3dfbaccfac"},"schema_version":"1.0"},"canonical_sha256":"612170c064a50fd8b649092ab6f24ffdc430226fac3c926caf0a21b09aed4923","source":{"kind":"arxiv","id":"0807.2040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.2040","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"0807.2040v2","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2040","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"MEQXBQDEUUH5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MEQXBQDEUUH5RNSJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MEQXBQDE","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MEQXBQDEUUH5RNSJBEVLN4SP7X","target":"record","payload":{"canonical_record":{"source":{"id":"0807.2040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-13T16:26:15Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"387fdb650823e1a63578bfbf484f6976d4acbc4061d51275964f06b38050657d","abstract_canon_sha256":"3abd1f6d48d1dfdbd4e9b136e40bd2fd74cefa89f43f1c670d7a1c3dfbaccfac"},"schema_version":"1.0"},"canonical_sha256":"612170c064a50fd8b649092ab6f24ffdc430226fac3c926caf0a21b09aed4923","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:10.806101Z","signature_b64":"5pbYhfITyCdGA9g4SC+T75mbldFef9TLM2sjwlvxvMubC4TdrNZZCIho6RqbMkvU3Dis+Z5g8zR32aVd9ghSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"612170c064a50fd8b649092ab6f24ffdc430226fac3c926caf0a21b09aed4923","last_reissued_at":"2026-05-18T04:23:10.805688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:10.805688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.2040","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRkUyajS0pEwgMzMd1zNjUF7mgc5tAiPTvrLseHi7d7HhMLq5EsOqF4g5DL3QQwUyobwJPLeOJYeSInWBaeaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:04:27.810682Z"},"content_sha256":"ca9cc21cc6ddcec819e626e5088c32a6b11faf1a55ff13a02630689d98ed58bf","schema_version":"1.0","event_id":"sha256:ca9cc21cc6ddcec819e626e5088c32a6b11faf1a55ff13a02630689d98ed58bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MEQXBQDEUUH5RNSJBEVLN4SP7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse random graphs with clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Bela Bollobas, Oliver Riordan, Svante Janson","submitted_at":"2008-07-13T16:26:15Z","abstract_excerpt":"In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results about this extension. The basic idea is to construct the random graph by adding not only edges but also other small graphs. In other words, we first construct an inhomogeneous random hypergraph with independent hyperedges, and then replace each hyperedge by a (perhaps complete) graph. Although flexible enough to produce graphs with significant dependence between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.2040","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmPPv+83xwdjbXxaMAQEh1s5ZghwEFRJDIna4kKEHK+H16jCBTTeJlB6yv/BIjTYPtvfTi3qepekqjwlKQZACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:04:27.811367Z"},"content_sha256":"58a52b9d4ef97dce84d419d1f832fbd6dc2a91807d41537d2e839bfe5fabf6c8","schema_version":"1.0","event_id":"sha256:58a52b9d4ef97dce84d419d1f832fbd6dc2a91807d41537d2e839bfe5fabf6c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/bundle.json","state_url":"https://pith.science/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/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-25T21:04:27Z","links":{"resolver":"https://pith.science/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X","bundle":"https://pith.science/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/bundle.json","state":"https://pith.science/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEQXBQDEUUH5RNSJBEVLN4SP7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MEQXBQDEUUH5RNSJBEVLN4SP7X","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":"3abd1f6d48d1dfdbd4e9b136e40bd2fd74cefa89f43f1c670d7a1c3dfbaccfac","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-13T16:26:15Z","title_canon_sha256":"387fdb650823e1a63578bfbf484f6976d4acbc4061d51275964f06b38050657d"},"schema_version":"1.0","source":{"id":"0807.2040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.2040","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"0807.2040v2","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.2040","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"MEQXBQDEUUH5","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MEQXBQDEUUH5RNSJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MEQXBQDE","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:58a52b9d4ef97dce84d419d1f832fbd6dc2a91807d41537d2e839bfe5fabf6c8","target":"graph","created_at":"2026-05-18T04:23:10Z","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":"In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results about this extension. The basic idea is to construct the random graph by adding not only edges but also other small graphs. In other words, we first construct an inhomogeneous random hypergraph with independent hyperedges, and then replace each hyperedge by a (perhaps complete) graph. Although flexible enough to produce graphs with significant dependence between","authors_text":"Bela Bollobas, Oliver Riordan, Svante Janson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-13T16:26:15Z","title":"Sparse random graphs with clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.2040","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:ca9cc21cc6ddcec819e626e5088c32a6b11faf1a55ff13a02630689d98ed58bf","target":"record","created_at":"2026-05-18T04:23:10Z","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":"3abd1f6d48d1dfdbd4e9b136e40bd2fd74cefa89f43f1c670d7a1c3dfbaccfac","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-07-13T16:26:15Z","title_canon_sha256":"387fdb650823e1a63578bfbf484f6976d4acbc4061d51275964f06b38050657d"},"schema_version":"1.0","source":{"id":"0807.2040","kind":"arxiv","version":2}},"canonical_sha256":"612170c064a50fd8b649092ab6f24ffdc430226fac3c926caf0a21b09aed4923","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"612170c064a50fd8b649092ab6f24ffdc430226fac3c926caf0a21b09aed4923","first_computed_at":"2026-05-18T04:23:10.805688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:10.805688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5pbYhfITyCdGA9g4SC+T75mbldFef9TLM2sjwlvxvMubC4TdrNZZCIho6RqbMkvU3Dis+Z5g8zR32aVd9ghSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:10.806101Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.2040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca9cc21cc6ddcec819e626e5088c32a6b11faf1a55ff13a02630689d98ed58bf","sha256:58a52b9d4ef97dce84d419d1f832fbd6dc2a91807d41537d2e839bfe5fabf6c8"],"state_sha256":"099135e88a56e6378dd56d5da11d45c8db3b1f1360fc432b7fb50de2668319ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnH+wlEJG2rNZQBzA/pLX3zSNy/hrFminq2uEsR/mrg+iRzqsU2aKAo8cfIgNiuI9XYHU73kQr21Cknb48RRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:04:27.814933Z","bundle_sha256":"39d8ea4c3b695e8dcf06c05a0962919242485cbdfe2cb06779e0a1a17f5ca9b0"}}