{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OLWBFPDHPWHG3YLNWBICZBYPF5","short_pith_number":"pith:OLWBFPDH","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"},"canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","source":{"kind":"arxiv","id":"1311.3240","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3240","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3240v3","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3240","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"OLWBFPDHPWHG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OLWBFPDHPWHG3YLN","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OLWBFPDH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OLWBFPDHPWHG3YLNWBICZBYPF5","target":"record","payload":{"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"},"canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","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"},"source_kind":"arxiv","source_id":"1311.3240","source_version":3,"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-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR5OloVn+YxlbgyYADS8KeDETwUhZKh9E2V407PnD0upAfAV8MM4g5kkBNyJJRIbpqg7BkcbAWTLZNwvA/DcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:50:50.535970Z"},"content_sha256":"525a3a0ee337e212958593a555cdd9b087fe66c1588c5ec84f0dfd26d48692cd","schema_version":"1.0","event_id":"sha256:525a3a0ee337e212958593a555cdd9b087fe66c1588c5ec84f0dfd26d48692cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OLWBFPDHPWHG3YLNWBICZBYPF5","target":"graph","payload":{"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"},"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-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DhaEioS8GxTeCxggebWf1wA2k5j95ToVJxJFWUxFpI2AlaNDBjBSFDXVzFka4vipPBROd1GPD049One/yH3ADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:50:50.536330Z"},"content_sha256":"27aee1e49e2cc3c1ede384253a135638a765e37dba18a0af28cba37884ba3b8c","schema_version":"1.0","event_id":"sha256:27aee1e49e2cc3c1ede384253a135638a765e37dba18a0af28cba37884ba3b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/bundle.json","state_url":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/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-27T15:50:50Z","links":{"resolver":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5","bundle":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/bundle.json","state":"https://pith.science/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLWBFPDHPWHG3YLNWBICZBYPF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OLWBFPDHPWHG3YLNWBICZBYPF5","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":"8d393457fcae824777d1c1def0b14bc01fea0898dd1bf11c680b5c7aa4631f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T18:27:00Z","title_canon_sha256":"dd93a6282e8e0b736d15c5ff07ddc3aac240b548934da15d45cab6f4069ff28b"},"schema_version":"1.0","source":{"id":"1311.3240","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3240","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3240v3","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3240","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"OLWBFPDHPWHG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OLWBFPDHPWHG3YLN","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OLWBFPDH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:27aee1e49e2cc3c1ede384253a135638a765e37dba18a0af28cba37884ba3b8c","target":"graph","created_at":"2026-05-18T01:19:48Z","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":"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,","authors_text":"Colin McDiarmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T18:27:00Z","title":"Connectivity for bridge-alterable graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3240","kind":"arxiv","version":3},"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:525a3a0ee337e212958593a555cdd9b087fe66c1588c5ec84f0dfd26d48692cd","target":"record","created_at":"2026-05-18T01:19:48Z","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":"8d393457fcae824777d1c1def0b14bc01fea0898dd1bf11c680b5c7aa4631f7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T18:27:00Z","title_canon_sha256":"dd93a6282e8e0b736d15c5ff07ddc3aac240b548934da15d45cab6f4069ff28b"},"schema_version":"1.0","source":{"id":"1311.3240","kind":"arxiv","version":3}},"canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72ec12bc677d8e6de16db0502c870f2f7243f1135ddabc282ac5751841fec31b","first_computed_at":"2026-05-18T01:19:48.831250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:48.831250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YzJfKwhbDVw5l/dNwk0FQrb1+1YWf2RcSIa5uZ3twD2DTPdnJHcTKs6rgOW2LLhJDvdktrp5x/CYdQ1ouIfVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:48.831695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3240","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:525a3a0ee337e212958593a555cdd9b087fe66c1588c5ec84f0dfd26d48692cd","sha256:27aee1e49e2cc3c1ede384253a135638a765e37dba18a0af28cba37884ba3b8c"],"state_sha256":"5371e27ac3c5e0f22aed57516b5da51398436c3c71f1bc44f2fb5bb43db370b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj63OMSobTqUBQhf1XPzbjRDt4ae8ik8OyPGpm8xw/o0ys0GFtcXZD2DQc3CuuP/TI8LTUpShnaegdnxf9cjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:50:50.538255Z","bundle_sha256":"b2301993972fe45b2ca812e33b43bfc8be3b89c2dca8042581dcf8e5a3edda19"}}