{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BSZZEMYPKD6MIAGTPAO6QTZ2NL","short_pith_number":"pith:BSZZEMYP","schema_version":"1.0","canonical_sha256":"0cb392330f50fcc400d3781de84f3a6ac1bfc2812fc1d8f3e1ae9855991b7275","source":{"kind":"arxiv","id":"2502.01810","version":1},"attestation_state":"computed","paper":{"title":"Estimating Network Models using Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.EM","stat.CO","stat.ML"],"primary_cat":"cs.SI","authors_text":"Angelo Mele","submitted_at":"2025-02-03T20:41:06Z","abstract_excerpt":"Exponential random graph models (ERGMs) are very flexible for modeling network formation but pose difficult estimation challenges due to their intractable normalizing constant. Existing methods, such as MCMC-MLE, rely on sequential simulation at every optimization step. We propose a neural network approach that trains on a single, large set of parameter-simulation pairs to learn the mapping from parameters to average network statistics. Once trained, this map can be inverted, yielding a fast and parallelizable estimation method. The procedure also accommodates extra network statistics to mitig"},"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":"2502.01810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-02-03T20:41:06Z","cross_cats_sorted":["econ.EM","stat.CO","stat.ML"],"title_canon_sha256":"d2d33175762c3fb4f594b4789c3626f6e099b7a03781473cc3f42f89ffc82d59","abstract_canon_sha256":"d9a9937d2d50fbb7e019f25f08219977f012a18c804e81fbd7ca835824153ccf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:19.608754Z","signature_b64":"Dw0VJI8Lj7NOLE94oVcQ8R6LyXVLkoPBvnqoGepwoyteOEiGvoRLGAc6VMTTbf3dbjTy/uT1UwcQxXzzH07NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cb392330f50fcc400d3781de84f3a6ac1bfc2812fc1d8f3e1ae9855991b7275","last_reissued_at":"2026-07-05T10:09:19.608236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:19.608236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Network Models using Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.EM","stat.CO","stat.ML"],"primary_cat":"cs.SI","authors_text":"Angelo Mele","submitted_at":"2025-02-03T20:41:06Z","abstract_excerpt":"Exponential random graph models (ERGMs) are very flexible for modeling network formation but pose difficult estimation challenges due to their intractable normalizing constant. Existing methods, such as MCMC-MLE, rely on sequential simulation at every optimization step. We propose a neural network approach that trains on a single, large set of parameter-simulation pairs to learn the mapping from parameters to average network statistics. Once trained, this map can be inverted, yielding a fast and parallelizable estimation method. The procedure also accommodates extra network statistics to mitig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01810","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/2502.01810/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":"2502.01810","created_at":"2026-07-05T10:09:19.608299+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01810v1","created_at":"2026-07-05T10:09:19.608299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01810","created_at":"2026-07-05T10:09:19.608299+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSZZEMYPKD6M","created_at":"2026-07-05T10:09:19.608299+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSZZEMYPKD6MIAGT","created_at":"2026-07-05T10:09:19.608299+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSZZEMYP","created_at":"2026-07-05T10:09:19.608299+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25873","citing_title":"Bayesian perspectives on exponential random graph models","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL","json":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL.json","graph_json":"https://pith.science/api/pith-number/BSZZEMYPKD6MIAGTPAO6QTZ2NL/graph.json","events_json":"https://pith.science/api/pith-number/BSZZEMYPKD6MIAGTPAO6QTZ2NL/events.json","paper":"https://pith.science/paper/BSZZEMYP"},"agent_actions":{"view_html":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL","download_json":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL.json","view_paper":"https://pith.science/paper/BSZZEMYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01810&json=true","fetch_graph":"https://pith.science/api/pith-number/BSZZEMYPKD6MIAGTPAO6QTZ2NL/graph.json","fetch_events":"https://pith.science/api/pith-number/BSZZEMYPKD6MIAGTPAO6QTZ2NL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL/action/storage_attestation","attest_author":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL/action/author_attestation","sign_citation":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL/action/citation_signature","submit_replication":"https://pith.science/pith/BSZZEMYPKD6MIAGTPAO6QTZ2NL/action/replication_record"}},"created_at":"2026-07-05T10:09:19.608299+00:00","updated_at":"2026-07-05T10:09:19.608299+00:00"}