MétaCan
Menu
Back to cohort
Record W2962883236

Nucleation-free $3D$ rigidity

2013· article· en· W2962883236 on OpenAlexfundno aff
Jialong Cheng, Meera Sitharam, Ileana Streinu

Bibliographic record

VenueSmith ScholarWorks (Smith College) · 2013
Typearticle
Languageen
FieldEngineering
TopicStructural Analysis and Optimization
Canadian institutionsnot available
FundersDivision of Computing and Communication FoundationsDirectorate for Computer and Information Science and EngineeringNational Institute of General Medical SciencesDefense Advanced Research Projects AgencyMcGill UniversityNational Science Foundation
KeywordsRigidity (electromagnetism)NucleationEnhanced Data Rates for GSM EvolutionCombinatoricsMathematicsDiscrete mathematicsComputer sciencePhysicsArtificial intelligenceQuantum mechanics
DOInot available

Abstract

fetched live from OpenAlex

All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. In this paper we present a class of arbitrarily large graphs with no non-trivial vertex-induced rigid subgraphs, which have implied distances between pairs of vertices not joined by edges. As a consequence, we obtain (a) the first class of counter-examples to a potential combinatorial characterization of 3D generic independence and rigidity proposed by Sitharam and Zhou [5] and (b) the first example of a 3D rigidity circuit which has no non-trivial rigid induced subgraphs. 1

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.043

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0130.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.004
GPT teacher head0.165
Teacher spread0.161 · 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 designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations8
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueSmith ScholarWorks (Smith College)Same topicStructural Analysis and OptimizationFrench-language works237,207