{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LZEQ4QFHYQPUTE7GBESNHNOZ3P","short_pith_number":"pith:LZEQ4QFH","canonical_record":{"source":{"id":"0905.3576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"39330ac6ef166447b472915b05f0b347be9ecc0f21a0b987788080f674306fa2","abstract_canon_sha256":"6a3310490128775a387d97f598ec8a605c97bd2548031afc304d92ff9f1461c3"},"schema_version":"1.0"},"canonical_sha256":"5e490e40a7c41f4993e60924d3b5d9dbf2bb17da2dff4b7e12a5c32a8ea21428","source":{"kind":"arxiv","id":"0905.3576","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3576","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3576v2","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3576","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"LZEQ4QFHYQPU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LZEQ4QFHYQPUTE7G","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LZEQ4QFH","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LZEQ4QFHYQPUTE7GBESNHNOZ3P","target":"record","payload":{"canonical_record":{"source":{"id":"0905.3576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"39330ac6ef166447b472915b05f0b347be9ecc0f21a0b987788080f674306fa2","abstract_canon_sha256":"6a3310490128775a387d97f598ec8a605c97bd2548031afc304d92ff9f1461c3"},"schema_version":"1.0"},"canonical_sha256":"5e490e40a7c41f4993e60924d3b5d9dbf2bb17da2dff4b7e12a5c32a8ea21428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:38.127100Z","signature_b64":"URXyep6+ffXX2IUfOUqpBk6zXPfoKADxcfJyADBwr4AI41zFFERCFv0FDoduik57ajBvyNKdANkSXzhjvVFzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e490e40a7c41f4993e60924d3b5d9dbf2bb17da2dff4b7e12a5c32a8ea21428","last_reissued_at":"2026-05-18T02:13:38.126632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:38.126632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.3576","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-18T02:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeFVKAl7OuIsiqQkEygqFtXljg0Q3I4D9PAQsEys6GqapQzPJQn/FwbSYj/jXROSAGFnDtfNQwhH1OXXqDPjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:15:07.137473Z"},"content_sha256":"bbdd2c0f8b5ba024c8f2e97485f109d9c0a5137d047d8033f99de2fae2ac5509","schema_version":"1.0","event_id":"sha256:bbdd2c0f8b5ba024c8f2e97485f109d9c0a5137d047d8033f99de2fae2ac5509"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LZEQ4QFHYQPUTE7GBESNHNOZ3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A First-Passage Kinetic Monte Carlo Algorithm for Complex Diffusion-Reaction Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.mtrl-sci","authors_text":"A. Donev, B. Sadigh, G. H. Gilmer, M. H. Kalos, T. Oppelstrup, V. V. Bulatov","submitted_at":"2009-05-21T22:37:47Z","abstract_excerpt":"We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in [Phys. Rev. Lett., 97:230602, 2006] and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3576","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-18T02:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHWpv1nsjELzqtypo9ij1dbft36camwJD0AUHmw8x5QwXiylltZvdhSIn+ZwYNfFFKV5MX+SJCCWUf6TSgfhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:15:07.137866Z"},"content_sha256":"df77292d89806bcd12a96ab51fee1f08d1ab1fa86c7b0fe2e7ed2e2f9ef7ae20","schema_version":"1.0","event_id":"sha256:df77292d89806bcd12a96ab51fee1f08d1ab1fa86c7b0fe2e7ed2e2f9ef7ae20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/bundle.json","state_url":"https://pith.science/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/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-05T21:15:07Z","links":{"resolver":"https://pith.science/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P","bundle":"https://pith.science/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/bundle.json","state":"https://pith.science/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZEQ4QFHYQPUTE7GBESNHNOZ3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LZEQ4QFHYQPUTE7GBESNHNOZ3P","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":"6a3310490128775a387d97f598ec8a605c97bd2548031afc304d92ff9f1461c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:37:47Z","title_canon_sha256":"39330ac6ef166447b472915b05f0b347be9ecc0f21a0b987788080f674306fa2"},"schema_version":"1.0","source":{"id":"0905.3576","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3576","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3576v2","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3576","created_at":"2026-05-18T02:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"LZEQ4QFHYQPU","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LZEQ4QFHYQPUTE7G","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LZEQ4QFH","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:df77292d89806bcd12a96ab51fee1f08d1ab1fa86c7b0fe2e7ed2e2f9ef7ae20","target":"graph","created_at":"2026-05-18T02:13:38Z","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 develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in [Phys. Rev. Lett., 97:230602, 2006] and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage ","authors_text":"A. Donev, B. Sadigh, G. H. Gilmer, M. H. Kalos, T. Oppelstrup, V. V. Bulatov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:37:47Z","title":"A First-Passage Kinetic Monte Carlo Algorithm for Complex Diffusion-Reaction Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3576","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:bbdd2c0f8b5ba024c8f2e97485f109d9c0a5137d047d8033f99de2fae2ac5509","target":"record","created_at":"2026-05-18T02:13:38Z","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":"6a3310490128775a387d97f598ec8a605c97bd2548031afc304d92ff9f1461c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:37:47Z","title_canon_sha256":"39330ac6ef166447b472915b05f0b347be9ecc0f21a0b987788080f674306fa2"},"schema_version":"1.0","source":{"id":"0905.3576","kind":"arxiv","version":2}},"canonical_sha256":"5e490e40a7c41f4993e60924d3b5d9dbf2bb17da2dff4b7e12a5c32a8ea21428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e490e40a7c41f4993e60924d3b5d9dbf2bb17da2dff4b7e12a5c32a8ea21428","first_computed_at":"2026-05-18T02:13:38.126632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:38.126632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URXyep6+ffXX2IUfOUqpBk6zXPfoKADxcfJyADBwr4AI41zFFERCFv0FDoduik57ajBvyNKdANkSXzhjvVFzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:38.127100Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.3576","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbdd2c0f8b5ba024c8f2e97485f109d9c0a5137d047d8033f99de2fae2ac5509","sha256:df77292d89806bcd12a96ab51fee1f08d1ab1fa86c7b0fe2e7ed2e2f9ef7ae20"],"state_sha256":"8bebae2717b75a87502748a573fea0399528f64ee36c6a98e06d2192a893829d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiSUiPk4XnE3ZmD/j/1WV9rmqQsgf/Wf1JN3SToq5zUu5fw0kc/MQ5RocRQFOyV1AfAV6tHtiLV7ssrVwH9/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:15:07.142919Z","bundle_sha256":"94195661253c5964d788cc5a1133f1ccf1887e7e083c9545db0203195b17069f"}}