population op• Datenarten: table → table
• Aufruf: import fullseye as fs; fs.ledger.graph_core_persistence(adjs, mode='in', weighted=False) (die Implementierung direkt: import graphinv; graphinv.graph_core_persistence(adjs, mode='in', weighted=False); aus dem Register: opsgraph.get("graph_core_persistence"))
> Für diesen Operator gibt es noch keine Übersetzung. Es folgt der Originaltext unverändert.
Which nodes sit in the innermost core of every individual — K wirings on one node order.
adjs is a list of K square matrices or a table {name: matrix} on the same node order (a node absent from an individual is a zero row and column). For each individual the innermost core of graph_kcore (same mode / weighted) is taken; appearances[v] counts the individuals whose innermost core contains v. An individual whose innermost index is 0 (e.g. no edges) has no core and contributes no member. Following Yadav & Singh 2026, a node is persistent if it is in the core of all K, recurrent if in 2 .. K−1, transient if in exactly 1, and never otherwise.
Returns a dict: k (K), n, names, membership (K, n) bool, appearances (n,), persistent / recurrent / transient / never (n,) bool masks, n_persistent .. n_never, kmax (K,) the innermost index per individual, n_inner (K,), mode, weighted.
Identities: sum(n_inner) == sum(appearances); the four classes partition the nodes; K identical inputs make every core node persistent and nothing recurrent or transient; every persistent node is in every individual's innermost core.
Raises ValueError: adjs not a list / table; fewer than 2 individuals; matrices of different sizes; any refusal of graph_kcore.
• Katalog der Beispieldaten (Download-URLs / Lizenzen) — 2-D nutzt skimage.data (BSD/Public Domain) plus synthetische Bilder, 3-D nennt Download-URLs echter Datenquellen (Stanford, PDS, …).
• Herkunft und Literatur der Operatoren — die Quellen der Forschung/Verfahren, auf denen diese Operatorfamilie beruht.
• Der kanonische Algorithmus (Autor, Jahr) und seine Anwendungen stehen im Familienleitfaden oben.
• poc_worm_core_persists — py -3.11 examples/poc_worm_core_persists.py
table als Eingabe)graph_edge_consensus · tree_morphometry · tree_sholl · tree_run_length
population)graph_edge_consensus · graph_strength_growth
*Provenance: graphinv.py — GRAPH Operator-Registry. Diese Notiz wird von tools/opdocs.py md erzeugt (nicht von Hand bearbeiten).*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.