{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVHTXMYA3BWSBWCXOJBEEJSDYH","short_pith_number":"pith:FVHTXMYA","canonical_record":{"source":{"id":"1802.10311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-28T09:02:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b7b460aa108bc8b3c99fd1cefa573ba5978debf88df375cb5cc2c681cf20c6c2","abstract_canon_sha256":"40373b0562efaf164bb6664c69523bbb1ca7d9d96e0c6eb5d6de749267abc3ef"},"schema_version":"1.0"},"canonical_sha256":"2d4f3bb300d86d20d8577242422643c1c4826040ec892f093475268bd2629bae","source":{"kind":"arxiv","id":"1802.10311","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10311","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10311v2","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10311","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"FVHTXMYA3BWS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVHTXMYA3BWSBWCX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVHTXMYA","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVHTXMYA3BWSBWCXOJBEEJSDYH","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-28T09:02:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b7b460aa108bc8b3c99fd1cefa573ba5978debf88df375cb5cc2c681cf20c6c2","abstract_canon_sha256":"40373b0562efaf164bb6664c69523bbb1ca7d9d96e0c6eb5d6de749267abc3ef"},"schema_version":"1.0"},"canonical_sha256":"2d4f3bb300d86d20d8577242422643c1c4826040ec892f093475268bd2629bae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:09.566734Z","signature_b64":"KFeCvJzrv43UKNZQK7t4qPfWR2rc9efSaNvozGoZDIY2/xe1oOXxS8eRqlAtt3Na4taSJAyumCNsBOxxuaeFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4f3bb300d86d20d8577242422643c1c4826040ec892f093475268bd2629bae","last_reissued_at":"2026-05-18T00:09:09.566157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:09.566157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10311","source_version":2,"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:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCFz1vmtSi2eB0luBGnvqlqLD1lKtdggEAgT4heMQgYhz8iwLSQvfkW+wTzJwq+Q78wl+vVTaHPfXTH7WebLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:35:51.219951Z"},"content_sha256":"037d554c360431aff60a6822d0c0ac50434620fc3f41e2d665fd78931bdacd86","schema_version":"1.0","event_id":"sha256:037d554c360431aff60a6822d0c0ac50434620fc3f41e2d665fd78931bdacd86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVHTXMYA3BWSBWCXOJBEEJSDYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Maximum Likelihood estimation via Equilibrium Expectation for Large Network Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Alessandro Lomi, Alex Stivala, Antonietta Mira, Garry Robins, Maksym Byshkin","submitted_at":"2018-02-28T09:02:26Z","abstract_excerpt":"A major line of contemporary research on complex networks is based on the development of statistical models that specify the local motifs associated with macro-structural properties observed in actual networks. This statistical approach becomes increasingly problematic as network size increases. In the context of current research on efficient estimation of models for large network data sets, we propose a fast algorithm for maximum likelihood estimation (MLE) that afords a signifcant increase in the size of networks amenable to direct empirical analysis. The algorithm we propose in this paper r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10311","kind":"arxiv","version":2},"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:09:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2omeldiUaM+7Wi53IZ+H6XlN/jeugiNBc0M+IgzRru3AAQhZ65J9Ph/7uHT4ROtzCpdAEdA14I6QQvMoZvj3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:35:51.220289Z"},"content_sha256":"6c5cb18d521ea909374363840d44bf5c59c8696fc809ca22f4083fd3a7ff8ec0","schema_version":"1.0","event_id":"sha256:6c5cb18d521ea909374363840d44bf5c59c8696fc809ca22f4083fd3a7ff8ec0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/bundle.json","state_url":"https://pith.science/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/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-23T14:35:51Z","links":{"resolver":"https://pith.science/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH","bundle":"https://pith.science/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/bundle.json","state":"https://pith.science/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVHTXMYA3BWSBWCXOJBEEJSDYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVHTXMYA3BWSBWCXOJBEEJSDYH","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":"40373b0562efaf164bb6664c69523bbb1ca7d9d96e0c6eb5d6de749267abc3ef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-28T09:02:26Z","title_canon_sha256":"b7b460aa108bc8b3c99fd1cefa573ba5978debf88df375cb5cc2c681cf20c6c2"},"schema_version":"1.0","source":{"id":"1802.10311","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10311","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10311v2","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10311","created_at":"2026-05-18T00:09:09Z"},{"alias_kind":"pith_short_12","alias_value":"FVHTXMYA3BWS","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVHTXMYA3BWSBWCX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVHTXMYA","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6c5cb18d521ea909374363840d44bf5c59c8696fc809ca22f4083fd3a7ff8ec0","target":"graph","created_at":"2026-05-18T00:09:09Z","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":"A major line of contemporary research on complex networks is based on the development of statistical models that specify the local motifs associated with macro-structural properties observed in actual networks. This statistical approach becomes increasingly problematic as network size increases. In the context of current research on efficient estimation of models for large network data sets, we propose a fast algorithm for maximum likelihood estimation (MLE) that afords a signifcant increase in the size of networks amenable to direct empirical analysis. The algorithm we propose in this paper r","authors_text":"Alessandro Lomi, Alex Stivala, Antonietta Mira, Garry Robins, Maksym Byshkin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-28T09:02:26Z","title":"Fast Maximum Likelihood estimation via Equilibrium Expectation for Large Network Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10311","kind":"arxiv","version":2},"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:037d554c360431aff60a6822d0c0ac50434620fc3f41e2d665fd78931bdacd86","target":"record","created_at":"2026-05-18T00:09:09Z","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":"40373b0562efaf164bb6664c69523bbb1ca7d9d96e0c6eb5d6de749267abc3ef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-28T09:02:26Z","title_canon_sha256":"b7b460aa108bc8b3c99fd1cefa573ba5978debf88df375cb5cc2c681cf20c6c2"},"schema_version":"1.0","source":{"id":"1802.10311","kind":"arxiv","version":2}},"canonical_sha256":"2d4f3bb300d86d20d8577242422643c1c4826040ec892f093475268bd2629bae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d4f3bb300d86d20d8577242422643c1c4826040ec892f093475268bd2629bae","first_computed_at":"2026-05-18T00:09:09.566157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:09.566157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KFeCvJzrv43UKNZQK7t4qPfWR2rc9efSaNvozGoZDIY2/xe1oOXxS8eRqlAtt3Na4taSJAyumCNsBOxxuaeFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:09.566734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10311","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:037d554c360431aff60a6822d0c0ac50434620fc3f41e2d665fd78931bdacd86","sha256:6c5cb18d521ea909374363840d44bf5c59c8696fc809ca22f4083fd3a7ff8ec0"],"state_sha256":"f65ccef25819ae428bf869f487b7a2f46718d16927da31b85a4c5ef7d1c9740f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCr/5Jf3m1e9wBntoc5HiDq5SuEV1TiozEKcaGMNLMDcuVAc23nG9w2zNn54i4iA7/4nS0Yf4tWF5O3PVugXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:35:51.222204Z","bundle_sha256":"4f59d2163c33a971c0994999c551f0773d71090f418146cbf94eb7f9b87451a9"}}