{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U2OZOB7C4VVREYWLTQSVU7TB32","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":"59544e38c5d16f4048f3da73273b6b7970809866de481b8def0bdbb6e9cbda84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-05T20:21:34Z","title_canon_sha256":"80e279769bd98d2160ea1cf7ad4e55064efd9287725dab09f2e16c56f173bdd9"},"schema_version":"1.0","source":{"id":"1208.1049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1049","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1049v1","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1049","created_at":"2026-05-18T03:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"U2OZOB7C4VVR","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U2OZOB7C4VVREYWL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U2OZOB7C","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:4071ed8650655c9ba07e0805c3399b46e6849010e23cc5b0ec2103805de25ae3","target":"graph","created_at":"2026-05-18T03:49:20Z","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":"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","authors_text":"Giorgos Arampatzis, Markos A. Katsoulakis, Petr Plechac","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-05T20:21:34Z","title":"Parallelization, processor communication and error analysis in lattice kinetic Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1049","kind":"arxiv","version":1},"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:a5a7089d6cb1cc3468bd6091a4412eaf671c3bafaad6f823d41e319a40068152","target":"record","created_at":"2026-05-18T03:49:20Z","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":"59544e38c5d16f4048f3da73273b6b7970809866de481b8def0bdbb6e9cbda84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-08-05T20:21:34Z","title_canon_sha256":"80e279769bd98d2160ea1cf7ad4e55064efd9287725dab09f2e16c56f173bdd9"},"schema_version":"1.0","source":{"id":"1208.1049","kind":"arxiv","version":1}},"canonical_sha256":"a69d9707e2e56b1262cb9c255a7e61de8d251339d40a3409a3c8cae10a3d945c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a69d9707e2e56b1262cb9c255a7e61de8d251339d40a3409a3c8cae10a3d945c","first_computed_at":"2026-05-18T03:49:20.699115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:20.699115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KvSdvd6bWwYSKIbJANQYYS6DFmprvY00lqH1/MmTIpLxPL06byB0Zv/fHRbSiSgZUX0d6HG4sycpOb5UGWiyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:20.699803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5a7089d6cb1cc3468bd6091a4412eaf671c3bafaad6f823d41e319a40068152","sha256:4071ed8650655c9ba07e0805c3399b46e6849010e23cc5b0ec2103805de25ae3"],"state_sha256":"f1ab5850372618874203f50e410792012ddd712cbb597486ac18012c6b46c5b3"}