{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DPPJNMZU4BIGCO3SWAGB6CHVV6","short_pith_number":"pith:DPPJNMZU","canonical_record":{"source":{"id":"1807.08834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-23T21:20:06Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"d48240eeb3922ea546caa4e6be67f60d54480f054d8759ae985db0b8b643faa0","abstract_canon_sha256":"150fbc1c384099f43d9b88fee9bca9843732993cd5afe01e2b018080bc729403"},"schema_version":"1.0"},"canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","source":{"kind":"arxiv","id":"1807.08834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08834","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08834v1","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08834","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"DPPJNMZU4BIG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPPJNMZU4BIGCO3S","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPPJNMZU","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DPPJNMZU4BIGCO3SWAGB6CHVV6","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-23T21:20:06Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"d48240eeb3922ea546caa4e6be67f60d54480f054d8759ae985db0b8b643faa0","abstract_canon_sha256":"150fbc1c384099f43d9b88fee9bca9843732993cd5afe01e2b018080bc729403"},"schema_version":"1.0"},"canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:57.684249Z","signature_b64":"D0syqCOWLnDRuz3/L84x7Dh7DujLZQYzw3HuiWcLtkS7KvcPCaPdZkSthR5heJFlsIJVOAmSbUq2B6N6QvuICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","last_reissued_at":"2026-05-18T00:09:57.683753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:57.683753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08834","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:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoEJkz8Clo53AvL4Cow1h9tZhJNIrJUjNgO+Qvhqn6iYcucuVIUzYT84D1rupDZfSg+9LkeHgBIjfNqng69ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:31:33.258135Z"},"content_sha256":"905ff3116c7e99b5015c49f69d63839025a6f6967d112cd679dedbd8df48d3c1","schema_version":"1.0","event_id":"sha256:905ff3116c7e99b5015c49f69d63839025a6f6967d112cd679dedbd8df48d3c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DPPJNMZU4BIGCO3SWAGB6CHVV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable Multiple Time Step Simulation/Prediction from Lagged Dynamic Network Regression Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Abhirup Mallik, Zack W. Almquist","submitted_at":"2018-07-23T21:20:06Z","abstract_excerpt":"Recent developments in computers and automated data collection strategies have greatly increased the interest in statistical modeling of dynamic networks. Many of the statistical models employed for inference on large-scale dynamic networks suffer from limited forward simulation/prediction ability. A major problem with many of the forward simulation procedures is the tendency for the model to become degenerate in only a few time steps, i.e., the simulation/prediction procedure results in either null graphs or complete graphs. Here, we describe an algorithm for simulating a sequence of networks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08834","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:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfiEBlTm5JNDy2Z1AD2azP+tLKpchM6sBbAL3OOumMTkmXZ63YxOt67/l/MgiDiS76KYxZVIi3hKMFVHPb41AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:31:33.258515Z"},"content_sha256":"2e6ed9fe2286aad5ee7b547a0f4c1e17282ec47f567a7121f43a78a658bc73ac","schema_version":"1.0","event_id":"sha256:2e6ed9fe2286aad5ee7b547a0f4c1e17282ec47f567a7121f43a78a658bc73ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/bundle.json","state_url":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/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-26T08:31:33Z","links":{"resolver":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6","bundle":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/bundle.json","state":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DPPJNMZU4BIGCO3SWAGB6CHVV6","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":"150fbc1c384099f43d9b88fee9bca9843732993cd5afe01e2b018080bc729403","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-23T21:20:06Z","title_canon_sha256":"d48240eeb3922ea546caa4e6be67f60d54480f054d8759ae985db0b8b643faa0"},"schema_version":"1.0","source":{"id":"1807.08834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08834","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08834v1","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08834","created_at":"2026-05-18T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"DPPJNMZU4BIG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPPJNMZU4BIGCO3S","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPPJNMZU","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:2e6ed9fe2286aad5ee7b547a0f4c1e17282ec47f567a7121f43a78a658bc73ac","target":"graph","created_at":"2026-05-18T00:09:57Z","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":"Recent developments in computers and automated data collection strategies have greatly increased the interest in statistical modeling of dynamic networks. Many of the statistical models employed for inference on large-scale dynamic networks suffer from limited forward simulation/prediction ability. A major problem with many of the forward simulation procedures is the tendency for the model to become degenerate in only a few time steps, i.e., the simulation/prediction procedure results in either null graphs or complete graphs. Here, we describe an algorithm for simulating a sequence of networks","authors_text":"Abhirup Mallik, Zack W. Almquist","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-23T21:20:06Z","title":"Stable Multiple Time Step Simulation/Prediction from Lagged Dynamic Network Regression Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08834","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:905ff3116c7e99b5015c49f69d63839025a6f6967d112cd679dedbd8df48d3c1","target":"record","created_at":"2026-05-18T00:09:57Z","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":"150fbc1c384099f43d9b88fee9bca9843732993cd5afe01e2b018080bc729403","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-07-23T21:20:06Z","title_canon_sha256":"d48240eeb3922ea546caa4e6be67f60d54480f054d8759ae985db0b8b643faa0"},"schema_version":"1.0","source":{"id":"1807.08834","kind":"arxiv","version":1}},"canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","first_computed_at":"2026-05-18T00:09:57.683753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:57.683753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0syqCOWLnDRuz3/L84x7Dh7DujLZQYzw3HuiWcLtkS7KvcPCaPdZkSthR5heJFlsIJVOAmSbUq2B6N6QvuICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:57.684249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905ff3116c7e99b5015c49f69d63839025a6f6967d112cd679dedbd8df48d3c1","sha256:2e6ed9fe2286aad5ee7b547a0f4c1e17282ec47f567a7121f43a78a658bc73ac"],"state_sha256":"67b3c3a0b21b7b627e72fc08c286695bf885ba54f102a8f7cfaf21e9623380e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GF5MZ7FEIMLzoFl3B1n2Ta1B/AOX0K4twynFCvXuzPa2WFs5wrQcafCmcCushjygZGKgnVkAjVoeNkjKUQ8PCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:31:33.260483Z","bundle_sha256":"e9630b2ecee6e37ba08cf302dd06fe3583786dc3d3ce6d599df6b0f8076ffb67"}}