{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5GEEYAHT6SYD2ESAJVDTARGYVM","short_pith_number":"pith:5GEEYAHT","canonical_record":{"source":{"id":"1604.03993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-13T22:52:05Z","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"title_canon_sha256":"1b2bbd244361481db871e9eb5c9f4e6562185ee0b1afc11a6bbba3eeb2354142","abstract_canon_sha256":"19fa6ae1f5802e6674db47c8d50932f1b4981a515b4bf474165ac99ac69623ed"},"schema_version":"1.0"},"canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","source":{"kind":"arxiv","id":"1604.03993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03993","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03993v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03993","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"5GEEYAHT6SYD","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5GEEYAHT6SYD2ESA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5GEEYAHT","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5GEEYAHT6SYD2ESAJVDTARGYVM","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-13T22:52:05Z","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"title_canon_sha256":"1b2bbd244361481db871e9eb5c9f4e6562185ee0b1afc11a6bbba3eeb2354142","abstract_canon_sha256":"19fa6ae1f5802e6674db47c8d50932f1b4981a515b4bf474165ac99ac69623ed"},"schema_version":"1.0"},"canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.997868Z","signature_b64":"kJLuc5W4JYcbMGNoa4tgnzvxknTwyJQNqLIK3YfIc800Zr9lmdh30iYU83hocR4gHrwmsG+OoCNFYTn12QWCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","last_reissued_at":"2026-05-18T01:17:06.997258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.997258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03993","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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tc/65wL09n61gR89UTF1Rq6mwVGxihN9us/FJ3GIYxRn1C/r5xARCnFbXFmAdQTaEpptJpAH9TJvKoSS/nALBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:44:13.390790Z"},"content_sha256":"99cc7f4f3a6f950ec9bad2fd763c257f26638b8d4e4ccdb32e970ca50dbc0a2c","schema_version":"1.0","event_id":"sha256:99cc7f4f3a6f950ec9bad2fd763c257f26638b8d4e4ccdb32e970ca50dbc0a2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5GEEYAHT6SYD2ESAJVDTARGYVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistency of modularity clustering on random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Erik Davis, Sunder Sethuraman","submitted_at":"2016-04-13T22:52:05Z","abstract_excerpt":"We consider a large class of random geometric graphs constructed from samples $\\mathcal{X}_n = \\{X_1,X_2,\\ldots,X_n\\}$ of independent, identically distributed observations of an underlying probability measure $\\nu$ on a bounded domain $D\\subset \\mathbb{R}^d$. The popular `modularity' clustering method specifies a partition $\\mathcal{U}_n$ of the set $\\mathcal{X}_n$ as the solution of an optimization problem. In this paper, under conditions on $\\nu$ and $D$, we derive scaling limits of the modularity clustering on random geometric graphs. Among other results, we show a geometric form of consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03993","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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvJeaf93ku5jBFitxzf5tY9fXGKz4zUjsPE1IoH1iykgXZdWCBG1G0gPC7bNNcAFgo42I5iImHVl5zkulDJoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:44:13.391410Z"},"content_sha256":"5a7f7725887aad70b638c57a516569befcf92cd4f66c45ad054743e026c46c50","schema_version":"1.0","event_id":"sha256:5a7f7725887aad70b638c57a516569befcf92cd4f66c45ad054743e026c46c50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/bundle.json","state_url":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/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-07T09:44:13Z","links":{"resolver":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM","bundle":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/bundle.json","state":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5GEEYAHT6SYD2ESAJVDTARGYVM","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":"19fa6ae1f5802e6674db47c8d50932f1b4981a515b4bf474165ac99ac69623ed","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-13T22:52:05Z","title_canon_sha256":"1b2bbd244361481db871e9eb5c9f4e6562185ee0b1afc11a6bbba3eeb2354142"},"schema_version":"1.0","source":{"id":"1604.03993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03993","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03993v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03993","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"5GEEYAHT6SYD","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5GEEYAHT6SYD2ESA","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5GEEYAHT","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:5a7f7725887aad70b638c57a516569befcf92cd4f66c45ad054743e026c46c50","target":"graph","created_at":"2026-05-18T01:17:06Z","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":"We consider a large class of random geometric graphs constructed from samples $\\mathcal{X}_n = \\{X_1,X_2,\\ldots,X_n\\}$ of independent, identically distributed observations of an underlying probability measure $\\nu$ on a bounded domain $D\\subset \\mathbb{R}^d$. The popular `modularity' clustering method specifies a partition $\\mathcal{U}_n$ of the set $\\mathcal{X}_n$ as the solution of an optimization problem. In this paper, under conditions on $\\nu$ and $D$, we derive scaling limits of the modularity clustering on random geometric graphs. Among other results, we show a geometric form of consist","authors_text":"Erik Davis, Sunder Sethuraman","cross_cats":["math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-13T22:52:05Z","title":"Consistency of modularity clustering on random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03993","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:99cc7f4f3a6f950ec9bad2fd763c257f26638b8d4e4ccdb32e970ca50dbc0a2c","target":"record","created_at":"2026-05-18T01:17:06Z","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":"19fa6ae1f5802e6674db47c8d50932f1b4981a515b4bf474165ac99ac69623ed","cross_cats_sorted":["math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-13T22:52:05Z","title_canon_sha256":"1b2bbd244361481db871e9eb5c9f4e6562185ee0b1afc11a6bbba3eeb2354142"},"schema_version":"1.0","source":{"id":"1604.03993","kind":"arxiv","version":1}},"canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","first_computed_at":"2026-05-18T01:17:06.997258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.997258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kJLuc5W4JYcbMGNoa4tgnzvxknTwyJQNqLIK3YfIc800Zr9lmdh30iYU83hocR4gHrwmsG+OoCNFYTn12QWCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.997868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99cc7f4f3a6f950ec9bad2fd763c257f26638b8d4e4ccdb32e970ca50dbc0a2c","sha256:5a7f7725887aad70b638c57a516569befcf92cd4f66c45ad054743e026c46c50"],"state_sha256":"e22c7b31c3dca6891904cd5871faefca8bc2af5677922fda5ead7df0188f20fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ig48G1Me/dm8/5hV8ZrJpSe5EkNaCbEnkctcjU+tZht2ZLI4HUxp7nWdzEcrKtBTEkMD+5+Hfb9WE6T80LsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:44:13.395335Z","bundle_sha256":"72741c7d20e9027d745efe1f2a06843c9b91be44be7aad1fcad25d060b0d6251"}}