{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:F7RHWW2DNQ44RPZ7BSNL4KJLHC","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":"99a8e96ab770395b1648f7b4c4a405381fe3767387e6d64b7d4feaa9b03d8aa2","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-09-01T15:55:13Z","title_canon_sha256":"6a84c9b581cd3f13c814d5414a0713d065b37e6c79420788fb19e804d819eb90"},"schema_version":"1.0","source":{"id":"math/0509022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0509022","created_at":"2026-07-04T14:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"math/0509022v1","created_at":"2026-07-04T14:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0509022","created_at":"2026-07-04T14:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"F7RHWW2DNQ44","created_at":"2026-07-04T14:40:21Z"},{"alias_kind":"pith_short_16","alias_value":"F7RHWW2DNQ44RPZ7","created_at":"2026-07-04T14:40:21Z"},{"alias_kind":"pith_short_8","alias_value":"F7RHWW2D","created_at":"2026-07-04T14:40:21Z"}],"graph_snapshots":[{"event_id":"sha256:f81e48934dfa6ef4368e0d59d979eb8c0d677f604eb61f2f2b467fc5c9b7f69c","target":"graph","created_at":"2026-07-04T14:40:21Z","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/0509022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The isoperimetric constant of a graph $G$ on $n$ vertices, $i(G)$, is the minimum of $\\frac{|\\partial S|}{|S|}$, taken over all nonempty subsets $S\\subset V(G)$ of size at most $n/2$, where $\\partial S$ denotes the set of edges with precisely one end in $S$. A random graph process on $n$ vertices, $\\widetilde{G}(t)$, is a sequence of $\\binom{n}{2}$ graphs, where $\\widetilde{G}(0)$ is the edgeless graph on $n$ vertices, and $\\widetilde{G}(t)$ is the result of adding an edge to $\\widetilde{G}(t-1)$, uniformly distributed over all the missing edges. We show that in almost every graph process $i(\\","authors_text":"Eyal Lubetzky, Itai Benjamini, Michael Krivelevich, Simi Haber","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2005-09-01T15:55:13Z","title":"The isoperimetric constant of the random graph process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0509022","kind":"arxiv","version":1},"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:638a2b40a21d1be0ab56b432f940575ec037c19cca357de5fa61b0eede6b6bef","target":"record","created_at":"2026-07-04T14:40:21Z","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":"99a8e96ab770395b1648f7b4c4a405381fe3767387e6d64b7d4feaa9b03d8aa2","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-09-01T15:55:13Z","title_canon_sha256":"6a84c9b581cd3f13c814d5414a0713d065b37e6c79420788fb19e804d819eb90"},"schema_version":"1.0","source":{"id":"math/0509022","kind":"arxiv","version":1}},"canonical_sha256":"2fe27b5b436c39c8bf3f0c9abe292b3885468db5e08134d840c6966d52dc2cee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fe27b5b436c39c8bf3f0c9abe292b3885468db5e08134d840c6966d52dc2cee","first_computed_at":"2026-07-04T14:40:21.321754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:40:21.321754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ra/j7fOKiuEMLIbEQHNRnKc7gqOI1FpZ6FA8tJMYKWOLyABTdxPA4GfsvmgxZ23kRDI8i8Mi9sWLisoYZdKQAg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:40:21.322214Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0509022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638a2b40a21d1be0ab56b432f940575ec037c19cca357de5fa61b0eede6b6bef","sha256:f81e48934dfa6ef4368e0d59d979eb8c0d677f604eb61f2f2b467fc5c9b7f69c"],"state_sha256":"9d5f1d71eec3cd08054858c82d6506705b18e1a90f4fa3191728948a26c4c3e1"}