MétaCan
Menu
Back to cohort
Record W1583304127

Proceedings of the 36th international symposium on Symbolic and algebraic computation

2011· article· en· W1583304127 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsSymbolic computationComputer scienceAlgebra over a fieldSymbolic-numeric computationSoftwareAlgebraic numberMathematical softwareField (mathematics)Quantifier eliminationDifferential algebraic geometryComputationTheoretical computer scienceMathematicsOrdinary differential equationProgramming languageDifferential equationPure mathematicsDifferential algebraic equation
DOInot available

Abstract

fetched live from OpenAlex

ISSAC 2011 is a continuation of a well-established series of international conferences for the presentation of the latest advances in the field of Symbolic and Algebraic Computation. The first meeting of the series (1966) was held in Washington, DC, and sponsored by the Association for Computing Machinery (ACM). Since then, the abbreviated name of the meeting has evolved from SYMSAM, SYMSAC, EUROSAM, EUROCAL to finally settle on the present name ISSAC. This 36th meeting took place in San Jose, CA, from June 8 to June 11. For the first time, ISSAC was affiliated with the Federated Computing Research Conference (FCRC). FCRC assembles a spectrum of conferences and workshops into a week-long meeting, to foster communication among researchers in different fields in computer science and engineering. The topics represented at ISSAC include, but are not limited to: Algorithmic aspects: Exact and symbolic linear, polynomial and differential algebra. Symbolicnumeric, homotopy, and series methods. Computational geometry, group theory, number theory, quantifier elimination and logic. Summation, recurrence equations, integration, ODE & PDE. Theoretical and practical aspects, including algebraic complexity, and techniques for important special cases. Software aspects: Design of packages and systems, data representation. Parallel and distributed algebraic computing, considerations for modern hardware. User interface issues, and use of computer algebra systems with other software such as systems for digital libraries, simulation and optimization, automated theorem-proving, computer-aided design, automatic differentiation, and courseware. Application aspects: Applications that stretch the current limits of symbolic and algebraic computation, use it in new ways, or apply it in situations with broad impact, in particular to the natural sciences, life sciences, engineering, economics and finance, and education. ISSAC 2011 featured invited talks, contributed papers, tutorials, poster sessions and software presentations. This volume contains all the contributed papers which were presented at the meeting as well as the abstracts of the invited talks and of the tutorials. A total of 83 papers were submitted; each was distributed to members of the program committee and external reviewers. Reviewing included a rebuttal phase for certain papers. An average of 3.5 referee reports was obtained for each submission and 44 papers were selected. They are representative of the various facets of today's research in computer algebra, ranging from purely theoretical results to software development and important applications. They also offer an illustration of the field's vitality after a history of half a century, and of its future prospects.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.924
Threshold uncertainty score0.157

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.232
Teacher spread0.215 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it