{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R56HKYPBNLLXGAW5YP6NU6BLMK","short_pith_number":"pith:R56HKYPB","canonical_record":{"source":{"id":"1708.02598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-08T18:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"08c6eadd9bc15d1b2a8d9525e7f0ca9810072141c6ecf80a3f99f63a46559284","abstract_canon_sha256":"4e016073852eb1444f6ea5f00b2509fa4e558647f1322d33c0c717972903f962"},"schema_version":"1.0"},"canonical_sha256":"8f7c7561e16ad77302ddc3fcda782b62a4638e5d0843f811763e0341158dd2dc","source":{"kind":"arxiv","id":"1708.02598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02598","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02598v1","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02598","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"pith_short_12","alias_value":"R56HKYPBNLLX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R56HKYPBNLLXGAW5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R56HKYPB","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R56HKYPBNLLXGAW5YP6NU6BLMK","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-08T18:21:42Z","cross_cats_sorted":[],"title_canon_sha256":"08c6eadd9bc15d1b2a8d9525e7f0ca9810072141c6ecf80a3f99f63a46559284","abstract_canon_sha256":"4e016073852eb1444f6ea5f00b2509fa4e558647f1322d33c0c717972903f962"},"schema_version":"1.0"},"canonical_sha256":"8f7c7561e16ad77302ddc3fcda782b62a4638e5d0843f811763e0341158dd2dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:20.239255Z","signature_b64":"fsuMudsfy9OG0f1oHvXDSbrEliNUJrg7uLSZSraK1Dw+SAlaaUVtiLylOqA1Tu69on04seh7Pv6tsiMoJ/rpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7c7561e16ad77302ddc3fcda782b62a4638e5d0843f811763e0341158dd2dc","last_reissued_at":"2026-05-18T00:38:20.238594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:20.238594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02598","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-18T00:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/bNH9pqMSENV66wk6No4AsVZZDPFkVHa5TFR6DWOzRsfImReDTngNI28ZTGAbrWPtzhi3vaVAgFY8gt0HpmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:57.458962Z"},"content_sha256":"9ac51b372d33e802eb871dd708334e09fee277208ddc7e3f9f24a5627c249e08","schema_version":"1.0","event_id":"sha256:9ac51b372d33e802eb871dd708334e09fee277208ddc7e3f9f24a5627c249e08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R56HKYPBNLLXGAW5YP6NU6BLMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Random Graph Models with Big Networks: Maximum Pseudolikelihood Estimation and the Parametric Bootstrap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Bruce A. Desmarais, Christian S. Schmid","submitted_at":"2017-08-08T18:21:42Z","abstract_excerpt":"With the growth of interest in network data across fields, the Exponential Random Graph Model (ERGM) has emerged as the leading approach to the statistical analysis of network data. ERGM parameter estimation requires the approximation of an intractable normalizing constant. Simulation methods represent the state-of-the-art approach to approximating the normalizing constant, leading to estimation by Monte Carlo maximum likelihood (MCMLE). MCMLE is accurate when a large sample of networks is used to approximate the normalizing constant. However, MCMLE is computationally expensive, and may be pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02598","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-18T00:38:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UrnhIT5JA4WdfWiDG6GA9xSUXIODU7NGHzTEskjZbrCrXbtRrULRygxTMK4vS4mf2Ghz+nuZxMJE+lhe+5HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:57.459654Z"},"content_sha256":"32ede30c741be66659763105e7e463014c0f202f9facb0f544ccc657dfa14ef8","schema_version":"1.0","event_id":"sha256:32ede30c741be66659763105e7e463014c0f202f9facb0f544ccc657dfa14ef8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/bundle.json","state_url":"https://pith.science/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/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-11T06:59:57Z","links":{"resolver":"https://pith.science/pith/R56HKYPBNLLXGAW5YP6NU6BLMK","bundle":"https://pith.science/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/bundle.json","state":"https://pith.science/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R56HKYPBNLLXGAW5YP6NU6BLMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R56HKYPBNLLXGAW5YP6NU6BLMK","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":"4e016073852eb1444f6ea5f00b2509fa4e558647f1322d33c0c717972903f962","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-08T18:21:42Z","title_canon_sha256":"08c6eadd9bc15d1b2a8d9525e7f0ca9810072141c6ecf80a3f99f63a46559284"},"schema_version":"1.0","source":{"id":"1708.02598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02598","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02598v1","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02598","created_at":"2026-05-18T00:38:20Z"},{"alias_kind":"pith_short_12","alias_value":"R56HKYPBNLLX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R56HKYPBNLLXGAW5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R56HKYPB","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:32ede30c741be66659763105e7e463014c0f202f9facb0f544ccc657dfa14ef8","target":"graph","created_at":"2026-05-18T00:38:20Z","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":"With the growth of interest in network data across fields, the Exponential Random Graph Model (ERGM) has emerged as the leading approach to the statistical analysis of network data. ERGM parameter estimation requires the approximation of an intractable normalizing constant. Simulation methods represent the state-of-the-art approach to approximating the normalizing constant, leading to estimation by Monte Carlo maximum likelihood (MCMLE). MCMLE is accurate when a large sample of networks is used to approximate the normalizing constant. However, MCMLE is computationally expensive, and may be pro","authors_text":"Bruce A. Desmarais, Christian S. Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-08T18:21:42Z","title":"Exponential Random Graph Models with Big Networks: Maximum Pseudolikelihood Estimation and the Parametric Bootstrap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02598","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:9ac51b372d33e802eb871dd708334e09fee277208ddc7e3f9f24a5627c249e08","target":"record","created_at":"2026-05-18T00:38:20Z","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":"4e016073852eb1444f6ea5f00b2509fa4e558647f1322d33c0c717972903f962","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-08T18:21:42Z","title_canon_sha256":"08c6eadd9bc15d1b2a8d9525e7f0ca9810072141c6ecf80a3f99f63a46559284"},"schema_version":"1.0","source":{"id":"1708.02598","kind":"arxiv","version":1}},"canonical_sha256":"8f7c7561e16ad77302ddc3fcda782b62a4638e5d0843f811763e0341158dd2dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f7c7561e16ad77302ddc3fcda782b62a4638e5d0843f811763e0341158dd2dc","first_computed_at":"2026-05-18T00:38:20.238594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:20.238594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fsuMudsfy9OG0f1oHvXDSbrEliNUJrg7uLSZSraK1Dw+SAlaaUVtiLylOqA1Tu69on04seh7Pv6tsiMoJ/rpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:20.239255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ac51b372d33e802eb871dd708334e09fee277208ddc7e3f9f24a5627c249e08","sha256:32ede30c741be66659763105e7e463014c0f202f9facb0f544ccc657dfa14ef8"],"state_sha256":"18d9230b13971b65449267c6b280619910689616f6546ca9034073d495424e20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iTpk+2W2xCTld4sRiKvzL/HEd2Oq7U2QA+Eb4Z6hCrlfbBkjGM3h/BA+8gAlMPttD16h/06cnTNmY4SMA2qDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:59:57.463654Z","bundle_sha256":"482b2a0dfdcc30133f019ce54c3bf11f925c4c340ea01b38fc38c66138655621"}}