Papers › Building a Framework for Predictive Science

Building a Framework for Predictive Science

6 Feb 2012arXiv:1202.1056links table onlyarchive 2025-07-28

Michael M. McKerns, Leif Strand, Tim Sullivan, Alta Fang, Michael A. G. Aivazis

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Key questions that scientists and engineers typically want to address can be formulated in terms of predictive science. Questions such as: "How well does my computational model represent reality?", "What are the most important parameters in the problem?", and "What is the best next experiment to perform?" are fundamental in solving scientific problems. Mystic is a framework for massively-parallel optimization and rigorous sensitivity analysis that enables these motivating questions to be addressed quantitatively as global optimization problems. Often realistic physics, engineering, and materials models may have hundreds of input parameters, hundreds of constraints, and may require execution times of seconds or longer. In more extreme cases, realistic models may be multi-scale, and require the use of high-performance computing clusters for their evaluation. Predictive calculations, formulated as a global optimization over a potential surface in design parameter space, may require an already prohibitively large simulation to be performed hundreds, if not thousands, of times. The need to prepare, schedule, and monitor thousands of model evaluations, and dynamically explore and analyze results, is a challenging problem that requires a software infrastructure capable of distributing and managing computations on large-scale heterogeneous resources. In this paper, we present the design behind an optimization framework, and also a framework for heterogeneous computing, that when utilized together, can make computationally intractable sensitivity and optimization problems much more tractable.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1202.1056")

Code

Syntology Ran 1 of 23 code samples harvested from 3 repositories linked to this paper; 22 have no recorded run. Of those that ran: 1 ran · violated contract.

By repository: community (archive-listed): 23 samples from 3 repositories, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

14 repositories listed; official and paper-mentioned ones first.

avitabayan/dill-master mentioned on GitHubNOASSERTION report
seung-lab/kimimaro mentioned on GitHubGPL-3.0 report
seungbin79/pathos mentioned on GitHubNOASSERTION report
uqfoundation/dill mentioned on GitHubNOASSERTION report
uqfoundation/klepto mentioned on GitHubNOASSERTION report
uqfoundation/multiprocess mentioned on GitHubNOASSERTION report
uqfoundation/mystic mentioned on GitHub report
uqfoundation/pathos mentioned on GitHubNOASSERTION report
uqfoundation/pox mentioned on GitHubNOASSERTION report
uqfoundation/ppft mentioned on GitHubNOASSERTION report
uqfoundation/pyina mentioned on GitHubNOASSERTION report
vdods/heisenberg mentioned on GitHubMIT report
vdods/vorpy mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

23 samples harvested; 1 ran; 0 honoured the contract we drafted; 22 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
22unverified

Licence: 1 of the 23 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

objective uqfoundation/mystic/examples2/constrained_scipy.py community (archive-listed) ran · violated contract fingerprinted licence not identified · pointer only · 621cc5bb1ecdb5d1 · report
apply_along_axes vdods/vorpy/vorpy/apply_along_axes.py community (archive-listed) unverified MIT (permissive) · 3a51985cf6ab2abf · report
csv_as_ndarray vdods/heisenberg/heisenberg/util.py community (archive-listed) unverified MIT (permissive) · 1c135cea54770762 · report
hamiltonian vdods/heisenberg/attic/library/heisenberg_dynamics.py community (archive-listed) unverified MIT (permissive) · d0e2fb0b867a239c · report
hamiltonian_vector_field vdods/heisenberg/attic/library/heisenberg_dynamics.py community (archive-listed) unverified MIT (permissive) · de0e9a6c7e0f92c8 · report
heisenberg_dynamics_context__embedding_1_0 vdods/heisenberg/lambdified_cache/heisenberg_dynamics_context__embedding_1_0.py community (archive-listed) unverified MIT (permissive) · 93d7dc17151046ff · report
heisenberg_dynamics_context__embedding_1_1 vdods/heisenberg/lambdified_cache/heisenberg_dynamics_context__embedding_1_1.py community (archive-listed) unverified MIT (permissive) · 60ae50961fbe9267 · report
heisenberg_dynamics_context__embedding_2_0 vdods/heisenberg/lambdified_cache/heisenberg_dynamics_context__embedding_2_0.py community (archive-listed) unverified MIT (permissive) · ca1643492eaa417c · report
heisenberg_dynamics_context__embedding_2_1 vdods/heisenberg/lambdified_cache/heisenberg_dynamics_context__embedding_2_1.py community (archive-listed) unverified MIT (permissive) · fcf09d70696222db · report
index_map_inverse vdods/vorpy/vorpy/index_map.py community (archive-listed) unverified MIT (permissive) · db4b3e16f9fcba46 · report
is_nondecreasing_sequence vdods/vorpy/vorpy/index_map.py community (archive-listed) unverified MIT (permissive) · 624b7ae3fa81dc0d · report
is_shape vdods/vorpy/vorpy/tensor.py community (archive-listed) unverified MIT (permissive) · e716c46533206f3b · report
is_subsequence_of_nondecreasing_sequence vdods/vorpy/vorpy/index_map.py community (archive-listed) unverified MIT (permissive) · 5d40b8b4fe617dbd · report
multiindex_iterator vdods/vorpy/vorpy/symbolic.py community (archive-listed) unverified MIT (permissive) · 89ce97793aebab44 · report
order_of_shape vdods/vorpy/vorpy/tensor.py community (archive-listed) unverified MIT (permissive) · afed75e84204d77c · report
pop_brackets_off_of vdods/heisenberg/heisenberg/util.py community (archive-listed) unverified MIT (permissive) · 009088ea0d602631 · report
prefixed_symbolic_tensor vdods/vorpy/vorpy/experimental/coordinates.py community (archive-listed) unverified MIT (permissive) · 7fd7f3e024b88362 · report
random_embedding2_point vdods/heisenberg/heisenberg/util.py community (archive-listed) unverified MIT (permissive) · ae238d4fff59e4aa · report
shape vdods/vorpy/vorpy/tensor.py community (archive-listed) unverified MIT (permissive) · 962f703d7a53bdd9 · report
simplified vdods/vorpy/vorpy/experimental/coordinates.py community (archive-listed) unverified MIT (permissive) · 2042cfb3e3d52015 · report
substitution vdods/vorpy/vorpy/experimental/coordinates.py community (archive-listed) unverified MIT (permissive) · 44b2e3b39c7acb7c · report
tensor vdods/vorpy/vorpy/symbolic.py community (archive-listed) unverified MIT (permissive) · 995101d37cdc8bb5 · report
variable vdods/vorpy/vorpy/symbolic.py community (archive-listed) unverified MIT (permissive) · df5dbaf5fee7d5c4 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections