{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FOEIKW3TH7HY5PTNQGYOLDHWP6","short_pith_number":"pith:FOEIKW3T","canonical_record":{"source":{"id":"1202.1639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-08T09:58:07Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"746389e1d27109707884775d14c9b39d4c231902557bc5909bb2e9c41bbcfa9d","abstract_canon_sha256":"a79bd6120c41a543c852fc2b61ab302c216c458f45a9b158b58edce761dc1e08"},"schema_version":"1.0"},"canonical_sha256":"2b88855b733fcf8ebe6d81b0e58cf67f8d7486a8b1048e226433c14f28694604","source":{"kind":"arxiv","id":"1202.1639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1639","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1639v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1639","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FOEIKW3TH7HY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FOEIKW3TH7HY5PTN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FOEIKW3T","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FOEIKW3TH7HY5PTNQGYOLDHWP6","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-08T09:58:07Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"746389e1d27109707884775d14c9b39d4c231902557bc5909bb2e9c41bbcfa9d","abstract_canon_sha256":"a79bd6120c41a543c852fc2b61ab302c216c458f45a9b158b58edce761dc1e08"},"schema_version":"1.0"},"canonical_sha256":"2b88855b733fcf8ebe6d81b0e58cf67f8d7486a8b1048e226433c14f28694604","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.033803Z","signature_b64":"LTE/KpkaxlPkanzvaYHiD+r+wVym0aQvuqsdoiNaIt2qLzAa9SbP0wcZWOaXqVm1O3kIyymwwotYLV1wk6m6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b88855b733fcf8ebe6d81b0e58cf67f8d7486a8b1048e226433c14f28694604","last_reissued_at":"2026-05-18T02:21:18.033118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.033118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1639","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCXwAZQ58ar5CE5UIfyof6Y5uKCfJ0POWHrKkNCYvP1yDHFGpivLGpWZrgHO3Jf1lY59W5I1JSQaZQgxfqxuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:24.053646Z"},"content_sha256":"e91cf43b7b4d77b14d5390501dae91f4f1ac403145fe6ea496efcc878dbc6cae","schema_version":"1.0","event_id":"sha256:e91cf43b7b4d77b14d5390501dae91f4f1ac403145fe6ea496efcc878dbc6cae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FOEIKW3TH7HY5PTNQGYOLDHWP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Alen Lancic, Hrvoje Stefancic, Mile Sikic, Nino Antulov-Fantulin","submitted_at":"2012-02-08T09:58:07Z","abstract_excerpt":"The epidemic spreading on arbitrary complex networks is studied in SIR (Susceptible Infected Recovered) compartment model. We propose our implementation of a Naive SIR algorithm for epidemic simulation spreading on networks that uses data structures efficiently to reduce running time. The Naive SIR algorithm models full epidemic dynamics and can be easily upgraded to parallel version. We also propose novel algorithm for epidemic simulation spreading on networks called the FastSIR algorithm that has better average case running time than the Naive SIR algorithm. The FastSIR algorithm uses novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1639","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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gIUWcg3d717/180OoSMj/kp5Y67BJOzbQloMyy4z2xKVjQvrI0JWLau3YIF8zY1LRMc2Y+dkuCPt878BuXrpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:24.054275Z"},"content_sha256":"896234415caeb2aab03400346f30b4a2b7af6a9964dcd3a07af16b09177de549","schema_version":"1.0","event_id":"sha256:896234415caeb2aab03400346f30b4a2b7af6a9964dcd3a07af16b09177de549"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/bundle.json","state_url":"https://pith.science/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/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-26T03:41:24Z","links":{"resolver":"https://pith.science/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6","bundle":"https://pith.science/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/bundle.json","state":"https://pith.science/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOEIKW3TH7HY5PTNQGYOLDHWP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FOEIKW3TH7HY5PTNQGYOLDHWP6","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":"a79bd6120c41a543c852fc2b61ab302c216c458f45a9b158b58edce761dc1e08","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-08T09:58:07Z","title_canon_sha256":"746389e1d27109707884775d14c9b39d4c231902557bc5909bb2e9c41bbcfa9d"},"schema_version":"1.0","source":{"id":"1202.1639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1639","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1639v1","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1639","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FOEIKW3TH7HY","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FOEIKW3TH7HY5PTN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FOEIKW3T","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:896234415caeb2aab03400346f30b4a2b7af6a9964dcd3a07af16b09177de549","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"The epidemic spreading on arbitrary complex networks is studied in SIR (Susceptible Infected Recovered) compartment model. We propose our implementation of a Naive SIR algorithm for epidemic simulation spreading on networks that uses data structures efficiently to reduce running time. The Naive SIR algorithm models full epidemic dynamics and can be easily upgraded to parallel version. We also propose novel algorithm for epidemic simulation spreading on networks called the FastSIR algorithm that has better average case running time than the Naive SIR algorithm. The FastSIR algorithm uses novel ","authors_text":"Alen Lancic, Hrvoje Stefancic, Mile Sikic, Nino Antulov-Fantulin","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-08T09:58:07Z","title":"FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1639","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:e91cf43b7b4d77b14d5390501dae91f4f1ac403145fe6ea496efcc878dbc6cae","target":"record","created_at":"2026-05-18T02:21:18Z","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":"a79bd6120c41a543c852fc2b61ab302c216c458f45a9b158b58edce761dc1e08","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-08T09:58:07Z","title_canon_sha256":"746389e1d27109707884775d14c9b39d4c231902557bc5909bb2e9c41bbcfa9d"},"schema_version":"1.0","source":{"id":"1202.1639","kind":"arxiv","version":1}},"canonical_sha256":"2b88855b733fcf8ebe6d81b0e58cf67f8d7486a8b1048e226433c14f28694604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b88855b733fcf8ebe6d81b0e58cf67f8d7486a8b1048e226433c14f28694604","first_computed_at":"2026-05-18T02:21:18.033118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.033118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTE/KpkaxlPkanzvaYHiD+r+wVym0aQvuqsdoiNaIt2qLzAa9SbP0wcZWOaXqVm1O3kIyymwwotYLV1wk6m6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.033803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e91cf43b7b4d77b14d5390501dae91f4f1ac403145fe6ea496efcc878dbc6cae","sha256:896234415caeb2aab03400346f30b4a2b7af6a9964dcd3a07af16b09177de549"],"state_sha256":"19f05120263b07cac6d956c46e6d063f701623767dfceba7c3aef080807d70ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8gv6kW2uZD5HKWW/uzH51klzUzEAQ3AQCnC05y69OfdSOSSJ1Znh9wpwycuGZtpitPpD9DQUJHl1XKS+CACBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:41:24.057812Z","bundle_sha256":"2499ae45cdab3ff626edb1ec66ab87863c3183a7f1f839410389d559278534a5"}}