{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GNXRFTMJDRBVEZ25UEANAS47NZ","short_pith_number":"pith:GNXRFTMJ","canonical_record":{"source":{"id":"1811.00948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-11-02T15:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"b6f5efeebc99e2cfd8310add2b4ef1b05ae3ae29c798a01fdcb6e1a028e2cdff","abstract_canon_sha256":"b26544840ac585aa4d8e6e6187c520a9e193dd7ebb115a5f34437d6b941be3d3"},"schema_version":"1.0"},"canonical_sha256":"336f12cd891c4352675da100d04b9f6e5d3ecd41b44d3bcc0f5fff3a5ff7791c","source":{"kind":"arxiv","id":"1811.00948","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00948","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00948v2","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00948","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"GNXRFTMJDRBV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNXRFTMJDRBVEZ25","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNXRFTMJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GNXRFTMJDRBVEZ25UEANAS47NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-11-02T15:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"b6f5efeebc99e2cfd8310add2b4ef1b05ae3ae29c798a01fdcb6e1a028e2cdff","abstract_canon_sha256":"b26544840ac585aa4d8e6e6187c520a9e193dd7ebb115a5f34437d6b941be3d3"},"schema_version":"1.0"},"canonical_sha256":"336f12cd891c4352675da100d04b9f6e5d3ecd41b44d3bcc0f5fff3a5ff7791c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.331778Z","signature_b64":"swKgYYgJmWNGglHHH0IAGIEwyWOYEy6KHrIgXB0gi/zAJNczJoD+wBHkr/LBOul9UgNX1HXMfQ51kIyuwc3kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336f12cd891c4352675da100d04b9f6e5d3ecd41b44d3bcc0f5fff3a5ff7791c","last_reissued_at":"2026-05-17T23:48:22.330958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.330958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00948","source_version":2,"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:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQAtd8HVbkdvMzxHEi0SAxolOz3NmTVQa9Q/l3E3VT74Ub6fyGCvsA36l+9rksNjQu2yoIeBiMZwc9SwRmzdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:53:16.971310Z"},"content_sha256":"e1df89bb694a33acd5b73937e48badffc2d249070165299bd71f687dee7896fc","schema_version":"1.0","event_id":"sha256:e1df89bb694a33acd5b73937e48badffc2d249070165299bd71f687dee7896fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GNXRFTMJDRBVEZ25UEANAS47NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniformisation techniques for stochastic simulation of chemical reaction networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Casper Beentjes, Ruth Baker","submitted_at":"2018-11-02T15:57:03Z","abstract_excerpt":"This work considers the method of uniformisation for continuous-time Markov chains in the context of chemical reaction networks. Previous work in the literature has shown that uniformisation can be beneficial in the context of time-inhomogeneous models, such as chemical reaction networks incorporating extrinsic noise. This paper lays focus on the understanding of uniformisation from the viewpoint of sample paths of chemical reaction networks. In particular, an efficient pathwise stochastic simulation algorithm for time-homogeneous models is presented which is complexity-wise equal to Gillespie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00948","kind":"arxiv","version":2},"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:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zrb0jO9mCEulLFlVrwB5GQdZB1PA0A1xj4Z/hD/bHC57a39UzVCAH18ZY7geOe4K3Tx/vfqYhFu8M3wJ/5t2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:53:16.971687Z"},"content_sha256":"5539a3c2fe9001b22a37fb5429f69a6d008128f5258be71e53129e18f6904227","schema_version":"1.0","event_id":"sha256:5539a3c2fe9001b22a37fb5429f69a6d008128f5258be71e53129e18f6904227"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/bundle.json","state_url":"https://pith.science/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/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-25T10:53:16Z","links":{"resolver":"https://pith.science/pith/GNXRFTMJDRBVEZ25UEANAS47NZ","bundle":"https://pith.science/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/bundle.json","state":"https://pith.science/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNXRFTMJDRBVEZ25UEANAS47NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GNXRFTMJDRBVEZ25UEANAS47NZ","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":"b26544840ac585aa4d8e6e6187c520a9e193dd7ebb115a5f34437d6b941be3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-11-02T15:57:03Z","title_canon_sha256":"b6f5efeebc99e2cfd8310add2b4ef1b05ae3ae29c798a01fdcb6e1a028e2cdff"},"schema_version":"1.0","source":{"id":"1811.00948","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00948","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00948v2","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00948","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"GNXRFTMJDRBV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GNXRFTMJDRBVEZ25","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GNXRFTMJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:5539a3c2fe9001b22a37fb5429f69a6d008128f5258be71e53129e18f6904227","target":"graph","created_at":"2026-05-17T23:48:22Z","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":"This work considers the method of uniformisation for continuous-time Markov chains in the context of chemical reaction networks. Previous work in the literature has shown that uniformisation can be beneficial in the context of time-inhomogeneous models, such as chemical reaction networks incorporating extrinsic noise. This paper lays focus on the understanding of uniformisation from the viewpoint of sample paths of chemical reaction networks. In particular, an efficient pathwise stochastic simulation algorithm for time-homogeneous models is presented which is complexity-wise equal to Gillespie","authors_text":"Casper Beentjes, Ruth Baker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-11-02T15:57:03Z","title":"Uniformisation techniques for stochastic simulation of chemical reaction networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00948","kind":"arxiv","version":2},"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:e1df89bb694a33acd5b73937e48badffc2d249070165299bd71f687dee7896fc","target":"record","created_at":"2026-05-17T23:48:22Z","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":"b26544840ac585aa4d8e6e6187c520a9e193dd7ebb115a5f34437d6b941be3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-11-02T15:57:03Z","title_canon_sha256":"b6f5efeebc99e2cfd8310add2b4ef1b05ae3ae29c798a01fdcb6e1a028e2cdff"},"schema_version":"1.0","source":{"id":"1811.00948","kind":"arxiv","version":2}},"canonical_sha256":"336f12cd891c4352675da100d04b9f6e5d3ecd41b44d3bcc0f5fff3a5ff7791c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"336f12cd891c4352675da100d04b9f6e5d3ecd41b44d3bcc0f5fff3a5ff7791c","first_computed_at":"2026-05-17T23:48:22.330958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:22.330958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swKgYYgJmWNGglHHH0IAGIEwyWOYEy6KHrIgXB0gi/zAJNczJoD+wBHkr/LBOul9UgNX1HXMfQ51kIyuwc3kDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:22.331778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00948","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1df89bb694a33acd5b73937e48badffc2d249070165299bd71f687dee7896fc","sha256:5539a3c2fe9001b22a37fb5429f69a6d008128f5258be71e53129e18f6904227"],"state_sha256":"c6d302bdb72c01042d2ca3ded5e14592cc5aa889623c646bc34d871f5e973071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KMiS58a6tISC/KMgl7XtbYLV31rL5O5yDXSEFrKTJH61bXESa46TDYnj2ijzNKDfz/Vf1XrCUD81FzH06KSfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:53:16.973766Z","bundle_sha256":"86852feb3ff15c37ba38534ccefa470274ed237df39118dd8715fed39ec51edf"}}