MétaCan
Menu
Back to cohort
Record W4376123207 · doi:10.48550/arxiv.2305.05622

Multilinear Hyperquiver Representations

2023· preprint· en· W4376123207 on OpenAlexfundno aff
Tommi Muller, Vidit Nanda, Anna Seigal

Bibliographic record

VenuearXiv (Cornell University) · 2023
Typepreprint
Languageen
FieldMathematics
TopicTensor decomposition and applications
Canadian institutionsnot available
FundersAir Force Office of Scientific ResearchDivision of Materials ResearchEngineering and Physical Sciences Research CouncilNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsMultilinear mapQuiverHypergraphTensor (intrinsic definition)MathematicsRepresentation (politics)Dimension (graph theory)Eigenvalues and eigenvectorsTupleLinear subspacePure mathematicsVariety (cybernetics)Algebra over a fieldDiscrete mathematics

Abstract

fetched live from OpenAlex

We count singular vector tuples of a system of tensors assigned to the edges of a directed hypergraph. To do so, we study the generalisation of quivers to directed hypergraphs. Assigning vector spaces to the nodes of a hypergraph and multilinear maps to its hyperedges gives a hyperquiver representation. Hyperquiver representations generalise quiver representations (where all hyperedges are edges) and tensors (where there is only one multilinear map). The singular vectors of a hyperquiver representation are a compatible assignment of vectors to the nodes. We compute the dimension and degree of the variety of singular vectors of a sufficiently generic hyperquiver representation. Our formula specialises to known results that count the singular vectors and eigenvectors of a generic tensor. Lastly, we study a hypergraph generalisation of the inverse tensor eigenvalue problem and solve it algorithmically.

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.004
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.007
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.002
Science and technology studies0.0010.003
Scholarly communication0.0030.006
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0070.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.286
GPT teacher head0.290
Teacher spread0.003 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicTensor decomposition and applicationsFrench-language works237,207