{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X5TPXYKUPBQVLFJCEHQO7FKEJA","short_pith_number":"pith:X5TPXYKU","schema_version":"1.0","canonical_sha256":"bf66fbe154786155952221e0ef9544481e796dad49eba47a5051e6cb383ccca3","source":{"kind":"arxiv","id":"2406.01790","version":1},"attestation_state":"computed","paper":{"title":"The bunkbed conjecture is not robust to generalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Lawrence Hollom","submitted_at":"2024-06-03T21:13:50Z","abstract_excerpt":"The bunkbed conjecture, which has featured in the folklore of probability theory since at least 1985, concerns bond percolation on the product graph $G\\Box K_2$. We have two copies $G_0$ and $G_1$ of $G$, and if $x^{(0)}$ and $x^{(1)}$ are the copies of a vertex $x\\in V(G)$ in $G_0$ and $G_1$ respectively, then edge $x^{(0)}x^{(1)}$ is present. The conjecture states that, for vertices $u,v\\in V(G)$, percolation from $u^{(0)}$ to $v^{(0)}$ is at least as likely as percolation from $u^{(0)}$ to $v^{(1)}$. While the conjecture is widely expected to be true, having attracted significant attention,"},"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":"2406.01790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-03T21:13:50Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"79544c95363f313020e827957765cae567cfddfcf5d805b5437794457445aa83","abstract_canon_sha256":"3f43ee44bd6d03f95059b1c7c9c7cb049449dd3aa1da2a78acd20f7f4922ce16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:48.613850Z","signature_b64":"W7gDwncYh1ttWcPw50A/bmRpV6QoZzOuAnLp5c1rvNhk7ltk4xFaxC1sar1b5edda/+b9XXQXSSygyGnVDEEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf66fbe154786155952221e0ef9544481e796dad49eba47a5051e6cb383ccca3","last_reissued_at":"2026-07-05T08:26:48.613367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:48.613367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The bunkbed conjecture is not robust to generalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Lawrence Hollom","submitted_at":"2024-06-03T21:13:50Z","abstract_excerpt":"The bunkbed conjecture, which has featured in the folklore of probability theory since at least 1985, concerns bond percolation on the product graph $G\\Box K_2$. We have two copies $G_0$ and $G_1$ of $G$, and if $x^{(0)}$ and $x^{(1)}$ are the copies of a vertex $x\\in V(G)$ in $G_0$ and $G_1$ respectively, then edge $x^{(0)}x^{(1)}$ is present. The conjecture states that, for vertices $u,v\\in V(G)$, percolation from $u^{(0)}$ to $v^{(0)}$ is at least as likely as percolation from $u^{(0)}$ to $v^{(1)}$. While the conjecture is widely expected to be true, having attracted significant attention,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01790","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.01790/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.01790","created_at":"2026-07-05T08:26:48.613428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01790v1","created_at":"2026-07-05T08:26:48.613428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01790","created_at":"2026-07-05T08:26:48.613428+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5TPXYKUPBQV","created_at":"2026-07-05T08:26:48.613428+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5TPXYKUPBQVLFJC","created_at":"2026-07-05T08:26:48.613428+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5TPXYKU","created_at":"2026-07-05T08:26:48.613428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09264","citing_title":"The bunkbed conjecture still holds for cactus graphs and for graphs with certain biconnected components","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA","json":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA.json","graph_json":"https://pith.science/api/pith-number/X5TPXYKUPBQVLFJCEHQO7FKEJA/graph.json","events_json":"https://pith.science/api/pith-number/X5TPXYKUPBQVLFJCEHQO7FKEJA/events.json","paper":"https://pith.science/paper/X5TPXYKU"},"agent_actions":{"view_html":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA","download_json":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA.json","view_paper":"https://pith.science/paper/X5TPXYKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01790&json=true","fetch_graph":"https://pith.science/api/pith-number/X5TPXYKUPBQVLFJCEHQO7FKEJA/graph.json","fetch_events":"https://pith.science/api/pith-number/X5TPXYKUPBQVLFJCEHQO7FKEJA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA/action/storage_attestation","attest_author":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA/action/author_attestation","sign_citation":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA/action/citation_signature","submit_replication":"https://pith.science/pith/X5TPXYKUPBQVLFJCEHQO7FKEJA/action/replication_record"}},"created_at":"2026-07-05T08:26:48.613428+00:00","updated_at":"2026-07-05T08:26:48.613428+00:00"}