{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U2OZOB7C4VVREYWLTQSVU7TB32","short_pith_number":"pith:U2OZOB7C","schema_version":"1.0","canonical_sha256":"a69d9707e2e56b1262cb9c255a7e61de8d251339d40a3409a3c8cae10a3d945c","source":{"kind":"arxiv","id":"1208.1049","version":1},"attestation_state":"computed","paper":{"title":"Parallelization, processor communication and error analysis in lattice kinetic Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Giorgos Arampatzis, Markos A. Katsoulakis, Petr Plechac","submitted_at":"2012-08-05T20:21:34Z","abstract_excerpt":"In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are fractional step algorithms with a time-stepping window $\\Delta t$, and as such they are inherently partially asynchronous since there is no processor communication during the period $\\Delta t$. In this contribution we primarily focus on the error analysis of FS-KMC algorithms as approximations of conventional, serial kinetic Monte Carlo (KMC). A key aspect of our an"},"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":"1208.1049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-05T20:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"80e279769bd98d2160ea1cf7ad4e55064efd9287725dab09f2e16c56f173bdd9","abstract_canon_sha256":"59544e38c5d16f4048f3da73273b6b7970809866de481b8def0bdbb6e9cbda84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.699803Z","signature_b64":"KvSdvd6bWwYSKIbJANQYYS6DFmprvY00lqH1/MmTIpLxPL06byB0Zv/fHRbSiSgZUX0d6HG4sycpOb5UGWiyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69d9707e2e56b1262cb9c255a7e61de8d251339d40a3409a3c8cae10a3d945c","last_reissued_at":"2026-05-18T03:49:20.699115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.699115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallelization, processor communication and error analysis in lattice kinetic Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Giorgos Arampatzis, Markos A. Katsoulakis, Petr Plechac","submitted_at":"2012-08-05T20:21:34Z","abstract_excerpt":"In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are fractional step algorithms with a time-stepping window $\\Delta t$, and as such they are inherently partially asynchronous since there is no processor communication during the period $\\Delta t$. In this contribution we primarily focus on the error analysis of FS-KMC algorithms as approximations of conventional, serial kinetic Monte Carlo (KMC). A key aspect of our an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1049","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.1049","created_at":"2026-05-18T03:49:20.699217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1049v1","created_at":"2026-05-18T03:49:20.699217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1049","created_at":"2026-05-18T03:49:20.699217+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2OZOB7C4VVR","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2OZOB7C4VVREYWL","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2OZOB7C","created_at":"2026-05-18T12:27:23.164592+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/U2OZOB7C4VVREYWLTQSVU7TB32","json":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32.json","graph_json":"https://pith.science/api/pith-number/U2OZOB7C4VVREYWLTQSVU7TB32/graph.json","events_json":"https://pith.science/api/pith-number/U2OZOB7C4VVREYWLTQSVU7TB32/events.json","paper":"https://pith.science/paper/U2OZOB7C"},"agent_actions":{"view_html":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32","download_json":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32.json","view_paper":"https://pith.science/paper/U2OZOB7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1049&json=true","fetch_graph":"https://pith.science/api/pith-number/U2OZOB7C4VVREYWLTQSVU7TB32/graph.json","fetch_events":"https://pith.science/api/pith-number/U2OZOB7C4VVREYWLTQSVU7TB32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32/action/storage_attestation","attest_author":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32/action/author_attestation","sign_citation":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32/action/citation_signature","submit_replication":"https://pith.science/pith/U2OZOB7C4VVREYWLTQSVU7TB32/action/replication_record"}},"created_at":"2026-05-18T03:49:20.699217+00:00","updated_at":"2026-05-18T03:49:20.699217+00:00"}