{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MLTOU2I2ELLRMRFW6VC4OZPCEL","short_pith_number":"pith:MLTOU2I2","canonical_record":{"source":{"id":"1203.3398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T15:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"0cb94e5e725c16b2883fa34f3e73e19725c1e9a8e8fdbfa2420272e277a82fa7","abstract_canon_sha256":"bc81be847fd1aae3f53941d2b00ea56556a7252dd299406eea83300f311c6d19"},"schema_version":"1.0"},"canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","source":{"kind":"arxiv","id":"1203.3398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3398","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3398v2","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3398","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"MLTOU2I2ELLR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLTOU2I2ELLRMRFW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLTOU2I2","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MLTOU2I2ELLRMRFW6VC4OZPCEL","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T15:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"0cb94e5e725c16b2883fa34f3e73e19725c1e9a8e8fdbfa2420272e277a82fa7","abstract_canon_sha256":"bc81be847fd1aae3f53941d2b00ea56556a7252dd299406eea83300f311c6d19"},"schema_version":"1.0"},"canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.513960Z","signature_b64":"a0u6v7hm6JzSNMHSxOk/m5HnIJWMyVNcJ1Us6cSDBdRFdF5ABPmyt/E7xCkLbLW49Fw4OilcDdFHhyDVVM7tAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","last_reissued_at":"2026-05-18T03:49:45.513387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.513387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3398","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-18T03:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNhAk1tIQoGzLg7yFOYeJ/snbt7d0K0RZqYrCzIoZNIQoxgjOXXA8Yk60jfHI5eFDFer7xmlV2/kHFDdMEuVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:08:32.218551Z"},"content_sha256":"a24d7e646f5e5bd011afc85ce45cd9974d186deb810b9c9ef0a9c53c3415afbc","schema_version":"1.0","event_id":"sha256:a24d7e646f5e5bd011afc85ce45cd9974d186deb810b9c9ef0a9c53c3415afbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MLTOU2I2ELLRMRFW6VC4OZPCEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity for random graphs from a weighted bridge-addable class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid","submitted_at":"2012-03-15T15:50:44Z","abstract_excerpt":"There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph is in the class and u and v are vertices in different components then the graph obtained by adding an edge (bridge) between u and v must also be in the class.\n  Various bounds are known concerning the probability of a random graph from such a class being connected or having many components, sometimes under the additional assumption that bridges can be delet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3398","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-18T03:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ1y9qQM17xSVOylGrXKJEY0PoqHSPtrYC8luA84bcBvk8BSWaaxHt5kQLiJBaihCgCl6YCne3iWceQinXcDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:08:32.218885Z"},"content_sha256":"089c0d7d6fdfc7b88cd0cfc48a77b1ddcf097fd97166f989e5705636371fa6d6","schema_version":"1.0","event_id":"sha256:089c0d7d6fdfc7b88cd0cfc48a77b1ddcf097fd97166f989e5705636371fa6d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/bundle.json","state_url":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/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-27T18:08:32Z","links":{"resolver":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL","bundle":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/bundle.json","state":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MLTOU2I2ELLRMRFW6VC4OZPCEL","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":"bc81be847fd1aae3f53941d2b00ea56556a7252dd299406eea83300f311c6d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T15:50:44Z","title_canon_sha256":"0cb94e5e725c16b2883fa34f3e73e19725c1e9a8e8fdbfa2420272e277a82fa7"},"schema_version":"1.0","source":{"id":"1203.3398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3398","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3398v2","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3398","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"MLTOU2I2ELLR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MLTOU2I2ELLRMRFW","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MLTOU2I2","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:089c0d7d6fdfc7b88cd0cfc48a77b1ddcf097fd97166f989e5705636371fa6d6","target":"graph","created_at":"2026-05-18T03:49:45Z","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":"There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph is in the class and u and v are vertices in different components then the graph obtained by adding an edge (bridge) between u and v must also be in the class.\n  Various bounds are known concerning the probability of a random graph from such a class being connected or having many components, sometimes under the additional assumption that bridges can be delet","authors_text":"Colin McDiarmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T15:50:44Z","title":"Connectivity for random graphs from a weighted bridge-addable class"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3398","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:a24d7e646f5e5bd011afc85ce45cd9974d186deb810b9c9ef0a9c53c3415afbc","target":"record","created_at":"2026-05-18T03:49:45Z","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":"bc81be847fd1aae3f53941d2b00ea56556a7252dd299406eea83300f311c6d19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-15T15:50:44Z","title_canon_sha256":"0cb94e5e725c16b2883fa34f3e73e19725c1e9a8e8fdbfa2420272e277a82fa7"},"schema_version":"1.0","source":{"id":"1203.3398","kind":"arxiv","version":2}},"canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","first_computed_at":"2026-05-18T03:49:45.513387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:45.513387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0u6v7hm6JzSNMHSxOk/m5HnIJWMyVNcJ1Us6cSDBdRFdF5ABPmyt/E7xCkLbLW49Fw4OilcDdFHhyDVVM7tAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:45.513960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24d7e646f5e5bd011afc85ce45cd9974d186deb810b9c9ef0a9c53c3415afbc","sha256:089c0d7d6fdfc7b88cd0cfc48a77b1ddcf097fd97166f989e5705636371fa6d6"],"state_sha256":"704caa1b2c7e9d70269510c1057a859c84c9f6645b64daff103d069b9974a8af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHx8FTaNR0+STPPGJepWHiqC3LncIJBQ9kxD7m+R2YGSc7NgPBup1RT/bvHkZuo+jNqrf+QnbNNLLniiW30QAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:08:32.220727Z","bundle_sha256":"d089a35b953839e20f014be5cf6a91429a0d82795b126f7053b952628b0c593e"}}