{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OLWBFPDHPWHG3YLNWBICZBYPF5","short_pith_number":"pith:OLWBFPDH","schema_version":"1.0","canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","source":{"kind":"arxiv","id":"1311.3240","version":3},"attestation_state":"computed","paper":{"title":"Connectivity for bridge-alterable graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid","submitted_at":"2013-11-13T18:27:00Z","abstract_excerpt":"A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set of forests on vertex set {1,..,n}, a classical result of Renyi (1959) shows that the probability that $F_n$ is connected is $e^{-1/2 +o(1)}$. Recently Addario-Berry, McDiarmid and Reed (2012) and Kang and Panagiotou (2013) independently proved that, given a bridge-alterable class, for a random graph $R_n$ sampled uniformly from the graphs in the class on {1,"},"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":"1311.3240","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T18:27:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd93a6282e8e0b736d15c5ff07ddc3aac240b548934da15d45cab6f4069ff28b","abstract_canon_sha256":"8d393457fcae824777d1c1def0b14bc01fea0898dd1bf11c680b5c7aa4631f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:48.831695Z","signature_b64":"YzJfKwhbDVw5l/dNwk0FQrb1+1YWf2RcSIa5uZ3twD2DTPdnJHcTKs6rgOW2LLhJDvdktrp5x/CYdQ1ouIfVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","last_reissued_at":"2026-05-18T01:19:48.831250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:48.831250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectivity for bridge-alterable graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colin McDiarmid","submitted_at":"2013-11-13T18:27:00Z","abstract_excerpt":"A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set of forests on vertex set {1,..,n}, a classical result of Renyi (1959) shows that the probability that $F_n$ is connected is $e^{-1/2 +o(1)}$. Recently Addario-Berry, McDiarmid and Reed (2012) and Kang and Panagiotou (2013) independently proved that, given a bridge-alterable class, for a random graph $R_n$ sampled uniformly from the graphs in the class on {1,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3240","kind":"arxiv","version":3},"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":"1311.3240","created_at":"2026-05-18T01:19:48.831323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3240v3","created_at":"2026-05-18T01:19:48.831323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3240","created_at":"2026-05-18T01:19:48.831323+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLWBFPDHPWHG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLWBFPDHPWHG3YLN","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLWBFPDH","created_at":"2026-05-18T12:27:54.935989+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/OLWBFPDHPWHG3YLNWBICZBYPF5","json":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5.json","graph_json":"https://pith.science/api/pith-number/OLWBFPDHPWHG3YLNWBICZBYPF5/graph.json","events_json":"https://pith.science/api/pith-number/OLWBFPDHPWHG3YLNWBICZBYPF5/events.json","paper":"https://pith.science/paper/OLWBFPDH"},"agent_actions":{"view_html":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5","download_json":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5.json","view_paper":"https://pith.science/paper/OLWBFPDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3240&json=true","fetch_graph":"https://pith.science/api/pith-number/OLWBFPDHPWHG3YLNWBICZBYPF5/graph.json","fetch_events":"https://pith.science/api/pith-number/OLWBFPDHPWHG3YLNWBICZBYPF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/action/storage_attestation","attest_author":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/action/author_attestation","sign_citation":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/action/citation_signature","submit_replication":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/action/replication_record"}},"created_at":"2026-05-18T01:19:48.831323+00:00","updated_at":"2026-05-18T01:19:48.831323+00:00"}