{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5GEEYAHT6SYD2ESAJVDTARGYVM","short_pith_number":"pith:5GEEYAHT","schema_version":"1.0","canonical_sha256":"e9884c00f3f4b03d12404d473044d8ab236407cf8df35093b0de2a280f841bbd","source":{"kind":"arxiv","id":"1604.03993","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.03993","created_at":"2026-05-18T01:17:06.997360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03993v1","created_at":"2026-05-18T01:17:06.997360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03993","created_at":"2026-05-18T01:17:06.997360+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GEEYAHT6SYD","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GEEYAHT6SYD2ESA","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GEEYAHT","created_at":"2026-05-18T12:30:01.593930+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/5GEEYAHT6SYD2ESAJVDTARGYVM","json":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM.json","graph_json":"https://pith.science/api/pith-number/5GEEYAHT6SYD2ESAJVDTARGYVM/graph.json","events_json":"https://pith.science/api/pith-number/5GEEYAHT6SYD2ESAJVDTARGYVM/events.json","paper":"https://pith.science/paper/5GEEYAHT"},"agent_actions":{"view_html":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM","download_json":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM.json","view_paper":"https://pith.science/paper/5GEEYAHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03993&json=true","fetch_graph":"https://pith.science/api/pith-number/5GEEYAHT6SYD2ESAJVDTARGYVM/graph.json","fetch_events":"https://pith.science/api/pith-number/5GEEYAHT6SYD2ESAJVDTARGYVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/action/storage_attestation","attest_author":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/action/author_attestation","sign_citation":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/action/citation_signature","submit_replication":"https://pith.science/pith/5GEEYAHT6SYD2ESAJVDTARGYVM/action/replication_record"}},"created_at":"2026-05-18T01:17:06.997360+00:00","updated_at":"2026-05-18T01:17:06.997360+00:00"}