{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZUEFHCWXQVSSYY5TADII2OMUFM","short_pith_number":"pith:ZUEFHCWX","canonical_record":{"source":{"id":"1804.04583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-12T15:59:33Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dd26cad5e136fc37498c653346c8fc3456dc10983d6f8b0d8b0ef75adc49ad3e","abstract_canon_sha256":"3b623744ce3a191b6505569aaa977769f2ceb874aa30c04cd3279aa365265c06"},"schema_version":"1.0"},"canonical_sha256":"cd08538ad785652c63b300d08d39942b12df76cad7c5bcb316f4c6411faecf66","source":{"kind":"arxiv","id":"1804.04583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04583","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04583v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04583","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZUEFHCWXQVSS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZUEFHCWXQVSSYY5T","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZUEFHCWX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZUEFHCWXQVSSYY5TADII2OMUFM","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-12T15:59:33Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dd26cad5e136fc37498c653346c8fc3456dc10983d6f8b0d8b0ef75adc49ad3e","abstract_canon_sha256":"3b623744ce3a191b6505569aaa977769f2ceb874aa30c04cd3279aa365265c06"},"schema_version":"1.0"},"canonical_sha256":"cd08538ad785652c63b300d08d39942b12df76cad7c5bcb316f4c6411faecf66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:36.928769Z","signature_b64":"P4O4jb8H/oZjH4d+lkUjUZX2320OzE7pnFR6tyHkBLf58PSjTQlarsLh0ksS12sGxxcKknhCR8IxBGHY8fmeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd08538ad785652c63b300d08d39942b12df76cad7c5bcb316f4c6411faecf66","last_reissued_at":"2026-05-18T00:18:36.928121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:36.928121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04583","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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDNza5Dnc81R4E0D2MEd3kf4UUitaDnKv3H/IFS7nFclF+aDEWi24NAwPHsyoakmcw86keWvvuI/TtYhEvCVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:50:04.769538Z"},"content_sha256":"603cb8651e8fd0ddf9a9814c1f5cdfb91a60f0850574273715afe29f8314d6fd","schema_version":"1.0","event_id":"sha256:603cb8651e8fd0ddf9a9814c1f5cdfb91a60f0850574273715afe29f8314d6fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZUEFHCWXQVSSYY5TADII2OMUFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Generative Statistical Model for Graphs: The Latent Order Logistic (LOLOG) Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.ME","authors_text":"Ian E. Fellows","submitted_at":"2018-04-12T15:59:33Z","abstract_excerpt":"Full probability models are critical for the statistical modeling of complex networks, and yet there are few general, flexible and widely applicable generative methods. We propose a new family of probability models motivated by the idea of network growth, which we call the Latent Order Logistic (LOLOG) model. LOLOG is a fully general framework capable of describing any probability distribution over graph configurations, though not all distributions are easily expressible or estimable as a LOLOG. We develop inferential procedures based on Monte Carlo Method of Moments, Generalized Method of Mom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04583","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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otibK8qMbYWJ2olbM3fjFWZAqjPgk2hmuWeb4RRxcWPoMV9pHtgaSmRMWSTye6K25v5dYzfloAdSCHOpnIcDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:50:04.769891Z"},"content_sha256":"f881fcad1d61b47315efd2495fe2778627c1a9a115c5fe9de58561cb0a5888fe","schema_version":"1.0","event_id":"sha256:f881fcad1d61b47315efd2495fe2778627c1a9a115c5fe9de58561cb0a5888fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/bundle.json","state_url":"https://pith.science/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/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-05-21T18:50:04Z","links":{"resolver":"https://pith.science/pith/ZUEFHCWXQVSSYY5TADII2OMUFM","bundle":"https://pith.science/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/bundle.json","state":"https://pith.science/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUEFHCWXQVSSYY5TADII2OMUFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZUEFHCWXQVSSYY5TADII2OMUFM","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":"3b623744ce3a191b6505569aaa977769f2ceb874aa30c04cd3279aa365265c06","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-12T15:59:33Z","title_canon_sha256":"dd26cad5e136fc37498c653346c8fc3456dc10983d6f8b0d8b0ef75adc49ad3e"},"schema_version":"1.0","source":{"id":"1804.04583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04583","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04583v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04583","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZUEFHCWXQVSS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZUEFHCWXQVSSYY5T","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZUEFHCWX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f881fcad1d61b47315efd2495fe2778627c1a9a115c5fe9de58561cb0a5888fe","target":"graph","created_at":"2026-05-18T00:18:36Z","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":"Full probability models are critical for the statistical modeling of complex networks, and yet there are few general, flexible and widely applicable generative methods. We propose a new family of probability models motivated by the idea of network growth, which we call the Latent Order Logistic (LOLOG) model. LOLOG is a fully general framework capable of describing any probability distribution over graph configurations, though not all distributions are easily expressible or estimable as a LOLOG. We develop inferential procedures based on Monte Carlo Method of Moments, Generalized Method of Mom","authors_text":"Ian E. Fellows","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-12T15:59:33Z","title":"A New Generative Statistical Model for Graphs: The Latent Order Logistic (LOLOG) Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04583","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:603cb8651e8fd0ddf9a9814c1f5cdfb91a60f0850574273715afe29f8314d6fd","target":"record","created_at":"2026-05-18T00:18:36Z","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":"3b623744ce3a191b6505569aaa977769f2ceb874aa30c04cd3279aa365265c06","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-04-12T15:59:33Z","title_canon_sha256":"dd26cad5e136fc37498c653346c8fc3456dc10983d6f8b0d8b0ef75adc49ad3e"},"schema_version":"1.0","source":{"id":"1804.04583","kind":"arxiv","version":1}},"canonical_sha256":"cd08538ad785652c63b300d08d39942b12df76cad7c5bcb316f4c6411faecf66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd08538ad785652c63b300d08d39942b12df76cad7c5bcb316f4c6411faecf66","first_computed_at":"2026-05-18T00:18:36.928121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:36.928121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4O4jb8H/oZjH4d+lkUjUZX2320OzE7pnFR6tyHkBLf58PSjTQlarsLh0ksS12sGxxcKknhCR8IxBGHY8fmeAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:36.928769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:603cb8651e8fd0ddf9a9814c1f5cdfb91a60f0850574273715afe29f8314d6fd","sha256:f881fcad1d61b47315efd2495fe2778627c1a9a115c5fe9de58561cb0a5888fe"],"state_sha256":"002c399f294b2d6588dbd14662ff0d292be8bb3a1febea0ac6177851c79bdc6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmTDK4Fu66Xdwb+uvvY945dpkTSxID9gE1nvgtkc38/5X/tpFvmSFkDmE2tZKQJTnhtNodYJglGru7ftnBXFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:50:04.772051Z","bundle_sha256":"c20e7b59c9761038d5ac69da2707d35fea4762151eeadad739f3819af94bfce2"}}