{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YL32RAWOLHIRQRAYBSC3MYHL7G","short_pith_number":"pith:YL32RAWO","canonical_record":{"source":{"id":"1210.6259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-23T15:03:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1805651636c0841a9cbe408ef4933431b9ff4b2ef4f89a51401c3c30460aafb3","abstract_canon_sha256":"c1fc1fed82aef29c10f773f40abd81f1cbe26acaa92ac8e167d9f1dae65fe298"},"schema_version":"1.0"},"canonical_sha256":"c2f7a882ce59d11844180c85b660ebf9b4140a5dec7fc1442fb7b80e176d55c0","source":{"kind":"arxiv","id":"1210.6259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6259","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6259v1","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6259","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"YL32RAWOLHIR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YL32RAWOLHIRQRAY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YL32RAWO","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YL32RAWOLHIRQRAYBSC3MYHL7G","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-23T15:03:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1805651636c0841a9cbe408ef4933431b9ff4b2ef4f89a51401c3c30460aafb3","abstract_canon_sha256":"c1fc1fed82aef29c10f773f40abd81f1cbe26acaa92ac8e167d9f1dae65fe298"},"schema_version":"1.0"},"canonical_sha256":"c2f7a882ce59d11844180c85b660ebf9b4140a5dec7fc1442fb7b80e176d55c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:25.062114Z","signature_b64":"IT/N049xy9zocMN4Idvz49k5Zy2XiNKe780nO/wZBU2wQSb+nvE4nd9C06LQ7kdWFAUCKSwg+fxXVuONfKzDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2f7a882ce59d11844180c85b660ebf9b4140a5dec7fc1442fb7b80e176d55c0","last_reissued_at":"2026-05-18T03:42:25.061621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:25.061621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6259","source_version":1,"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-18T03:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+yrVzNBHh3vGaVZs3LGO3mXFN0q6cv3HhFT9+f6e13Os+g/liC0u+GIyHIJO+z3H/v+4t6Gamw7Lu+xf4tqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:15:05.806135Z"},"content_sha256":"2f0144598ae094637f4be8c9bc4f4dd02f4f3fa0bf8d9fa219c9a8ac3586df9f","schema_version":"1.0","event_id":"sha256:2f0144598ae094637f4be8c9bc4f4dd02f4f3fa0bf8d9fa219c9a8ac3586df9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YL32RAWOLHIRQRAYBSC3MYHL7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity of inhomogeneous random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Luc Devroye, Nicolas Fraiman","submitted_at":"2012-10-23T15:03:13Z","abstract_excerpt":"We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i,j) is added with probability min(1, \\K(X_i,X_j) log n/n), where \\K \\ge 0 is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6259","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"},"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-18T03:42:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmx268w0InPTX0J5SvAkxZ/WEvY4qRzluHQ7lBhfh60ASXoMpbrFwcD56c3ZXahpN1gwdyi0rZBUfotGavVYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:15:05.806873Z"},"content_sha256":"0ffc748ff161024a46a7a32ca7f9c11148ea06378295cc5627c5099680c08a3a","schema_version":"1.0","event_id":"sha256:0ffc748ff161024a46a7a32ca7f9c11148ea06378295cc5627c5099680c08a3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/bundle.json","state_url":"https://pith.science/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/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-08T05:15:05Z","links":{"resolver":"https://pith.science/pith/YL32RAWOLHIRQRAYBSC3MYHL7G","bundle":"https://pith.science/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/bundle.json","state":"https://pith.science/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL32RAWOLHIRQRAYBSC3MYHL7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YL32RAWOLHIRQRAYBSC3MYHL7G","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":"c1fc1fed82aef29c10f773f40abd81f1cbe26acaa92ac8e167d9f1dae65fe298","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-23T15:03:13Z","title_canon_sha256":"1805651636c0841a9cbe408ef4933431b9ff4b2ef4f89a51401c3c30460aafb3"},"schema_version":"1.0","source":{"id":"1210.6259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6259","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6259v1","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6259","created_at":"2026-05-18T03:42:25Z"},{"alias_kind":"pith_short_12","alias_value":"YL32RAWOLHIR","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YL32RAWOLHIRQRAY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YL32RAWO","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:0ffc748ff161024a46a7a32ca7f9c11148ea06378295cc5627c5099680c08a3a","target":"graph","created_at":"2026-05-18T03:42:25Z","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":"We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a separable metric space, and let their indices form the vertex set of a graph. An edge (i,j) is added with probability min(1, \\K(X_i,X_j) log n/n), where \\K \\ge 0 is a fixed kernel. We show that, under reasonably weak assumptions, the connectivity threshold of the model can be determined.","authors_text":"Luc Devroye, Nicolas Fraiman","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-23T15:03:13Z","title":"Connectivity of inhomogeneous random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6259","kind":"arxiv","version":1},"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:2f0144598ae094637f4be8c9bc4f4dd02f4f3fa0bf8d9fa219c9a8ac3586df9f","target":"record","created_at":"2026-05-18T03:42:25Z","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":"c1fc1fed82aef29c10f773f40abd81f1cbe26acaa92ac8e167d9f1dae65fe298","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-10-23T15:03:13Z","title_canon_sha256":"1805651636c0841a9cbe408ef4933431b9ff4b2ef4f89a51401c3c30460aafb3"},"schema_version":"1.0","source":{"id":"1210.6259","kind":"arxiv","version":1}},"canonical_sha256":"c2f7a882ce59d11844180c85b660ebf9b4140a5dec7fc1442fb7b80e176d55c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2f7a882ce59d11844180c85b660ebf9b4140a5dec7fc1442fb7b80e176d55c0","first_computed_at":"2026-05-18T03:42:25.061621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:25.061621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IT/N049xy9zocMN4Idvz49k5Zy2XiNKe780nO/wZBU2wQSb+nvE4nd9C06LQ7kdWFAUCKSwg+fxXVuONfKzDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:25.062114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f0144598ae094637f4be8c9bc4f4dd02f4f3fa0bf8d9fa219c9a8ac3586df9f","sha256:0ffc748ff161024a46a7a32ca7f9c11148ea06378295cc5627c5099680c08a3a"],"state_sha256":"5c306334690c3fc0d741504e21a388d093596a3d7ca1100bb7ab788b232c073e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpTU3WbAcUdo2CB0gUFqhsBGUKNT52WABxQlpJOpWnUJe+Bj8MJ50gpP6o3Hmuf8ipfUAmvIwGJLFOzoIqrSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:15:05.810597Z","bundle_sha256":"3b84a229e56c053db31bf3ec9665a1b60753e41bcf2900f634acb17676427035"}}