{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K4KU5GHAAI7MBWDZNOHCDQENAU","short_pith_number":"pith:K4KU5GHA","schema_version":"1.0","canonical_sha256":"57154e98e0023ec0d8796b8e21c08d050418b248494926e846975980f6ad890a","source":{"kind":"arxiv","id":"1107.2417","version":4},"attestation_state":"computed","paper":{"title":"Kinetic Activation Relaxation Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"physics.comp-ph","authors_text":"(2) Science Program, Canada, Doha, Fedwa El-Mellouhi (2), Jean-Fran\\c{c}ois Joly (1), Laurent Karim B\\'eland (1), Montr\\'eal, Normand Mousseau (1) ((1) D\\'epartement de physique, Peter Brommer (1), Qatar), QC, Regroupement qu\\'eb\\'ecois sur les mat\\'eriaux de pointe (RQMP), Texas A&M at Qatar, Universit\\'e de Montr\\'eal","submitted_at":"2011-07-12T21:09:08Z","abstract_excerpt":"We present a detailed description of the kinetic Activation-Relaxation Technique (k-ART), an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search. Combining a topological classification for local environments and event generation with ART nouveau, an efficient unbiased sampling method for finding transition states, k-ART can be applied to complex materials with atoms in off-lattice positions or with elastic deformations that cannot be handled with standard KMC approaches. In addition to presenting the various elements of the algorithm, we demonstrate the genera"},"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":"1107.2417","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2011-07-12T21:09:08Z","cross_cats_sorted":["cond-mat.mtrl-sci"],"title_canon_sha256":"b55041311fc307ca2af2b9db439842ca5d8b84346adb1b16188097f4c597e820","abstract_canon_sha256":"4b69e3f2532f218f9fbf3a95ac95f1f39d86d5bfd6afce979e156b66b8cc0e77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:37.031862Z","signature_b64":"0Es0fQHd19Kf9UxBT/djCUccQx3G63akpB/b3FSIQRTrSfoET9rFg1avjOGXypQ0PunflDAhnH3dcjSrKkwaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57154e98e0023ec0d8796b8e21c08d050418b248494926e846975980f6ad890a","last_reissued_at":"2026-05-18T04:10:37.031068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:37.031068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kinetic Activation Relaxation Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"physics.comp-ph","authors_text":"(2) Science Program, Canada, Doha, Fedwa El-Mellouhi (2), Jean-Fran\\c{c}ois Joly (1), Laurent Karim B\\'eland (1), Montr\\'eal, Normand Mousseau (1) ((1) D\\'epartement de physique, Peter Brommer (1), Qatar), QC, Regroupement qu\\'eb\\'ecois sur les mat\\'eriaux de pointe (RQMP), Texas A&M at Qatar, Universit\\'e de Montr\\'eal","submitted_at":"2011-07-12T21:09:08Z","abstract_excerpt":"We present a detailed description of the kinetic Activation-Relaxation Technique (k-ART), an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search. Combining a topological classification for local environments and event generation with ART nouveau, an efficient unbiased sampling method for finding transition states, k-ART can be applied to complex materials with atoms in off-lattice positions or with elastic deformations that cannot be handled with standard KMC approaches. In addition to presenting the various elements of the algorithm, we demonstrate the genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2417","kind":"arxiv","version":4},"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":"1107.2417","created_at":"2026-05-18T04:10:37.031212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2417v4","created_at":"2026-05-18T04:10:37.031212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2417","created_at":"2026-05-18T04:10:37.031212+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4KU5GHAAI7M","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4KU5GHAAI7MBWDZ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4KU5GHA","created_at":"2026-05-18T12:26:32.869790+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/K4KU5GHAAI7MBWDZNOHCDQENAU","json":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU.json","graph_json":"https://pith.science/api/pith-number/K4KU5GHAAI7MBWDZNOHCDQENAU/graph.json","events_json":"https://pith.science/api/pith-number/K4KU5GHAAI7MBWDZNOHCDQENAU/events.json","paper":"https://pith.science/paper/K4KU5GHA"},"agent_actions":{"view_html":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU","download_json":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU.json","view_paper":"https://pith.science/paper/K4KU5GHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2417&json=true","fetch_graph":"https://pith.science/api/pith-number/K4KU5GHAAI7MBWDZNOHCDQENAU/graph.json","fetch_events":"https://pith.science/api/pith-number/K4KU5GHAAI7MBWDZNOHCDQENAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU/action/storage_attestation","attest_author":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU/action/author_attestation","sign_citation":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU/action/citation_signature","submit_replication":"https://pith.science/pith/K4KU5GHAAI7MBWDZNOHCDQENAU/action/replication_record"}},"created_at":"2026-05-18T04:10:37.031212+00:00","updated_at":"2026-05-18T04:10:37.031212+00:00"}