MétaCan
Menu
Back to cohort
Record W4387602365 · doi:10.1093/comjnl/bxad077

Exact Short Products From Truncated Multipliers

2023· article· en· W4387602365 on OpenAlexafffund
Daniel Lemire

Bibliographic record

VenueThe Computer Journal · 2023
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsUniversité TÉLUQUniversité du Québec à Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMultiplier (economics)MathematicsIrrational numberInteger (computer science)ArithmeticMultipleDiscrete mathematicsProduct (mathematics)CombinatoricsAlgorithmComputer science

Abstract

fetched live from OpenAlex

Abstract We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage, e.g. a large integer (e.g. $5^{100}$) or an irrational number ($\pi $). We only need to access the most significant digits of the multiplier—as long as the integers are sufficiently small. We provide an efficient algorithm to compute the range of integers given a truncated multiplier and a desired number of digits.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.017
Threshold uncertainty score0.056

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0170.005

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.022
GPT teacher head0.238
Teacher spread0.216 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueThe Computer JournalSame topicCryptography and Residue ArithmeticFrench-language works237,207