{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:6C6FH7AEBCNH77K65ATMH6IQDZ","short_pith_number":"pith:6C6FH7AE","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"},"canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","source":{"kind":"arxiv","id":"math/0207112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0207112","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"math/0207112v2","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0207112","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"6C6FH7AEBCNH","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_16","alias_value":"6C6FH7AEBCNH77K6","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_8","alias_value":"6C6FH7AE","created_at":"2026-07-04T14:36:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:6C6FH7AEBCNH77K65ATMH6IQDZ","target":"record","payload":{"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"},"canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","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"},"source_kind":"arxiv","source_id":"math/0207112","source_version":2,"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-07-04T14:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Kh7jMYe3v6RTqJ/W5ZNXnGpLq4NDLK6lRNGhSXqOpf3ZDTwoiCsjHrVod+oW2YbixdXpfNPQ8AyCsio0JKJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:24:37.450760Z"},"content_sha256":"46d7036e4eb627e428e2a5f99c9682c531295fef2d872c83883026d817e19cf0","schema_version":"1.0","event_id":"sha256:46d7036e4eb627e428e2a5f99c9682c531295fef2d872c83883026d817e19cf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:6C6FH7AEBCNH77K65ATMH6IQDZ","target":"graph","payload":{"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"},"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-07-04T14:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pn44ZoBUEKt1pZy2X5hidAyMNeN8MO2FdvfBHUkszBlVgwenJSuGF1+DyrrEhku20UEiOMCA7wgrY+HrDkDCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:24:37.451307Z"},"content_sha256":"e6a698d26f64a76b141ff871856c258f7c3a44cdd7c061fb75f7707b9dd5f34e","schema_version":"1.0","event_id":"sha256:e6a698d26f64a76b141ff871856c258f7c3a44cdd7c061fb75f7707b9dd5f34e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/bundle.json","state_url":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/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-08-11T01:24:37Z","links":{"resolver":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ","bundle":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/bundle.json","state":"https://pith.science/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6C6FH7AEBCNH77K65ATMH6IQDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:6C6FH7AEBCNH77K65ATMH6IQDZ","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":"6a3d10717c0b0878625ed23a8cf2ef67af4be4b9896d961c908ef0ad6f4b6515","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2002-07-12T17:19:03Z","title_canon_sha256":"b0da04ea585599e9f1b544a54c320b045a614f3aca1d366be07e90410e88dfa5"},"schema_version":"1.0","source":{"id":"math/0207112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0207112","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"math/0207112v2","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0207112","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"6C6FH7AEBCNH","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_16","alias_value":"6C6FH7AEBCNH77K6","created_at":"2026-07-04T14:36:19Z"},{"alias_kind":"pith_short_8","alias_value":"6C6FH7AE","created_at":"2026-07-04T14:36:19Z"}],"graph_snapshots":[{"event_id":"sha256:e6a698d26f64a76b141ff871856c258f7c3a44cdd7c061fb75f7707b9dd5f34e","target":"graph","created_at":"2026-07-04T14:36:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0207112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alan Stacey, Itai Benjamini, Noga Alon","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2002-07-12T17:19:03Z","title":"Percolation on finite graphs and isoperimetric inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0207112","kind":"arxiv","version":2},"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:46d7036e4eb627e428e2a5f99c9682c531295fef2d872c83883026d817e19cf0","target":"record","created_at":"2026-07-04T14:36:19Z","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":"6a3d10717c0b0878625ed23a8cf2ef67af4be4b9896d961c908ef0ad6f4b6515","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2002-07-12T17:19:03Z","title_canon_sha256":"b0da04ea585599e9f1b544a54c320b045a614f3aca1d366be07e90410e88dfa5"},"schema_version":"1.0","source":{"id":"math/0207112","kind":"arxiv","version":2}},"canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0bc53fc04089a7ffd5ee826c3f9101e497b30047e7359080eb691a0a548a19b","first_computed_at":"2026-07-04T14:36:19.297213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:36:19.297213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOV1Byhs9ZReBa7wURk2Kaa015cASPgfsCt8yKKVG2uRjqUtyU6lJqudLmIRNYKEhoMZS3gMOuVanjCUWqSJDw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:36:19.297651Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0207112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46d7036e4eb627e428e2a5f99c9682c531295fef2d872c83883026d817e19cf0","sha256:e6a698d26f64a76b141ff871856c258f7c3a44cdd7c061fb75f7707b9dd5f34e"],"state_sha256":"481b3b3057a715fe615f9dddf723d0256bf30cb3bd05e3281dd06c5c388e9a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6wNYC7I9vSKHUa+aW+i+LkD8mgxVtYkdjBSRVSDlgjs6+CtJQ6j28dANKn85TiISMegR3S1LmX16S2ewMLdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:24:37.457409Z","bundle_sha256":"eda615c8a5d008325d607741c9ea7f75889cc484c64164eac988cda0b0b8439b"}}