{
 "artifacts": null,
 "category": "architecture",
 "description": "Represent a multi-input interaction by several single-input edge channels and enforce conservation only after their signed contributions are summed at the vertices. This provides a neural architecture for composite interactions in which different channels have different drivers, while preventing the node update from inventing or destroying net internal flow.",
 "download_zip": "https://synthcore.org/download/1121",
 "formulas_latex": [
  "$$P_j=\\sum_{k=1}^{K}P_{j,k},\\qquad P_{j,k}=f_{\\theta,j,k}\\left(x_{t(j)},x_{h(j)},u_{j,k}\\right)$$",
  "$$q=B P+B_{\\mathrm{ext}}P^{\\mathrm{ext}}$$",
  "$$\\mathbf{1}^{\\mathsf{T}}B=0\\quad\\Longrightarrow\\quad\\mathbf{1}^{\\mathsf{T}}B P=0$$",
  "$$\\mathcal{L}=\\mathcal{L}_{\\mathrm{task}}+\\lambda\\left\\|\\mathbf{1}^{\\mathsf{T}}\\left(\\widehat q-B_{\\mathrm{ext}}P^{\\mathrm{ext}}\\right)\\right\\|_2^2$$"
 ],
 "id": 2870,
 "implementation": "1. Integration point: use this as the message-construction layer of a graph forecaster, neural ODE, or battery and energy-system world model. For every physical edge, create K parallel channel MLPs, one for each input type such as electrical, thermal, mechanical, or learned residual flow. Do not concatenate all inputs into one unconstrained edge MLP except as an ablation. 2. Pseudocode: for every edge j and channel k, compute p[j,k] = EdgeMLP_k(x[tail[j]], x[head[j]], u[j,k]); set p[j] = sum_k p[j,k]; aggregate q = incidence @ p; add q_ext = incidence_ext @ p_ext; update node states using q + q_ext. If the target obeys exact conservation, use incidence aggregation directly; otherwise add the displayed residual penalty. 3. Computed from the paper: parallel decomposition and conservation through vertex aggregation. Estimated empirically: channel functions, channel count K, and any constitutive correction in the node update. Measure conservation residual independently from prediction error. 4. First cheap experiment: train on a synthetic multi-domain graph with known electrical and thermal flows, then test on a small battery-temperature forecasting dataset or coupled RC network. Compare an unconstrained composite-edge GNN against K-channel decomposition with matched parameter count. The predicted signature is machine-precision internal conservation, with norm of 1^T B P below 1e-6 apart from floating-point error, while the unconstrained baseline has a nonzero residual that grows with rollout length. If the node dynamics are conservative, long-horizon energy drift should scale with external-flow and integration error rather than with the number of internal message-passing steps.",
 "math_summary": "Let B be an N by M signed incidence matrix, with B_ij equal to plus one or minus one when edge j enters or leaves node i and zero otherwise. For a composite interaction decomposed into K parallel edge channels, define channel flows P_jk = f_theta,jk(x_t(j), x_h(j), u_jk) and total edge flow P_j = sum_k P_jk. The vertex exchange is q = B P plus B_ext P_ext, where P_ext contains external flows. Because every internal incidence column sums to zero, 1^T B = 0 and therefore 1^T B P = 0: internal channels cannot create net system flow. The architecture should preserve this identity exactly and only learn external exchange or constitutive state-update terms.",
 "math_tags": [
  "graph-theory",
  "linear-algebra",
  "dynamical-systems"
 ],
 "ml_areas": [
  "graph-nn",
  "world-model",
  "regularization"
 ],
 "paper": {
  "arxiv_id": "2608.30157",
  "arxiv_url": "https://arxiv.org/abs/2608.30157",
  "summary_what_math_gives_to_ml": "The paper contributes two constructive graph-modeling mechanisms: recursive state-to-input feedback for representing non-adjacent dependencies without adding graph edges, and parallel decomposition of a composite edge into single-input edges while preserving vertex-level power conservation. These mechanisms transfer naturally to graph neural networks by separating topology from learned long-range feedback and by enforcing conservation through signed incidence aggregation. The strongest neural-network use is in physical or relational forecasting, where the constructions predict measurable reductions in conservation residuals and long-horizon rollout drift rather than relying only on benchmark accuracy.",
  "title": "Multi-Domain Graph-Based Modeling of Energy Systems with Applications to Lithium-Ion Batteries",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 4,
  "novelty": 5,
  "usefulness": 7
 },
 "solves": [
  "stability",
  "accuracy",
  "generalization"
 ],
 "title": "Conservative Parallel-Edge Decomposition",
 "url": "https://synthcore.org/idea/2870/conservative-parallel-edge-decomposition",
 "verification": {
  "peer_reviewed": false,
  "status": "queued_mechanism",
  "status_label": "Queued — mechanism check",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)"
 }
}