{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7I7RF36HMRAXQOJUE4QS3Z3ZUI","short_pith_number":"pith:7I7RF36H","schema_version":"1.0","canonical_sha256":"fa3f12efc7644178393427212de779a217ad128b3bf32a08e362857947bd0a74","source":{"kind":"arxiv","id":"1508.02671","version":1},"attestation_state":"computed","paper":{"title":"Majority Bootstrap Percolation on $G(n,p)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Nathan Kettle, Tomas Ju\\v{s}kevi\\v{c}ius","submitted_at":"2015-08-11T18:07:36Z","abstract_excerpt":"Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected neighbours are infected. We say that percolation occurs if eventually all vertices in $G$ become infected.\n  In this paper we study majority bootstrap percolation on the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ above the connectivity threshold. Perhaps surprisingly, the results obtained for small $p$ are comparable to the results for the hypercube obtained by Balo"},"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":"1508.02671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-11T18:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"815813b922d0f2a20c03fbbc8d2a47d6da1e7f7367ff086f388cf654305b903b","abstract_canon_sha256":"3ddba92b3b7811d039408cf59c4dfb63488353eeec800886f3171d7b8d3f0501"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:28.600543Z","signature_b64":"v60jVKvbi5457G73R6+CWRX60Ch2XikUyWIgwjwXoy0iSIvmLuYroiIyj/A8mKuXI96o7vC2bf7dTTmJcd9zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3f12efc7644178393427212de779a217ad128b3bf32a08e362857947bd0a74","last_reissued_at":"2026-05-18T01:35:28.599879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:28.599879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Majority Bootstrap Percolation on $G(n,p)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Nathan Kettle, Tomas Ju\\v{s}kevi\\v{c}ius","submitted_at":"2015-08-11T18:07:36Z","abstract_excerpt":"Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected neighbours are infected. We say that percolation occurs if eventually all vertices in $G$ become infected.\n  In this paper we study majority bootstrap percolation on the Erd\\H{o}s-R\\'enyi random graph $G(n,p)$ above the connectivity threshold. Perhaps surprisingly, the results obtained for small $p$ are comparable to the results for the hypercube obtained by Balo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02671","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":""},"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":"1508.02671","created_at":"2026-05-18T01:35:28.599990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02671v1","created_at":"2026-05-18T01:35:28.599990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02671","created_at":"2026-05-18T01:35:28.599990+00:00"},{"alias_kind":"pith_short_12","alias_value":"7I7RF36HMRAX","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7I7RF36HMRAXQOJU","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7I7RF36H","created_at":"2026-05-18T12:29:10.953037+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/7I7RF36HMRAXQOJUE4QS3Z3ZUI","json":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI.json","graph_json":"https://pith.science/api/pith-number/7I7RF36HMRAXQOJUE4QS3Z3ZUI/graph.json","events_json":"https://pith.science/api/pith-number/7I7RF36HMRAXQOJUE4QS3Z3ZUI/events.json","paper":"https://pith.science/paper/7I7RF36H"},"agent_actions":{"view_html":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI","download_json":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI.json","view_paper":"https://pith.science/paper/7I7RF36H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02671&json=true","fetch_graph":"https://pith.science/api/pith-number/7I7RF36HMRAXQOJUE4QS3Z3ZUI/graph.json","fetch_events":"https://pith.science/api/pith-number/7I7RF36HMRAXQOJUE4QS3Z3ZUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI/action/storage_attestation","attest_author":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI/action/author_attestation","sign_citation":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI/action/citation_signature","submit_replication":"https://pith.science/pith/7I7RF36HMRAXQOJUE4QS3Z3ZUI/action/replication_record"}},"created_at":"2026-05-18T01:35:28.599990+00:00","updated_at":"2026-05-18T01:35:28.599990+00:00"}