{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZC4HNIB2ZIP34MFAH5JJBPCK2V","short_pith_number":"pith:ZC4HNIB2","canonical_record":{"source":{"id":"1504.01298","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-04-03T15:55:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2bbbc6620926ff28408732a2930b2c10849f5fb8192d3e88423fee893f6ea30b","abstract_canon_sha256":"d54e8beb9304b3287019e6fe551cdfac10969aab0014ffcc8d4080633a828b07"},"schema_version":"1.0"},"canonical_sha256":"c8b876a03aca1fbe30a03f5290bc4ad5788ebe9136d68d61780266db312039d6","source":{"kind":"arxiv","id":"1504.01298","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01298","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01298v3","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01298","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZC4HNIB2ZIP3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZC4HNIB2ZIP34MFA","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZC4HNIB2","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZC4HNIB2ZIP34MFAH5JJBPCK2V","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01298","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-04-03T15:55:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2bbbc6620926ff28408732a2930b2c10849f5fb8192d3e88423fee893f6ea30b","abstract_canon_sha256":"d54e8beb9304b3287019e6fe551cdfac10969aab0014ffcc8d4080633a828b07"},"schema_version":"1.0"},"canonical_sha256":"c8b876a03aca1fbe30a03f5290bc4ad5788ebe9136d68d61780266db312039d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:39.373039Z","signature_b64":"PeNvdCT0MyRhaSW8ZM/DGJ+T3n1wyLOffYmyi0n4GKP5QtRdLxzIarYn7BT6+c0DZIdupphOre9bizrWMN21DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b876a03aca1fbe30a03f5290bc4ad5788ebe9136d68d61780266db312039d6","last_reissued_at":"2026-05-18T01:27:39.372616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:39.372616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01298","source_version":3,"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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkS43OBF70p8KjYLzS8cIUURkSMAQiBOr6zSpnDj/t5eWKoEUA3N5Ugb3HdtKomT5U4QQMz6JFqVrhZQjFRrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:54.589872Z"},"content_sha256":"5a7f5c2e990b53229fb9a14b1645da4729abafc5961d26ba8644cd6ce79bc52c","schema_version":"1.0","event_id":"sha256:5a7f5c2e990b53229fb9a14b1645da4729abafc5961d26ba8644cd6ce79bc52c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZC4HNIB2ZIP34MFAH5JJBPCK2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"q-bio.QM","authors_text":"Christian L. Vestergaard, Mathieu G\\'enois","submitted_at":"2015-04-03T15:55:03Z","abstract_excerpt":"Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01298","kind":"arxiv","version":3},"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-18T01:27:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvLzA0cpgAgpAPXmtqeOMa+CJNCDJ6y08pTOJa02G8MfUiwrDfFVDC8yDZLLLMKFHJPICn4/9AgmEhyxmjznAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:54.590231Z"},"content_sha256":"0689bbdc9ee476141fc36f8e3436ee39d4f72310d1094884d67e47eba02af21f","schema_version":"1.0","event_id":"sha256:0689bbdc9ee476141fc36f8e3436ee39d4f72310d1094884d67e47eba02af21f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/bundle.json","state_url":"https://pith.science/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/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-31T21:22:54Z","links":{"resolver":"https://pith.science/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V","bundle":"https://pith.science/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/bundle.json","state":"https://pith.science/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZC4HNIB2ZIP34MFAH5JJBPCK2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZC4HNIB2ZIP34MFAH5JJBPCK2V","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":"d54e8beb9304b3287019e6fe551cdfac10969aab0014ffcc8d4080633a828b07","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-04-03T15:55:03Z","title_canon_sha256":"2bbbc6620926ff28408732a2930b2c10849f5fb8192d3e88423fee893f6ea30b"},"schema_version":"1.0","source":{"id":"1504.01298","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01298","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01298v3","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01298","created_at":"2026-05-18T01:27:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZC4HNIB2ZIP3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZC4HNIB2ZIP34MFA","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZC4HNIB2","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:0689bbdc9ee476141fc36f8e3436ee39d4f72310d1094884d67e47eba02af21f","target":"graph","created_at":"2026-05-18T01:27:39Z","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":"Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to gener","authors_text":"Christian L. Vestergaard, Mathieu G\\'enois","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-04-03T15:55:03Z","title":"Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01298","kind":"arxiv","version":3},"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:5a7f5c2e990b53229fb9a14b1645da4729abafc5961d26ba8644cd6ce79bc52c","target":"record","created_at":"2026-05-18T01:27:39Z","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":"d54e8beb9304b3287019e6fe551cdfac10969aab0014ffcc8d4080633a828b07","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-04-03T15:55:03Z","title_canon_sha256":"2bbbc6620926ff28408732a2930b2c10849f5fb8192d3e88423fee893f6ea30b"},"schema_version":"1.0","source":{"id":"1504.01298","kind":"arxiv","version":3}},"canonical_sha256":"c8b876a03aca1fbe30a03f5290bc4ad5788ebe9136d68d61780266db312039d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8b876a03aca1fbe30a03f5290bc4ad5788ebe9136d68d61780266db312039d6","first_computed_at":"2026-05-18T01:27:39.372616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:39.372616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PeNvdCT0MyRhaSW8ZM/DGJ+T3n1wyLOffYmyi0n4GKP5QtRdLxzIarYn7BT6+c0DZIdupphOre9bizrWMN21DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:39.373039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01298","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a7f5c2e990b53229fb9a14b1645da4729abafc5961d26ba8644cd6ce79bc52c","sha256:0689bbdc9ee476141fc36f8e3436ee39d4f72310d1094884d67e47eba02af21f"],"state_sha256":"fb09d6d0de0723ad8360da37d93177528c124b79345dfbe40ea45a3513ff5868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIDH4YP8bUsm7BJj3sCKnO1PRUwIr4a/DtwXNmdUJYiWu+H7uyzJ/aAXiYudUE/0d6fISegOP2t16KXRv9GzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:22:54.592208Z","bundle_sha256":"96bc74d304b3ca34a3d7e7370d68624a7f4887755613ce2ba76d357c8e0eb2e9"}}