{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2XHZDFX4ZYK7CCS6SJUOV3MIZF","short_pith_number":"pith:2XHZDFX4","schema_version":"1.0","canonical_sha256":"d5cf9196fcce15f10a5e9268eaed88c956df396d28759540b4bcebc831203833","source":{"kind":"arxiv","id":"2506.15159","version":1},"attestation_state":"computed","paper":{"title":"Conditional central limit theorems for exponential random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Song-Hao Liu, Xiao Fang, Xiaolin Wang, Zhonggen Su","submitted_at":"2025-06-18T06:06:44Z","abstract_excerpt":"In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the number of two stars. This generalizes the corresponding result in the literature for the Erd\\H{o}s--R\\'enyi random graph. To prove our main result, we develop a new conditional CLT via exchangeable pairs based on the ideas of Dey and Terlov. Our key technical contributions in the application to ERGMs include establishing a linearity condition for an exchangea"},"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":"2506.15159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-06-18T06:06:44Z","cross_cats_sorted":[],"title_canon_sha256":"f495b6770e9d2cee0db28939eafc0c7b2584c2d978d386269898997e3d611db8","abstract_canon_sha256":"137ec3240da06ed8842b6bb25e337fc222ad5d944373c16d0bdf71de1f7903c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:38.341819Z","signature_b64":"JtOgU67oCahQuwYhanoKywN0yFjjUg5QxuC3G4KufDZypPIv2MSPmjeBTqy6hNW+HlrKsL7q5UoGnu0/r/vxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5cf9196fcce15f10a5e9268eaed88c956df396d28759540b4bcebc831203833","last_reissued_at":"2026-07-05T11:23:38.341300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:38.341300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional central limit theorems for exponential random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Song-Hao Liu, Xiao Fang, Xiaolin Wang, Zhonggen Su","submitted_at":"2025-06-18T06:06:44Z","abstract_excerpt":"In this paper, we study the Exponential Random Graph Models (ERGMs) conditioning on the number of edges. In subcritical region of model parameters, we prove a conditional Central Limit Theorem (CLT) with explicit mean and variance for the number of two stars. This generalizes the corresponding result in the literature for the Erd\\H{o}s--R\\'enyi random graph. To prove our main result, we develop a new conditional CLT via exchangeable pairs based on the ideas of Dey and Terlov. Our key technical contributions in the application to ERGMs include establishing a linearity condition for an exchangea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.15159/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.15159","created_at":"2026-07-05T11:23:38.341369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15159v1","created_at":"2026-07-05T11:23:38.341369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15159","created_at":"2026-07-05T11:23:38.341369+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XHZDFX4ZYK7","created_at":"2026-07-05T11:23:38.341369+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XHZDFX4ZYK7CCS6","created_at":"2026-07-05T11:23:38.341369+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XHZDFX4","created_at":"2026-07-05T11:23:38.341369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03442","citing_title":"Stein's method in network analysis","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF","json":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF.json","graph_json":"https://pith.science/api/pith-number/2XHZDFX4ZYK7CCS6SJUOV3MIZF/graph.json","events_json":"https://pith.science/api/pith-number/2XHZDFX4ZYK7CCS6SJUOV3MIZF/events.json","paper":"https://pith.science/paper/2XHZDFX4"},"agent_actions":{"view_html":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF","download_json":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF.json","view_paper":"https://pith.science/paper/2XHZDFX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15159&json=true","fetch_graph":"https://pith.science/api/pith-number/2XHZDFX4ZYK7CCS6SJUOV3MIZF/graph.json","fetch_events":"https://pith.science/api/pith-number/2XHZDFX4ZYK7CCS6SJUOV3MIZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF/action/storage_attestation","attest_author":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF/action/author_attestation","sign_citation":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF/action/citation_signature","submit_replication":"https://pith.science/pith/2XHZDFX4ZYK7CCS6SJUOV3MIZF/action/replication_record"}},"created_at":"2026-07-05T11:23:38.341369+00:00","updated_at":"2026-07-05T11:23:38.341369+00:00"}