{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SLRPA44BD63MVISN55EJD2R3BQ","short_pith_number":"pith:SLRPA44B","canonical_record":{"source":{"id":"1612.08629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-27T13:27:22Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"eec11e3707e18f43849b192609284936862bae5600bc667077ea138ac078e707","abstract_canon_sha256":"0504d1125071fc618c80e5b196d4f63e332097734acee8ec9632e4ec7db6a8e7"},"schema_version":"1.0"},"canonical_sha256":"92e2f073811fb6caa24def4891ea3b0c0c40cf851ca2222b96c41d47d5279640","source":{"kind":"arxiv","id":"1612.08629","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08629","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08629v4","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08629","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"SLRPA44BD63M","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SLRPA44BD63MVISN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SLRPA44B","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SLRPA44BD63MVISN55EJD2R3BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08629","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-27T13:27:22Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"eec11e3707e18f43849b192609284936862bae5600bc667077ea138ac078e707","abstract_canon_sha256":"0504d1125071fc618c80e5b196d4f63e332097734acee8ec9632e4ec7db6a8e7"},"schema_version":"1.0"},"canonical_sha256":"92e2f073811fb6caa24def4891ea3b0c0c40cf851ca2222b96c41d47d5279640","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.436342Z","signature_b64":"WAq7r65fqSo/tUjAAAi94ikHU70/DhFN5mOfrInJgWt1WZcHGbnfn9BpzNbTTNJb/3Y9FczWZ3YpUJLuJUOqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e2f073811fb6caa24def4891ea3b0c0c40cf851ca2222b96c41d47d5279640","last_reissued_at":"2026-05-17T23:59:33.435730Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.435730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08629","source_version":4,"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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kc6eLqBjgiX/AUlyCYPAgg0cnTHGGyAL7rz+6UR2jeWIggMswds2bE8HBoMlQBdgK4XEPSj3Fjk0g1aj36CFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:17.204974Z"},"content_sha256":"9bc230be981dd19e7450a6a489c512d723b5e02c40af8d24301dd0ff5d6a037d","schema_version":"1.0","event_id":"sha256:9bc230be981dd19e7450a6a489c512d723b5e02c40af8d24301dd0ff5d6a037d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SLRPA44BD63MVISN55EJD2R3BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating SIR processes on networks using weighted shortest paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Dijana Tolic, Kaj-Kolja Kleineberg, Nino Antulov-Fantulin","submitted_at":"2016-12-27T13:27:22Z","abstract_excerpt":"We present a framework to simulate SIR processes on networks using weighted shortest paths. Our framework maps the SIR dynamics to weights assigned to the edges of the network, which can be done for Markovian and non-Markovian processes alike. The weights represent the propagation time between the adjacent nodes for a particular realization. We simulate the dynamics by constructing an ensemble of such realizations, which can be done by using a Markov Chain Monte Carlo method or by direct sampling. The former provides a runtime advantage when realizations from all possible sources are computed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08629","kind":"arxiv","version":4},"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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4kS/+rQNipSj1T71pb/xxlf2KG2d5DjnN0qG2cBeD+zdgwaXZf9u3TsUBUUZCLi4AtV+mKWdgVF17SW7P0FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:10:17.205633Z"},"content_sha256":"5223ebcb065392b777ab0b7b9d5654f45edcd284be076170d9eb6cf3d5d92525","schema_version":"1.0","event_id":"sha256:5223ebcb065392b777ab0b7b9d5654f45edcd284be076170d9eb6cf3d5d92525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLRPA44BD63MVISN55EJD2R3BQ/bundle.json","state_url":"https://pith.science/pith/SLRPA44BD63MVISN55EJD2R3BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLRPA44BD63MVISN55EJD2R3BQ/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-30T21:10:17Z","links":{"resolver":"https://pith.science/pith/SLRPA44BD63MVISN55EJD2R3BQ","bundle":"https://pith.science/pith/SLRPA44BD63MVISN55EJD2R3BQ/bundle.json","state":"https://pith.science/pith/SLRPA44BD63MVISN55EJD2R3BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLRPA44BD63MVISN55EJD2R3BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SLRPA44BD63MVISN55EJD2R3BQ","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":"0504d1125071fc618c80e5b196d4f63e332097734acee8ec9632e4ec7db6a8e7","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-27T13:27:22Z","title_canon_sha256":"eec11e3707e18f43849b192609284936862bae5600bc667077ea138ac078e707"},"schema_version":"1.0","source":{"id":"1612.08629","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08629","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08629v4","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08629","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"SLRPA44BD63M","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SLRPA44BD63MVISN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SLRPA44B","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:5223ebcb065392b777ab0b7b9d5654f45edcd284be076170d9eb6cf3d5d92525","target":"graph","created_at":"2026-05-17T23:59:33Z","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":"We present a framework to simulate SIR processes on networks using weighted shortest paths. Our framework maps the SIR dynamics to weights assigned to the edges of the network, which can be done for Markovian and non-Markovian processes alike. The weights represent the propagation time between the adjacent nodes for a particular realization. We simulate the dynamics by constructing an ensemble of such realizations, which can be done by using a Markov Chain Monte Carlo method or by direct sampling. The former provides a runtime advantage when realizations from all possible sources are computed ","authors_text":"Dijana Tolic, Kaj-Kolja Kleineberg, Nino Antulov-Fantulin","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-27T13:27:22Z","title":"Simulating SIR processes on networks using weighted shortest paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08629","kind":"arxiv","version":4},"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:9bc230be981dd19e7450a6a489c512d723b5e02c40af8d24301dd0ff5d6a037d","target":"record","created_at":"2026-05-17T23:59:33Z","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":"0504d1125071fc618c80e5b196d4f63e332097734acee8ec9632e4ec7db6a8e7","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-27T13:27:22Z","title_canon_sha256":"eec11e3707e18f43849b192609284936862bae5600bc667077ea138ac078e707"},"schema_version":"1.0","source":{"id":"1612.08629","kind":"arxiv","version":4}},"canonical_sha256":"92e2f073811fb6caa24def4891ea3b0c0c40cf851ca2222b96c41d47d5279640","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92e2f073811fb6caa24def4891ea3b0c0c40cf851ca2222b96c41d47d5279640","first_computed_at":"2026-05-17T23:59:33.435730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:33.435730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WAq7r65fqSo/tUjAAAi94ikHU70/DhFN5mOfrInJgWt1WZcHGbnfn9BpzNbTTNJb/3Y9FczWZ3YpUJLuJUOqAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:33.436342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08629","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bc230be981dd19e7450a6a489c512d723b5e02c40af8d24301dd0ff5d6a037d","sha256:5223ebcb065392b777ab0b7b9d5654f45edcd284be076170d9eb6cf3d5d92525"],"state_sha256":"b9cfc49ac72570a6fe2eae7769cdf51a7f48f951d905afa07689fe09b5f5fcf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gurRfdqAzKG3aUs7brgNr7maPChp7aQX/m+yfiSgFYyTMWo/8M5hHZofBsXilGOo0jJ0dNAD6dhkmovH/y2YDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:10:17.209180Z","bundle_sha256":"b7d18f225c859d4442daf052a61e2968e124039c33d876c6501939657750877f"}}