{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:6C6FH7AEBCNH77K65ATMH6IQDZ","short_pith_number":"pith:6C6FH7AE","schema_version":"1.0","canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","source":{"kind":"arxiv","id":"math/0207112","version":2},"attestation_state":"computed","paper":{"title":"Percolation on finite graphs and isoperimetric inequalities","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Stacey, Itai Benjamini, Noga Alon","submitted_at":"2002-07-12T17:19:03Z","abstract_excerpt":"Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|G_n|, with probability going to one, uniformly in p. The method from Ajtai, Komlos and Szemeredi [Combinatorica 2 (1982) 1-7] is applied to obtain some new results about the critical probability for the emergence of a giant component in random subgraphs of finite regular expanding graphs of high girth, as well as a simple proof of"},"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":"math/0207112","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2002-07-12T17:19:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b0da04ea585599e9f1b544a54c320b045a614f3aca1d366be07e90410e88dfa5","abstract_canon_sha256":"6a3d10717c0b0878625ed23a8cf2ef67af4be4b9896d961c908ef0ad6f4b6515"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:36:19.297651Z","signature_b64":"KOV1Byhs9ZReBa7wURk2Kaa015cASPgfsCt8yKKVG2uRjqUtyU6lJqudLmIRNYKEhoMZS3gMOuVanjCUWqSJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","last_reissued_at":"2026-07-04T14:36:19.297213Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:36:19.297213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Percolation on finite graphs and isoperimetric inequalities","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alan Stacey, Itai Benjamini, Noga Alon","submitted_at":"2002-07-12T17:19:03Z","abstract_excerpt":"Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|G_n|, with probability going to one, uniformly in p. The method from Ajtai, Komlos and Szemeredi [Combinatorica 2 (1982) 1-7] is applied to obtain some new results about the critical probability for the emergence of a giant component in random subgraphs of finite regular expanding graphs of high girth, as well as a simple proof of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0207112","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0207112/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":"math/0207112","created_at":"2026-07-04T14:36:19.297277+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0207112v2","created_at":"2026-07-04T14:36:19.297277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0207112","created_at":"2026-07-04T14:36:19.297277+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C6FH7AEBCNH","created_at":"2026-07-04T14:36:19.297277+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C6FH7AEBCNH77K6","created_at":"2026-07-04T14:36:19.297277+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C6FH7AE","created_at":"2026-07-04T14:36:19.297277+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/6C6FH7AEBCNH77K65ATMH6IQDZ","json":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ.json","graph_json":"https://pith.science/api/pith-number/6C6FH7AEBCNH77K65ATMH6IQDZ/graph.json","events_json":"https://pith.science/api/pith-number/6C6FH7AEBCNH77K65ATMH6IQDZ/events.json","paper":"https://pith.science/paper/6C6FH7AE"},"agent_actions":{"view_html":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ","download_json":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ.json","view_paper":"https://pith.science/paper/6C6FH7AE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0207112&json=true","fetch_graph":"https://pith.science/api/pith-number/6C6FH7AEBCNH77K65ATMH6IQDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6C6FH7AEBCNH77K65ATMH6IQDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/action/storage_attestation","attest_author":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/action/author_attestation","sign_citation":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/action/citation_signature","submit_replication":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/action/replication_record"}},"created_at":"2026-07-04T14:36:19.297277+00:00","updated_at":"2026-07-04T14:36:19.297277+00:00"}