{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YM4HNMLDC3FT4KOB7CF5RMSM7Q","short_pith_number":"pith:YM4HNMLD","schema_version":"1.0","canonical_sha256":"c33876b16316cb3e29c1f88bd8b24cfc098199c6ffd506a01b177ce9478732bb","source":{"kind":"arxiv","id":"0905.3575","version":3},"attestation_state":"computed","paper":{"title":"First-Passage Kinetic Monte Carlo method","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:30:28Z","abstract_excerpt":"We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of super-hops, one particle at a time. By partitioning the simulation space into non-overlapping protecting domains each containing only one or two particles, the algorithm factorizes the N-body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body "},"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":"0905.3575","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2009-05-21T22:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"1812b7325286542468e0dd96707c578edbee0eeb5ee2b103412bae87b0f64889","abstract_canon_sha256":"3556556f5c4d94e1561bd73b66c02fff0a63c530dcd0ab40935475ceb1140503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:06.263066Z","signature_b64":"h1tRv34YGxRXMPd6WS70zGN4V26Ez4/TPEAEfgaBg2KM6LkVo9YwG5kBWwyjLiuwj+3dgnVskK7yckhc2Hl9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c33876b16316cb3e29c1f88bd8b24cfc098199c6ffd506a01b177ce9478732bb","last_reissued_at":"2026-05-18T03:24:06.262458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:06.262458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Passage Kinetic Monte Carlo method","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:30:28Z","abstract_excerpt":"We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the diffusing particles over long distances through a sequence of super-hops, one particle at a time. By partitioning the simulation space into non-overlapping protecting domains each containing only one or two particles, the algorithm factorizes the N-body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3575","kind":"arxiv","version":3},"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":"0905.3575","created_at":"2026-05-18T03:24:06.262547+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.3575v3","created_at":"2026-05-18T03:24:06.262547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3575","created_at":"2026-05-18T03:24:06.262547+00:00"},{"alias_kind":"pith_short_12","alias_value":"YM4HNMLDC3FT","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YM4HNMLDC3FT4KOB","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YM4HNMLD","created_at":"2026-05-18T12:26:02.257875+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/YM4HNMLDC3FT4KOB7CF5RMSM7Q","json":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q.json","graph_json":"https://pith.science/api/pith-number/YM4HNMLDC3FT4KOB7CF5RMSM7Q/graph.json","events_json":"https://pith.science/api/pith-number/YM4HNMLDC3FT4KOB7CF5RMSM7Q/events.json","paper":"https://pith.science/paper/YM4HNMLD"},"agent_actions":{"view_html":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q","download_json":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q.json","view_paper":"https://pith.science/paper/YM4HNMLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.3575&json=true","fetch_graph":"https://pith.science/api/pith-number/YM4HNMLDC3FT4KOB7CF5RMSM7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/YM4HNMLDC3FT4KOB7CF5RMSM7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q/action/storage_attestation","attest_author":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q/action/author_attestation","sign_citation":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q/action/citation_signature","submit_replication":"https://pith.science/pith/YM4HNMLDC3FT4KOB7CF5RMSM7Q/action/replication_record"}},"created_at":"2026-05-18T03:24:06.262547+00:00","updated_at":"2026-05-18T03:24:06.262547+00:00"}