MétaCan
Menu
Back to cohort
Record W2912066439 · doi:10.1145/1277500

Proceedings of the 2007 international workshop on Symbolic-numeric computation

2007· paratext· en· W2912066439 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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

Venuenot available
Typeparatext
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsnot available
Fundersnot available
KeywordsSymbolic computationSymbolic-numeric computationComputationThe SymbolicComputer scienceSymbolic data analysisAlgebraic numberPolynomialSymbolic trajectory evaluationAlgorithmAlgebra over a fieldTheoretical computer scienceMathematicsPure mathematicsModel checking

Abstract

fetched live from OpenAlex

Algorithms that combine ideas from symbolic and numeric computation have been of increasing interest over the past decade. Not only do the usual algorithms of computer algebra break down when applied to inexact values, but the analytic setting itself allows many new questions to be asked. This, together with the growing demand for speed, accuracy and reliability in mathematical computing, has accelerated the process of blurring the distinction between two areas of research that were previously quite separate. The goal of the present workshop is to support this interaction and integration of symbolic and numeric computing. Earlier meetings in this series include the SNAP 96 workshop, held in Sophia Antipolis, France, and the SNC 2005 meeting, held in Xi'an, China. Following the tradition, Symbolic-Numeric Computation 2007 will be held July 25-27 in London, Canada. SNC 2007 is affiliated with the 2007 International Symposium on Symbolic and Algebraic Computation (ISSAC 2007). Co-located with this workshop is PASCO 2007, the 2007 International Workshop on Parallel Symbolic Computation. SNC and PASCO are held immediately prior to the ISSAC 2007 meeting, both in London at the University of Western Ontario. ISSAC 2007 takes place nearby in Waterloo, Canada. The call for papers solicited contributions from all areas of symbolic-numeric computing, including: hybrid symbolic-numeric algorithmsapproximate polynomial GCD and factorizationsymbolic-numeric methods for solving polynomial systemsresultants and structured matrices for symbolic-numeric computationdifferential equations for symbolic-numeric computationsymbolic-numeric methods for geometric computationsymbolic-numeric algorithms in algebraic geometrysymbolic-numeric algorithms for nonlinear optimizationnumeric computation of characteristic sets and Gröbner basesimplementation of symbolic-numeric algorithmsmodel construction by approximate algebraic algorithms (e.g. numerical sparse interpolation, the approximate Buchberger-Moeller algorithm)applications of symbolic-numeric computation.. In response, 38 submissions were received: 9 extended abstracts and 29 full papers. The program committee collected 113 referee reports --- on average three per submission. After careful considerations, 6 of the 9 extended abstracts and 19 of the 29 papers were accepted. In addition, we are grateful that the majority of the invited speakers contributed full papers as well. One of our invited speakers, Anthony Kennedy, is joint with PASCO and we also share our after-dinner speaker, Keith Geddes, at the joint SNC-PASCO banquet. and many anonymous reviewers.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.461
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.016
GPT teacher head0.273
Teacher spread0.257 · 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

Quick stats

Citations18
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicPolynomial and algebraic computationFrench-language works237,207