{
  "annotation_id": "a811ae4c-468a-4364-aba2-d47c813aee5b",
  "date_created": "2026-03-02T18:00:24.533000Z",
  "date_modified": "2026-03-02T18:00:24.533000Z",
  "file_hash": "7955a6c8f8d1623c56370df3cecc21820e505c690615f1e694a203377ac92e45",
  "private": false,
  "record": {
    "abstract": "We present the details of the numerical realization of the recently advanced\nalgorithm developed to identify the fragmentation in heavy ion reactions. This\nnew algorithm is based on the Simulated Annealing method and is dubbed as\nSimulated Annealing Clusterization Algorithm [SACA]. We discuss the different\nparameters used in the Simulated Annealing method and present an economical set\nof the parameters which is based on the extensive analysis carried out for the\ncentral and peripheral collisions of Au-Au, Nb-Nb and Pb-Pb. These parameters\nare crucial for the success of the algorithm. Our set of optimized parameters\ngives the same results as the most conservative choice, but is very fast. We\nalso discuss the nucleon and fragment exchange processes which are very\nimportant for the energy minimization and finally present the analysis of the\nreaction dynamics using the new algorithm. This algorithm is can be applied\nwhenever one wants to identify which of a given number of constituents form\nbound objects.",
    "arxiv_id": "nucl-th/9811018",
    "authors": [
      "Rajeev K. Puri",
      "Joerg Aichelin"
    ],
    "categories": [
      "nucl-th"
    ],
    "doi": "10.1006/jcph.2000.6534",
    "journal_ref": "J.Comput.Phys. 162 (2000) 245-266",
    "title": "Simulated Annealing Clusterization Algorithm for Studying the   Multifragmentation",
    "url": "https://arxiv.org/abs/nucl-th/9811018"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5e0504f8-ed9b-441a-839d-97fb3204458b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}