{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3FTYUKJUMZE7A4PM4QACQS35UQ","short_pith_number":"pith:3FTYUKJU","canonical_record":{"source":{"id":"1805.08669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-22T15:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"efeab136c9b2db61207df7772750a576133cc866f76e00bdfea1a54b1c12c9ab","abstract_canon_sha256":"2798ba6851043b567cad04d8333b382fc412a11fddbe61455a188748b5ef63e9"},"schema_version":"1.0"},"canonical_sha256":"d9678a29346649f071ece400284b7da41bed46ad12eea69c2de87e82fa9b8ad8","source":{"kind":"arxiv","id":"1805.08669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08669","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08669v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08669","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"3FTYUKJUMZE7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FTYUKJUMZE7A4PM","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FTYUKJU","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3FTYUKJUMZE7A4PM4QACQS35UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-22T15:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"efeab136c9b2db61207df7772750a576133cc866f76e00bdfea1a54b1c12c9ab","abstract_canon_sha256":"2798ba6851043b567cad04d8333b382fc412a11fddbe61455a188748b5ef63e9"},"schema_version":"1.0"},"canonical_sha256":"d9678a29346649f071ece400284b7da41bed46ad12eea69c2de87e82fa9b8ad8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.489971Z","signature_b64":"KGahZ8zNLkrUlnSdXAWodEUajcIKoqBoLLOL63kvPUsPIXTDRYL1qkuEaEPIgxCxT36w2KFiPrakxziZcRXsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9678a29346649f071ece400284b7da41bed46ad12eea69c2de87e82fa9b8ad8","last_reissued_at":"2026-05-18T00:15:25.489330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.489330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08669","source_version":1,"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-05-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI3cBV6YWyOMywYIZ1l3ymZjA2s48UA/8EzenjyvXZNaXxdncUEDiePESCCahF2uI/pDVvIEJl8l23BAW92tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:06:12.355520Z"},"content_sha256":"9e08faefe10af3adb594fe357389ba99abaec709d3319b3fe65a63ae11dde2f0","schema_version":"1.0","event_id":"sha256:9e08faefe10af3adb594fe357389ba99abaec709d3319b3fe65a63ae11dde2f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3FTYUKJUMZE7A4PM4QACQS35UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Cheeger cuts and bisections of random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mathew D. Penrose, Tobias M\\\"uller","submitted_at":"2018-05-22T15:41:55Z","abstract_excerpt":"Let $d \\geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to count boundary edges (for the surface) and vertices (for the volume). We show that for a geometric (possibly weighted) graph on $n$ random points in a $d$-dimensional domain with Lipschitz boundary and with distance parameter decaying more slowly (as a function of $n$) than the connectivity threshold, the Cheeger constant (under several possible definitions of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08669","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"},"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-05-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItnOLOu99xsZrvDGVowG6pxAmPOm0dAMzUbnHBbbOaL18Wi0pQV/ASXGiWrJZGA6/p/oAPYVwnxcZKdjxv0YCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:06:12.356215Z"},"content_sha256":"ec8a75f67ef94bb3da94ef050dde1eabc1293341b36e1906eeddb205004e913b","schema_version":"1.0","event_id":"sha256:ec8a75f67ef94bb3da94ef050dde1eabc1293341b36e1906eeddb205004e913b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/bundle.json","state_url":"https://pith.science/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/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-06-05T20:06:12Z","links":{"resolver":"https://pith.science/pith/3FTYUKJUMZE7A4PM4QACQS35UQ","bundle":"https://pith.science/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/bundle.json","state":"https://pith.science/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FTYUKJUMZE7A4PM4QACQS35UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3FTYUKJUMZE7A4PM4QACQS35UQ","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":"2798ba6851043b567cad04d8333b382fc412a11fddbe61455a188748b5ef63e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-22T15:41:55Z","title_canon_sha256":"efeab136c9b2db61207df7772750a576133cc866f76e00bdfea1a54b1c12c9ab"},"schema_version":"1.0","source":{"id":"1805.08669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08669","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08669v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08669","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"3FTYUKJUMZE7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FTYUKJUMZE7A4PM","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FTYUKJU","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:ec8a75f67ef94bb3da94ef050dde1eabc1293341b36e1906eeddb205004e913b","target":"graph","created_at":"2026-05-18T00:15:25Z","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"},"paper":{"abstract_excerpt":"Let $d \\geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to count boundary edges (for the surface) and vertices (for the volume). We show that for a geometric (possibly weighted) graph on $n$ random points in a $d$-dimensional domain with Lipschitz boundary and with distance parameter decaying more slowly (as a function of $n$) than the connectivity threshold, the Cheeger constant (under several possible definitions of","authors_text":"Mathew D. Penrose, Tobias M\\\"uller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-22T15:41:55Z","title":"Optimal Cheeger cuts and bisections of random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08669","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:9e08faefe10af3adb594fe357389ba99abaec709d3319b3fe65a63ae11dde2f0","target":"record","created_at":"2026-05-18T00:15:25Z","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":"2798ba6851043b567cad04d8333b382fc412a11fddbe61455a188748b5ef63e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-22T15:41:55Z","title_canon_sha256":"efeab136c9b2db61207df7772750a576133cc866f76e00bdfea1a54b1c12c9ab"},"schema_version":"1.0","source":{"id":"1805.08669","kind":"arxiv","version":1}},"canonical_sha256":"d9678a29346649f071ece400284b7da41bed46ad12eea69c2de87e82fa9b8ad8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9678a29346649f071ece400284b7da41bed46ad12eea69c2de87e82fa9b8ad8","first_computed_at":"2026-05-18T00:15:25.489330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:25.489330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGahZ8zNLkrUlnSdXAWodEUajcIKoqBoLLOL63kvPUsPIXTDRYL1qkuEaEPIgxCxT36w2KFiPrakxziZcRXsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:25.489971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e08faefe10af3adb594fe357389ba99abaec709d3319b3fe65a63ae11dde2f0","sha256:ec8a75f67ef94bb3da94ef050dde1eabc1293341b36e1906eeddb205004e913b"],"state_sha256":"2304d24daa47e1be621cb8ba32e8b09759f98850a8f517cbcdef070e6e8eb42e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kc71HzlKqLY0Zm2H6UH5S9xsdigjOovgO0oMFo+u7o6us2VXBRNJAqt1USVVovG7r8k57ZezIMTBEIC4YvQnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:06:12.361118Z","bundle_sha256":"d68f6039b671d7100b95aa7b19fbfb55c2d7692533497fde9a0f233c92c30461"}}