{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DFKI4NXCRJDIQTQTEJCBN5ZZ3E","short_pith_number":"pith:DFKI4NXC","schema_version":"1.0","canonical_sha256":"19548e36e28a46884e13224416f739d917e69c4e36ca0787342c85152b850178","source":{"kind":"arxiv","id":"1102.2650","version":5},"attestation_state":"computed","paper":{"title":"Estimating and understanding exponential random graph models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Persi Diaconis, Sourav Chatterjee","submitted_at":"2011-02-14T00:59:59Z","abstract_excerpt":"We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and Varadhan [European J. Combin. 32 (2011) 1000-1017]. The theory explains a host of difficulties encountered by applied workers: many distinct models have essentially the same MLE, rendering the problems ``practically'' ill-posed. We give the first rigorous proofs of ``degeneracy'' observed in these models. Here, almost all graphs have essentially no edges or are e"},"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":"1102.2650","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-14T00:59:59Z","cross_cats_sorted":["math-ph","math.MP","math.ST","stat.TH"],"title_canon_sha256":"eb33e6bdcd9ac1923fa6157e63de027e3b9034cc9fc64573f599aafc48705ff1","abstract_canon_sha256":"0995b0ba5b91c2b1cfd4ffaf7e87b2ca2d9f37a7fa0930fdb6e485a33f2356e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.167198Z","signature_b64":"JIHLA0vO6ypo0+qw8NjTYU0GBxQNKST75UXGMQ74rReBUjdijLr0l5/F0panQWbcx/HeDkaNkUs4pcnlDG9aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19548e36e28a46884e13224416f739d917e69c4e36ca0787342c85152b850178","last_reissued_at":"2026-05-18T03:06:43.166782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.166782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating and understanding exponential random graph models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Persi Diaconis, Sourav Chatterjee","submitted_at":"2011-02-14T00:59:59Z","abstract_excerpt":"We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and Varadhan [European J. Combin. 32 (2011) 1000-1017]. The theory explains a host of difficulties encountered by applied workers: many distinct models have essentially the same MLE, rendering the problems ``practically'' ill-posed. We give the first rigorous proofs of ``degeneracy'' observed in these models. Here, almost all graphs have essentially no edges or are e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2650","kind":"arxiv","version":5},"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":"1102.2650","created_at":"2026-05-18T03:06:43.166843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2650v5","created_at":"2026-05-18T03:06:43.166843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2650","created_at":"2026-05-18T03:06:43.166843+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFKI4NXCRJDI","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFKI4NXCRJDIQTQT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFKI4NXC","created_at":"2026-05-18T12:26:26.731475+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/DFKI4NXCRJDIQTQTEJCBN5ZZ3E","json":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E.json","graph_json":"https://pith.science/api/pith-number/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/graph.json","events_json":"https://pith.science/api/pith-number/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/events.json","paper":"https://pith.science/paper/DFKI4NXC"},"agent_actions":{"view_html":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E","download_json":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E.json","view_paper":"https://pith.science/paper/DFKI4NXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2650&json=true","fetch_graph":"https://pith.science/api/pith-number/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/graph.json","fetch_events":"https://pith.science/api/pith-number/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/action/storage_attestation","attest_author":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/action/author_attestation","sign_citation":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/action/citation_signature","submit_replication":"https://pith.science/pith/DFKI4NXCRJDIQTQTEJCBN5ZZ3E/action/replication_record"}},"created_at":"2026-05-18T03:06:43.166843+00:00","updated_at":"2026-05-18T03:06:43.166843+00:00"}