{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JOHFXEKIW7L7ONMIWYD6O5WEYW","short_pith_number":"pith:JOHFXEKI","schema_version":"1.0","canonical_sha256":"4b8e5b9148b7d7f73588b607e776c4c59aaee23f52511d9fd4ef4b09fd2863bd","source":{"kind":"arxiv","id":"1506.04802","version":2},"attestation_state":"computed","paper":{"title":"A fast exact simulation method for a class of Markov jump processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.NA","authors_text":"Lili Hu, Yao Li","submitted_at":"2015-06-16T00:10:16Z","abstract_excerpt":"A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length $\\tau$. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its impl"},"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":"1506.04802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-16T00:10:16Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"5df83205674ccdbdfe9e9bc3b7a9e514fbd33fbcd3e29e60f0b8b5234af66564","abstract_canon_sha256":"74cf2da8765c1e5704343b1cae10f51dac901d1d075a10e7b7214f692f0d93c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:29.424008Z","signature_b64":"JWaMwB+DELo5YFjZD98Dg5Gmv7kx6BLzZe1zvLp7kqsGC+qVSv7T08nkXV+3OZkZwpZBqZpF8IVs+tAoJRRcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b8e5b9148b7d7f73588b607e776c4c59aaee23f52511d9fd4ef4b09fd2863bd","last_reissued_at":"2026-05-18T01:29:29.423350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:29.423350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast exact simulation method for a class of Markov jump processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"math.NA","authors_text":"Lili Hu, Yao Li","submitted_at":"2015-06-16T00:10:16Z","abstract_excerpt":"A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length $\\tau$. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04802","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.04802","created_at":"2026-05-18T01:29:29.423461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04802v2","created_at":"2026-05-18T01:29:29.423461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04802","created_at":"2026-05-18T01:29:29.423461+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOHFXEKIW7L7","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOHFXEKIW7L7ONMI","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOHFXEKI","created_at":"2026-05-18T12:29:27.538025+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/JOHFXEKIW7L7ONMIWYD6O5WEYW","json":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW.json","graph_json":"https://pith.science/api/pith-number/JOHFXEKIW7L7ONMIWYD6O5WEYW/graph.json","events_json":"https://pith.science/api/pith-number/JOHFXEKIW7L7ONMIWYD6O5WEYW/events.json","paper":"https://pith.science/paper/JOHFXEKI"},"agent_actions":{"view_html":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW","download_json":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW.json","view_paper":"https://pith.science/paper/JOHFXEKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04802&json=true","fetch_graph":"https://pith.science/api/pith-number/JOHFXEKIW7L7ONMIWYD6O5WEYW/graph.json","fetch_events":"https://pith.science/api/pith-number/JOHFXEKIW7L7ONMIWYD6O5WEYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW/action/storage_attestation","attest_author":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW/action/author_attestation","sign_citation":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW/action/citation_signature","submit_replication":"https://pith.science/pith/JOHFXEKIW7L7ONMIWYD6O5WEYW/action/replication_record"}},"created_at":"2026-05-18T01:29:29.423461+00:00","updated_at":"2026-05-18T01:29:29.423461+00:00"}