MétaCan
Menu
Back to cohort
Record W2131679923 · doi:10.1109/spdp.1991.218285

Boolean theory of coteries

2002· article· en· W2131679923 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
TopicOptimization and Search Problems
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsBoolean functionBoolean data typeSet (abstract data type)Computer scienceFunction (biology)DecompositionTheoretical computer scienceTrue quantified Boolean formulaVariable (mathematics)CombinatoricsDiscrete mathematicsMathematicsAlgorithmBiologyProgramming language

Abstract

fetched live from OpenAlex

A coterie under a ground set U consists of a set of subsets (quorums) of U such that any pair of quorums intersect each other. 'Nondominated' coteries are of particular interest, since they are 'optimal' in some sense. By assigning a Boolean variable to each element in U, we represent a coterie by a Boolean function of these variables. The authors characterize the nondominated coteries as exactly those which can be represented by positive, self-dual functions. They take advantage of Boolean decomposition theorems to investigate 'decomposition' (or 'composition') of coteries, and prove that any function representing a nondominated coteries can be composed from copies of the 3-majority function. They also introduce a 'decomposition tree' to represent any nondominated coterie. A number of other new results are also obtained, demonstrating the usefulness of the Boolean approach.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.852
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.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.0010.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.038
GPT teacher head0.226
Teacher spread0.188 · 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

Citations11
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Search ProblemsFrench-language works237,207