{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RWKEUL442KXP6MXE73DKJJXYQJ","short_pith_number":"pith:RWKEUL44","schema_version":"1.0","canonical_sha256":"8d944a2f9cd2aeff32e4fec6a4a6f8827dea604a00d3fe614d88205305a50e48","source":{"kind":"arxiv","id":"0906.3657","version":2},"attestation_state":"computed","paper":{"title":"Sharp threshold for percolation on expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"G\\'abor Lugosi, Itai Benjamini, Rapha\\\"el Rossignol, St\\'ephane Boucheron","submitted_at":"2009-06-19T12:59:51Z","abstract_excerpt":"We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c in ]0,1[, the property that the random subgraph contains a giant component of size c|V| has a sharp threshold."},"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":"0906.3657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-06-19T12:59:51Z","cross_cats_sorted":[],"title_canon_sha256":"5acdb1afe5d3325792557482efa425f496adf7b867907cf6171942df9dbad9a1","abstract_canon_sha256":"fa6271ebfecbc2b5f301003a151ac5b60c1db023d8d08434c8b6577c4df93fb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:58.049585Z","signature_b64":"oIwW7G30xgzqLyk9EAV7iHJmmbBI+N1hKao8SPG+mjuk0+/dstlRYXKiPIknf2NAS76w9HwIHc/Ms6mC1Cf0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d944a2f9cd2aeff32e4fec6a4a6f8827dea604a00d3fe614d88205305a50e48","last_reissued_at":"2026-05-18T03:44:58.048921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:58.048921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp threshold for percolation on expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"G\\'abor Lugosi, Itai Benjamini, Rapha\\\"el Rossignol, St\\'ephane Boucheron","submitted_at":"2009-06-19T12:59:51Z","abstract_excerpt":"We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c in ]0,1[, the property that the random subgraph contains a giant component of size c|V| has a sharp threshold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3657","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":"0906.3657","created_at":"2026-05-18T03:44:58.049036+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.3657v2","created_at":"2026-05-18T03:44:58.049036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3657","created_at":"2026-05-18T03:44:58.049036+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWKEUL442KXP","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWKEUL442KXP6MXE","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWKEUL44","created_at":"2026-05-18T12:26:01.383474+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/RWKEUL442KXP6MXE73DKJJXYQJ","json":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ.json","graph_json":"https://pith.science/api/pith-number/RWKEUL442KXP6MXE73DKJJXYQJ/graph.json","events_json":"https://pith.science/api/pith-number/RWKEUL442KXP6MXE73DKJJXYQJ/events.json","paper":"https://pith.science/paper/RWKEUL44"},"agent_actions":{"view_html":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ","download_json":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ.json","view_paper":"https://pith.science/paper/RWKEUL44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.3657&json=true","fetch_graph":"https://pith.science/api/pith-number/RWKEUL442KXP6MXE73DKJJXYQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RWKEUL442KXP6MXE73DKJJXYQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ/action/storage_attestation","attest_author":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ/action/author_attestation","sign_citation":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ/action/citation_signature","submit_replication":"https://pith.science/pith/RWKEUL442KXP6MXE73DKJJXYQJ/action/replication_record"}},"created_at":"2026-05-18T03:44:58.049036+00:00","updated_at":"2026-05-18T03:44:58.049036+00:00"}