{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPPJNMZU4BIGCO3SWAGB6CHVV6","short_pith_number":"pith:DPPJNMZU","schema_version":"1.0","canonical_sha256":"1bde96b334e050613b72b00c1f08f5afa8d3251ee0fd4a10c4cea1f9caf639ac","source":{"kind":"arxiv","id":"1807.08834","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.08834","created_at":"2026-05-18T00:09:57.683831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08834v1","created_at":"2026-05-18T00:09:57.683831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08834","created_at":"2026-05-18T00:09:57.683831+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPPJNMZU4BIG","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPPJNMZU4BIGCO3S","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPPJNMZU","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6","json":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6.json","graph_json":"https://pith.science/api/pith-number/DPPJNMZU4BIGCO3SWAGB6CHVV6/graph.json","events_json":"https://pith.science/api/pith-number/DPPJNMZU4BIGCO3SWAGB6CHVV6/events.json","paper":"https://pith.science/paper/DPPJNMZU"},"agent_actions":{"view_html":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6","download_json":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6.json","view_paper":"https://pith.science/paper/DPPJNMZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08834&json=true","fetch_graph":"https://pith.science/api/pith-number/DPPJNMZU4BIGCO3SWAGB6CHVV6/graph.json","fetch_events":"https://pith.science/api/pith-number/DPPJNMZU4BIGCO3SWAGB6CHVV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/action/storage_attestation","attest_author":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/action/author_attestation","sign_citation":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/action/citation_signature","submit_replication":"https://pith.science/pith/DPPJNMZU4BIGCO3SWAGB6CHVV6/action/replication_record"}},"created_at":"2026-05-18T00:09:57.683831+00:00","updated_at":"2026-05-18T00:09:57.683831+00:00"}