MétaCan
Menu
Back to cohort

A divide and conquer partitioning method for bigraph data in industrial grade intelligent unmanned distributed systems

2025· article· W4415968816 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
Typearticle
Language
FieldComputer Science
TopicGraph Theory and Algorithms
Canadian institutionsnot available
FundersNingbo University of Technology
KeywordsScalabilityAdaptabilityLocalityHypergraphNode (physics)Process (computing)Load balancing (electrical power)Distributed databaseTask (project management)

Abstract

fetched live from OpenAlex

With the increasing deployment of intelligent unmanned systems in industrial fire monitoring and emergency response applications, the challenge of balancing storage loads among distributed nodes has become more critical. This paper proposes a divide-and-conquer partitioning method based on the Bigraph model, which jointly captures the spatial nesting and communication dependencies of system nodes. The method includes hypergraph transformation, CSR structure generation, METIS-based partitioning, and a refinement process guided by location constraints. By incorporating node data volume as a weight factor in the partitioning process, the method effectively reflects actual storage loads and achieves balanced subgraph allocation. This approach is especially suitable for managing uneven task distribution in modular, scalable distributed systems. Experimental results demonstrate that the proposed method significantly improves load balance and data locality after partitioning, showing strong adaptability and scalability.

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.005
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.977
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.096
GPT teacher head0.346
Teacher spread0.250 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicGraph Theory and AlgorithmsFrench-language works237,207