{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MLTOU2I2ELLRMRFW6VC4OZPCEL","short_pith_number":"pith:MLTOU2I2","schema_version":"1.0","canonical_sha256":"62e6ea691a22d71644b6f545c765e222c38a804c928543776c9f899ac751716d","source":{"kind":"arxiv","id":"1203.3398","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.3398","created_at":"2026-05-18T03:49:45.513477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3398v2","created_at":"2026-05-18T03:49:45.513477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3398","created_at":"2026-05-18T03:49:45.513477+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLTOU2I2ELLR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLTOU2I2ELLRMRFW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLTOU2I2","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL","json":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL.json","graph_json":"https://pith.science/api/pith-number/MLTOU2I2ELLRMRFW6VC4OZPCEL/graph.json","events_json":"https://pith.science/api/pith-number/MLTOU2I2ELLRMRFW6VC4OZPCEL/events.json","paper":"https://pith.science/paper/MLTOU2I2"},"agent_actions":{"view_html":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL","download_json":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL.json","view_paper":"https://pith.science/paper/MLTOU2I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3398&json=true","fetch_graph":"https://pith.science/api/pith-number/MLTOU2I2ELLRMRFW6VC4OZPCEL/graph.json","fetch_events":"https://pith.science/api/pith-number/MLTOU2I2ELLRMRFW6VC4OZPCEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/action/storage_attestation","attest_author":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/action/author_attestation","sign_citation":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/action/citation_signature","submit_replication":"https://pith.science/pith/MLTOU2I2ELLRMRFW6VC4OZPCEL/action/replication_record"}},"created_at":"2026-05-18T03:49:45.513477+00:00","updated_at":"2026-05-18T03:49:45.513477+00:00"}